./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_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_push_back_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 d155cc00d5c2ba6f5ef1d5e883c6d133605de01ed97e4300960f893025d81fd1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:10:38,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:10:38,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:10:38,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:10:38,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:10:38,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:10:38,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:10:38,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:10:38,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:10:38,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:10:38,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:10:38,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:10:38,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:10:38,283 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:10:38,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:10:38,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:10:38,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:10:38,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:10:38,286 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:10:38,287 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:10:38,288 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:10:38,289 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:10:38,290 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:10:38,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:10:38,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:10:38,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:10:38,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:10:38,293 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:10:38,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:10:38,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:10:38,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:10:38,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:10:38,295 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:10:38,296 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:10:38,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:10:38,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:10:38,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:10:38,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:10:38,298 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:10:38,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:10:38,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:10:38,299 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:10:38,315 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:10:38,315 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:10:38,315 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:10:38,315 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:10:38,316 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:10:38,316 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:10:38,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:10:38,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:10:38,317 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:10:38,317 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:10:38,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:10:38,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:10:38,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:10:38,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:10:38,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:10:38,318 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:10:38,318 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:10:38,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:10:38,319 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:10:38,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:10:38,321 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:10:38,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:10:38,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:10:38,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:10:38,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:10:38,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:10:38,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:10:38,322 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:10:38,323 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:10:38,323 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:10:38,323 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 -> d155cc00d5c2ba6f5ef1d5e883c6d133605de01ed97e4300960f893025d81fd1 [2022-02-20 21:10:38,479 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:10:38,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:10:38,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:10:38,503 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:10:38,504 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:10:38,505 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_push_back_harness.i [2022-02-20 21:10:38,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca896a1d/d69d03275fdb499aa1711cac5a890e59/FLAGf071768e0 [2022-02-20 21:10:39,136 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:10:39,137 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.i [2022-02-20 21:10:39,165 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca896a1d/d69d03275fdb499aa1711cac5a890e59/FLAGf071768e0 [2022-02-20 21:10:39,316 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca896a1d/d69d03275fdb499aa1711cac5a890e59 [2022-02-20 21:10:39,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:10:39,318 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:10:39,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:10:39,320 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:10:39,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:10:39,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:10:39" (1/1) ... [2022-02-20 21:10:39,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe54d01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:39, skipping insertion in model container [2022-02-20 21:10:39,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:10:39" (1/1) ... [2022-02-20 21:10:39,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:10:39,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:10:39,595 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_push_back_harness.i[4499,4512] [2022-02-20 21:10:39,611 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_push_back_harness.i[4559,4572] [2022-02-20 21:10:40,095 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,101 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,101 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,102 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,103 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,111 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,115 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,117 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,117 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,122 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,123 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,124 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,125 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,345 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:10:40,346 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:10:40,348 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:10:40,349 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:10:40,351 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:10:40,351 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:10:40,351 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:10:40,352 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:10:40,352 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:10:40,353 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:10:40,425 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:10:40,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:10:40,461 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:10:40,470 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_push_back_harness.i[4499,4512] [2022-02-20 21:10:40,475 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_push_back_harness.i[4559,4572] [2022-02-20 21:10:40,520 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,522 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,522 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,523 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,523 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,536 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,537 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,538 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,541 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,542 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,543 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,543 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,543 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:40,589 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:10:40,591 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:10:40,591 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:10:40,592 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:10:40,596 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:10:40,596 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:10:40,596 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:10:40,597 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:10:40,597 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:10:40,597 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:10:40,617 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:10:40,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:10:40,764 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:10:40,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:40 WrapperNode [2022-02-20 21:10:40,765 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:10:40,766 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:10:40,766 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:10:40,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:10:40,771 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:40" (1/1) ... [2022-02-20 21:10:40,829 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:40" (1/1) ... [2022-02-20 21:10:40,879 INFO L137 Inliner]: procedures = 679, calls = 1048, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 150 [2022-02-20 21:10:40,880 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:10:40,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:10:40,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:10:40,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:10:40,886 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:40" (1/1) ... [2022-02-20 21:10:40,886 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:40" (1/1) ... [2022-02-20 21:10:40,897 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:40" (1/1) ... [2022-02-20 21:10:40,898 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:40" (1/1) ... [2022-02-20 21:10:40,922 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:40" (1/1) ... [2022-02-20 21:10:40,926 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:40" (1/1) ... [2022-02-20 21:10:40,931 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:40" (1/1) ... [2022-02-20 21:10:40,935 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:10:40,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:10:40,940 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:10:40,940 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:10:40,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:40" (1/1) ... [2022-02-20 21:10:40,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:10:40,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:10:41,008 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:41,011 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:41,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:10:41,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 21:10:41,042 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 21:10:41,043 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-02-20 21:10:41,059 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-02-20 21:10:41,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:10:41,060 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-02-20 21:10:41,060 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-02-20 21:10:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:10:41,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:10:41,062 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2022-02-20 21:10:41,062 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2022-02-20 21:10:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:10:41,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:10:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:10:41,063 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:10:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:10:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:10:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:10:41,063 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-02-20 21:10:41,064 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-02-20 21:10:41,064 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-02-20 21:10:41,064 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-02-20 21:10:41,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:10:41,266 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:10:41,271 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:10:41,554 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:10:41,560 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:10:41,561 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 21:10:41,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:10:41 BoogieIcfgContainer [2022-02-20 21:10:41,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:10:41,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:10:41,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:10:41,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:10:41,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:10:39" (1/3) ... [2022-02-20 21:10:41,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3932d447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:10:41, skipping insertion in model container [2022-02-20 21:10:41,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:40" (2/3) ... [2022-02-20 21:10:41,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3932d447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:10:41, skipping insertion in model container [2022-02-20 21:10:41,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:10:41" (3/3) ... [2022-02-20 21:10:41,569 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_back_harness.i [2022-02-20 21:10:41,572 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:10:41,572 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:10:41,602 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:10:41,606 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:41,606 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:10:41,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 21:10:41,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 21:10:41,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:41,629 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:41,630 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:41,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:41,637 INFO L85 PathProgramCache]: Analyzing trace with hash 524704703, now seen corresponding path program 1 times [2022-02-20 21:10:41,645 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:41,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087028172] [2022-02-20 21:10:41,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:41,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:41,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:10:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:41,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} #res := #t~nondet13;havoc #t~nondet13; {105#true} is VALID [2022-02-20 21:10:41,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume true; {105#true} is VALID [2022-02-20 21:10:41,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {105#true} {105#true} #208#return; {105#true} is VALID [2022-02-20 21:10:41,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:10:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:42,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 21:10:42,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume 0 == ~cond % 256;assume false; {106#false} is VALID [2022-02-20 21:10:42,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:10:42,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106#false} {105#true} #210#return; {106#false} is VALID [2022-02-20 21:10:42,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:42,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {105#true} is VALID [2022-02-20 21:10:42,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume !#t~short299#1; {155#(not |aws_linked_list_is_valid_#t~short299#1|)} is VALID [2022-02-20 21:10:42,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {155#(not |aws_linked_list_is_valid_#t~short299#1|)} #t~short301#1 := #t~short299#1; {156#(not |aws_linked_list_is_valid_#t~short301#1|)} is VALID [2022-02-20 21:10:42,088 INFO L290 TraceCheckUtils]: 3: Hoare triple {156#(not |aws_linked_list_is_valid_#t~short301#1|)} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {106#false} is VALID [2022-02-20 21:10:42,088 INFO L290 TraceCheckUtils]: 4: Hoare triple {106#false} #t~short303#1 := #t~short301#1; {106#false} is VALID [2022-02-20 21:10:42,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {106#false} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {106#false} is VALID [2022-02-20 21:10:42,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {106#false} #t~short305#1 := #t~short303#1; {106#false} is VALID [2022-02-20 21:10:42,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {106#false} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {106#false} is VALID [2022-02-20 21:10:42,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {106#false} assume !#t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;#res#1 := 0; {106#false} is VALID [2022-02-20 21:10:42,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:10:42,091 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {106#false} {106#false} #212#return; {106#false} is VALID [2022-02-20 21:10:42,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 21:10:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:42,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 21:10:42,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume 0 == ~cond % 256;assume false; {106#false} is VALID [2022-02-20 21:10:42,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:10:42,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106#false} {106#false} #214#return; {106#false} is VALID [2022-02-20 21:10:42,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 21:10:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:42,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 21:10:42,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume 0 == ~cond % 256;assume false; {106#false} is VALID [2022-02-20 21:10:42,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:10:42,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106#false} {106#false} #216#return; {106#false} is VALID [2022-02-20 21:10:42,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:10:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:42,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {105#true} is VALID [2022-02-20 21:10:42,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {105#true} is VALID [2022-02-20 21:10:42,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {105#true} #t~short316 := #t~short313; {105#true} is VALID [2022-02-20 21:10:42,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {105#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {105#true} is VALID [2022-02-20 21:10:42,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {105#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {105#true} is VALID [2022-02-20 21:10:42,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {105#true} assume true; {105#true} is VALID [2022-02-20 21:10:42,145 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {105#true} {106#false} #188#return; {106#false} is VALID [2022-02-20 21:10:42,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 21:10:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:42,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 21:10:42,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume 0 == ~cond % 256;assume false; {106#false} is VALID [2022-02-20 21:10:42,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:10:42,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106#false} {106#false} #190#return; {106#false} is VALID [2022-02-20 21:10:42,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-20 21:10:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:42,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 21:10:42,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume 0 == ~cond % 256;assume false; {106#false} is VALID [2022-02-20 21:10:42,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:10:42,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106#false} {106#false} #192#return; {106#false} is VALID [2022-02-20 21:10:42,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 21:10:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:42,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {105#true} is VALID [2022-02-20 21:10:42,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {105#true} is VALID [2022-02-20 21:10:42,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {105#true} #t~short316 := #t~short313; {105#true} is VALID [2022-02-20 21:10:42,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {105#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {105#true} is VALID [2022-02-20 21:10:42,183 INFO L290 TraceCheckUtils]: 4: Hoare triple {105#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {105#true} is VALID [2022-02-20 21:10:42,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {105#true} assume true; {105#true} is VALID [2022-02-20 21:10:42,183 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {105#true} {106#false} #194#return; {106#false} is VALID [2022-02-20 21:10:42,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#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(36, 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; {105#true} is VALID [2022-02-20 21:10:42,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {105#true} is VALID [2022-02-20 21:10:42,186 INFO L272 TraceCheckUtils]: 2: Hoare triple {105#true} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {105#true} is VALID [2022-02-20 21:10:42,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {105#true} #res := #t~nondet13;havoc #t~nondet13; {105#true} is VALID [2022-02-20 21:10:42,187 INFO L290 TraceCheckUtils]: 4: Hoare triple {105#true} assume true; {105#true} is VALID [2022-02-20 21:10:42,187 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {105#true} {105#true} #208#return; {105#true} is VALID [2022-02-20 21:10:42,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {105#true} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {105#true} is VALID [2022-02-20 21:10:42,188 INFO L272 TraceCheckUtils]: 7: Hoare triple {105#true} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {105#true} is VALID [2022-02-20 21:10:42,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 21:10:42,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {105#true} assume 0 == ~cond % 256;assume false; {106#false} is VALID [2022-02-20 21:10:42,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:10:42,190 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {106#false} {105#true} #210#return; {106#false} is VALID [2022-02-20 21:10:42,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {106#false} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {106#false} is VALID [2022-02-20 21:10:42,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {106#false} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {106#false} is VALID [2022-02-20 21:10:42,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {106#false} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {106#false} is VALID [2022-02-20 21:10:42,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {106#false} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {106#false} is VALID [2022-02-20 21:10:42,194 INFO L272 TraceCheckUtils]: 16: Hoare triple {106#false} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {105#true} is VALID [2022-02-20 21:10:42,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {105#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {105#true} is VALID [2022-02-20 21:10:42,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {105#true} assume !#t~short299#1; {155#(not |aws_linked_list_is_valid_#t~short299#1|)} is VALID [2022-02-20 21:10:42,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {155#(not |aws_linked_list_is_valid_#t~short299#1|)} #t~short301#1 := #t~short299#1; {156#(not |aws_linked_list_is_valid_#t~short301#1|)} is VALID [2022-02-20 21:10:42,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {156#(not |aws_linked_list_is_valid_#t~short301#1|)} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {106#false} is VALID [2022-02-20 21:10:42,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {106#false} #t~short303#1 := #t~short301#1; {106#false} is VALID [2022-02-20 21:10:42,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {106#false} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {106#false} is VALID [2022-02-20 21:10:42,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {106#false} #t~short305#1 := #t~short303#1; {106#false} is VALID [2022-02-20 21:10:42,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {106#false} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {106#false} is VALID [2022-02-20 21:10:42,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {106#false} assume !#t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;#res#1 := 0; {106#false} is VALID [2022-02-20 21:10:42,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:10:42,197 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {106#false} {106#false} #212#return; {106#false} is VALID [2022-02-20 21:10:42,197 INFO L272 TraceCheckUtils]: 28: Hoare triple {106#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {105#true} is VALID [2022-02-20 21:10:42,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 21:10:42,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {105#true} assume 0 == ~cond % 256;assume false; {106#false} is VALID [2022-02-20 21:10:42,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:10:42,199 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {106#false} {106#false} #214#return; {106#false} is VALID [2022-02-20 21:10:42,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {106#false} havoc aws_linked_list_push_back_#t~ret386#1; {106#false} is VALID [2022-02-20 21:10:42,199 INFO L272 TraceCheckUtils]: 34: Hoare triple {106#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {105#true} is VALID [2022-02-20 21:10:42,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 21:10:42,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {105#true} assume 0 == ~cond % 256;assume false; {106#false} is VALID [2022-02-20 21:10:42,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:10:42,200 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {106#false} {106#false} #216#return; {106#false} is VALID [2022-02-20 21:10:42,201 INFO L272 TraceCheckUtils]: 39: Hoare triple {106#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {106#false} is VALID [2022-02-20 21:10:42,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {106#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {106#false} is VALID [2022-02-20 21:10:42,201 INFO L272 TraceCheckUtils]: 41: Hoare triple {106#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {105#true} is VALID [2022-02-20 21:10:42,201 INFO L290 TraceCheckUtils]: 42: Hoare triple {105#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {105#true} is VALID [2022-02-20 21:10:42,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {105#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {105#true} is VALID [2022-02-20 21:10:42,201 INFO L290 TraceCheckUtils]: 44: Hoare triple {105#true} #t~short316 := #t~short313; {105#true} is VALID [2022-02-20 21:10:42,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {105#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {105#true} is VALID [2022-02-20 21:10:42,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {105#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {105#true} is VALID [2022-02-20 21:10:42,202 INFO L290 TraceCheckUtils]: 47: Hoare triple {105#true} assume true; {105#true} is VALID [2022-02-20 21:10:42,202 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {105#true} {106#false} #188#return; {106#false} is VALID [2022-02-20 21:10:42,202 INFO L272 TraceCheckUtils]: 49: Hoare triple {106#false} call assume_abort_if_not(#t~ret370); {105#true} is VALID [2022-02-20 21:10:42,202 INFO L290 TraceCheckUtils]: 50: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 21:10:42,203 INFO L290 TraceCheckUtils]: 51: Hoare triple {105#true} assume 0 == ~cond % 256;assume false; {106#false} is VALID [2022-02-20 21:10:42,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:10:42,205 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {106#false} {106#false} #190#return; {106#false} is VALID [2022-02-20 21:10:42,205 INFO L290 TraceCheckUtils]: 54: Hoare triple {106#false} havoc #t~ret370; {106#false} is VALID [2022-02-20 21:10:42,205 INFO L272 TraceCheckUtils]: 55: Hoare triple {106#false} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {105#true} is VALID [2022-02-20 21:10:42,205 INFO L290 TraceCheckUtils]: 56: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 21:10:42,206 INFO L290 TraceCheckUtils]: 57: Hoare triple {105#true} assume 0 == ~cond % 256;assume false; {106#false} is VALID [2022-02-20 21:10:42,206 INFO L290 TraceCheckUtils]: 58: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:10:42,206 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {106#false} {106#false} #192#return; {106#false} is VALID [2022-02-20 21:10:42,206 INFO L290 TraceCheckUtils]: 60: Hoare triple {106#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {106#false} is VALID [2022-02-20 21:10:42,206 INFO L272 TraceCheckUtils]: 61: Hoare triple {106#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {105#true} is VALID [2022-02-20 21:10:42,207 INFO L290 TraceCheckUtils]: 62: Hoare triple {105#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {105#true} is VALID [2022-02-20 21:10:42,207 INFO L290 TraceCheckUtils]: 63: Hoare triple {105#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {105#true} is VALID [2022-02-20 21:10:42,207 INFO L290 TraceCheckUtils]: 64: Hoare triple {105#true} #t~short316 := #t~short313; {105#true} is VALID [2022-02-20 21:10:42,207 INFO L290 TraceCheckUtils]: 65: Hoare triple {105#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {105#true} is VALID [2022-02-20 21:10:42,208 INFO L290 TraceCheckUtils]: 66: Hoare triple {105#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {105#true} is VALID [2022-02-20 21:10:42,208 INFO L290 TraceCheckUtils]: 67: Hoare triple {105#true} assume true; {105#true} is VALID [2022-02-20 21:10:42,208 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {105#true} {106#false} #194#return; {106#false} is VALID [2022-02-20 21:10:42,209 INFO L272 TraceCheckUtils]: 69: Hoare triple {106#false} call __VERIFIER_assert(#t~ret373); {106#false} is VALID [2022-02-20 21:10:42,210 INFO L290 TraceCheckUtils]: 70: Hoare triple {106#false} ~cond := #in~cond; {106#false} is VALID [2022-02-20 21:10:42,214 INFO L290 TraceCheckUtils]: 71: Hoare triple {106#false} assume 0 == ~cond % 256; {106#false} is VALID [2022-02-20 21:10:42,215 INFO L290 TraceCheckUtils]: 72: Hoare triple {106#false} assume !false; {106#false} is VALID [2022-02-20 21:10:42,215 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 21:10:42,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:42,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087028172] [2022-02-20 21:10:42,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087028172] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:42,224 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:10:42,224 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:10:42,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508804691] [2022-02-20 21:10:42,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:42,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2022-02-20 21:10:42,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:42,235 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:10:42,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:42,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:10:42,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:42,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:10:42,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:10:42,334 INFO L87 Difference]: Start difference. First operand has 102 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:10:42,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:42,715 INFO L93 Difference]: Finished difference Result 208 states and 310 transitions. [2022-02-20 21:10:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:10:42,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2022-02-20 21:10:42,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:42,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:10:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 310 transitions. [2022-02-20 21:10:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:10:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 310 transitions. [2022-02-20 21:10:42,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 310 transitions. [2022-02-20 21:10:42,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:42,990 INFO L225 Difference]: With dead ends: 208 [2022-02-20 21:10:42,990 INFO L226 Difference]: Without dead ends: 109 [2022-02-20 21:10:42,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:10:42,995 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 21 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:42,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 398 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:10:43,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-20 21:10:43,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2022-02-20 21:10:43,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:43,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 99 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:43,021 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 99 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:43,022 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 99 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:43,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:43,033 INFO L93 Difference]: Finished difference Result 109 states and 149 transitions. [2022-02-20 21:10:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 149 transitions. [2022-02-20 21:10:43,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:43,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:43,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 109 states. [2022-02-20 21:10:43,036 INFO L87 Difference]: Start difference. First operand has 99 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 109 states. [2022-02-20 21:10:43,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:43,041 INFO L93 Difference]: Finished difference Result 109 states and 149 transitions. [2022-02-20 21:10:43,041 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 149 transitions. [2022-02-20 21:10:43,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:43,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:43,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:43,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.2380952380952381) internal successors, (78), 64 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:43,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2022-02-20 21:10:43,048 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 73 [2022-02-20 21:10:43,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:43,048 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2022-02-20 21:10:43,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:10:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2022-02-20 21:10:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 21:10:43,050 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:43,050 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:43,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:10:43,050 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:43,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:43,051 INFO L85 PathProgramCache]: Analyzing trace with hash -125862913, now seen corresponding path program 1 times [2022-02-20 21:10:43,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:43,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529594904] [2022-02-20 21:10:43,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:43,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:43,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:10:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {799#true} #res := #t~nondet13;havoc #t~nondet13; {799#true} is VALID [2022-02-20 21:10:43,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {799#true} {799#true} #208#return; {799#true} is VALID [2022-02-20 21:10:43,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:10:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {799#true} ~cond := #in~cond; {799#true} is VALID [2022-02-20 21:10:43,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} assume !(0 == ~cond % 256); {799#true} is VALID [2022-02-20 21:10:43,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #210#return; {799#true} is VALID [2022-02-20 21:10:43,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {799#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {799#true} is VALID [2022-02-20 21:10:43,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} assume !#t~short299#1; {799#true} is VALID [2022-02-20 21:10:43,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {799#true} #t~short301#1 := #t~short299#1; {799#true} is VALID [2022-02-20 21:10:43,151 INFO L290 TraceCheckUtils]: 3: Hoare triple {799#true} assume !#t~short301#1; {849#(not |aws_linked_list_is_valid_#t~short301#1|)} is VALID [2022-02-20 21:10:43,152 INFO L290 TraceCheckUtils]: 4: Hoare triple {849#(not |aws_linked_list_is_valid_#t~short301#1|)} #t~short303#1 := #t~short301#1; {850#(not |aws_linked_list_is_valid_#t~short303#1|)} is VALID [2022-02-20 21:10:43,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {850#(not |aws_linked_list_is_valid_#t~short303#1|)} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {800#false} is VALID [2022-02-20 21:10:43,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {800#false} #t~short305#1 := #t~short303#1; {800#false} is VALID [2022-02-20 21:10:43,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {800#false} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {800#false} is VALID [2022-02-20 21:10:43,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {800#false} assume !#t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;#res#1 := 0; {800#false} is VALID [2022-02-20 21:10:43,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {800#false} assume true; {800#false} is VALID [2022-02-20 21:10:43,153 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {800#false} {799#true} #212#return; {800#false} is VALID [2022-02-20 21:10:43,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 21:10:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {799#true} ~cond := #in~cond; {799#true} is VALID [2022-02-20 21:10:43,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} assume !(0 == ~cond % 256); {799#true} is VALID [2022-02-20 21:10:43,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {799#true} {800#false} #214#return; {800#false} is VALID [2022-02-20 21:10:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 21:10:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {799#true} ~cond := #in~cond; {799#true} is VALID [2022-02-20 21:10:43,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} assume !(0 == ~cond % 256); {799#true} is VALID [2022-02-20 21:10:43,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {799#true} {800#false} #216#return; {800#false} is VALID [2022-02-20 21:10:43,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:10:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {799#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {799#true} is VALID [2022-02-20 21:10:43,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {799#true} is VALID [2022-02-20 21:10:43,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {799#true} #t~short316 := #t~short313; {799#true} is VALID [2022-02-20 21:10:43,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {799#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {799#true} is VALID [2022-02-20 21:10:43,180 INFO L290 TraceCheckUtils]: 4: Hoare triple {799#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {799#true} is VALID [2022-02-20 21:10:43,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,180 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {799#true} {800#false} #188#return; {800#false} is VALID [2022-02-20 21:10:43,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 21:10:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {799#true} ~cond := #in~cond; {799#true} is VALID [2022-02-20 21:10:43,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} assume !(0 == ~cond % 256); {799#true} is VALID [2022-02-20 21:10:43,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {799#true} {800#false} #190#return; {800#false} is VALID [2022-02-20 21:10:43,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-20 21:10:43,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {799#true} ~cond := #in~cond; {799#true} is VALID [2022-02-20 21:10:43,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} assume !(0 == ~cond % 256); {799#true} is VALID [2022-02-20 21:10:43,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {799#true} {800#false} #192#return; {800#false} is VALID [2022-02-20 21:10:43,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 21:10:43,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {799#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {799#true} is VALID [2022-02-20 21:10:43,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {799#true} is VALID [2022-02-20 21:10:43,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {799#true} #t~short316 := #t~short313; {799#true} is VALID [2022-02-20 21:10:43,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {799#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {799#true} is VALID [2022-02-20 21:10:43,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {799#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {799#true} is VALID [2022-02-20 21:10:43,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,208 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {799#true} {800#false} #194#return; {800#false} is VALID [2022-02-20 21:10:43,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {799#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(36, 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; {799#true} is VALID [2022-02-20 21:10:43,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {799#true} is VALID [2022-02-20 21:10:43,209 INFO L272 TraceCheckUtils]: 2: Hoare triple {799#true} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {799#true} is VALID [2022-02-20 21:10:43,209 INFO L290 TraceCheckUtils]: 3: Hoare triple {799#true} #res := #t~nondet13;havoc #t~nondet13; {799#true} is VALID [2022-02-20 21:10:43,209 INFO L290 TraceCheckUtils]: 4: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,209 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {799#true} {799#true} #208#return; {799#true} is VALID [2022-02-20 21:10:43,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {799#true} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {799#true} is VALID [2022-02-20 21:10:43,209 INFO L272 TraceCheckUtils]: 7: Hoare triple {799#true} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {799#true} is VALID [2022-02-20 21:10:43,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {799#true} ~cond := #in~cond; {799#true} is VALID [2022-02-20 21:10:43,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {799#true} assume !(0 == ~cond % 256); {799#true} is VALID [2022-02-20 21:10:43,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,210 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {799#true} {799#true} #210#return; {799#true} is VALID [2022-02-20 21:10:43,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {799#true} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {799#true} is VALID [2022-02-20 21:10:43,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {799#true} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {799#true} is VALID [2022-02-20 21:10:43,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {799#true} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {799#true} is VALID [2022-02-20 21:10:43,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {799#true} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {799#true} is VALID [2022-02-20 21:10:43,211 INFO L272 TraceCheckUtils]: 16: Hoare triple {799#true} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {799#true} is VALID [2022-02-20 21:10:43,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {799#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {799#true} is VALID [2022-02-20 21:10:43,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {799#true} assume !#t~short299#1; {799#true} is VALID [2022-02-20 21:10:43,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {799#true} #t~short301#1 := #t~short299#1; {799#true} is VALID [2022-02-20 21:10:43,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {799#true} assume !#t~short301#1; {849#(not |aws_linked_list_is_valid_#t~short301#1|)} is VALID [2022-02-20 21:10:43,213 INFO L290 TraceCheckUtils]: 21: Hoare triple {849#(not |aws_linked_list_is_valid_#t~short301#1|)} #t~short303#1 := #t~short301#1; {850#(not |aws_linked_list_is_valid_#t~short303#1|)} is VALID [2022-02-20 21:10:43,213 INFO L290 TraceCheckUtils]: 22: Hoare triple {850#(not |aws_linked_list_is_valid_#t~short303#1|)} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {800#false} is VALID [2022-02-20 21:10:43,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {800#false} #t~short305#1 := #t~short303#1; {800#false} is VALID [2022-02-20 21:10:43,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {800#false} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {800#false} is VALID [2022-02-20 21:10:43,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {800#false} assume !#t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;#res#1 := 0; {800#false} is VALID [2022-02-20 21:10:43,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {800#false} assume true; {800#false} is VALID [2022-02-20 21:10:43,214 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {800#false} {799#true} #212#return; {800#false} is VALID [2022-02-20 21:10:43,214 INFO L272 TraceCheckUtils]: 28: Hoare triple {800#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {799#true} is VALID [2022-02-20 21:10:43,214 INFO L290 TraceCheckUtils]: 29: Hoare triple {799#true} ~cond := #in~cond; {799#true} is VALID [2022-02-20 21:10:43,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {799#true} assume !(0 == ~cond % 256); {799#true} is VALID [2022-02-20 21:10:43,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,225 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {799#true} {800#false} #214#return; {800#false} is VALID [2022-02-20 21:10:43,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {800#false} havoc aws_linked_list_push_back_#t~ret386#1; {800#false} is VALID [2022-02-20 21:10:43,225 INFO L272 TraceCheckUtils]: 34: Hoare triple {800#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {799#true} is VALID [2022-02-20 21:10:43,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {799#true} ~cond := #in~cond; {799#true} is VALID [2022-02-20 21:10:43,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {799#true} assume !(0 == ~cond % 256); {799#true} is VALID [2022-02-20 21:10:43,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,226 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {799#true} {800#false} #216#return; {800#false} is VALID [2022-02-20 21:10:43,226 INFO L272 TraceCheckUtils]: 39: Hoare triple {800#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {800#false} is VALID [2022-02-20 21:10:43,226 INFO L290 TraceCheckUtils]: 40: Hoare triple {800#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {800#false} is VALID [2022-02-20 21:10:43,226 INFO L272 TraceCheckUtils]: 41: Hoare triple {800#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {799#true} is VALID [2022-02-20 21:10:43,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {799#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {799#true} is VALID [2022-02-20 21:10:43,227 INFO L290 TraceCheckUtils]: 43: Hoare triple {799#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {799#true} is VALID [2022-02-20 21:10:43,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {799#true} #t~short316 := #t~short313; {799#true} is VALID [2022-02-20 21:10:43,227 INFO L290 TraceCheckUtils]: 45: Hoare triple {799#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {799#true} is VALID [2022-02-20 21:10:43,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {799#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {799#true} is VALID [2022-02-20 21:10:43,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,227 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {799#true} {800#false} #188#return; {800#false} is VALID [2022-02-20 21:10:43,228 INFO L272 TraceCheckUtils]: 49: Hoare triple {800#false} call assume_abort_if_not(#t~ret370); {799#true} is VALID [2022-02-20 21:10:43,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {799#true} ~cond := #in~cond; {799#true} is VALID [2022-02-20 21:10:43,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {799#true} assume !(0 == ~cond % 256); {799#true} is VALID [2022-02-20 21:10:43,228 INFO L290 TraceCheckUtils]: 52: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,228 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {799#true} {800#false} #190#return; {800#false} is VALID [2022-02-20 21:10:43,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {800#false} havoc #t~ret370; {800#false} is VALID [2022-02-20 21:10:43,228 INFO L272 TraceCheckUtils]: 55: Hoare triple {800#false} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {799#true} is VALID [2022-02-20 21:10:43,228 INFO L290 TraceCheckUtils]: 56: Hoare triple {799#true} ~cond := #in~cond; {799#true} is VALID [2022-02-20 21:10:43,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {799#true} assume !(0 == ~cond % 256); {799#true} is VALID [2022-02-20 21:10:43,229 INFO L290 TraceCheckUtils]: 58: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,229 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {799#true} {800#false} #192#return; {800#false} is VALID [2022-02-20 21:10:43,229 INFO L290 TraceCheckUtils]: 60: Hoare triple {800#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {800#false} is VALID [2022-02-20 21:10:43,229 INFO L272 TraceCheckUtils]: 61: Hoare triple {800#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {799#true} is VALID [2022-02-20 21:10:43,229 INFO L290 TraceCheckUtils]: 62: Hoare triple {799#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {799#true} is VALID [2022-02-20 21:10:43,229 INFO L290 TraceCheckUtils]: 63: Hoare triple {799#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {799#true} is VALID [2022-02-20 21:10:43,230 INFO L290 TraceCheckUtils]: 64: Hoare triple {799#true} #t~short316 := #t~short313; {799#true} is VALID [2022-02-20 21:10:43,230 INFO L290 TraceCheckUtils]: 65: Hoare triple {799#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {799#true} is VALID [2022-02-20 21:10:43,230 INFO L290 TraceCheckUtils]: 66: Hoare triple {799#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {799#true} is VALID [2022-02-20 21:10:43,230 INFO L290 TraceCheckUtils]: 67: Hoare triple {799#true} assume true; {799#true} is VALID [2022-02-20 21:10:43,230 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {799#true} {800#false} #194#return; {800#false} is VALID [2022-02-20 21:10:43,230 INFO L272 TraceCheckUtils]: 69: Hoare triple {800#false} call __VERIFIER_assert(#t~ret373); {800#false} is VALID [2022-02-20 21:10:43,230 INFO L290 TraceCheckUtils]: 70: Hoare triple {800#false} ~cond := #in~cond; {800#false} is VALID [2022-02-20 21:10:43,231 INFO L290 TraceCheckUtils]: 71: Hoare triple {800#false} assume 0 == ~cond % 256; {800#false} is VALID [2022-02-20 21:10:43,231 INFO L290 TraceCheckUtils]: 72: Hoare triple {800#false} assume !false; {800#false} is VALID [2022-02-20 21:10:43,231 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 21:10:43,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:43,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529594904] [2022-02-20 21:10:43,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529594904] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:43,232 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:10:43,232 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:10:43,232 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833373782] [2022-02-20 21:10:43,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:43,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2022-02-20 21:10:43,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:43,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:10:43,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:43,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:10:43,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:43,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:10:43,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:10:43,275 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:10:43,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:43,513 INFO L93 Difference]: Finished difference Result 192 states and 265 transitions. [2022-02-20 21:10:43,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:10:43,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2022-02-20 21:10:43,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:10:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 261 transitions. [2022-02-20 21:10:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:10:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 261 transitions. [2022-02-20 21:10:43,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 261 transitions. [2022-02-20 21:10:43,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:43,699 INFO L225 Difference]: With dead ends: 192 [2022-02-20 21:10:43,699 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 21:10:43,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:10:43,703 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 12 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:43,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 380 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:10:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 21:10:43,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2022-02-20 21:10:43,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:43,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 101 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 66 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:43,721 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 101 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 66 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:43,722 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 101 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 66 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:43,726 INFO L93 Difference]: Finished difference Result 107 states and 145 transitions. [2022-02-20 21:10:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2022-02-20 21:10:43,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:43,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:43,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 66 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 107 states. [2022-02-20 21:10:43,729 INFO L87 Difference]: Start difference. First operand has 101 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 66 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 107 states. [2022-02-20 21:10:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:43,734 INFO L93 Difference]: Finished difference Result 107 states and 145 transitions. [2022-02-20 21:10:43,734 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2022-02-20 21:10:43,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:43,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:43,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:43,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 66 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 135 transitions. [2022-02-20 21:10:43,740 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 135 transitions. Word has length 73 [2022-02-20 21:10:43,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:43,742 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 135 transitions. [2022-02-20 21:10:43,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:10:43,742 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2022-02-20 21:10:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 21:10:43,744 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:43,745 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:43,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:10:43,745 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:43,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:43,745 INFO L85 PathProgramCache]: Analyzing trace with hash 2140518273, now seen corresponding path program 1 times [2022-02-20 21:10:43,746 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:43,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839560778] [2022-02-20 21:10:43,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:43,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:10:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {1471#true} #res := #t~nondet13;havoc #t~nondet13; {1471#true} is VALID [2022-02-20 21:10:43,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,878 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1471#true} {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #208#return; {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:43,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:10:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 21:10:43,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume !(0 == ~cond % 256); {1471#true} is VALID [2022-02-20 21:10:43,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #210#return; {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:43,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {1471#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {1471#true} is VALID [2022-02-20 21:10:43,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume !#t~short299#1; {1471#true} is VALID [2022-02-20 21:10:43,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} #t~short301#1 := #t~short299#1; {1471#true} is VALID [2022-02-20 21:10:43,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {1471#true} assume !#t~short301#1; {1471#true} is VALID [2022-02-20 21:10:43,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {1471#true} #t~short303#1 := #t~short301#1; {1471#true} is VALID [2022-02-20 21:10:43,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} assume !#t~short303#1; {1523#(not |aws_linked_list_is_valid_#t~short303#1|)} is VALID [2022-02-20 21:10:43,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {1523#(not |aws_linked_list_is_valid_#t~short303#1|)} #t~short305#1 := #t~short303#1; {1524#(not |aws_linked_list_is_valid_#t~short305#1|)} is VALID [2022-02-20 21:10:43,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {1524#(not |aws_linked_list_is_valid_#t~short305#1|)} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {1472#false} is VALID [2022-02-20 21:10:43,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {1472#false} assume !#t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;#res#1 := 0; {1472#false} is VALID [2022-02-20 21:10:43,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {1472#false} assume true; {1472#false} is VALID [2022-02-20 21:10:43,929 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1472#false} {1481#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} #212#return; {1472#false} is VALID [2022-02-20 21:10:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 21:10:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 21:10:43,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume !(0 == ~cond % 256); {1471#true} is VALID [2022-02-20 21:10:43,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1472#false} #214#return; {1472#false} is VALID [2022-02-20 21:10:43,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 21:10:43,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 21:10:43,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume !(0 == ~cond % 256); {1471#true} is VALID [2022-02-20 21:10:43,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1472#false} #216#return; {1472#false} is VALID [2022-02-20 21:10:43,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:10:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {1471#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {1471#true} is VALID [2022-02-20 21:10:43,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {1471#true} is VALID [2022-02-20 21:10:43,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} #t~short316 := #t~short313; {1471#true} is VALID [2022-02-20 21:10:43,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {1471#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {1471#true} is VALID [2022-02-20 21:10:43,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {1471#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {1471#true} is VALID [2022-02-20 21:10:43,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,962 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1471#true} {1472#false} #188#return; {1472#false} is VALID [2022-02-20 21:10:43,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 21:10:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 21:10:43,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume !(0 == ~cond % 256); {1471#true} is VALID [2022-02-20 21:10:43,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1472#false} #190#return; {1472#false} is VALID [2022-02-20 21:10:43,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-20 21:10:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 21:10:43,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume !(0 == ~cond % 256); {1471#true} is VALID [2022-02-20 21:10:43,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1471#true} {1472#false} #192#return; {1472#false} is VALID [2022-02-20 21:10:43,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 21:10:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:43,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {1471#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {1471#true} is VALID [2022-02-20 21:10:43,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {1471#true} is VALID [2022-02-20 21:10:43,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {1471#true} #t~short316 := #t~short313; {1471#true} is VALID [2022-02-20 21:10:43,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {1471#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {1471#true} is VALID [2022-02-20 21:10:43,983 INFO L290 TraceCheckUtils]: 4: Hoare triple {1471#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {1471#true} is VALID [2022-02-20 21:10:43,983 INFO L290 TraceCheckUtils]: 5: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,983 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1471#true} {1472#false} #194#return; {1472#false} is VALID [2022-02-20 21:10:43,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {1471#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(36, 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; {1471#true} is VALID [2022-02-20 21:10:43,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {1471#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:43,985 INFO L272 TraceCheckUtils]: 2: Hoare triple {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {1471#true} is VALID [2022-02-20 21:10:43,985 INFO L290 TraceCheckUtils]: 3: Hoare triple {1471#true} #res := #t~nondet13;havoc #t~nondet13; {1471#true} is VALID [2022-02-20 21:10:43,985 INFO L290 TraceCheckUtils]: 4: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,986 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1471#true} {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #208#return; {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:43,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:43,986 INFO L272 TraceCheckUtils]: 7: Hoare triple {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {1471#true} is VALID [2022-02-20 21:10:43,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 21:10:43,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {1471#true} assume !(0 == ~cond % 256); {1471#true} is VALID [2022-02-20 21:10:43,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,987 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1471#true} {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #210#return; {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:43,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:43,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:43,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:43,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {1473#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {1481#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} is VALID [2022-02-20 21:10:43,989 INFO L272 TraceCheckUtils]: 16: Hoare triple {1481#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {1471#true} is VALID [2022-02-20 21:10:43,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {1471#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {1471#true} is VALID [2022-02-20 21:10:43,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {1471#true} assume !#t~short299#1; {1471#true} is VALID [2022-02-20 21:10:43,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {1471#true} #t~short301#1 := #t~short299#1; {1471#true} is VALID [2022-02-20 21:10:43,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {1471#true} assume !#t~short301#1; {1471#true} is VALID [2022-02-20 21:10:43,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {1471#true} #t~short303#1 := #t~short301#1; {1471#true} is VALID [2022-02-20 21:10:43,990 INFO L290 TraceCheckUtils]: 22: Hoare triple {1471#true} assume !#t~short303#1; {1523#(not |aws_linked_list_is_valid_#t~short303#1|)} is VALID [2022-02-20 21:10:43,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {1523#(not |aws_linked_list_is_valid_#t~short303#1|)} #t~short305#1 := #t~short303#1; {1524#(not |aws_linked_list_is_valid_#t~short305#1|)} is VALID [2022-02-20 21:10:43,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {1524#(not |aws_linked_list_is_valid_#t~short305#1|)} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {1472#false} is VALID [2022-02-20 21:10:43,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {1472#false} assume !#t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;#res#1 := 0; {1472#false} is VALID [2022-02-20 21:10:43,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {1472#false} assume true; {1472#false} is VALID [2022-02-20 21:10:43,991 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1472#false} {1481#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} #212#return; {1472#false} is VALID [2022-02-20 21:10:43,991 INFO L272 TraceCheckUtils]: 28: Hoare triple {1472#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {1471#true} is VALID [2022-02-20 21:10:43,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 21:10:43,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {1471#true} assume !(0 == ~cond % 256); {1471#true} is VALID [2022-02-20 21:10:43,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,991 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1471#true} {1472#false} #214#return; {1472#false} is VALID [2022-02-20 21:10:43,991 INFO L290 TraceCheckUtils]: 33: Hoare triple {1472#false} havoc aws_linked_list_push_back_#t~ret386#1; {1472#false} is VALID [2022-02-20 21:10:43,991 INFO L272 TraceCheckUtils]: 34: Hoare triple {1472#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {1471#true} is VALID [2022-02-20 21:10:43,991 INFO L290 TraceCheckUtils]: 35: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 21:10:43,992 INFO L290 TraceCheckUtils]: 36: Hoare triple {1471#true} assume !(0 == ~cond % 256); {1471#true} is VALID [2022-02-20 21:10:43,992 INFO L290 TraceCheckUtils]: 37: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,992 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1471#true} {1472#false} #216#return; {1472#false} is VALID [2022-02-20 21:10:43,992 INFO L272 TraceCheckUtils]: 39: Hoare triple {1472#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {1472#false} is VALID [2022-02-20 21:10:43,992 INFO L290 TraceCheckUtils]: 40: Hoare triple {1472#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {1472#false} is VALID [2022-02-20 21:10:43,992 INFO L272 TraceCheckUtils]: 41: Hoare triple {1472#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {1471#true} is VALID [2022-02-20 21:10:43,992 INFO L290 TraceCheckUtils]: 42: Hoare triple {1471#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {1471#true} is VALID [2022-02-20 21:10:43,992 INFO L290 TraceCheckUtils]: 43: Hoare triple {1471#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {1471#true} is VALID [2022-02-20 21:10:43,993 INFO L290 TraceCheckUtils]: 44: Hoare triple {1471#true} #t~short316 := #t~short313; {1471#true} is VALID [2022-02-20 21:10:43,993 INFO L290 TraceCheckUtils]: 45: Hoare triple {1471#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {1471#true} is VALID [2022-02-20 21:10:43,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {1471#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {1471#true} is VALID [2022-02-20 21:10:43,993 INFO L290 TraceCheckUtils]: 47: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,993 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1471#true} {1472#false} #188#return; {1472#false} is VALID [2022-02-20 21:10:43,993 INFO L272 TraceCheckUtils]: 49: Hoare triple {1472#false} call assume_abort_if_not(#t~ret370); {1471#true} is VALID [2022-02-20 21:10:43,993 INFO L290 TraceCheckUtils]: 50: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 21:10:43,993 INFO L290 TraceCheckUtils]: 51: Hoare triple {1471#true} assume !(0 == ~cond % 256); {1471#true} is VALID [2022-02-20 21:10:43,993 INFO L290 TraceCheckUtils]: 52: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,993 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1471#true} {1472#false} #190#return; {1472#false} is VALID [2022-02-20 21:10:43,994 INFO L290 TraceCheckUtils]: 54: Hoare triple {1472#false} havoc #t~ret370; {1472#false} is VALID [2022-02-20 21:10:43,994 INFO L272 TraceCheckUtils]: 55: Hoare triple {1472#false} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {1471#true} is VALID [2022-02-20 21:10:43,994 INFO L290 TraceCheckUtils]: 56: Hoare triple {1471#true} ~cond := #in~cond; {1471#true} is VALID [2022-02-20 21:10:43,994 INFO L290 TraceCheckUtils]: 57: Hoare triple {1471#true} assume !(0 == ~cond % 256); {1471#true} is VALID [2022-02-20 21:10:43,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,994 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {1471#true} {1472#false} #192#return; {1472#false} is VALID [2022-02-20 21:10:43,994 INFO L290 TraceCheckUtils]: 60: Hoare triple {1472#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {1472#false} is VALID [2022-02-20 21:10:43,994 INFO L272 TraceCheckUtils]: 61: Hoare triple {1472#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {1471#true} is VALID [2022-02-20 21:10:43,994 INFO L290 TraceCheckUtils]: 62: Hoare triple {1471#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {1471#true} is VALID [2022-02-20 21:10:43,995 INFO L290 TraceCheckUtils]: 63: Hoare triple {1471#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {1471#true} is VALID [2022-02-20 21:10:43,995 INFO L290 TraceCheckUtils]: 64: Hoare triple {1471#true} #t~short316 := #t~short313; {1471#true} is VALID [2022-02-20 21:10:43,995 INFO L290 TraceCheckUtils]: 65: Hoare triple {1471#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {1471#true} is VALID [2022-02-20 21:10:43,995 INFO L290 TraceCheckUtils]: 66: Hoare triple {1471#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {1471#true} is VALID [2022-02-20 21:10:43,995 INFO L290 TraceCheckUtils]: 67: Hoare triple {1471#true} assume true; {1471#true} is VALID [2022-02-20 21:10:43,995 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {1471#true} {1472#false} #194#return; {1472#false} is VALID [2022-02-20 21:10:43,995 INFO L272 TraceCheckUtils]: 69: Hoare triple {1472#false} call __VERIFIER_assert(#t~ret373); {1472#false} is VALID [2022-02-20 21:10:43,995 INFO L290 TraceCheckUtils]: 70: Hoare triple {1472#false} ~cond := #in~cond; {1472#false} is VALID [2022-02-20 21:10:43,995 INFO L290 TraceCheckUtils]: 71: Hoare triple {1472#false} assume 0 == ~cond % 256; {1472#false} is VALID [2022-02-20 21:10:43,996 INFO L290 TraceCheckUtils]: 72: Hoare triple {1472#false} assume !false; {1472#false} is VALID [2022-02-20 21:10:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 21:10:43,996 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:43,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839560778] [2022-02-20 21:10:43,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839560778] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:43,996 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:10:43,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:10:43,997 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96594895] [2022-02-20 21:10:43,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:43,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-02-20 21:10:43,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:43,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:44,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:44,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:10:44,034 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:44,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:10:44,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:10:44,035 INFO L87 Difference]: Start difference. First operand 101 states and 135 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:44,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:44,495 INFO L93 Difference]: Finished difference Result 192 states and 263 transitions. [2022-02-20 21:10:44,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:10:44,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-02-20 21:10:44,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:44,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 255 transitions. [2022-02-20 21:10:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 255 transitions. [2022-02-20 21:10:44,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 255 transitions. [2022-02-20 21:10:44,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:44,667 INFO L225 Difference]: With dead ends: 192 [2022-02-20 21:10:44,668 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 21:10:44,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:10:44,669 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 22 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:44,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 571 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:10:44,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 21:10:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2022-02-20 21:10:44,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:44,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 104 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:44,674 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 104 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:44,675 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 104 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:44,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:44,678 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2022-02-20 21:10:44,678 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2022-02-20 21:10:44,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:44,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:44,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 105 states. [2022-02-20 21:10:44,679 INFO L87 Difference]: Start difference. First operand has 104 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 105 states. [2022-02-20 21:10:44,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:44,682 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2022-02-20 21:10:44,682 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2022-02-20 21:10:44,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:44,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:44,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:44,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:44,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 69 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2022-02-20 21:10:44,686 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 73 [2022-02-20 21:10:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:44,686 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2022-02-20 21:10:44,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:44,686 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2022-02-20 21:10:44,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 21:10:44,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:44,687 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:44,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:10:44,687 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:44,688 INFO L85 PathProgramCache]: Analyzing trace with hash 2124999555, now seen corresponding path program 1 times [2022-02-20 21:10:44,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:44,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586095527] [2022-02-20 21:10:44,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:44,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:44,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:10:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:44,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {2146#true} #res := #t~nondet13;havoc #t~nondet13; {2146#true} is VALID [2022-02-20 21:10:44,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,774 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2146#true} {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #208#return; {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:44,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:10:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:44,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-02-20 21:10:44,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#true} assume !(0 == ~cond % 256); {2146#true} is VALID [2022-02-20 21:10:44,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2146#true} {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #210#return; {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:44,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:44,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {2146#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {2198#(or (= |aws_linked_list_is_valid_#in~list#1.base| 0) |aws_linked_list_is_valid_#t~short299#1|)} is VALID [2022-02-20 21:10:44,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {2198#(or (= |aws_linked_list_is_valid_#in~list#1.base| 0) |aws_linked_list_is_valid_#t~short299#1|)} assume !#t~short299#1; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} #t~short301#1 := #t~short299#1; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume !#t~short301#1; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,813 INFO L290 TraceCheckUtils]: 4: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} #t~short303#1 := #t~short301#1; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume !#t~short303#1; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,814 INFO L290 TraceCheckUtils]: 6: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} #t~short305#1 := #t~short303#1; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume !#t~short305#1; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume !#t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;#res#1 := 0; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume true; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,816 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} {2156#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} #212#return; {2147#false} is VALID [2022-02-20 21:10:44,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 21:10:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:44,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-02-20 21:10:44,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#true} assume !(0 == ~cond % 256); {2146#true} is VALID [2022-02-20 21:10:44,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2146#true} {2147#false} #214#return; {2147#false} is VALID [2022-02-20 21:10:44,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 21:10:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:44,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-02-20 21:10:44,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#true} assume !(0 == ~cond % 256); {2146#true} is VALID [2022-02-20 21:10:44,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2146#true} {2147#false} #216#return; {2147#false} is VALID [2022-02-20 21:10:44,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:10:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:44,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {2146#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {2146#true} is VALID [2022-02-20 21:10:44,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {2146#true} is VALID [2022-02-20 21:10:44,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {2146#true} #t~short316 := #t~short313; {2146#true} is VALID [2022-02-20 21:10:44,843 INFO L290 TraceCheckUtils]: 3: Hoare triple {2146#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {2146#true} is VALID [2022-02-20 21:10:44,843 INFO L290 TraceCheckUtils]: 4: Hoare triple {2146#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {2146#true} is VALID [2022-02-20 21:10:44,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,844 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2146#true} {2147#false} #188#return; {2147#false} is VALID [2022-02-20 21:10:44,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 21:10:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:44,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-02-20 21:10:44,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#true} assume !(0 == ~cond % 256); {2146#true} is VALID [2022-02-20 21:10:44,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2146#true} {2147#false} #190#return; {2147#false} is VALID [2022-02-20 21:10:44,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-20 21:10:44,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:44,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-02-20 21:10:44,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#true} assume !(0 == ~cond % 256); {2146#true} is VALID [2022-02-20 21:10:44,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2146#true} {2147#false} #192#return; {2147#false} is VALID [2022-02-20 21:10:44,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 21:10:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:44,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {2146#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {2146#true} is VALID [2022-02-20 21:10:44,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {2146#true} is VALID [2022-02-20 21:10:44,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {2146#true} #t~short316 := #t~short313; {2146#true} is VALID [2022-02-20 21:10:44,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {2146#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {2146#true} is VALID [2022-02-20 21:10:44,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {2146#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {2146#true} is VALID [2022-02-20 21:10:44,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,867 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2146#true} {2147#false} #194#return; {2147#false} is VALID [2022-02-20 21:10:44,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {2146#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(36, 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; {2146#true} is VALID [2022-02-20 21:10:44,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:44,868 INFO L272 TraceCheckUtils]: 2: Hoare triple {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {2146#true} is VALID [2022-02-20 21:10:44,868 INFO L290 TraceCheckUtils]: 3: Hoare triple {2146#true} #res := #t~nondet13;havoc #t~nondet13; {2146#true} is VALID [2022-02-20 21:10:44,868 INFO L290 TraceCheckUtils]: 4: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,868 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2146#true} {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #208#return; {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:44,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:44,869 INFO L272 TraceCheckUtils]: 7: Hoare triple {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {2146#true} is VALID [2022-02-20 21:10:44,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-02-20 21:10:44,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {2146#true} assume !(0 == ~cond % 256); {2146#true} is VALID [2022-02-20 21:10:44,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,869 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2146#true} {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #210#return; {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:44,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:44,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:44,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:44,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {2148#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {2156#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} is VALID [2022-02-20 21:10:44,871 INFO L272 TraceCheckUtils]: 16: Hoare triple {2156#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {2146#true} is VALID [2022-02-20 21:10:44,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {2146#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {2198#(or (= |aws_linked_list_is_valid_#in~list#1.base| 0) |aws_linked_list_is_valid_#t~short299#1|)} is VALID [2022-02-20 21:10:44,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {2198#(or (= |aws_linked_list_is_valid_#in~list#1.base| 0) |aws_linked_list_is_valid_#t~short299#1|)} assume !#t~short299#1; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} #t~short301#1 := #t~short299#1; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume !#t~short301#1; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} #t~short303#1 := #t~short301#1; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume !#t~short303#1; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} #t~short305#1 := #t~short303#1; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume !#t~short305#1; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume !#t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;#res#1 := 0; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume true; {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:44,874 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2199#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} {2156#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} #212#return; {2147#false} is VALID [2022-02-20 21:10:44,874 INFO L272 TraceCheckUtils]: 28: Hoare triple {2147#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {2146#true} is VALID [2022-02-20 21:10:44,874 INFO L290 TraceCheckUtils]: 29: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-02-20 21:10:44,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {2146#true} assume !(0 == ~cond % 256); {2146#true} is VALID [2022-02-20 21:10:44,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,875 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2146#true} {2147#false} #214#return; {2147#false} is VALID [2022-02-20 21:10:44,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {2147#false} havoc aws_linked_list_push_back_#t~ret386#1; {2147#false} is VALID [2022-02-20 21:10:44,875 INFO L272 TraceCheckUtils]: 34: Hoare triple {2147#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {2146#true} is VALID [2022-02-20 21:10:44,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-02-20 21:10:44,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {2146#true} assume !(0 == ~cond % 256); {2146#true} is VALID [2022-02-20 21:10:44,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,875 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2146#true} {2147#false} #216#return; {2147#false} is VALID [2022-02-20 21:10:44,875 INFO L272 TraceCheckUtils]: 39: Hoare triple {2147#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {2147#false} is VALID [2022-02-20 21:10:44,876 INFO L290 TraceCheckUtils]: 40: Hoare triple {2147#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {2147#false} is VALID [2022-02-20 21:10:44,876 INFO L272 TraceCheckUtils]: 41: Hoare triple {2147#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {2146#true} is VALID [2022-02-20 21:10:44,876 INFO L290 TraceCheckUtils]: 42: Hoare triple {2146#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {2146#true} is VALID [2022-02-20 21:10:44,876 INFO L290 TraceCheckUtils]: 43: Hoare triple {2146#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {2146#true} is VALID [2022-02-20 21:10:44,876 INFO L290 TraceCheckUtils]: 44: Hoare triple {2146#true} #t~short316 := #t~short313; {2146#true} is VALID [2022-02-20 21:10:44,876 INFO L290 TraceCheckUtils]: 45: Hoare triple {2146#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {2146#true} is VALID [2022-02-20 21:10:44,876 INFO L290 TraceCheckUtils]: 46: Hoare triple {2146#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {2146#true} is VALID [2022-02-20 21:10:44,876 INFO L290 TraceCheckUtils]: 47: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,876 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2146#true} {2147#false} #188#return; {2147#false} is VALID [2022-02-20 21:10:44,876 INFO L272 TraceCheckUtils]: 49: Hoare triple {2147#false} call assume_abort_if_not(#t~ret370); {2146#true} is VALID [2022-02-20 21:10:44,877 INFO L290 TraceCheckUtils]: 50: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-02-20 21:10:44,877 INFO L290 TraceCheckUtils]: 51: Hoare triple {2146#true} assume !(0 == ~cond % 256); {2146#true} is VALID [2022-02-20 21:10:44,877 INFO L290 TraceCheckUtils]: 52: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,877 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2146#true} {2147#false} #190#return; {2147#false} is VALID [2022-02-20 21:10:44,877 INFO L290 TraceCheckUtils]: 54: Hoare triple {2147#false} havoc #t~ret370; {2147#false} is VALID [2022-02-20 21:10:44,877 INFO L272 TraceCheckUtils]: 55: Hoare triple {2147#false} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {2146#true} is VALID [2022-02-20 21:10:44,877 INFO L290 TraceCheckUtils]: 56: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-02-20 21:10:44,877 INFO L290 TraceCheckUtils]: 57: Hoare triple {2146#true} assume !(0 == ~cond % 256); {2146#true} is VALID [2022-02-20 21:10:44,877 INFO L290 TraceCheckUtils]: 58: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,878 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2146#true} {2147#false} #192#return; {2147#false} is VALID [2022-02-20 21:10:44,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {2147#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {2147#false} is VALID [2022-02-20 21:10:44,878 INFO L272 TraceCheckUtils]: 61: Hoare triple {2147#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {2146#true} is VALID [2022-02-20 21:10:44,878 INFO L290 TraceCheckUtils]: 62: Hoare triple {2146#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {2146#true} is VALID [2022-02-20 21:10:44,878 INFO L290 TraceCheckUtils]: 63: Hoare triple {2146#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {2146#true} is VALID [2022-02-20 21:10:44,878 INFO L290 TraceCheckUtils]: 64: Hoare triple {2146#true} #t~short316 := #t~short313; {2146#true} is VALID [2022-02-20 21:10:44,878 INFO L290 TraceCheckUtils]: 65: Hoare triple {2146#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {2146#true} is VALID [2022-02-20 21:10:44,878 INFO L290 TraceCheckUtils]: 66: Hoare triple {2146#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {2146#true} is VALID [2022-02-20 21:10:44,878 INFO L290 TraceCheckUtils]: 67: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-02-20 21:10:44,878 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2146#true} {2147#false} #194#return; {2147#false} is VALID [2022-02-20 21:10:44,879 INFO L272 TraceCheckUtils]: 69: Hoare triple {2147#false} call __VERIFIER_assert(#t~ret373); {2147#false} is VALID [2022-02-20 21:10:44,879 INFO L290 TraceCheckUtils]: 70: Hoare triple {2147#false} ~cond := #in~cond; {2147#false} is VALID [2022-02-20 21:10:44,879 INFO L290 TraceCheckUtils]: 71: Hoare triple {2147#false} assume 0 == ~cond % 256; {2147#false} is VALID [2022-02-20 21:10:44,879 INFO L290 TraceCheckUtils]: 72: Hoare triple {2147#false} assume !false; {2147#false} is VALID [2022-02-20 21:10:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 21:10:44,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:44,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586095527] [2022-02-20 21:10:44,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586095527] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:44,880 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:10:44,880 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:10:44,880 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042466725] [2022-02-20 21:10:44,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:44,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-02-20 21:10:44,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:44,881 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:44,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:44,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:10:44,914 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:44,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:10:44,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:10:44,914 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:45,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:45,284 INFO L93 Difference]: Finished difference Result 201 states and 268 transitions. [2022-02-20 21:10:45,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 21:10:45,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-02-20 21:10:45,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 256 transitions. [2022-02-20 21:10:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:45,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 256 transitions. [2022-02-20 21:10:45,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 256 transitions. [2022-02-20 21:10:45,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:45,460 INFO L225 Difference]: With dead ends: 201 [2022-02-20 21:10:45,460 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 21:10:45,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:10:45,461 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 28 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:45,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 448 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 21:10:45,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 21:10:45,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-02-20 21:10:45,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:45,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:45,466 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:45,466 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:45,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:45,469 INFO L93 Difference]: Finished difference Result 102 states and 135 transitions. [2022-02-20 21:10:45,469 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2022-02-20 21:10:45,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:45,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:45,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 102 states. [2022-02-20 21:10:45,471 INFO L87 Difference]: Start difference. First operand has 102 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 102 states. [2022-02-20 21:10:45,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:45,473 INFO L93 Difference]: Finished difference Result 102 states and 135 transitions. [2022-02-20 21:10:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2022-02-20 21:10:45,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:45,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:45,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:45,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.2121212121212122) internal successors, (80), 67 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:10:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2022-02-20 21:10:45,478 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 73 [2022-02-20 21:10:45,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:45,479 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2022-02-20 21:10:45,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:45,479 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2022-02-20 21:10:45,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 21:10:45,480 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:45,480 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:45,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:10:45,480 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:45,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:45,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1956548997, now seen corresponding path program 1 times [2022-02-20 21:10:45,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:45,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607029490] [2022-02-20 21:10:45,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:45,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:45,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:10:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:45,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {2820#true} #res := #t~nondet13;havoc #t~nondet13; {2820#true} is VALID [2022-02-20 21:10:45,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:45,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2820#true} {2820#true} #208#return; {2820#true} is VALID [2022-02-20 21:10:45,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:10:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:45,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {2820#true} ~cond := #in~cond; {2820#true} is VALID [2022-02-20 21:10:45,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {2820#true} assume !(0 == ~cond % 256); {2820#true} is VALID [2022-02-20 21:10:45,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:45,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2820#true} {2820#true} #210#return; {2820#true} is VALID [2022-02-20 21:10:45,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:45,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {2820#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {2820#true} is VALID [2022-02-20 21:10:45,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {2820#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {2820#true} is VALID [2022-02-20 21:10:45,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {2820#true} #t~short301#1 := #t~short299#1; {2820#true} is VALID [2022-02-20 21:10:45,592 INFO L290 TraceCheckUtils]: 3: Hoare triple {2820#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {2820#true} is VALID [2022-02-20 21:10:45,592 INFO L290 TraceCheckUtils]: 4: Hoare triple {2820#true} #t~short303#1 := #t~short301#1; {2820#true} is VALID [2022-02-20 21:10:45,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {2820#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {2820#true} is VALID [2022-02-20 21:10:45,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {2820#true} #t~short305#1 := #t~short303#1; {2820#true} is VALID [2022-02-20 21:10:45,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {2820#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {2820#true} is VALID [2022-02-20 21:10:45,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {2820#true} assume !#t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;#res#1 := 0; {2871#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:45,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {2871#(= 0 |aws_linked_list_is_valid_#res#1|)} assume true; {2871#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:45,594 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2871#(= 0 |aws_linked_list_is_valid_#res#1|)} {2820#true} #212#return; {2840#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0)} is VALID [2022-02-20 21:10:45,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 21:10:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:45,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {2820#true} ~cond := #in~cond; {2872#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:10:45,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {2872#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {2873#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:45,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {2873#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} assume true; {2873#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:45,622 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2873#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} {2840#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0)} #214#return; {2821#false} is VALID [2022-02-20 21:10:45,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 21:10:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:45,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {2820#true} ~cond := #in~cond; {2820#true} is VALID [2022-02-20 21:10:45,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {2820#true} assume !(0 == ~cond % 256); {2820#true} is VALID [2022-02-20 21:10:45,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:45,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2820#true} {2821#false} #216#return; {2821#false} is VALID [2022-02-20 21:10:45,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:10:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:45,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {2820#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {2820#true} is VALID [2022-02-20 21:10:45,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {2820#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {2820#true} is VALID [2022-02-20 21:10:45,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {2820#true} #t~short316 := #t~short313; {2820#true} is VALID [2022-02-20 21:10:45,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {2820#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {2820#true} is VALID [2022-02-20 21:10:45,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {2820#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {2820#true} is VALID [2022-02-20 21:10:45,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:45,638 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2820#true} {2821#false} #188#return; {2821#false} is VALID [2022-02-20 21:10:45,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 21:10:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:45,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {2820#true} ~cond := #in~cond; {2820#true} is VALID [2022-02-20 21:10:45,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {2820#true} assume !(0 == ~cond % 256); {2820#true} is VALID [2022-02-20 21:10:45,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:45,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2820#true} {2821#false} #190#return; {2821#false} is VALID [2022-02-20 21:10:45,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-20 21:10:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:45,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {2820#true} ~cond := #in~cond; {2820#true} is VALID [2022-02-20 21:10:45,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {2820#true} assume !(0 == ~cond % 256); {2820#true} is VALID [2022-02-20 21:10:45,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:45,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2820#true} {2821#false} #192#return; {2821#false} is VALID [2022-02-20 21:10:45,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-02-20 21:10:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:45,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {2820#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {2820#true} is VALID [2022-02-20 21:10:45,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {2820#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {2820#true} is VALID [2022-02-20 21:10:45,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {2820#true} #t~short316 := #t~short313; {2820#true} is VALID [2022-02-20 21:10:45,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {2820#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {2820#true} is VALID [2022-02-20 21:10:45,658 INFO L290 TraceCheckUtils]: 4: Hoare triple {2820#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {2820#true} is VALID [2022-02-20 21:10:45,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:45,658 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2820#true} {2821#false} #194#return; {2821#false} is VALID [2022-02-20 21:10:45,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {2820#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(36, 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; {2820#true} is VALID [2022-02-20 21:10:45,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {2820#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {2820#true} is VALID [2022-02-20 21:10:45,659 INFO L272 TraceCheckUtils]: 2: Hoare triple {2820#true} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {2820#true} is VALID [2022-02-20 21:10:45,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {2820#true} #res := #t~nondet13;havoc #t~nondet13; {2820#true} is VALID [2022-02-20 21:10:45,659 INFO L290 TraceCheckUtils]: 4: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:45,659 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2820#true} {2820#true} #208#return; {2820#true} is VALID [2022-02-20 21:10:45,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {2820#true} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {2820#true} is VALID [2022-02-20 21:10:45,659 INFO L272 TraceCheckUtils]: 7: Hoare triple {2820#true} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {2820#true} is VALID [2022-02-20 21:10:45,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {2820#true} ~cond := #in~cond; {2820#true} is VALID [2022-02-20 21:10:45,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {2820#true} assume !(0 == ~cond % 256); {2820#true} is VALID [2022-02-20 21:10:45,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:45,660 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2820#true} {2820#true} #210#return; {2820#true} is VALID [2022-02-20 21:10:45,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {2820#true} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {2820#true} is VALID [2022-02-20 21:10:45,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {2820#true} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {2820#true} is VALID [2022-02-20 21:10:45,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {2820#true} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {2820#true} is VALID [2022-02-20 21:10:45,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {2820#true} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {2820#true} is VALID [2022-02-20 21:10:45,660 INFO L272 TraceCheckUtils]: 16: Hoare triple {2820#true} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {2820#true} is VALID [2022-02-20 21:10:45,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {2820#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {2820#true} is VALID [2022-02-20 21:10:45,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {2820#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {2820#true} is VALID [2022-02-20 21:10:45,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {2820#true} #t~short301#1 := #t~short299#1; {2820#true} is VALID [2022-02-20 21:10:45,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {2820#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {2820#true} is VALID [2022-02-20 21:10:45,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {2820#true} #t~short303#1 := #t~short301#1; {2820#true} is VALID [2022-02-20 21:10:45,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {2820#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {2820#true} is VALID [2022-02-20 21:10:45,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {2820#true} #t~short305#1 := #t~short303#1; {2820#true} is VALID [2022-02-20 21:10:45,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {2820#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {2820#true} is VALID [2022-02-20 21:10:45,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {2820#true} assume !#t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;#res#1 := 0; {2871#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:45,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {2871#(= 0 |aws_linked_list_is_valid_#res#1|)} assume true; {2871#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:45,662 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2871#(= 0 |aws_linked_list_is_valid_#res#1|)} {2820#true} #212#return; {2840#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0)} is VALID [2022-02-20 21:10:45,662 INFO L272 TraceCheckUtils]: 28: Hoare triple {2840#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0)} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {2820#true} is VALID [2022-02-20 21:10:45,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {2820#true} ~cond := #in~cond; {2872#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:10:45,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {2872#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {2873#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:45,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {2873#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} assume true; {2873#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:45,682 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2873#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} {2840#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0)} #214#return; {2821#false} is VALID [2022-02-20 21:10:45,682 INFO L290 TraceCheckUtils]: 33: Hoare triple {2821#false} havoc aws_linked_list_push_back_#t~ret386#1; {2821#false} is VALID [2022-02-20 21:10:45,682 INFO L272 TraceCheckUtils]: 34: Hoare triple {2821#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {2820#true} is VALID [2022-02-20 21:10:45,682 INFO L290 TraceCheckUtils]: 35: Hoare triple {2820#true} ~cond := #in~cond; {2820#true} is VALID [2022-02-20 21:10:45,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {2820#true} assume !(0 == ~cond % 256); {2820#true} is VALID [2022-02-20 21:10:45,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:45,683 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2820#true} {2821#false} #216#return; {2821#false} is VALID [2022-02-20 21:10:45,683 INFO L272 TraceCheckUtils]: 39: Hoare triple {2821#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {2821#false} is VALID [2022-02-20 21:10:45,683 INFO L290 TraceCheckUtils]: 40: Hoare triple {2821#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {2821#false} is VALID [2022-02-20 21:10:45,683 INFO L272 TraceCheckUtils]: 41: Hoare triple {2821#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {2820#true} is VALID [2022-02-20 21:10:45,683 INFO L290 TraceCheckUtils]: 42: Hoare triple {2820#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {2820#true} is VALID [2022-02-20 21:10:45,683 INFO L290 TraceCheckUtils]: 43: Hoare triple {2820#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {2820#true} is VALID [2022-02-20 21:10:45,683 INFO L290 TraceCheckUtils]: 44: Hoare triple {2820#true} #t~short316 := #t~short313; {2820#true} is VALID [2022-02-20 21:10:45,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {2820#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {2820#true} is VALID [2022-02-20 21:10:45,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {2820#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {2820#true} is VALID [2022-02-20 21:10:45,684 INFO L290 TraceCheckUtils]: 47: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:45,684 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2820#true} {2821#false} #188#return; {2821#false} is VALID [2022-02-20 21:10:45,684 INFO L272 TraceCheckUtils]: 49: Hoare triple {2821#false} call assume_abort_if_not(#t~ret370); {2820#true} is VALID [2022-02-20 21:10:45,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {2820#true} ~cond := #in~cond; {2820#true} is VALID [2022-02-20 21:10:45,684 INFO L290 TraceCheckUtils]: 51: Hoare triple {2820#true} assume !(0 == ~cond % 256); {2820#true} is VALID [2022-02-20 21:10:45,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:45,684 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2820#true} {2821#false} #190#return; {2821#false} is VALID [2022-02-20 21:10:45,684 INFO L290 TraceCheckUtils]: 54: Hoare triple {2821#false} havoc #t~ret370; {2821#false} is VALID [2022-02-20 21:10:45,684 INFO L272 TraceCheckUtils]: 55: Hoare triple {2821#false} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {2820#true} is VALID [2022-02-20 21:10:45,684 INFO L290 TraceCheckUtils]: 56: Hoare triple {2820#true} ~cond := #in~cond; {2820#true} is VALID [2022-02-20 21:10:45,685 INFO L290 TraceCheckUtils]: 57: Hoare triple {2820#true} assume !(0 == ~cond % 256); {2820#true} is VALID [2022-02-20 21:10:45,685 INFO L290 TraceCheckUtils]: 58: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:45,685 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2820#true} {2821#false} #192#return; {2821#false} is VALID [2022-02-20 21:10:45,685 INFO L290 TraceCheckUtils]: 60: Hoare triple {2821#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {2821#false} is VALID [2022-02-20 21:10:45,685 INFO L272 TraceCheckUtils]: 61: Hoare triple {2821#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {2820#true} is VALID [2022-02-20 21:10:45,685 INFO L290 TraceCheckUtils]: 62: Hoare triple {2820#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {2820#true} is VALID [2022-02-20 21:10:45,685 INFO L290 TraceCheckUtils]: 63: Hoare triple {2820#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {2820#true} is VALID [2022-02-20 21:10:45,685 INFO L290 TraceCheckUtils]: 64: Hoare triple {2820#true} #t~short316 := #t~short313; {2820#true} is VALID [2022-02-20 21:10:45,685 INFO L290 TraceCheckUtils]: 65: Hoare triple {2820#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {2820#true} is VALID [2022-02-20 21:10:45,685 INFO L290 TraceCheckUtils]: 66: Hoare triple {2820#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {2820#true} is VALID [2022-02-20 21:10:45,686 INFO L290 TraceCheckUtils]: 67: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:45,686 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2820#true} {2821#false} #194#return; {2821#false} is VALID [2022-02-20 21:10:45,686 INFO L272 TraceCheckUtils]: 69: Hoare triple {2821#false} call __VERIFIER_assert(#t~ret373); {2821#false} is VALID [2022-02-20 21:10:45,686 INFO L290 TraceCheckUtils]: 70: Hoare triple {2821#false} ~cond := #in~cond; {2821#false} is VALID [2022-02-20 21:10:45,686 INFO L290 TraceCheckUtils]: 71: Hoare triple {2821#false} assume 0 == ~cond % 256; {2821#false} is VALID [2022-02-20 21:10:45,686 INFO L290 TraceCheckUtils]: 72: Hoare triple {2821#false} assume !false; {2821#false} is VALID [2022-02-20 21:10:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-02-20 21:10:45,687 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:45,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607029490] [2022-02-20 21:10:45,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607029490] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:10:45,687 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666377440] [2022-02-20 21:10:45,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:45,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:45,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:10:45,689 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:10:45,719 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:10:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:45,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 21:10:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:45,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:10:46,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {2820#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(36, 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; {2877#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 21:10:46,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {2877#(< 0 |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:46,233 INFO L272 TraceCheckUtils]: 2: Hoare triple {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {2820#true} is VALID [2022-02-20 21:10:46,234 INFO L290 TraceCheckUtils]: 3: Hoare triple {2820#true} #res := #t~nondet13;havoc #t~nondet13; {2820#true} is VALID [2022-02-20 21:10:46,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:46,234 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2820#true} {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} #208#return; {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:46,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:46,234 INFO L272 TraceCheckUtils]: 7: Hoare triple {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {2820#true} is VALID [2022-02-20 21:10:46,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {2820#true} ~cond := #in~cond; {2820#true} is VALID [2022-02-20 21:10:46,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {2820#true} assume !(0 == ~cond % 256); {2820#true} is VALID [2022-02-20 21:10:46,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {2820#true} assume true; {2820#true} is VALID [2022-02-20 21:10:46,235 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2820#true} {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} #210#return; {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:46,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:46,236 INFO L290 TraceCheckUtils]: 13: Hoare triple {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:46,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:46,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {2881#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {2924#(< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|)} is VALID [2022-02-20 21:10:46,237 INFO L272 TraceCheckUtils]: 16: Hoare triple {2924#(< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|)} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {2820#true} is VALID [2022-02-20 21:10:46,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {2820#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {2820#true} is VALID [2022-02-20 21:10:46,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {2820#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {2820#true} is VALID [2022-02-20 21:10:46,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {2820#true} #t~short301#1 := #t~short299#1; {2820#true} is VALID [2022-02-20 21:10:46,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {2820#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {2820#true} is VALID [2022-02-20 21:10:46,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {2820#true} #t~short303#1 := #t~short301#1; {2820#true} is VALID [2022-02-20 21:10:46,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {2820#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {2820#true} is VALID [2022-02-20 21:10:46,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {2820#true} #t~short305#1 := #t~short303#1; {2820#true} is VALID [2022-02-20 21:10:46,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {2820#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {2820#true} is VALID [2022-02-20 21:10:46,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {2820#true} assume !#t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;#res#1 := 0; {2871#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:46,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {2871#(= 0 |aws_linked_list_is_valid_#res#1|)} assume true; {2871#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:46,239 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2871#(= 0 |aws_linked_list_is_valid_#res#1|)} {2924#(< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|)} #212#return; {2961#(and (= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0) (< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|))} is VALID [2022-02-20 21:10:46,239 INFO L272 TraceCheckUtils]: 28: Hoare triple {2961#(and (= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0) (< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|))} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {2820#true} is VALID [2022-02-20 21:10:46,240 INFO L290 TraceCheckUtils]: 29: Hoare triple {2820#true} ~cond := #in~cond; {2872#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:10:46,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {2872#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {2971#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} is VALID [2022-02-20 21:10:46,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {2971#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} assume true; {2971#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} is VALID [2022-02-20 21:10:46,241 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2971#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} {2961#(and (= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0) (< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|))} #214#return; {2821#false} is VALID [2022-02-20 21:10:46,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {2821#false} havoc aws_linked_list_push_back_#t~ret386#1; {2821#false} is VALID [2022-02-20 21:10:46,241 INFO L272 TraceCheckUtils]: 34: Hoare triple {2821#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {2821#false} is VALID [2022-02-20 21:10:46,241 INFO L290 TraceCheckUtils]: 35: Hoare triple {2821#false} ~cond := #in~cond; {2821#false} is VALID [2022-02-20 21:10:46,241 INFO L290 TraceCheckUtils]: 36: Hoare triple {2821#false} assume !(0 == ~cond % 256); {2821#false} is VALID [2022-02-20 21:10:46,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {2821#false} assume true; {2821#false} is VALID [2022-02-20 21:10:46,241 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2821#false} {2821#false} #216#return; {2821#false} is VALID [2022-02-20 21:10:46,241 INFO L272 TraceCheckUtils]: 39: Hoare triple {2821#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {2821#false} is VALID [2022-02-20 21:10:46,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {2821#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {2821#false} is VALID [2022-02-20 21:10:46,242 INFO L272 TraceCheckUtils]: 41: Hoare triple {2821#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {2821#false} is VALID [2022-02-20 21:10:46,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {2821#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {2821#false} is VALID [2022-02-20 21:10:46,242 INFO L290 TraceCheckUtils]: 43: Hoare triple {2821#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {2821#false} is VALID [2022-02-20 21:10:46,242 INFO L290 TraceCheckUtils]: 44: Hoare triple {2821#false} #t~short316 := #t~short313; {2821#false} is VALID [2022-02-20 21:10:46,242 INFO L290 TraceCheckUtils]: 45: Hoare triple {2821#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {2821#false} is VALID [2022-02-20 21:10:46,242 INFO L290 TraceCheckUtils]: 46: Hoare triple {2821#false} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {2821#false} is VALID [2022-02-20 21:10:46,242 INFO L290 TraceCheckUtils]: 47: Hoare triple {2821#false} assume true; {2821#false} is VALID [2022-02-20 21:10:46,242 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2821#false} {2821#false} #188#return; {2821#false} is VALID [2022-02-20 21:10:46,242 INFO L272 TraceCheckUtils]: 49: Hoare triple {2821#false} call assume_abort_if_not(#t~ret370); {2821#false} is VALID [2022-02-20 21:10:46,243 INFO L290 TraceCheckUtils]: 50: Hoare triple {2821#false} ~cond := #in~cond; {2821#false} is VALID [2022-02-20 21:10:46,245 INFO L290 TraceCheckUtils]: 51: Hoare triple {2821#false} assume !(0 == ~cond % 256); {2821#false} is VALID [2022-02-20 21:10:46,245 INFO L290 TraceCheckUtils]: 52: Hoare triple {2821#false} assume true; {2821#false} is VALID [2022-02-20 21:10:46,245 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2821#false} {2821#false} #190#return; {2821#false} is VALID [2022-02-20 21:10:46,245 INFO L290 TraceCheckUtils]: 54: Hoare triple {2821#false} havoc #t~ret370; {2821#false} is VALID [2022-02-20 21:10:46,245 INFO L272 TraceCheckUtils]: 55: Hoare triple {2821#false} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {2821#false} is VALID [2022-02-20 21:10:46,245 INFO L290 TraceCheckUtils]: 56: Hoare triple {2821#false} ~cond := #in~cond; {2821#false} is VALID [2022-02-20 21:10:46,246 INFO L290 TraceCheckUtils]: 57: Hoare triple {2821#false} assume !(0 == ~cond % 256); {2821#false} is VALID [2022-02-20 21:10:46,246 INFO L290 TraceCheckUtils]: 58: Hoare triple {2821#false} assume true; {2821#false} is VALID [2022-02-20 21:10:46,246 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {2821#false} {2821#false} #192#return; {2821#false} is VALID [2022-02-20 21:10:46,246 INFO L290 TraceCheckUtils]: 60: Hoare triple {2821#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {2821#false} is VALID [2022-02-20 21:10:46,246 INFO L272 TraceCheckUtils]: 61: Hoare triple {2821#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {2821#false} is VALID [2022-02-20 21:10:46,246 INFO L290 TraceCheckUtils]: 62: Hoare triple {2821#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {2821#false} is VALID [2022-02-20 21:10:46,246 INFO L290 TraceCheckUtils]: 63: Hoare triple {2821#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {2821#false} is VALID [2022-02-20 21:10:46,246 INFO L290 TraceCheckUtils]: 64: Hoare triple {2821#false} #t~short316 := #t~short313; {2821#false} is VALID [2022-02-20 21:10:46,246 INFO L290 TraceCheckUtils]: 65: Hoare triple {2821#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {2821#false} is VALID [2022-02-20 21:10:46,246 INFO L290 TraceCheckUtils]: 66: Hoare triple {2821#false} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {2821#false} is VALID [2022-02-20 21:10:46,247 INFO L290 TraceCheckUtils]: 67: Hoare triple {2821#false} assume true; {2821#false} is VALID [2022-02-20 21:10:46,247 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {2821#false} {2821#false} #194#return; {2821#false} is VALID [2022-02-20 21:10:46,247 INFO L272 TraceCheckUtils]: 69: Hoare triple {2821#false} call __VERIFIER_assert(#t~ret373); {2821#false} is VALID [2022-02-20 21:10:46,247 INFO L290 TraceCheckUtils]: 70: Hoare triple {2821#false} ~cond := #in~cond; {2821#false} is VALID [2022-02-20 21:10:46,247 INFO L290 TraceCheckUtils]: 71: Hoare triple {2821#false} assume 0 == ~cond % 256; {2821#false} is VALID [2022-02-20 21:10:46,247 INFO L290 TraceCheckUtils]: 72: Hoare triple {2821#false} assume !false; {2821#false} is VALID [2022-02-20 21:10:46,247 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 21:10:46,248 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:10:46,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666377440] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:46,248 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 21:10:46,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 11 [2022-02-20 21:10:46,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786003622] [2022-02-20 21:10:46,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:46,249 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 73 [2022-02-20 21:10:46,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:46,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-20 21:10:46,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:46,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 21:10:46,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:46,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 21:10:46,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-20 21:10:46,303 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 9 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-20 21:10:47,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:47,436 INFO L93 Difference]: Finished difference Result 194 states and 259 transitions. [2022-02-20 21:10:47,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 21:10:47,437 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 73 [2022-02-20 21:10:47,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:47,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-20 21:10:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2022-02-20 21:10:47,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-20 21:10:47,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 249 transitions. [2022-02-20 21:10:47,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 249 transitions. [2022-02-20 21:10:47,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:47,632 INFO L225 Difference]: With dead ends: 194 [2022-02-20 21:10:47,632 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 21:10:47,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-02-20 21:10:47,636 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 130 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:47,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 713 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 21:10:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 21:10:47,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-02-20 21:10:47,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:47,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 104 states, 67 states have (on average 1.208955223880597) internal successors, (81), 69 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:47,685 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 104 states, 67 states have (on average 1.208955223880597) internal successors, (81), 69 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:47,685 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 104 states, 67 states have (on average 1.208955223880597) internal successors, (81), 69 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:47,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:47,688 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2022-02-20 21:10:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 140 transitions. [2022-02-20 21:10:47,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:47,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:47,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 67 states have (on average 1.208955223880597) internal successors, (81), 69 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 106 states. [2022-02-20 21:10:47,689 INFO L87 Difference]: Start difference. First operand has 104 states, 67 states have (on average 1.208955223880597) internal successors, (81), 69 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 106 states. [2022-02-20 21:10:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:47,693 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2022-02-20 21:10:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 140 transitions. [2022-02-20 21:10:47,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:47,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:47,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:47,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.208955223880597) internal successors, (81), 69 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 138 transitions. [2022-02-20 21:10:47,698 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 138 transitions. Word has length 73 [2022-02-20 21:10:47,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:47,698 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 138 transitions. [2022-02-20 21:10:47,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 4 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-02-20 21:10:47,698 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2022-02-20 21:10:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 21:10:47,699 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:47,699 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:47,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 21:10:47,917 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:47,918 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:47,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:47,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1237560575, now seen corresponding path program 1 times [2022-02-20 21:10:47,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:47,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687284208] [2022-02-20 21:10:47,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:47,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:48,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:10:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:48,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {3731#true} #res := #t~nondet13;havoc #t~nondet13; {3731#true} is VALID [2022-02-20 21:10:48,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3731#true} {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #208#return; {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:48,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:10:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:48,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {3731#true} ~cond := #in~cond; {3731#true} is VALID [2022-02-20 21:10:48,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {3731#true} assume !(0 == ~cond % 256); {3731#true} is VALID [2022-02-20 21:10:48,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3731#true} {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #210#return; {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:48,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:48,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {3731#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short301#1 := #t~short299#1; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,162 INFO L290 TraceCheckUtils]: 3: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,163 INFO L290 TraceCheckUtils]: 4: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short303#1 := #t~short301#1; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short305#1 := #t~short303#1; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {3786#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|)} is VALID [2022-02-20 21:10:48,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {3786#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|)} assume aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0;aws_linked_list_is_valid_deep_#res#1 := 0; {3787#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:48,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {3787#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {3787#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:48,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {3787#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume true; {3787#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:48,166 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3787#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} {3741#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} #212#return; {3732#false} is VALID [2022-02-20 21:10:48,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:10:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:48,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {3731#true} ~cond := #in~cond; {3731#true} is VALID [2022-02-20 21:10:48,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {3731#true} assume !(0 == ~cond % 256); {3731#true} is VALID [2022-02-20 21:10:48,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3731#true} {3732#false} #214#return; {3732#false} is VALID [2022-02-20 21:10:48,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 21:10:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:48,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {3731#true} ~cond := #in~cond; {3731#true} is VALID [2022-02-20 21:10:48,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {3731#true} assume !(0 == ~cond % 256); {3731#true} is VALID [2022-02-20 21:10:48,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3731#true} {3732#false} #216#return; {3732#false} is VALID [2022-02-20 21:10:48,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 21:10:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:48,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {3731#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {3731#true} is VALID [2022-02-20 21:10:48,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {3731#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {3731#true} is VALID [2022-02-20 21:10:48,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {3731#true} #t~short316 := #t~short313; {3731#true} is VALID [2022-02-20 21:10:48,189 INFO L290 TraceCheckUtils]: 3: Hoare triple {3731#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {3731#true} is VALID [2022-02-20 21:10:48,189 INFO L290 TraceCheckUtils]: 4: Hoare triple {3731#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {3731#true} is VALID [2022-02-20 21:10:48,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,190 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3731#true} {3732#false} #188#return; {3732#false} is VALID [2022-02-20 21:10:48,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 21:10:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:48,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {3731#true} ~cond := #in~cond; {3731#true} is VALID [2022-02-20 21:10:48,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {3731#true} assume !(0 == ~cond % 256); {3731#true} is VALID [2022-02-20 21:10:48,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3731#true} {3732#false} #190#return; {3732#false} is VALID [2022-02-20 21:10:48,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-20 21:10:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:48,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {3731#true} ~cond := #in~cond; {3731#true} is VALID [2022-02-20 21:10:48,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {3731#true} assume !(0 == ~cond % 256); {3731#true} is VALID [2022-02-20 21:10:48,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3731#true} {3732#false} #192#return; {3732#false} is VALID [2022-02-20 21:10:48,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-02-20 21:10:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:48,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {3731#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {3731#true} is VALID [2022-02-20 21:10:48,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {3731#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {3731#true} is VALID [2022-02-20 21:10:48,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {3731#true} #t~short316 := #t~short313; {3731#true} is VALID [2022-02-20 21:10:48,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {3731#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {3731#true} is VALID [2022-02-20 21:10:48,210 INFO L290 TraceCheckUtils]: 4: Hoare triple {3731#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {3731#true} is VALID [2022-02-20 21:10:48,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,210 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3731#true} {3732#false} #194#return; {3732#false} is VALID [2022-02-20 21:10:48,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {3731#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(36, 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; {3731#true} is VALID [2022-02-20 21:10:48,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {3731#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:48,211 INFO L272 TraceCheckUtils]: 2: Hoare triple {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {3731#true} is VALID [2022-02-20 21:10:48,211 INFO L290 TraceCheckUtils]: 3: Hoare triple {3731#true} #res := #t~nondet13;havoc #t~nondet13; {3731#true} is VALID [2022-02-20 21:10:48,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,211 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3731#true} {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #208#return; {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:48,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:48,212 INFO L272 TraceCheckUtils]: 7: Hoare triple {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {3731#true} is VALID [2022-02-20 21:10:48,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {3731#true} ~cond := #in~cond; {3731#true} is VALID [2022-02-20 21:10:48,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {3731#true} assume !(0 == ~cond % 256); {3731#true} is VALID [2022-02-20 21:10:48,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,213 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3731#true} {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #210#return; {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:48,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:48,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:48,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:48,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {3733#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {3741#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} is VALID [2022-02-20 21:10:48,214 INFO L272 TraceCheckUtils]: 16: Hoare triple {3741#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {3731#true} is VALID [2022-02-20 21:10:48,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {3731#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short301#1 := #t~short299#1; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short303#1 := #t~short301#1; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short305#1 := #t~short303#1; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:48,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {3785#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {3786#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|)} is VALID [2022-02-20 21:10:48,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {3786#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|)} assume aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0;aws_linked_list_is_valid_deep_#res#1 := 0; {3787#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:48,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {3787#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {3787#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:48,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {3787#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume true; {3787#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:48,220 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3787#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} {3741#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} #212#return; {3732#false} is VALID [2022-02-20 21:10:48,220 INFO L272 TraceCheckUtils]: 30: Hoare triple {3732#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {3731#true} is VALID [2022-02-20 21:10:48,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {3731#true} ~cond := #in~cond; {3731#true} is VALID [2022-02-20 21:10:48,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {3731#true} assume !(0 == ~cond % 256); {3731#true} is VALID [2022-02-20 21:10:48,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,220 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3731#true} {3732#false} #214#return; {3732#false} is VALID [2022-02-20 21:10:48,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {3732#false} havoc aws_linked_list_push_back_#t~ret386#1; {3732#false} is VALID [2022-02-20 21:10:48,220 INFO L272 TraceCheckUtils]: 36: Hoare triple {3732#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {3731#true} is VALID [2022-02-20 21:10:48,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {3731#true} ~cond := #in~cond; {3731#true} is VALID [2022-02-20 21:10:48,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {3731#true} assume !(0 == ~cond % 256); {3731#true} is VALID [2022-02-20 21:10:48,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,221 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3731#true} {3732#false} #216#return; {3732#false} is VALID [2022-02-20 21:10:48,221 INFO L272 TraceCheckUtils]: 41: Hoare triple {3732#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {3732#false} is VALID [2022-02-20 21:10:48,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {3732#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {3732#false} is VALID [2022-02-20 21:10:48,221 INFO L272 TraceCheckUtils]: 43: Hoare triple {3732#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {3731#true} is VALID [2022-02-20 21:10:48,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {3731#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {3731#true} is VALID [2022-02-20 21:10:48,221 INFO L290 TraceCheckUtils]: 45: Hoare triple {3731#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {3731#true} is VALID [2022-02-20 21:10:48,221 INFO L290 TraceCheckUtils]: 46: Hoare triple {3731#true} #t~short316 := #t~short313; {3731#true} is VALID [2022-02-20 21:10:48,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {3731#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {3731#true} is VALID [2022-02-20 21:10:48,222 INFO L290 TraceCheckUtils]: 48: Hoare triple {3731#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {3731#true} is VALID [2022-02-20 21:10:48,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,222 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3731#true} {3732#false} #188#return; {3732#false} is VALID [2022-02-20 21:10:48,222 INFO L272 TraceCheckUtils]: 51: Hoare triple {3732#false} call assume_abort_if_not(#t~ret370); {3731#true} is VALID [2022-02-20 21:10:48,222 INFO L290 TraceCheckUtils]: 52: Hoare triple {3731#true} ~cond := #in~cond; {3731#true} is VALID [2022-02-20 21:10:48,222 INFO L290 TraceCheckUtils]: 53: Hoare triple {3731#true} assume !(0 == ~cond % 256); {3731#true} is VALID [2022-02-20 21:10:48,222 INFO L290 TraceCheckUtils]: 54: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,222 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {3731#true} {3732#false} #190#return; {3732#false} is VALID [2022-02-20 21:10:48,222 INFO L290 TraceCheckUtils]: 56: Hoare triple {3732#false} havoc #t~ret370; {3732#false} is VALID [2022-02-20 21:10:48,223 INFO L272 TraceCheckUtils]: 57: Hoare triple {3732#false} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {3731#true} is VALID [2022-02-20 21:10:48,223 INFO L290 TraceCheckUtils]: 58: Hoare triple {3731#true} ~cond := #in~cond; {3731#true} is VALID [2022-02-20 21:10:48,223 INFO L290 TraceCheckUtils]: 59: Hoare triple {3731#true} assume !(0 == ~cond % 256); {3731#true} is VALID [2022-02-20 21:10:48,223 INFO L290 TraceCheckUtils]: 60: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,223 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {3731#true} {3732#false} #192#return; {3732#false} is VALID [2022-02-20 21:10:48,223 INFO L290 TraceCheckUtils]: 62: Hoare triple {3732#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {3732#false} is VALID [2022-02-20 21:10:48,223 INFO L272 TraceCheckUtils]: 63: Hoare triple {3732#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {3731#true} is VALID [2022-02-20 21:10:48,223 INFO L290 TraceCheckUtils]: 64: Hoare triple {3731#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {3731#true} is VALID [2022-02-20 21:10:48,223 INFO L290 TraceCheckUtils]: 65: Hoare triple {3731#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {3731#true} is VALID [2022-02-20 21:10:48,224 INFO L290 TraceCheckUtils]: 66: Hoare triple {3731#true} #t~short316 := #t~short313; {3731#true} is VALID [2022-02-20 21:10:48,224 INFO L290 TraceCheckUtils]: 67: Hoare triple {3731#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {3731#true} is VALID [2022-02-20 21:10:48,224 INFO L290 TraceCheckUtils]: 68: Hoare triple {3731#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {3731#true} is VALID [2022-02-20 21:10:48,224 INFO L290 TraceCheckUtils]: 69: Hoare triple {3731#true} assume true; {3731#true} is VALID [2022-02-20 21:10:48,224 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {3731#true} {3732#false} #194#return; {3732#false} is VALID [2022-02-20 21:10:48,224 INFO L272 TraceCheckUtils]: 71: Hoare triple {3732#false} call __VERIFIER_assert(#t~ret373); {3732#false} is VALID [2022-02-20 21:10:48,224 INFO L290 TraceCheckUtils]: 72: Hoare triple {3732#false} ~cond := #in~cond; {3732#false} is VALID [2022-02-20 21:10:48,224 INFO L290 TraceCheckUtils]: 73: Hoare triple {3732#false} assume 0 == ~cond % 256; {3732#false} is VALID [2022-02-20 21:10:48,224 INFO L290 TraceCheckUtils]: 74: Hoare triple {3732#false} assume !false; {3732#false} is VALID [2022-02-20 21:10:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 21:10:48,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:48,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687284208] [2022-02-20 21:10:48,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687284208] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:48,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:10:48,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:10:48,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637646020] [2022-02-20 21:10:48,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:48,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 75 [2022-02-20 21:10:48,226 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:48,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:48,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:48,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:10:48,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:48,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:10:48,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:10:48,269 INFO L87 Difference]: Start difference. First operand 104 states and 138 transitions. Second operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:48,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:48,883 INFO L93 Difference]: Finished difference Result 197 states and 264 transitions. [2022-02-20 21:10:48,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:10:48,884 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 75 [2022-02-20 21:10:48,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:48,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:48,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 251 transitions. [2022-02-20 21:10:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:48,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 251 transitions. [2022-02-20 21:10:48,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 251 transitions. [2022-02-20 21:10:49,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:49,063 INFO L225 Difference]: With dead ends: 197 [2022-02-20 21:10:49,063 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 21:10:49,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-20 21:10:49,064 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 49 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:49,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 616 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 21:10:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 21:10:49,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-02-20 21:10:49,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:49,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 104 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 69 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:49,099 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 104 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 69 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:49,099 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 104 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 69 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:49,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:49,107 INFO L93 Difference]: Finished difference Result 104 states and 137 transitions. [2022-02-20 21:10:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2022-02-20 21:10:49,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:49,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:49,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 69 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 104 states. [2022-02-20 21:10:49,108 INFO L87 Difference]: Start difference. First operand has 104 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 69 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 104 states. [2022-02-20 21:10:49,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:49,117 INFO L93 Difference]: Finished difference Result 104 states and 137 transitions. [2022-02-20 21:10:49,117 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2022-02-20 21:10:49,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:49,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:49,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:49,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:49,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.1940298507462686) internal successors, (80), 69 states have internal predecessors, (80), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:49,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 137 transitions. [2022-02-20 21:10:49,122 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 137 transitions. Word has length 75 [2022-02-20 21:10:49,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:49,122 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 137 transitions. [2022-02-20 21:10:49,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.166666666666667) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 137 transitions. [2022-02-20 21:10:49,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 21:10:49,123 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:49,123 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:49,123 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 21:10:49,123 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:49,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:49,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1187141198, now seen corresponding path program 1 times [2022-02-20 21:10:49,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:49,124 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146294536] [2022-02-20 21:10:49,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:49,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:10:49,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {4415#true} #res := #t~nondet13;havoc #t~nondet13; {4415#true} is VALID [2022-02-20 21:10:49,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4415#true} {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #208#return; {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:49,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:10:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {4415#true} ~cond := #in~cond; {4415#true} is VALID [2022-02-20 21:10:49,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {4415#true} assume !(0 == ~cond % 256); {4415#true} is VALID [2022-02-20 21:10:49,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4415#true} {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #210#return; {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:49,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {4415#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short301#1 := #t~short299#1; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,240 INFO L290 TraceCheckUtils]: 3: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short303#1 := #t~short301#1; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short305#1 := #t~short303#1; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {4472#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|)} is VALID [2022-02-20 21:10:49,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {4472#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|)} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {4473#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|)} is VALID [2022-02-20 21:10:49,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {4473#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|)} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:49,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:49,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:49,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume true; {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:49,244 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} {4425#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} #212#return; {4416#false} is VALID [2022-02-20 21:10:49,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 21:10:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {4415#true} ~cond := #in~cond; {4415#true} is VALID [2022-02-20 21:10:49,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {4415#true} assume !(0 == ~cond % 256); {4415#true} is VALID [2022-02-20 21:10:49,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4415#true} {4416#false} #214#return; {4416#false} is VALID [2022-02-20 21:10:49,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 21:10:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {4415#true} ~cond := #in~cond; {4415#true} is VALID [2022-02-20 21:10:49,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {4415#true} assume !(0 == ~cond % 256); {4415#true} is VALID [2022-02-20 21:10:49,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4415#true} {4416#false} #216#return; {4416#false} is VALID [2022-02-20 21:10:49,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-20 21:10:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {4415#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {4415#true} is VALID [2022-02-20 21:10:49,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {4415#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {4415#true} is VALID [2022-02-20 21:10:49,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {4415#true} #t~short316 := #t~short313; {4415#true} is VALID [2022-02-20 21:10:49,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {4415#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {4415#true} is VALID [2022-02-20 21:10:49,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {4415#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {4415#true} is VALID [2022-02-20 21:10:49,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,263 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4415#true} {4416#false} #188#return; {4416#false} is VALID [2022-02-20 21:10:49,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-20 21:10:49,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {4415#true} ~cond := #in~cond; {4415#true} is VALID [2022-02-20 21:10:49,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {4415#true} assume !(0 == ~cond % 256); {4415#true} is VALID [2022-02-20 21:10:49,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4415#true} {4416#false} #190#return; {4416#false} is VALID [2022-02-20 21:10:49,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-02-20 21:10:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {4415#true} ~cond := #in~cond; {4415#true} is VALID [2022-02-20 21:10:49,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {4415#true} assume !(0 == ~cond % 256); {4415#true} is VALID [2022-02-20 21:10:49,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4415#true} {4416#false} #192#return; {4416#false} is VALID [2022-02-20 21:10:49,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 21:10:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {4415#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {4415#true} is VALID [2022-02-20 21:10:49,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {4415#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {4415#true} is VALID [2022-02-20 21:10:49,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {4415#true} #t~short316 := #t~short313; {4415#true} is VALID [2022-02-20 21:10:49,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {4415#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {4415#true} is VALID [2022-02-20 21:10:49,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {4415#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {4415#true} is VALID [2022-02-20 21:10:49,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,279 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4415#true} {4416#false} #194#return; {4416#false} is VALID [2022-02-20 21:10:49,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {4415#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(36, 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; {4415#true} is VALID [2022-02-20 21:10:49,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {4415#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:49,280 INFO L272 TraceCheckUtils]: 2: Hoare triple {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {4415#true} is VALID [2022-02-20 21:10:49,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {4415#true} #res := #t~nondet13;havoc #t~nondet13; {4415#true} is VALID [2022-02-20 21:10:49,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,280 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4415#true} {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #208#return; {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:49,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:49,281 INFO L272 TraceCheckUtils]: 7: Hoare triple {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {4415#true} is VALID [2022-02-20 21:10:49,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {4415#true} ~cond := #in~cond; {4415#true} is VALID [2022-02-20 21:10:49,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {4415#true} assume !(0 == ~cond % 256); {4415#true} is VALID [2022-02-20 21:10:49,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,282 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4415#true} {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} #210#return; {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:49,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:49,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:49,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:49,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {4417#(not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| 0))} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {4425#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} is VALID [2022-02-20 21:10:49,283 INFO L272 TraceCheckUtils]: 16: Hoare triple {4425#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {4415#true} is VALID [2022-02-20 21:10:49,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {4415#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short301#1 := #t~short299#1; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short303#1 := #t~short301#1; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short305#1 := #t~short303#1; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:49,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {4471#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {4472#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|)} is VALID [2022-02-20 21:10:49,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {4472#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|)} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {4473#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|)} is VALID [2022-02-20 21:10:49,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {4473#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|)} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:49,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:49,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:49,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume true; {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:49,289 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4474#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} {4425#(not (= 0 |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} #212#return; {4416#false} is VALID [2022-02-20 21:10:49,289 INFO L272 TraceCheckUtils]: 32: Hoare triple {4416#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {4415#true} is VALID [2022-02-20 21:10:49,289 INFO L290 TraceCheckUtils]: 33: Hoare triple {4415#true} ~cond := #in~cond; {4415#true} is VALID [2022-02-20 21:10:49,289 INFO L290 TraceCheckUtils]: 34: Hoare triple {4415#true} assume !(0 == ~cond % 256); {4415#true} is VALID [2022-02-20 21:10:49,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,289 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4415#true} {4416#false} #214#return; {4416#false} is VALID [2022-02-20 21:10:49,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {4416#false} havoc aws_linked_list_push_back_#t~ret386#1; {4416#false} is VALID [2022-02-20 21:10:49,290 INFO L272 TraceCheckUtils]: 38: Hoare triple {4416#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {4415#true} is VALID [2022-02-20 21:10:49,290 INFO L290 TraceCheckUtils]: 39: Hoare triple {4415#true} ~cond := #in~cond; {4415#true} is VALID [2022-02-20 21:10:49,290 INFO L290 TraceCheckUtils]: 40: Hoare triple {4415#true} assume !(0 == ~cond % 256); {4415#true} is VALID [2022-02-20 21:10:49,290 INFO L290 TraceCheckUtils]: 41: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,290 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {4415#true} {4416#false} #216#return; {4416#false} is VALID [2022-02-20 21:10:49,290 INFO L272 TraceCheckUtils]: 43: Hoare triple {4416#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {4416#false} is VALID [2022-02-20 21:10:49,290 INFO L290 TraceCheckUtils]: 44: Hoare triple {4416#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {4416#false} is VALID [2022-02-20 21:10:49,290 INFO L272 TraceCheckUtils]: 45: Hoare triple {4416#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {4415#true} is VALID [2022-02-20 21:10:49,290 INFO L290 TraceCheckUtils]: 46: Hoare triple {4415#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {4415#true} is VALID [2022-02-20 21:10:49,291 INFO L290 TraceCheckUtils]: 47: Hoare triple {4415#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {4415#true} is VALID [2022-02-20 21:10:49,291 INFO L290 TraceCheckUtils]: 48: Hoare triple {4415#true} #t~short316 := #t~short313; {4415#true} is VALID [2022-02-20 21:10:49,291 INFO L290 TraceCheckUtils]: 49: Hoare triple {4415#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {4415#true} is VALID [2022-02-20 21:10:49,291 INFO L290 TraceCheckUtils]: 50: Hoare triple {4415#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {4415#true} is VALID [2022-02-20 21:10:49,291 INFO L290 TraceCheckUtils]: 51: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,291 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {4415#true} {4416#false} #188#return; {4416#false} is VALID [2022-02-20 21:10:49,291 INFO L272 TraceCheckUtils]: 53: Hoare triple {4416#false} call assume_abort_if_not(#t~ret370); {4415#true} is VALID [2022-02-20 21:10:49,291 INFO L290 TraceCheckUtils]: 54: Hoare triple {4415#true} ~cond := #in~cond; {4415#true} is VALID [2022-02-20 21:10:49,291 INFO L290 TraceCheckUtils]: 55: Hoare triple {4415#true} assume !(0 == ~cond % 256); {4415#true} is VALID [2022-02-20 21:10:49,292 INFO L290 TraceCheckUtils]: 56: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,292 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {4415#true} {4416#false} #190#return; {4416#false} is VALID [2022-02-20 21:10:49,292 INFO L290 TraceCheckUtils]: 58: Hoare triple {4416#false} havoc #t~ret370; {4416#false} is VALID [2022-02-20 21:10:49,292 INFO L272 TraceCheckUtils]: 59: Hoare triple {4416#false} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {4415#true} is VALID [2022-02-20 21:10:49,292 INFO L290 TraceCheckUtils]: 60: Hoare triple {4415#true} ~cond := #in~cond; {4415#true} is VALID [2022-02-20 21:10:49,292 INFO L290 TraceCheckUtils]: 61: Hoare triple {4415#true} assume !(0 == ~cond % 256); {4415#true} is VALID [2022-02-20 21:10:49,292 INFO L290 TraceCheckUtils]: 62: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,292 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {4415#true} {4416#false} #192#return; {4416#false} is VALID [2022-02-20 21:10:49,292 INFO L290 TraceCheckUtils]: 64: Hoare triple {4416#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {4416#false} is VALID [2022-02-20 21:10:49,292 INFO L272 TraceCheckUtils]: 65: Hoare triple {4416#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {4415#true} is VALID [2022-02-20 21:10:49,293 INFO L290 TraceCheckUtils]: 66: Hoare triple {4415#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {4415#true} is VALID [2022-02-20 21:10:49,293 INFO L290 TraceCheckUtils]: 67: Hoare triple {4415#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {4415#true} is VALID [2022-02-20 21:10:49,293 INFO L290 TraceCheckUtils]: 68: Hoare triple {4415#true} #t~short316 := #t~short313; {4415#true} is VALID [2022-02-20 21:10:49,293 INFO L290 TraceCheckUtils]: 69: Hoare triple {4415#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {4415#true} is VALID [2022-02-20 21:10:49,293 INFO L290 TraceCheckUtils]: 70: Hoare triple {4415#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {4415#true} is VALID [2022-02-20 21:10:49,293 INFO L290 TraceCheckUtils]: 71: Hoare triple {4415#true} assume true; {4415#true} is VALID [2022-02-20 21:10:49,293 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {4415#true} {4416#false} #194#return; {4416#false} is VALID [2022-02-20 21:10:49,293 INFO L272 TraceCheckUtils]: 73: Hoare triple {4416#false} call __VERIFIER_assert(#t~ret373); {4416#false} is VALID [2022-02-20 21:10:49,293 INFO L290 TraceCheckUtils]: 74: Hoare triple {4416#false} ~cond := #in~cond; {4416#false} is VALID [2022-02-20 21:10:49,294 INFO L290 TraceCheckUtils]: 75: Hoare triple {4416#false} assume 0 == ~cond % 256; {4416#false} is VALID [2022-02-20 21:10:49,294 INFO L290 TraceCheckUtils]: 76: Hoare triple {4416#false} assume !false; {4416#false} is VALID [2022-02-20 21:10:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 21:10:49,294 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:49,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146294536] [2022-02-20 21:10:49,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146294536] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:49,294 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:10:49,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 21:10:49,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640697262] [2022-02-20 21:10:49,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:49,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2022-02-20 21:10:49,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:49,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:49,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:49,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 21:10:49,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:49,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 21:10:49,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:10:49,340 INFO L87 Difference]: Start difference. First operand 104 states and 137 transitions. Second operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:50,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:50,077 INFO L93 Difference]: Finished difference Result 206 states and 277 transitions. [2022-02-20 21:10:50,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 21:10:50,077 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2022-02-20 21:10:50,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:50,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:50,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 264 transitions. [2022-02-20 21:10:50,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:50,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 264 transitions. [2022-02-20 21:10:50,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 264 transitions. [2022-02-20 21:10:50,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:50,277 INFO L225 Difference]: With dead ends: 206 [2022-02-20 21:10:50,277 INFO L226 Difference]: Without dead ends: 112 [2022-02-20 21:10:50,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-20 21:10:50,278 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 75 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:50,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 716 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 21:10:50,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-20 21:10:50,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2022-02-20 21:10:50,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:50,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 105 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:50,320 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 105 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:50,320 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 105 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:50,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:50,323 INFO L93 Difference]: Finished difference Result 112 states and 150 transitions. [2022-02-20 21:10:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 150 transitions. [2022-02-20 21:10:50,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:50,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:50,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 112 states. [2022-02-20 21:10:50,324 INFO L87 Difference]: Start difference. First operand has 105 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 112 states. [2022-02-20 21:10:50,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:50,332 INFO L93 Difference]: Finished difference Result 112 states and 150 transitions. [2022-02-20 21:10:50,333 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 150 transitions. [2022-02-20 21:10:50,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:50,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:50,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:50,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 70 states have internal predecessors, (81), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 138 transitions. [2022-02-20 21:10:50,339 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 138 transitions. Word has length 77 [2022-02-20 21:10:50,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:50,339 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 138 transitions. [2022-02-20 21:10:50,339 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.571428571428571) internal successors, (39), 8 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:50,339 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 138 transitions. [2022-02-20 21:10:50,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 21:10:50,340 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:50,340 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:50,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 21:10:50,341 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:50,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1548809988, now seen corresponding path program 1 times [2022-02-20 21:10:50,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:50,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274758464] [2022-02-20 21:10:50,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:50,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:50,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:50,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:10:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:50,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {5134#true} #res := #t~nondet13;havoc #t~nondet13; {5134#true} is VALID [2022-02-20 21:10:50,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5134#true} {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} #208#return; {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} is VALID [2022-02-20 21:10:50,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:10:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:50,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {5134#true} ~cond := #in~cond; {5134#true} is VALID [2022-02-20 21:10:50,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {5134#true} assume !(0 == ~cond % 256); {5134#true} is VALID [2022-02-20 21:10:50,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5134#true} {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} #210#return; {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} is VALID [2022-02-20 21:10:50,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:50,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {5134#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {5134#true} is VALID [2022-02-20 21:10:50,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {5134#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {5134#true} is VALID [2022-02-20 21:10:50,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {5134#true} #t~short301#1 := #t~short299#1; {5134#true} is VALID [2022-02-20 21:10:50,450 INFO L290 TraceCheckUtils]: 3: Hoare triple {5134#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {5134#true} is VALID [2022-02-20 21:10:50,450 INFO L290 TraceCheckUtils]: 4: Hoare triple {5134#true} #t~short303#1 := #t~short301#1; {5134#true} is VALID [2022-02-20 21:10:50,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {5134#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {5134#true} is VALID [2022-02-20 21:10:50,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {5134#true} #t~short305#1 := #t~short303#1; {5134#true} is VALID [2022-02-20 21:10:50,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {5134#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {5134#true} is VALID [2022-02-20 21:10:50,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {5134#true} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {5134#true} is VALID [2022-02-20 21:10:50,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {5134#true} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {5191#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)} is VALID [2022-02-20 21:10:50,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {5191#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {5191#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)} is VALID [2022-02-20 21:10:50,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {5191#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)} assume aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 1; {5135#false} is VALID [2022-02-20 21:10:50,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {5135#false} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {5135#false} is VALID [2022-02-20 21:10:50,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {5135#false} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {5135#false} is VALID [2022-02-20 21:10:50,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {5135#false} assume true; {5135#false} is VALID [2022-02-20 21:10:50,452 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5135#false} {5144#(= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0)} #212#return; {5135#false} is VALID [2022-02-20 21:10:50,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-20 21:10:50,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:50,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {5134#true} ~cond := #in~cond; {5134#true} is VALID [2022-02-20 21:10:50,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {5134#true} assume !(0 == ~cond % 256); {5134#true} is VALID [2022-02-20 21:10:50,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5134#true} {5135#false} #214#return; {5135#false} is VALID [2022-02-20 21:10:50,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-20 21:10:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:50,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {5134#true} ~cond := #in~cond; {5134#true} is VALID [2022-02-20 21:10:50,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {5134#true} assume !(0 == ~cond % 256); {5134#true} is VALID [2022-02-20 21:10:50,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5134#true} {5135#false} #216#return; {5135#false} is VALID [2022-02-20 21:10:50,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:10:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:50,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {5134#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {5134#true} is VALID [2022-02-20 21:10:50,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {5134#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {5134#true} is VALID [2022-02-20 21:10:50,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {5134#true} #t~short316 := #t~short313; {5134#true} is VALID [2022-02-20 21:10:50,474 INFO L290 TraceCheckUtils]: 3: Hoare triple {5134#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {5134#true} is VALID [2022-02-20 21:10:50,474 INFO L290 TraceCheckUtils]: 4: Hoare triple {5134#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {5134#true} is VALID [2022-02-20 21:10:50,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,474 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5134#true} {5135#false} #188#return; {5135#false} is VALID [2022-02-20 21:10:50,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 21:10:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:50,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {5134#true} ~cond := #in~cond; {5134#true} is VALID [2022-02-20 21:10:50,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {5134#true} assume !(0 == ~cond % 256); {5134#true} is VALID [2022-02-20 21:10:50,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5134#true} {5135#false} #190#return; {5135#false} is VALID [2022-02-20 21:10:50,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-20 21:10:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:50,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {5134#true} ~cond := #in~cond; {5134#true} is VALID [2022-02-20 21:10:50,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {5134#true} assume !(0 == ~cond % 256); {5134#true} is VALID [2022-02-20 21:10:50,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5134#true} {5135#false} #192#return; {5135#false} is VALID [2022-02-20 21:10:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 21:10:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:50,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {5134#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {5134#true} is VALID [2022-02-20 21:10:50,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {5134#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {5134#true} is VALID [2022-02-20 21:10:50,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {5134#true} #t~short316 := #t~short313; {5134#true} is VALID [2022-02-20 21:10:50,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {5134#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {5134#true} is VALID [2022-02-20 21:10:50,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {5134#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {5134#true} is VALID [2022-02-20 21:10:50,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,497 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5134#true} {5135#false} #194#return; {5135#false} is VALID [2022-02-20 21:10:50,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {5134#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(36, 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; {5134#true} is VALID [2022-02-20 21:10:50,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {5134#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} is VALID [2022-02-20 21:10:50,497 INFO L272 TraceCheckUtils]: 2: Hoare triple {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {5134#true} is VALID [2022-02-20 21:10:50,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {5134#true} #res := #t~nondet13;havoc #t~nondet13; {5134#true} is VALID [2022-02-20 21:10:50,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,498 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5134#true} {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} #208#return; {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} is VALID [2022-02-20 21:10:50,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} is VALID [2022-02-20 21:10:50,498 INFO L272 TraceCheckUtils]: 7: Hoare triple {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {5134#true} is VALID [2022-02-20 21:10:50,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {5134#true} ~cond := #in~cond; {5134#true} is VALID [2022-02-20 21:10:50,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {5134#true} assume !(0 == ~cond % 256); {5134#true} is VALID [2022-02-20 21:10:50,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,499 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5134#true} {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} #210#return; {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} is VALID [2022-02-20 21:10:50,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} is VALID [2022-02-20 21:10:50,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} is VALID [2022-02-20 21:10:50,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} is VALID [2022-02-20 21:10:50,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {5136#(= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0)} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {5144#(= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0)} is VALID [2022-02-20 21:10:50,501 INFO L272 TraceCheckUtils]: 16: Hoare triple {5144#(= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0)} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {5134#true} is VALID [2022-02-20 21:10:50,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {5134#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {5134#true} is VALID [2022-02-20 21:10:50,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {5134#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {5134#true} is VALID [2022-02-20 21:10:50,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {5134#true} #t~short301#1 := #t~short299#1; {5134#true} is VALID [2022-02-20 21:10:50,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {5134#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {5134#true} is VALID [2022-02-20 21:10:50,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {5134#true} #t~short303#1 := #t~short301#1; {5134#true} is VALID [2022-02-20 21:10:50,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {5134#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {5134#true} is VALID [2022-02-20 21:10:50,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {5134#true} #t~short305#1 := #t~short303#1; {5134#true} is VALID [2022-02-20 21:10:50,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {5134#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {5134#true} is VALID [2022-02-20 21:10:50,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {5134#true} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {5134#true} is VALID [2022-02-20 21:10:50,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {5134#true} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {5191#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)} is VALID [2022-02-20 21:10:50,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {5191#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {5191#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)} is VALID [2022-02-20 21:10:50,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {5191#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)} assume aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 1; {5135#false} is VALID [2022-02-20 21:10:50,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {5135#false} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {5135#false} is VALID [2022-02-20 21:10:50,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {5135#false} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {5135#false} is VALID [2022-02-20 21:10:50,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {5135#false} assume true; {5135#false} is VALID [2022-02-20 21:10:50,504 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5135#false} {5144#(= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0)} #212#return; {5135#false} is VALID [2022-02-20 21:10:50,504 INFO L272 TraceCheckUtils]: 33: Hoare triple {5135#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {5134#true} is VALID [2022-02-20 21:10:50,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {5134#true} ~cond := #in~cond; {5134#true} is VALID [2022-02-20 21:10:50,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {5134#true} assume !(0 == ~cond % 256); {5134#true} is VALID [2022-02-20 21:10:50,504 INFO L290 TraceCheckUtils]: 36: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,504 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5134#true} {5135#false} #214#return; {5135#false} is VALID [2022-02-20 21:10:50,505 INFO L290 TraceCheckUtils]: 38: Hoare triple {5135#false} havoc aws_linked_list_push_back_#t~ret386#1; {5135#false} is VALID [2022-02-20 21:10:50,505 INFO L272 TraceCheckUtils]: 39: Hoare triple {5135#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {5134#true} is VALID [2022-02-20 21:10:50,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {5134#true} ~cond := #in~cond; {5134#true} is VALID [2022-02-20 21:10:50,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {5134#true} assume !(0 == ~cond % 256); {5134#true} is VALID [2022-02-20 21:10:50,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,505 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {5134#true} {5135#false} #216#return; {5135#false} is VALID [2022-02-20 21:10:50,505 INFO L272 TraceCheckUtils]: 44: Hoare triple {5135#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {5135#false} is VALID [2022-02-20 21:10:50,505 INFO L290 TraceCheckUtils]: 45: Hoare triple {5135#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {5135#false} is VALID [2022-02-20 21:10:50,505 INFO L272 TraceCheckUtils]: 46: Hoare triple {5135#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {5134#true} is VALID [2022-02-20 21:10:50,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {5134#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {5134#true} is VALID [2022-02-20 21:10:50,506 INFO L290 TraceCheckUtils]: 48: Hoare triple {5134#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {5134#true} is VALID [2022-02-20 21:10:50,506 INFO L290 TraceCheckUtils]: 49: Hoare triple {5134#true} #t~short316 := #t~short313; {5134#true} is VALID [2022-02-20 21:10:50,506 INFO L290 TraceCheckUtils]: 50: Hoare triple {5134#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {5134#true} is VALID [2022-02-20 21:10:50,506 INFO L290 TraceCheckUtils]: 51: Hoare triple {5134#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {5134#true} is VALID [2022-02-20 21:10:50,506 INFO L290 TraceCheckUtils]: 52: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,506 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5134#true} {5135#false} #188#return; {5135#false} is VALID [2022-02-20 21:10:50,506 INFO L272 TraceCheckUtils]: 54: Hoare triple {5135#false} call assume_abort_if_not(#t~ret370); {5134#true} is VALID [2022-02-20 21:10:50,506 INFO L290 TraceCheckUtils]: 55: Hoare triple {5134#true} ~cond := #in~cond; {5134#true} is VALID [2022-02-20 21:10:50,506 INFO L290 TraceCheckUtils]: 56: Hoare triple {5134#true} assume !(0 == ~cond % 256); {5134#true} is VALID [2022-02-20 21:10:50,506 INFO L290 TraceCheckUtils]: 57: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,507 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {5134#true} {5135#false} #190#return; {5135#false} is VALID [2022-02-20 21:10:50,507 INFO L290 TraceCheckUtils]: 59: Hoare triple {5135#false} havoc #t~ret370; {5135#false} is VALID [2022-02-20 21:10:50,507 INFO L272 TraceCheckUtils]: 60: Hoare triple {5135#false} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {5134#true} is VALID [2022-02-20 21:10:50,507 INFO L290 TraceCheckUtils]: 61: Hoare triple {5134#true} ~cond := #in~cond; {5134#true} is VALID [2022-02-20 21:10:50,507 INFO L290 TraceCheckUtils]: 62: Hoare triple {5134#true} assume !(0 == ~cond % 256); {5134#true} is VALID [2022-02-20 21:10:50,507 INFO L290 TraceCheckUtils]: 63: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,507 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {5134#true} {5135#false} #192#return; {5135#false} is VALID [2022-02-20 21:10:50,507 INFO L290 TraceCheckUtils]: 65: Hoare triple {5135#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {5135#false} is VALID [2022-02-20 21:10:50,507 INFO L272 TraceCheckUtils]: 66: Hoare triple {5135#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {5134#true} is VALID [2022-02-20 21:10:50,508 INFO L290 TraceCheckUtils]: 67: Hoare triple {5134#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {5134#true} is VALID [2022-02-20 21:10:50,508 INFO L290 TraceCheckUtils]: 68: Hoare triple {5134#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {5134#true} is VALID [2022-02-20 21:10:50,508 INFO L290 TraceCheckUtils]: 69: Hoare triple {5134#true} #t~short316 := #t~short313; {5134#true} is VALID [2022-02-20 21:10:50,508 INFO L290 TraceCheckUtils]: 70: Hoare triple {5134#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {5134#true} is VALID [2022-02-20 21:10:50,508 INFO L290 TraceCheckUtils]: 71: Hoare triple {5134#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {5134#true} is VALID [2022-02-20 21:10:50,508 INFO L290 TraceCheckUtils]: 72: Hoare triple {5134#true} assume true; {5134#true} is VALID [2022-02-20 21:10:50,508 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {5134#true} {5135#false} #194#return; {5135#false} is VALID [2022-02-20 21:10:50,508 INFO L272 TraceCheckUtils]: 74: Hoare triple {5135#false} call __VERIFIER_assert(#t~ret373); {5135#false} is VALID [2022-02-20 21:10:50,508 INFO L290 TraceCheckUtils]: 75: Hoare triple {5135#false} ~cond := #in~cond; {5135#false} is VALID [2022-02-20 21:10:50,509 INFO L290 TraceCheckUtils]: 76: Hoare triple {5135#false} assume 0 == ~cond % 256; {5135#false} is VALID [2022-02-20 21:10:50,509 INFO L290 TraceCheckUtils]: 77: Hoare triple {5135#false} assume !false; {5135#false} is VALID [2022-02-20 21:10:50,509 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 21:10:50,509 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:50,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274758464] [2022-02-20 21:10:50,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274758464] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:50,509 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:10:50,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:10:50,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972813868] [2022-02-20 21:10:50,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:50,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2022-02-20 21:10:50,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:50,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:50,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:50,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:10:50,550 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:50,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:10:50,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:10:50,551 INFO L87 Difference]: Start difference. First operand 105 states and 138 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:50,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:50,972 INFO L93 Difference]: Finished difference Result 202 states and 273 transitions. [2022-02-20 21:10:50,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:10:50,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2022-02-20 21:10:50,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:50,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 256 transitions. [2022-02-20 21:10:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:50,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 256 transitions. [2022-02-20 21:10:50,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 256 transitions. [2022-02-20 21:10:51,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:51,147 INFO L225 Difference]: With dead ends: 202 [2022-02-20 21:10:51,147 INFO L226 Difference]: Without dead ends: 111 [2022-02-20 21:10:51,147 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:10:51,148 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 23 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:51,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 449 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:10:51,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-20 21:10:51,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 106. [2022-02-20 21:10:51,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:51,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 106 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 71 states have internal predecessors, (82), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:51,183 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 106 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 71 states have internal predecessors, (82), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:51,183 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 106 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 71 states have internal predecessors, (82), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:51,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:51,186 INFO L93 Difference]: Finished difference Result 111 states and 148 transitions. [2022-02-20 21:10:51,186 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 148 transitions. [2022-02-20 21:10:51,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:51,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:51,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 71 states have internal predecessors, (82), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 111 states. [2022-02-20 21:10:51,187 INFO L87 Difference]: Start difference. First operand has 106 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 71 states have internal predecessors, (82), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 111 states. [2022-02-20 21:10:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:51,189 INFO L93 Difference]: Finished difference Result 111 states and 148 transitions. [2022-02-20 21:10:51,189 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 148 transitions. [2022-02-20 21:10:51,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:51,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:51,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:51,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:51,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 71 states have internal predecessors, (82), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 139 transitions. [2022-02-20 21:10:51,193 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 139 transitions. Word has length 78 [2022-02-20 21:10:51,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:51,193 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 139 transitions. [2022-02-20 21:10:51,193 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:51,193 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 139 transitions. [2022-02-20 21:10:51,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-20 21:10:51,194 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:51,194 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:51,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 21:10:51,194 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:51,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:51,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1185344546, now seen corresponding path program 1 times [2022-02-20 21:10:51,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:51,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416444375] [2022-02-20 21:10:51,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:51,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:51,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:10:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:51,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {5840#true} #res := #t~nondet13;havoc #t~nondet13; {5840#true} is VALID [2022-02-20 21:10:51,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,288 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5840#true} {5840#true} #208#return; {5840#true} is VALID [2022-02-20 21:10:51,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:10:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:51,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {5840#true} ~cond := #in~cond; {5840#true} is VALID [2022-02-20 21:10:51,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {5840#true} assume !(0 == ~cond % 256); {5840#true} is VALID [2022-02-20 21:10:51,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5840#true} {5840#true} #210#return; {5840#true} is VALID [2022-02-20 21:10:51,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:51,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 21:10:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:51,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {5840#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {5840#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {5840#true} #t~short311 := #t~short308; {5840#true} is VALID [2022-02-20 21:10:51,327 INFO L290 TraceCheckUtils]: 3: Hoare triple {5840#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {5840#true} is VALID [2022-02-20 21:10:51,328 INFO L290 TraceCheckUtils]: 4: Hoare triple {5840#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {5840#true} is VALID [2022-02-20 21:10:51,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,328 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5840#true} {5840#true} #242#return; {5840#true} is VALID [2022-02-20 21:10:51,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {5840#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {5840#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {5840#true} #t~short301#1 := #t~short299#1; {5840#true} is VALID [2022-02-20 21:10:51,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {5840#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {5840#true} is VALID [2022-02-20 21:10:51,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {5840#true} #t~short303#1 := #t~short301#1; {5840#true} is VALID [2022-02-20 21:10:51,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {5840#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {5840#true} #t~short305#1 := #t~short303#1; {5840#true} is VALID [2022-02-20 21:10:51,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {5840#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {5840#true} is VALID [2022-02-20 21:10:51,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {5840#true} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {5840#true} is VALID [2022-02-20 21:10:51,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {5840#true} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {5840#true} is VALID [2022-02-20 21:10:51,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {5840#true} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {5840#true} is VALID [2022-02-20 21:10:51,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {5840#true} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset); {5840#true} is VALID [2022-02-20 21:10:51,330 INFO L272 TraceCheckUtils]: 12: Hoare triple {5840#true} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {5840#true} is VALID [2022-02-20 21:10:51,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {5840#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {5840#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {5840#true} #t~short311 := #t~short308; {5840#true} is VALID [2022-02-20 21:10:51,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {5840#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {5840#true} is VALID [2022-02-20 21:10:51,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {5840#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {5840#true} is VALID [2022-02-20 21:10:51,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,331 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {5840#true} {5840#true} #242#return; {5840#true} is VALID [2022-02-20 21:10:51,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {5840#true} assume 0 == aws_linked_list_is_valid_deep_#t~ret317#1 % 256;havoc aws_linked_list_is_valid_deep_#t~ret317#1;aws_linked_list_is_valid_deep_#res#1 := 0; {5911#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1| 0)} is VALID [2022-02-20 21:10:51,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {5911#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1| 0)} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {5912#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:51,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {5912#(= 0 |aws_linked_list_is_valid_#res#1|)} assume true; {5912#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:51,332 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5912#(= 0 |aws_linked_list_is_valid_#res#1|)} {5840#true} #212#return; {5873#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0)} is VALID [2022-02-20 21:10:51,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-20 21:10:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:51,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {5840#true} ~cond := #in~cond; {5913#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:10:51,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {5913#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {5914#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:51,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {5914#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} assume true; {5914#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:51,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5914#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} {5873#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0)} #214#return; {5841#false} is VALID [2022-02-20 21:10:51,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 21:10:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:51,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {5840#true} ~cond := #in~cond; {5840#true} is VALID [2022-02-20 21:10:51,370 INFO L290 TraceCheckUtils]: 1: Hoare triple {5840#true} assume !(0 == ~cond % 256); {5840#true} is VALID [2022-02-20 21:10:51,370 INFO L290 TraceCheckUtils]: 2: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,370 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5840#true} {5841#false} #216#return; {5841#false} is VALID [2022-02-20 21:10:51,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 21:10:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:51,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {5840#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {5840#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {5840#true} #t~short316 := #t~short313; {5840#true} is VALID [2022-02-20 21:10:51,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {5840#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {5840#true} is VALID [2022-02-20 21:10:51,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {5840#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {5840#true} is VALID [2022-02-20 21:10:51,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,391 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5840#true} {5841#false} #188#return; {5841#false} is VALID [2022-02-20 21:10:51,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-20 21:10:51,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:51,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {5840#true} ~cond := #in~cond; {5840#true} is VALID [2022-02-20 21:10:51,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {5840#true} assume !(0 == ~cond % 256); {5840#true} is VALID [2022-02-20 21:10:51,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5840#true} {5841#false} #190#return; {5841#false} is VALID [2022-02-20 21:10:51,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 21:10:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:51,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {5840#true} ~cond := #in~cond; {5840#true} is VALID [2022-02-20 21:10:51,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {5840#true} assume !(0 == ~cond % 256); {5840#true} is VALID [2022-02-20 21:10:51,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5840#true} {5841#false} #192#return; {5841#false} is VALID [2022-02-20 21:10:51,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-02-20 21:10:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:51,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {5840#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {5840#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {5840#true} #t~short316 := #t~short313; {5840#true} is VALID [2022-02-20 21:10:51,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {5840#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {5840#true} is VALID [2022-02-20 21:10:51,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {5840#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {5840#true} is VALID [2022-02-20 21:10:51,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,414 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5840#true} {5841#false} #194#return; {5841#false} is VALID [2022-02-20 21:10:51,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {5840#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(36, 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; {5840#true} is VALID [2022-02-20 21:10:51,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {5840#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {5840#true} is VALID [2022-02-20 21:10:51,415 INFO L272 TraceCheckUtils]: 2: Hoare triple {5840#true} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {5840#true} is VALID [2022-02-20 21:10:51,415 INFO L290 TraceCheckUtils]: 3: Hoare triple {5840#true} #res := #t~nondet13;havoc #t~nondet13; {5840#true} is VALID [2022-02-20 21:10:51,415 INFO L290 TraceCheckUtils]: 4: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,415 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5840#true} {5840#true} #208#return; {5840#true} is VALID [2022-02-20 21:10:51,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {5840#true} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {5840#true} is VALID [2022-02-20 21:10:51,415 INFO L272 TraceCheckUtils]: 7: Hoare triple {5840#true} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {5840#true} is VALID [2022-02-20 21:10:51,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {5840#true} ~cond := #in~cond; {5840#true} is VALID [2022-02-20 21:10:51,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {5840#true} assume !(0 == ~cond % 256); {5840#true} is VALID [2022-02-20 21:10:51,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,416 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5840#true} {5840#true} #210#return; {5840#true} is VALID [2022-02-20 21:10:51,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {5840#true} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {5840#true} is VALID [2022-02-20 21:10:51,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {5840#true} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {5840#true} is VALID [2022-02-20 21:10:51,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {5840#true} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {5840#true} is VALID [2022-02-20 21:10:51,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {5840#true} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {5840#true} is VALID [2022-02-20 21:10:51,417 INFO L272 TraceCheckUtils]: 16: Hoare triple {5840#true} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {5840#true} is VALID [2022-02-20 21:10:51,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {5840#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {5840#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {5840#true} #t~short301#1 := #t~short299#1; {5840#true} is VALID [2022-02-20 21:10:51,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {5840#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {5840#true} is VALID [2022-02-20 21:10:51,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {5840#true} #t~short303#1 := #t~short301#1; {5840#true} is VALID [2022-02-20 21:10:51,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {5840#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {5840#true} #t~short305#1 := #t~short303#1; {5840#true} is VALID [2022-02-20 21:10:51,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {5840#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {5840#true} is VALID [2022-02-20 21:10:51,418 INFO L290 TraceCheckUtils]: 25: Hoare triple {5840#true} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {5840#true} is VALID [2022-02-20 21:10:51,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {5840#true} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {5840#true} is VALID [2022-02-20 21:10:51,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {5840#true} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {5840#true} is VALID [2022-02-20 21:10:51,418 INFO L290 TraceCheckUtils]: 28: Hoare triple {5840#true} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset); {5840#true} is VALID [2022-02-20 21:10:51,418 INFO L272 TraceCheckUtils]: 29: Hoare triple {5840#true} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {5840#true} is VALID [2022-02-20 21:10:51,418 INFO L290 TraceCheckUtils]: 30: Hoare triple {5840#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,418 INFO L290 TraceCheckUtils]: 31: Hoare triple {5840#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,419 INFO L290 TraceCheckUtils]: 32: Hoare triple {5840#true} #t~short311 := #t~short308; {5840#true} is VALID [2022-02-20 21:10:51,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {5840#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {5840#true} is VALID [2022-02-20 21:10:51,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {5840#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {5840#true} is VALID [2022-02-20 21:10:51,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,419 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5840#true} {5840#true} #242#return; {5840#true} is VALID [2022-02-20 21:10:51,420 INFO L290 TraceCheckUtils]: 37: Hoare triple {5840#true} assume 0 == aws_linked_list_is_valid_deep_#t~ret317#1 % 256;havoc aws_linked_list_is_valid_deep_#t~ret317#1;aws_linked_list_is_valid_deep_#res#1 := 0; {5911#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1| 0)} is VALID [2022-02-20 21:10:51,420 INFO L290 TraceCheckUtils]: 38: Hoare triple {5911#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1| 0)} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {5912#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:51,420 INFO L290 TraceCheckUtils]: 39: Hoare triple {5912#(= 0 |aws_linked_list_is_valid_#res#1|)} assume true; {5912#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:51,421 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5912#(= 0 |aws_linked_list_is_valid_#res#1|)} {5840#true} #212#return; {5873#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0)} is VALID [2022-02-20 21:10:51,421 INFO L272 TraceCheckUtils]: 41: Hoare triple {5873#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0)} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {5840#true} is VALID [2022-02-20 21:10:51,422 INFO L290 TraceCheckUtils]: 42: Hoare triple {5840#true} ~cond := #in~cond; {5913#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:10:51,422 INFO L290 TraceCheckUtils]: 43: Hoare triple {5913#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {5914#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:51,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {5914#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} assume true; {5914#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:51,423 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5914#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} {5873#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0)} #214#return; {5841#false} is VALID [2022-02-20 21:10:51,423 INFO L290 TraceCheckUtils]: 46: Hoare triple {5841#false} havoc aws_linked_list_push_back_#t~ret386#1; {5841#false} is VALID [2022-02-20 21:10:51,423 INFO L272 TraceCheckUtils]: 47: Hoare triple {5841#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {5840#true} is VALID [2022-02-20 21:10:51,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {5840#true} ~cond := #in~cond; {5840#true} is VALID [2022-02-20 21:10:51,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {5840#true} assume !(0 == ~cond % 256); {5840#true} is VALID [2022-02-20 21:10:51,424 INFO L290 TraceCheckUtils]: 50: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,424 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5840#true} {5841#false} #216#return; {5841#false} is VALID [2022-02-20 21:10:51,424 INFO L272 TraceCheckUtils]: 52: Hoare triple {5841#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {5841#false} is VALID [2022-02-20 21:10:51,424 INFO L290 TraceCheckUtils]: 53: Hoare triple {5841#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {5841#false} is VALID [2022-02-20 21:10:51,424 INFO L272 TraceCheckUtils]: 54: Hoare triple {5841#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {5840#true} is VALID [2022-02-20 21:10:51,424 INFO L290 TraceCheckUtils]: 55: Hoare triple {5840#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,425 INFO L290 TraceCheckUtils]: 56: Hoare triple {5840#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,425 INFO L290 TraceCheckUtils]: 57: Hoare triple {5840#true} #t~short316 := #t~short313; {5840#true} is VALID [2022-02-20 21:10:51,425 INFO L290 TraceCheckUtils]: 58: Hoare triple {5840#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {5840#true} is VALID [2022-02-20 21:10:51,425 INFO L290 TraceCheckUtils]: 59: Hoare triple {5840#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {5840#true} is VALID [2022-02-20 21:10:51,425 INFO L290 TraceCheckUtils]: 60: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,425 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5840#true} {5841#false} #188#return; {5841#false} is VALID [2022-02-20 21:10:51,425 INFO L272 TraceCheckUtils]: 62: Hoare triple {5841#false} call assume_abort_if_not(#t~ret370); {5840#true} is VALID [2022-02-20 21:10:51,426 INFO L290 TraceCheckUtils]: 63: Hoare triple {5840#true} ~cond := #in~cond; {5840#true} is VALID [2022-02-20 21:10:51,426 INFO L290 TraceCheckUtils]: 64: Hoare triple {5840#true} assume !(0 == ~cond % 256); {5840#true} is VALID [2022-02-20 21:10:51,426 INFO L290 TraceCheckUtils]: 65: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,426 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5840#true} {5841#false} #190#return; {5841#false} is VALID [2022-02-20 21:10:51,426 INFO L290 TraceCheckUtils]: 67: Hoare triple {5841#false} havoc #t~ret370; {5841#false} is VALID [2022-02-20 21:10:51,426 INFO L272 TraceCheckUtils]: 68: Hoare triple {5841#false} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {5840#true} is VALID [2022-02-20 21:10:51,426 INFO L290 TraceCheckUtils]: 69: Hoare triple {5840#true} ~cond := #in~cond; {5840#true} is VALID [2022-02-20 21:10:51,426 INFO L290 TraceCheckUtils]: 70: Hoare triple {5840#true} assume !(0 == ~cond % 256); {5840#true} is VALID [2022-02-20 21:10:51,427 INFO L290 TraceCheckUtils]: 71: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,427 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {5840#true} {5841#false} #192#return; {5841#false} is VALID [2022-02-20 21:10:51,427 INFO L290 TraceCheckUtils]: 73: Hoare triple {5841#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {5841#false} is VALID [2022-02-20 21:10:51,427 INFO L272 TraceCheckUtils]: 74: Hoare triple {5841#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {5840#true} is VALID [2022-02-20 21:10:51,427 INFO L290 TraceCheckUtils]: 75: Hoare triple {5840#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,427 INFO L290 TraceCheckUtils]: 76: Hoare triple {5840#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {5840#true} is VALID [2022-02-20 21:10:51,427 INFO L290 TraceCheckUtils]: 77: Hoare triple {5840#true} #t~short316 := #t~short313; {5840#true} is VALID [2022-02-20 21:10:51,427 INFO L290 TraceCheckUtils]: 78: Hoare triple {5840#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {5840#true} is VALID [2022-02-20 21:10:51,428 INFO L290 TraceCheckUtils]: 79: Hoare triple {5840#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {5840#true} is VALID [2022-02-20 21:10:51,428 INFO L290 TraceCheckUtils]: 80: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:51,428 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {5840#true} {5841#false} #194#return; {5841#false} is VALID [2022-02-20 21:10:51,428 INFO L272 TraceCheckUtils]: 82: Hoare triple {5841#false} call __VERIFIER_assert(#t~ret373); {5841#false} is VALID [2022-02-20 21:10:51,428 INFO L290 TraceCheckUtils]: 83: Hoare triple {5841#false} ~cond := #in~cond; {5841#false} is VALID [2022-02-20 21:10:51,428 INFO L290 TraceCheckUtils]: 84: Hoare triple {5841#false} assume 0 == ~cond % 256; {5841#false} is VALID [2022-02-20 21:10:51,428 INFO L290 TraceCheckUtils]: 85: Hoare triple {5841#false} assume !false; {5841#false} is VALID [2022-02-20 21:10:51,429 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-02-20 21:10:51,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:51,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416444375] [2022-02-20 21:10:51,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416444375] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:10:51,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243967183] [2022-02-20 21:10:51,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:51,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:51,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:10:51,431 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:10:51,433 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:10:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:51,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 21:10:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:51,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:10:52,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {5840#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(36, 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; {5918#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 21:10:52,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {5918#(< 0 |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:52,033 INFO L272 TraceCheckUtils]: 2: Hoare triple {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {5840#true} is VALID [2022-02-20 21:10:52,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {5840#true} #res := #t~nondet13;havoc #t~nondet13; {5840#true} is VALID [2022-02-20 21:10:52,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:52,033 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5840#true} {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} #208#return; {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:52,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:52,034 INFO L272 TraceCheckUtils]: 7: Hoare triple {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {5840#true} is VALID [2022-02-20 21:10:52,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {5840#true} ~cond := #in~cond; {5840#true} is VALID [2022-02-20 21:10:52,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {5840#true} assume !(0 == ~cond % 256); {5840#true} is VALID [2022-02-20 21:10:52,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:52,034 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5840#true} {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} #210#return; {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:52,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:52,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:52,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:52,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {5922#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {5965#(< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|)} is VALID [2022-02-20 21:10:52,036 INFO L272 TraceCheckUtils]: 16: Hoare triple {5965#(< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|)} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {5840#true} is VALID [2022-02-20 21:10:52,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {5840#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {5840#true} is VALID [2022-02-20 21:10:52,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {5840#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {5840#true} is VALID [2022-02-20 21:10:52,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {5840#true} #t~short301#1 := #t~short299#1; {5840#true} is VALID [2022-02-20 21:10:52,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {5840#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {5840#true} is VALID [2022-02-20 21:10:52,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {5840#true} #t~short303#1 := #t~short301#1; {5840#true} is VALID [2022-02-20 21:10:52,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {5840#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {5840#true} is VALID [2022-02-20 21:10:52,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {5840#true} #t~short305#1 := #t~short303#1; {5840#true} is VALID [2022-02-20 21:10:52,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {5840#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {5840#true} is VALID [2022-02-20 21:10:52,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {5840#true} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {5840#true} is VALID [2022-02-20 21:10:52,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {5840#true} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {5840#true} is VALID [2022-02-20 21:10:52,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {5840#true} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {5840#true} is VALID [2022-02-20 21:10:52,037 INFO L290 TraceCheckUtils]: 28: Hoare triple {5840#true} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset); {5840#true} is VALID [2022-02-20 21:10:52,038 INFO L272 TraceCheckUtils]: 29: Hoare triple {5840#true} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {5840#true} is VALID [2022-02-20 21:10:52,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {5840#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {5840#true} is VALID [2022-02-20 21:10:52,038 INFO L290 TraceCheckUtils]: 31: Hoare triple {5840#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {5840#true} is VALID [2022-02-20 21:10:52,038 INFO L290 TraceCheckUtils]: 32: Hoare triple {5840#true} #t~short311 := #t~short308; {5840#true} is VALID [2022-02-20 21:10:52,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {5840#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {5840#true} is VALID [2022-02-20 21:10:52,038 INFO L290 TraceCheckUtils]: 34: Hoare triple {5840#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {5840#true} is VALID [2022-02-20 21:10:52,038 INFO L290 TraceCheckUtils]: 35: Hoare triple {5840#true} assume true; {5840#true} is VALID [2022-02-20 21:10:52,038 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5840#true} {5840#true} #242#return; {5840#true} is VALID [2022-02-20 21:10:52,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {5840#true} assume 0 == aws_linked_list_is_valid_deep_#t~ret317#1 % 256;havoc aws_linked_list_is_valid_deep_#t~ret317#1;aws_linked_list_is_valid_deep_#res#1 := 0; {5911#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1| 0)} is VALID [2022-02-20 21:10:52,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {5911#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1| 0)} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {5912#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:52,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {5912#(= 0 |aws_linked_list_is_valid_#res#1|)} assume true; {5912#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:52,040 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5912#(= 0 |aws_linked_list_is_valid_#res#1|)} {5965#(< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|)} #212#return; {6041#(and (= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0) (< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|))} is VALID [2022-02-20 21:10:52,040 INFO L272 TraceCheckUtils]: 41: Hoare triple {6041#(and (= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0) (< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|))} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {5840#true} is VALID [2022-02-20 21:10:52,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {5840#true} ~cond := #in~cond; {5913#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:10:52,041 INFO L290 TraceCheckUtils]: 43: Hoare triple {5913#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {6051#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} is VALID [2022-02-20 21:10:52,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {6051#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} assume true; {6051#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} is VALID [2022-02-20 21:10:52,042 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6051#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} {6041#(and (= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0) (< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|))} #214#return; {5841#false} is VALID [2022-02-20 21:10:52,042 INFO L290 TraceCheckUtils]: 46: Hoare triple {5841#false} havoc aws_linked_list_push_back_#t~ret386#1; {5841#false} is VALID [2022-02-20 21:10:52,042 INFO L272 TraceCheckUtils]: 47: Hoare triple {5841#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {5841#false} is VALID [2022-02-20 21:10:52,042 INFO L290 TraceCheckUtils]: 48: Hoare triple {5841#false} ~cond := #in~cond; {5841#false} is VALID [2022-02-20 21:10:52,042 INFO L290 TraceCheckUtils]: 49: Hoare triple {5841#false} assume !(0 == ~cond % 256); {5841#false} is VALID [2022-02-20 21:10:52,042 INFO L290 TraceCheckUtils]: 50: Hoare triple {5841#false} assume true; {5841#false} is VALID [2022-02-20 21:10:52,042 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5841#false} {5841#false} #216#return; {5841#false} is VALID [2022-02-20 21:10:52,042 INFO L272 TraceCheckUtils]: 52: Hoare triple {5841#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {5841#false} is VALID [2022-02-20 21:10:52,043 INFO L290 TraceCheckUtils]: 53: Hoare triple {5841#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {5841#false} is VALID [2022-02-20 21:10:52,043 INFO L272 TraceCheckUtils]: 54: Hoare triple {5841#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {5841#false} is VALID [2022-02-20 21:10:52,043 INFO L290 TraceCheckUtils]: 55: Hoare triple {5841#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {5841#false} is VALID [2022-02-20 21:10:52,043 INFO L290 TraceCheckUtils]: 56: Hoare triple {5841#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {5841#false} is VALID [2022-02-20 21:10:52,043 INFO L290 TraceCheckUtils]: 57: Hoare triple {5841#false} #t~short316 := #t~short313; {5841#false} is VALID [2022-02-20 21:10:52,043 INFO L290 TraceCheckUtils]: 58: Hoare triple {5841#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {5841#false} is VALID [2022-02-20 21:10:52,043 INFO L290 TraceCheckUtils]: 59: Hoare triple {5841#false} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {5841#false} is VALID [2022-02-20 21:10:52,043 INFO L290 TraceCheckUtils]: 60: Hoare triple {5841#false} assume true; {5841#false} is VALID [2022-02-20 21:10:52,043 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5841#false} {5841#false} #188#return; {5841#false} is VALID [2022-02-20 21:10:52,044 INFO L272 TraceCheckUtils]: 62: Hoare triple {5841#false} call assume_abort_if_not(#t~ret370); {5841#false} is VALID [2022-02-20 21:10:52,044 INFO L290 TraceCheckUtils]: 63: Hoare triple {5841#false} ~cond := #in~cond; {5841#false} is VALID [2022-02-20 21:10:52,044 INFO L290 TraceCheckUtils]: 64: Hoare triple {5841#false} assume !(0 == ~cond % 256); {5841#false} is VALID [2022-02-20 21:10:52,044 INFO L290 TraceCheckUtils]: 65: Hoare triple {5841#false} assume true; {5841#false} is VALID [2022-02-20 21:10:52,044 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5841#false} {5841#false} #190#return; {5841#false} is VALID [2022-02-20 21:10:52,044 INFO L290 TraceCheckUtils]: 67: Hoare triple {5841#false} havoc #t~ret370; {5841#false} is VALID [2022-02-20 21:10:52,044 INFO L272 TraceCheckUtils]: 68: Hoare triple {5841#false} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {5841#false} is VALID [2022-02-20 21:10:52,044 INFO L290 TraceCheckUtils]: 69: Hoare triple {5841#false} ~cond := #in~cond; {5841#false} is VALID [2022-02-20 21:10:52,044 INFO L290 TraceCheckUtils]: 70: Hoare triple {5841#false} assume !(0 == ~cond % 256); {5841#false} is VALID [2022-02-20 21:10:52,045 INFO L290 TraceCheckUtils]: 71: Hoare triple {5841#false} assume true; {5841#false} is VALID [2022-02-20 21:10:52,045 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {5841#false} {5841#false} #192#return; {5841#false} is VALID [2022-02-20 21:10:52,045 INFO L290 TraceCheckUtils]: 73: Hoare triple {5841#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {5841#false} is VALID [2022-02-20 21:10:52,045 INFO L272 TraceCheckUtils]: 74: Hoare triple {5841#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {5841#false} is VALID [2022-02-20 21:10:52,045 INFO L290 TraceCheckUtils]: 75: Hoare triple {5841#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {5841#false} is VALID [2022-02-20 21:10:52,045 INFO L290 TraceCheckUtils]: 76: Hoare triple {5841#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {5841#false} is VALID [2022-02-20 21:10:52,045 INFO L290 TraceCheckUtils]: 77: Hoare triple {5841#false} #t~short316 := #t~short313; {5841#false} is VALID [2022-02-20 21:10:52,045 INFO L290 TraceCheckUtils]: 78: Hoare triple {5841#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {5841#false} is VALID [2022-02-20 21:10:52,045 INFO L290 TraceCheckUtils]: 79: Hoare triple {5841#false} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {5841#false} is VALID [2022-02-20 21:10:52,045 INFO L290 TraceCheckUtils]: 80: Hoare triple {5841#false} assume true; {5841#false} is VALID [2022-02-20 21:10:52,046 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {5841#false} {5841#false} #194#return; {5841#false} is VALID [2022-02-20 21:10:52,046 INFO L272 TraceCheckUtils]: 82: Hoare triple {5841#false} call __VERIFIER_assert(#t~ret373); {5841#false} is VALID [2022-02-20 21:10:52,046 INFO L290 TraceCheckUtils]: 83: Hoare triple {5841#false} ~cond := #in~cond; {5841#false} is VALID [2022-02-20 21:10:52,046 INFO L290 TraceCheckUtils]: 84: Hoare triple {5841#false} assume 0 == ~cond % 256; {5841#false} is VALID [2022-02-20 21:10:52,046 INFO L290 TraceCheckUtils]: 85: Hoare triple {5841#false} assume !false; {5841#false} is VALID [2022-02-20 21:10:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 21:10:52,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:10:52,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243967183] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:52,047 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 21:10:52,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 12 [2022-02-20 21:10:52,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456494210] [2022-02-20 21:10:52,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:52,048 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 86 [2022-02-20 21:10:52,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:52,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:10:52,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:52,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 21:10:52,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:52,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 21:10:52,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 21:10:52,100 INFO L87 Difference]: Start difference. First operand 106 states and 139 transitions. Second operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:10:53,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:53,045 INFO L93 Difference]: Finished difference Result 203 states and 268 transitions. [2022-02-20 21:10:53,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 21:10:53,045 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 86 [2022-02-20 21:10:53,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:10:53,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 251 transitions. [2022-02-20 21:10:53,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:10:53,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 251 transitions. [2022-02-20 21:10:53,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 251 transitions. [2022-02-20 21:10:53,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:53,231 INFO L225 Difference]: With dead ends: 203 [2022-02-20 21:10:53,231 INFO L226 Difference]: Without dead ends: 111 [2022-02-20 21:10:53,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-02-20 21:10:53,232 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 132 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:53,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 709 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 21:10:53,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-20 21:10:53,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2022-02-20 21:10:53,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:53,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 107 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 72 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:53,268 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 107 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 72 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:53,269 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 107 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 72 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:53,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:53,271 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2022-02-20 21:10:53,271 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 145 transitions. [2022-02-20 21:10:53,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:53,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:53,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 72 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 111 states. [2022-02-20 21:10:53,272 INFO L87 Difference]: Start difference. First operand has 107 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 72 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 111 states. [2022-02-20 21:10:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:53,274 INFO L93 Difference]: Finished difference Result 111 states and 145 transitions. [2022-02-20 21:10:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 145 transitions. [2022-02-20 21:10:53,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:53,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:53,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:53,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:53,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 72 states have internal predecessors, (83), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 140 transitions. [2022-02-20 21:10:53,277 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 140 transitions. Word has length 86 [2022-02-20 21:10:53,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:53,277 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 140 transitions. [2022-02-20 21:10:53,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.5) internal successors, (52), 9 states have internal predecessors, (52), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:10:53,278 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 140 transitions. [2022-02-20 21:10:53,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-20 21:10:53,278 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:53,278 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:53,317 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:53,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-02-20 21:10:53,497 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:53,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:53,498 INFO L85 PathProgramCache]: Analyzing trace with hash 172862485, now seen corresponding path program 1 times [2022-02-20 21:10:53,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:53,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794924238] [2022-02-20 21:10:53,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:53,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:53,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:10:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:53,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {6842#true} #res := #t~nondet13;havoc #t~nondet13; {6842#true} is VALID [2022-02-20 21:10:53,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,567 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6842#true} {6842#true} #208#return; {6842#true} is VALID [2022-02-20 21:10:53,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:10:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:53,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {6842#true} ~cond := #in~cond; {6842#true} is VALID [2022-02-20 21:10:53,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {6842#true} assume !(0 == ~cond % 256); {6842#true} is VALID [2022-02-20 21:10:53,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6842#true} {6842#true} #210#return; {6842#true} is VALID [2022-02-20 21:10:53,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:53,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 21:10:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:53,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {6842#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {6842#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {6842#true} #t~short311 := #t~short308; {6842#true} is VALID [2022-02-20 21:10:53,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {6842#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {6842#true} is VALID [2022-02-20 21:10:53,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {6842#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {6842#true} is VALID [2022-02-20 21:10:53,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,662 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6842#true} {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} #242#return; {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {6842#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {6842#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {6907#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not |aws_linked_list_is_valid_#t~short299#1|) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {6907#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not |aws_linked_list_is_valid_#t~short299#1|) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} #t~short301#1 := #t~short299#1; {6908#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not |aws_linked_list_is_valid_#t~short301#1|))} is VALID [2022-02-20 21:10:53,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {6908#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not |aws_linked_list_is_valid_#t~short301#1|))} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,664 INFO L290 TraceCheckUtils]: 4: Hoare triple {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} #t~short303#1 := #t~short301#1; {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} #t~short305#1 := #t~short303#1; {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {6910#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {6910#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|) 0)))} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset); {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,667 INFO L272 TraceCheckUtils]: 12: Hoare triple {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {6842#true} is VALID [2022-02-20 21:10:53,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {6842#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {6842#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {6842#true} #t~short311 := #t~short308; {6842#true} is VALID [2022-02-20 21:10:53,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {6842#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {6842#true} is VALID [2022-02-20 21:10:53,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {6842#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {6842#true} is VALID [2022-02-20 21:10:53,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,669 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6842#true} {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} #242#return; {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} assume !(0 == aws_linked_list_is_valid_deep_#t~ret317#1 % 256);havoc aws_linked_list_is_valid_deep_#t~ret317#1;call aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset := read~$Pointer$(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, 8);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset;havoc aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset; {6919#(or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| 0)) (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base| 0)))} is VALID [2022-02-20 21:10:53,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {6919#(or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| 0)) (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base| 0)))} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {6843#false} is VALID [2022-02-20 21:10:53,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {6843#false} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {6843#false} is VALID [2022-02-20 21:10:53,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {6843#false} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {6843#false} is VALID [2022-02-20 21:10:53,670 INFO L290 TraceCheckUtils]: 24: Hoare triple {6843#false} assume true; {6843#false} is VALID [2022-02-20 21:10:53,670 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6843#false} {6842#true} #212#return; {6843#false} is VALID [2022-02-20 21:10:53,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-20 21:10:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:53,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {6842#true} ~cond := #in~cond; {6842#true} is VALID [2022-02-20 21:10:53,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {6842#true} assume !(0 == ~cond % 256); {6842#true} is VALID [2022-02-20 21:10:53,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6842#true} {6843#false} #214#return; {6843#false} is VALID [2022-02-20 21:10:53,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 21:10:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:53,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {6842#true} ~cond := #in~cond; {6842#true} is VALID [2022-02-20 21:10:53,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {6842#true} assume !(0 == ~cond % 256); {6842#true} is VALID [2022-02-20 21:10:53,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6842#true} {6843#false} #216#return; {6843#false} is VALID [2022-02-20 21:10:53,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-20 21:10:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:53,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {6842#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {6842#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {6842#true} #t~short316 := #t~short313; {6842#true} is VALID [2022-02-20 21:10:53,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {6842#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {6842#true} is VALID [2022-02-20 21:10:53,714 INFO L290 TraceCheckUtils]: 4: Hoare triple {6842#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {6842#true} is VALID [2022-02-20 21:10:53,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,714 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6842#true} {6843#false} #188#return; {6843#false} is VALID [2022-02-20 21:10:53,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-02-20 21:10:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:53,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {6842#true} ~cond := #in~cond; {6842#true} is VALID [2022-02-20 21:10:53,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {6842#true} assume !(0 == ~cond % 256); {6842#true} is VALID [2022-02-20 21:10:53,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6842#true} {6843#false} #190#return; {6843#false} is VALID [2022-02-20 21:10:53,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-02-20 21:10:53,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:53,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {6842#true} ~cond := #in~cond; {6842#true} is VALID [2022-02-20 21:10:53,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {6842#true} assume !(0 == ~cond % 256); {6842#true} is VALID [2022-02-20 21:10:53,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6842#true} {6843#false} #192#return; {6843#false} is VALID [2022-02-20 21:10:53,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-02-20 21:10:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:53,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {6842#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {6842#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {6842#true} #t~short316 := #t~short313; {6842#true} is VALID [2022-02-20 21:10:53,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {6842#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {6842#true} is VALID [2022-02-20 21:10:53,748 INFO L290 TraceCheckUtils]: 4: Hoare triple {6842#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {6842#true} is VALID [2022-02-20 21:10:53,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,748 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6842#true} {6843#false} #194#return; {6843#false} is VALID [2022-02-20 21:10:53,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {6842#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(36, 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; {6842#true} is VALID [2022-02-20 21:10:53,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {6842#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {6842#true} is VALID [2022-02-20 21:10:53,748 INFO L272 TraceCheckUtils]: 2: Hoare triple {6842#true} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {6842#true} is VALID [2022-02-20 21:10:53,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {6842#true} #res := #t~nondet13;havoc #t~nondet13; {6842#true} is VALID [2022-02-20 21:10:53,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,749 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6842#true} {6842#true} #208#return; {6842#true} is VALID [2022-02-20 21:10:53,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {6842#true} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {6842#true} is VALID [2022-02-20 21:10:53,749 INFO L272 TraceCheckUtils]: 7: Hoare triple {6842#true} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {6842#true} is VALID [2022-02-20 21:10:53,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {6842#true} ~cond := #in~cond; {6842#true} is VALID [2022-02-20 21:10:53,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {6842#true} assume !(0 == ~cond % 256); {6842#true} is VALID [2022-02-20 21:10:53,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,749 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6842#true} {6842#true} #210#return; {6842#true} is VALID [2022-02-20 21:10:53,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {6842#true} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {6842#true} is VALID [2022-02-20 21:10:53,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {6842#true} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {6842#true} is VALID [2022-02-20 21:10:53,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {6842#true} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {6842#true} is VALID [2022-02-20 21:10:53,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {6842#true} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {6842#true} is VALID [2022-02-20 21:10:53,750 INFO L272 TraceCheckUtils]: 16: Hoare triple {6842#true} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {6842#true} is VALID [2022-02-20 21:10:53,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {6842#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {6842#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {6907#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not |aws_linked_list_is_valid_#t~short299#1|) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {6907#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not |aws_linked_list_is_valid_#t~short299#1|) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} #t~short301#1 := #t~short299#1; {6908#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not |aws_linked_list_is_valid_#t~short301#1|))} is VALID [2022-02-20 21:10:53,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {6908#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not |aws_linked_list_is_valid_#t~short301#1|))} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} #t~short303#1 := #t~short301#1; {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} #t~short305#1 := #t~short303#1; {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {6909#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) 0)))} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {6910#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {6910#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|) 0)))} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset); {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,755 INFO L272 TraceCheckUtils]: 29: Hoare triple {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {6842#true} is VALID [2022-02-20 21:10:53,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {6842#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,755 INFO L290 TraceCheckUtils]: 31: Hoare triple {6842#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {6842#true} #t~short311 := #t~short308; {6842#true} is VALID [2022-02-20 21:10:53,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {6842#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {6842#true} is VALID [2022-02-20 21:10:53,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {6842#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {6842#true} is VALID [2022-02-20 21:10:53,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,756 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6842#true} {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} #242#return; {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} is VALID [2022-02-20 21:10:53,756 INFO L290 TraceCheckUtils]: 37: Hoare triple {6911#(or (not (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|) 0)))} assume !(0 == aws_linked_list_is_valid_deep_#t~ret317#1 % 256);havoc aws_linked_list_is_valid_deep_#t~ret317#1;call aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset := read~$Pointer$(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, 8);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset;havoc aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset; {6919#(or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| 0)) (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base| 0)))} is VALID [2022-02-20 21:10:53,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {6919#(or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| 0)) (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base| 0)))} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {6843#false} is VALID [2022-02-20 21:10:53,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {6843#false} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {6843#false} is VALID [2022-02-20 21:10:53,757 INFO L290 TraceCheckUtils]: 40: Hoare triple {6843#false} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {6843#false} is VALID [2022-02-20 21:10:53,757 INFO L290 TraceCheckUtils]: 41: Hoare triple {6843#false} assume true; {6843#false} is VALID [2022-02-20 21:10:53,757 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6843#false} {6842#true} #212#return; {6843#false} is VALID [2022-02-20 21:10:53,757 INFO L272 TraceCheckUtils]: 43: Hoare triple {6843#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {6842#true} is VALID [2022-02-20 21:10:53,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {6842#true} ~cond := #in~cond; {6842#true} is VALID [2022-02-20 21:10:53,769 INFO L290 TraceCheckUtils]: 45: Hoare triple {6842#true} assume !(0 == ~cond % 256); {6842#true} is VALID [2022-02-20 21:10:53,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,770 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6842#true} {6843#false} #214#return; {6843#false} is VALID [2022-02-20 21:10:53,770 INFO L290 TraceCheckUtils]: 48: Hoare triple {6843#false} havoc aws_linked_list_push_back_#t~ret386#1; {6843#false} is VALID [2022-02-20 21:10:53,770 INFO L272 TraceCheckUtils]: 49: Hoare triple {6843#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {6842#true} is VALID [2022-02-20 21:10:53,770 INFO L290 TraceCheckUtils]: 50: Hoare triple {6842#true} ~cond := #in~cond; {6842#true} is VALID [2022-02-20 21:10:53,770 INFO L290 TraceCheckUtils]: 51: Hoare triple {6842#true} assume !(0 == ~cond % 256); {6842#true} is VALID [2022-02-20 21:10:53,770 INFO L290 TraceCheckUtils]: 52: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,771 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6842#true} {6843#false} #216#return; {6843#false} is VALID [2022-02-20 21:10:53,771 INFO L272 TraceCheckUtils]: 54: Hoare triple {6843#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {6843#false} is VALID [2022-02-20 21:10:53,771 INFO L290 TraceCheckUtils]: 55: Hoare triple {6843#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {6843#false} is VALID [2022-02-20 21:10:53,771 INFO L272 TraceCheckUtils]: 56: Hoare triple {6843#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {6842#true} is VALID [2022-02-20 21:10:53,771 INFO L290 TraceCheckUtils]: 57: Hoare triple {6842#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,771 INFO L290 TraceCheckUtils]: 58: Hoare triple {6842#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,771 INFO L290 TraceCheckUtils]: 59: Hoare triple {6842#true} #t~short316 := #t~short313; {6842#true} is VALID [2022-02-20 21:10:53,771 INFO L290 TraceCheckUtils]: 60: Hoare triple {6842#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {6842#true} is VALID [2022-02-20 21:10:53,771 INFO L290 TraceCheckUtils]: 61: Hoare triple {6842#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {6842#true} is VALID [2022-02-20 21:10:53,771 INFO L290 TraceCheckUtils]: 62: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,772 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6842#true} {6843#false} #188#return; {6843#false} is VALID [2022-02-20 21:10:53,772 INFO L272 TraceCheckUtils]: 64: Hoare triple {6843#false} call assume_abort_if_not(#t~ret370); {6842#true} is VALID [2022-02-20 21:10:53,772 INFO L290 TraceCheckUtils]: 65: Hoare triple {6842#true} ~cond := #in~cond; {6842#true} is VALID [2022-02-20 21:10:53,772 INFO L290 TraceCheckUtils]: 66: Hoare triple {6842#true} assume !(0 == ~cond % 256); {6842#true} is VALID [2022-02-20 21:10:53,772 INFO L290 TraceCheckUtils]: 67: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,772 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6842#true} {6843#false} #190#return; {6843#false} is VALID [2022-02-20 21:10:53,772 INFO L290 TraceCheckUtils]: 69: Hoare triple {6843#false} havoc #t~ret370; {6843#false} is VALID [2022-02-20 21:10:53,772 INFO L272 TraceCheckUtils]: 70: Hoare triple {6843#false} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {6842#true} is VALID [2022-02-20 21:10:53,772 INFO L290 TraceCheckUtils]: 71: Hoare triple {6842#true} ~cond := #in~cond; {6842#true} is VALID [2022-02-20 21:10:53,772 INFO L290 TraceCheckUtils]: 72: Hoare triple {6842#true} assume !(0 == ~cond % 256); {6842#true} is VALID [2022-02-20 21:10:53,773 INFO L290 TraceCheckUtils]: 73: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,773 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6842#true} {6843#false} #192#return; {6843#false} is VALID [2022-02-20 21:10:53,773 INFO L290 TraceCheckUtils]: 75: Hoare triple {6843#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {6843#false} is VALID [2022-02-20 21:10:53,773 INFO L272 TraceCheckUtils]: 76: Hoare triple {6843#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {6842#true} is VALID [2022-02-20 21:10:53,773 INFO L290 TraceCheckUtils]: 77: Hoare triple {6842#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,773 INFO L290 TraceCheckUtils]: 78: Hoare triple {6842#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {6842#true} is VALID [2022-02-20 21:10:53,773 INFO L290 TraceCheckUtils]: 79: Hoare triple {6842#true} #t~short316 := #t~short313; {6842#true} is VALID [2022-02-20 21:10:53,773 INFO L290 TraceCheckUtils]: 80: Hoare triple {6842#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {6842#true} is VALID [2022-02-20 21:10:53,773 INFO L290 TraceCheckUtils]: 81: Hoare triple {6842#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {6842#true} is VALID [2022-02-20 21:10:53,773 INFO L290 TraceCheckUtils]: 82: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:53,774 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {6842#true} {6843#false} #194#return; {6843#false} is VALID [2022-02-20 21:10:53,774 INFO L272 TraceCheckUtils]: 84: Hoare triple {6843#false} call __VERIFIER_assert(#t~ret373); {6843#false} is VALID [2022-02-20 21:10:53,774 INFO L290 TraceCheckUtils]: 85: Hoare triple {6843#false} ~cond := #in~cond; {6843#false} is VALID [2022-02-20 21:10:53,774 INFO L290 TraceCheckUtils]: 86: Hoare triple {6843#false} assume 0 == ~cond % 256; {6843#false} is VALID [2022-02-20 21:10:53,774 INFO L290 TraceCheckUtils]: 87: Hoare triple {6843#false} assume !false; {6843#false} is VALID [2022-02-20 21:10:53,774 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 21:10:53,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:53,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794924238] [2022-02-20 21:10:53,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794924238] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:10:53,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591449887] [2022-02-20 21:10:53,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:53,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:53,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:10:53,786 INFO L229 MonitoredProcess]: Starting monitored process 4 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:10:53,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 21:10:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:54,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 21:10:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:54,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:10:54,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {6842#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(36, 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; {6923#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 21:10:54,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {6923#(< 0 |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:54,394 INFO L272 TraceCheckUtils]: 2: Hoare triple {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {6842#true} is VALID [2022-02-20 21:10:54,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {6842#true} #res := #t~nondet13;havoc #t~nondet13; {6842#true} is VALID [2022-02-20 21:10:54,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:54,395 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6842#true} {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} #208#return; {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:54,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:54,395 INFO L272 TraceCheckUtils]: 7: Hoare triple {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {6842#true} is VALID [2022-02-20 21:10:54,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {6842#true} ~cond := #in~cond; {6842#true} is VALID [2022-02-20 21:10:54,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {6842#true} assume !(0 == ~cond % 256); {6842#true} is VALID [2022-02-20 21:10:54,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:54,396 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6842#true} {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} #210#return; {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:54,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:54,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:54,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:54,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {6927#(< 1 |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base|)} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {6970#(< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|)} is VALID [2022-02-20 21:10:54,398 INFO L272 TraceCheckUtils]: 16: Hoare triple {6970#(< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|)} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {6842#true} is VALID [2022-02-20 21:10:54,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {6842#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {6842#true} is VALID [2022-02-20 21:10:54,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {6842#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {6842#true} is VALID [2022-02-20 21:10:54,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {6842#true} #t~short301#1 := #t~short299#1; {6842#true} is VALID [2022-02-20 21:10:54,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {6842#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {6842#true} is VALID [2022-02-20 21:10:54,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {6842#true} #t~short303#1 := #t~short301#1; {6842#true} is VALID [2022-02-20 21:10:54,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {6842#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {6842#true} is VALID [2022-02-20 21:10:54,399 INFO L290 TraceCheckUtils]: 23: Hoare triple {6842#true} #t~short305#1 := #t~short303#1; {6842#true} is VALID [2022-02-20 21:10:54,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {6842#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {6842#true} is VALID [2022-02-20 21:10:54,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {6842#true} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {6842#true} is VALID [2022-02-20 21:10:54,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {6842#true} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {7004#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1| 0)} is VALID [2022-02-20 21:10:54,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {7004#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1| 0)} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {7004#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1| 0)} is VALID [2022-02-20 21:10:54,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {7004#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1| 0)} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset); {7004#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1| 0)} is VALID [2022-02-20 21:10:54,424 INFO L272 TraceCheckUtils]: 29: Hoare triple {7004#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1| 0)} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {6842#true} is VALID [2022-02-20 21:10:54,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {6842#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {6842#true} is VALID [2022-02-20 21:10:54,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {6842#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {6842#true} is VALID [2022-02-20 21:10:54,425 INFO L290 TraceCheckUtils]: 32: Hoare triple {6842#true} #t~short311 := #t~short308; {6842#true} is VALID [2022-02-20 21:10:54,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {6842#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {6842#true} is VALID [2022-02-20 21:10:54,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {6842#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {6842#true} is VALID [2022-02-20 21:10:54,425 INFO L290 TraceCheckUtils]: 35: Hoare triple {6842#true} assume true; {6842#true} is VALID [2022-02-20 21:10:54,426 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6842#true} {7004#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1| 0)} #242#return; {7004#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1| 0)} is VALID [2022-02-20 21:10:54,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {7004#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1| 0)} assume !(0 == aws_linked_list_is_valid_deep_#t~ret317#1 % 256);havoc aws_linked_list_is_valid_deep_#t~ret317#1;call aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset := read~$Pointer$(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, 8);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset;havoc aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset; {7004#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1| 0)} is VALID [2022-02-20 21:10:54,426 INFO L290 TraceCheckUtils]: 38: Hoare triple {7004#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1| 0)} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {7004#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1| 0)} is VALID [2022-02-20 21:10:54,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {7004#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~head_reaches_tail~0#1| 0)} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {7044#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1| 0)} is VALID [2022-02-20 21:10:54,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {7044#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1| 0)} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {7048#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:54,427 INFO L290 TraceCheckUtils]: 41: Hoare triple {7048#(= 0 |aws_linked_list_is_valid_#res#1|)} assume true; {7048#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:54,428 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7048#(= 0 |aws_linked_list_is_valid_#res#1|)} {6970#(< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|)} #212#return; {7055#(and (= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0) (< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|))} is VALID [2022-02-20 21:10:54,428 INFO L272 TraceCheckUtils]: 43: Hoare triple {7055#(and (= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0) (< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|))} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {6842#true} is VALID [2022-02-20 21:10:54,428 INFO L290 TraceCheckUtils]: 44: Hoare triple {6842#true} ~cond := #in~cond; {7062#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:10:54,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {7062#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {7066#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} is VALID [2022-02-20 21:10:54,429 INFO L290 TraceCheckUtils]: 46: Hoare triple {7066#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} assume true; {7066#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} is VALID [2022-02-20 21:10:54,429 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7066#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} {7055#(and (= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| 0) (< 1 |ULTIMATE.start_aws_linked_list_push_back_~node#1.base|))} #214#return; {6843#false} is VALID [2022-02-20 21:10:54,429 INFO L290 TraceCheckUtils]: 48: Hoare triple {6843#false} havoc aws_linked_list_push_back_#t~ret386#1; {6843#false} is VALID [2022-02-20 21:10:54,429 INFO L272 TraceCheckUtils]: 49: Hoare triple {6843#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {6843#false} is VALID [2022-02-20 21:10:54,430 INFO L290 TraceCheckUtils]: 50: Hoare triple {6843#false} ~cond := #in~cond; {6843#false} is VALID [2022-02-20 21:10:54,430 INFO L290 TraceCheckUtils]: 51: Hoare triple {6843#false} assume !(0 == ~cond % 256); {6843#false} is VALID [2022-02-20 21:10:54,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {6843#false} assume true; {6843#false} is VALID [2022-02-20 21:10:54,430 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6843#false} {6843#false} #216#return; {6843#false} is VALID [2022-02-20 21:10:54,430 INFO L272 TraceCheckUtils]: 54: Hoare triple {6843#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {6843#false} is VALID [2022-02-20 21:10:54,430 INFO L290 TraceCheckUtils]: 55: Hoare triple {6843#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {6843#false} is VALID [2022-02-20 21:10:54,430 INFO L272 TraceCheckUtils]: 56: Hoare triple {6843#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {6843#false} is VALID [2022-02-20 21:10:54,430 INFO L290 TraceCheckUtils]: 57: Hoare triple {6843#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {6843#false} is VALID [2022-02-20 21:10:54,430 INFO L290 TraceCheckUtils]: 58: Hoare triple {6843#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {6843#false} is VALID [2022-02-20 21:10:54,431 INFO L290 TraceCheckUtils]: 59: Hoare triple {6843#false} #t~short316 := #t~short313; {6843#false} is VALID [2022-02-20 21:10:54,431 INFO L290 TraceCheckUtils]: 60: Hoare triple {6843#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {6843#false} is VALID [2022-02-20 21:10:54,431 INFO L290 TraceCheckUtils]: 61: Hoare triple {6843#false} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {6843#false} is VALID [2022-02-20 21:10:54,431 INFO L290 TraceCheckUtils]: 62: Hoare triple {6843#false} assume true; {6843#false} is VALID [2022-02-20 21:10:54,431 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6843#false} {6843#false} #188#return; {6843#false} is VALID [2022-02-20 21:10:54,431 INFO L272 TraceCheckUtils]: 64: Hoare triple {6843#false} call assume_abort_if_not(#t~ret370); {6843#false} is VALID [2022-02-20 21:10:54,431 INFO L290 TraceCheckUtils]: 65: Hoare triple {6843#false} ~cond := #in~cond; {6843#false} is VALID [2022-02-20 21:10:54,431 INFO L290 TraceCheckUtils]: 66: Hoare triple {6843#false} assume !(0 == ~cond % 256); {6843#false} is VALID [2022-02-20 21:10:54,431 INFO L290 TraceCheckUtils]: 67: Hoare triple {6843#false} assume true; {6843#false} is VALID [2022-02-20 21:10:54,431 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6843#false} {6843#false} #190#return; {6843#false} is VALID [2022-02-20 21:10:54,432 INFO L290 TraceCheckUtils]: 69: Hoare triple {6843#false} havoc #t~ret370; {6843#false} is VALID [2022-02-20 21:10:54,432 INFO L272 TraceCheckUtils]: 70: Hoare triple {6843#false} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {6843#false} is VALID [2022-02-20 21:10:54,432 INFO L290 TraceCheckUtils]: 71: Hoare triple {6843#false} ~cond := #in~cond; {6843#false} is VALID [2022-02-20 21:10:54,432 INFO L290 TraceCheckUtils]: 72: Hoare triple {6843#false} assume !(0 == ~cond % 256); {6843#false} is VALID [2022-02-20 21:10:54,432 INFO L290 TraceCheckUtils]: 73: Hoare triple {6843#false} assume true; {6843#false} is VALID [2022-02-20 21:10:54,432 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6843#false} {6843#false} #192#return; {6843#false} is VALID [2022-02-20 21:10:54,432 INFO L290 TraceCheckUtils]: 75: Hoare triple {6843#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {6843#false} is VALID [2022-02-20 21:10:54,432 INFO L272 TraceCheckUtils]: 76: Hoare triple {6843#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {6843#false} is VALID [2022-02-20 21:10:54,432 INFO L290 TraceCheckUtils]: 77: Hoare triple {6843#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {6843#false} is VALID [2022-02-20 21:10:54,432 INFO L290 TraceCheckUtils]: 78: Hoare triple {6843#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {6843#false} is VALID [2022-02-20 21:10:54,433 INFO L290 TraceCheckUtils]: 79: Hoare triple {6843#false} #t~short316 := #t~short313; {6843#false} is VALID [2022-02-20 21:10:54,433 INFO L290 TraceCheckUtils]: 80: Hoare triple {6843#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {6843#false} is VALID [2022-02-20 21:10:54,433 INFO L290 TraceCheckUtils]: 81: Hoare triple {6843#false} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {6843#false} is VALID [2022-02-20 21:10:54,433 INFO L290 TraceCheckUtils]: 82: Hoare triple {6843#false} assume true; {6843#false} is VALID [2022-02-20 21:10:54,433 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {6843#false} {6843#false} #194#return; {6843#false} is VALID [2022-02-20 21:10:54,433 INFO L272 TraceCheckUtils]: 84: Hoare triple {6843#false} call __VERIFIER_assert(#t~ret373); {6843#false} is VALID [2022-02-20 21:10:54,433 INFO L290 TraceCheckUtils]: 85: Hoare triple {6843#false} ~cond := #in~cond; {6843#false} is VALID [2022-02-20 21:10:54,433 INFO L290 TraceCheckUtils]: 86: Hoare triple {6843#false} assume 0 == ~cond % 256; {6843#false} is VALID [2022-02-20 21:10:54,433 INFO L290 TraceCheckUtils]: 87: Hoare triple {6843#false} assume !false; {6843#false} is VALID [2022-02-20 21:10:54,434 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-20 21:10:54,434 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:10:54,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591449887] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:54,434 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 21:10:54,434 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2022-02-20 21:10:54,434 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660881968] [2022-02-20 21:10:54,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:54,435 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 88 [2022-02-20 21:10:54,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:54,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:10:54,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:54,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 21:10:54,489 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:54,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 21:10:54,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2022-02-20 21:10:54,490 INFO L87 Difference]: Start difference. First operand 107 states and 140 transitions. Second operand has 11 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:10:55,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:55,670 INFO L93 Difference]: Finished difference Result 208 states and 274 transitions. [2022-02-20 21:10:55,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 21:10:55,671 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 88 [2022-02-20 21:10:55,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:10:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2022-02-20 21:10:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:10:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2022-02-20 21:10:55,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 252 transitions. [2022-02-20 21:10:55,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:55,846 INFO L225 Difference]: With dead ends: 208 [2022-02-20 21:10:55,846 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 21:10:55,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2022-02-20 21:10:55,847 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 136 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:55,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 792 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 21:10:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 21:10:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2022-02-20 21:10:55,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:55,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 108 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:55,892 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 108 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:55,892 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 108 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:55,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:55,894 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2022-02-20 21:10:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2022-02-20 21:10:55,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:55,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:55,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 115 states. [2022-02-20 21:10:55,896 INFO L87 Difference]: Start difference. First operand has 108 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 115 states. [2022-02-20 21:10:55,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:55,900 INFO L93 Difference]: Finished difference Result 115 states and 150 transitions. [2022-02-20 21:10:55,900 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 150 transitions. [2022-02-20 21:10:55,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:55,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:55,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:55,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:55,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 73 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:10:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 141 transitions. [2022-02-20 21:10:55,903 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 141 transitions. Word has length 88 [2022-02-20 21:10:55,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:55,903 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 141 transitions. [2022-02-20 21:10:55,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:10:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 141 transitions. [2022-02-20 21:10:55,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-20 21:10:55,904 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:55,904 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:55,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 21:10:56,117 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:56,117 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:56,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:56,118 INFO L85 PathProgramCache]: Analyzing trace with hash 759251201, now seen corresponding path program 1 times [2022-02-20 21:10:56,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:56,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647042600] [2022-02-20 21:10:56,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:56,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:56,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:10:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:56,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {7875#true} #res := #t~nondet13;havoc #t~nondet13; {7875#true} is VALID [2022-02-20 21:10:56,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7875#true} {7877#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} #208#return; {7877#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:10:56,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:10:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:56,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-02-20 21:10:56,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {7875#true} assume !(0 == ~cond % 256); {7875#true} is VALID [2022-02-20 21:10:56,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7875#true} {7877#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} #210#return; {7877#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:10:56,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:56,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 21:10:56,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:56,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {7875#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {7875#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {7875#true} #t~short311 := #t~short308; {7875#true} is VALID [2022-02-20 21:10:56,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {7875#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {7875#true} is VALID [2022-02-20 21:10:56,586 INFO L290 TraceCheckUtils]: 4: Hoare triple {7875#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {7875#true} is VALID [2022-02-20 21:10:56,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,586 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7875#true} {7875#true} #242#return; {7875#true} is VALID [2022-02-20 21:10:56,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {7875#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {7875#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {7875#true} #t~short301#1 := #t~short299#1; {7875#true} is VALID [2022-02-20 21:10:56,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {7875#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {7875#true} is VALID [2022-02-20 21:10:56,586 INFO L290 TraceCheckUtils]: 4: Hoare triple {7875#true} #t~short303#1 := #t~short301#1; {7875#true} is VALID [2022-02-20 21:10:56,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {7875#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {7875#true} #t~short305#1 := #t~short303#1; {7875#true} is VALID [2022-02-20 21:10:56,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {7875#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {7875#true} is VALID [2022-02-20 21:10:56,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {7875#true} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {7875#true} is VALID [2022-02-20 21:10:56,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {7875#true} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {7875#true} is VALID [2022-02-20 21:10:56,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {7875#true} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {7875#true} is VALID [2022-02-20 21:10:56,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {7875#true} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset); {7875#true} is VALID [2022-02-20 21:10:56,587 INFO L272 TraceCheckUtils]: 12: Hoare triple {7875#true} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {7875#true} is VALID [2022-02-20 21:10:56,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {7875#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {7875#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {7875#true} #t~short311 := #t~short308; {7875#true} is VALID [2022-02-20 21:10:56,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {7875#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {7875#true} is VALID [2022-02-20 21:10:56,588 INFO L290 TraceCheckUtils]: 17: Hoare triple {7875#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {7875#true} is VALID [2022-02-20 21:10:56,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,588 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {7875#true} {7875#true} #242#return; {7875#true} is VALID [2022-02-20 21:10:56,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {7875#true} assume !(0 == aws_linked_list_is_valid_deep_#t~ret317#1 % 256);havoc aws_linked_list_is_valid_deep_#t~ret317#1;call aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset := read~$Pointer$(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, 8);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset;havoc aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset; {7875#true} is VALID [2022-02-20 21:10:56,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {7875#true} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {7875#true} is VALID [2022-02-20 21:10:56,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {7875#true} assume aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 1; {7875#true} is VALID [2022-02-20 21:10:56,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {7875#true} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {7875#true} is VALID [2022-02-20 21:10:56,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {7875#true} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {7875#true} is VALID [2022-02-20 21:10:56,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,590 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {7875#true} {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} #212#return; {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} is VALID [2022-02-20 21:10:56,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 21:10:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:56,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-02-20 21:10:56,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {7875#true} assume !(0 == ~cond % 256); {7875#true} is VALID [2022-02-20 21:10:56,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7875#true} {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} #214#return; {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} is VALID [2022-02-20 21:10:56,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 21:10:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:56,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-02-20 21:10:56,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {7875#true} assume !(0 == ~cond % 256); {7875#true} is VALID [2022-02-20 21:10:56,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7875#true} {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} #216#return; {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} is VALID [2022-02-20 21:10:56,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-20 21:10:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:56,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {7875#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {7875#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {7875#true} #t~short316 := #t~short313; {7875#true} is VALID [2022-02-20 21:10:56,617 INFO L290 TraceCheckUtils]: 3: Hoare triple {7875#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {7875#true} is VALID [2022-02-20 21:10:56,617 INFO L290 TraceCheckUtils]: 4: Hoare triple {7875#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {7875#true} is VALID [2022-02-20 21:10:56,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,618 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7875#true} {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} #188#return; {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} is VALID [2022-02-20 21:10:56,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 21:10:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:56,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-02-20 21:10:56,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {7875#true} assume !(0 == ~cond % 256); {7875#true} is VALID [2022-02-20 21:10:56,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7875#true} {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} #190#return; {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} is VALID [2022-02-20 21:10:56,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-02-20 21:10:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:56,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-02-20 21:10:56,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {7875#true} assume !(0 == ~cond % 256); {7875#true} is VALID [2022-02-20 21:10:56,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7875#true} {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} #192#return; {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} is VALID [2022-02-20 21:10:56,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-02-20 21:10:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:56,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {7875#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {7958#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} is VALID [2022-02-20 21:10:56,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {7958#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {7958#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} is VALID [2022-02-20 21:10:56,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {7958#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} #t~short316 := #t~short313; {7958#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} is VALID [2022-02-20 21:10:56,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {7958#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {7959#(or (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|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))))) |aws_linked_list_node_prev_is_valid_#t~short316| (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) |aws_linked_list_node_prev_is_valid_#in~node.offset|)))} is VALID [2022-02-20 21:10:56,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {7959#(or (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|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))))) |aws_linked_list_node_prev_is_valid_#t~short316| (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) |aws_linked_list_node_prev_is_valid_#in~node.offset|)))} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {7960#(or (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|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) |aws_linked_list_node_prev_is_valid_#in~node.offset|)) (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:10:56,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {7960#(or (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|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) |aws_linked_list_node_prev_is_valid_#in~node.offset|)) (and (<= |aws_linked_list_node_prev_is_valid_#res| 1) (<= 1 |aws_linked_list_node_prev_is_valid_#res|)))} assume true; {7960#(or (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|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) |aws_linked_list_node_prev_is_valid_#in~node.offset|)) (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:10:56,744 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7960#(or (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|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) |aws_linked_list_node_prev_is_valid_#in~node.offset|)) (and (<= |aws_linked_list_node_prev_is_valid_#res| 1) (<= 1 |aws_linked_list_node_prev_is_valid_#res|)))} {7940#(and (= aws_linked_list_insert_before_~before.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8))) (select (select |#memory_$Pointer$.offset| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8))) (select (select |#memory_$Pointer$.offset| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8))) aws_linked_list_insert_before_~before.base))} #194#return; {7948#(and (<= |aws_linked_list_insert_before_#t~ret373| 1) (<= 1 |aws_linked_list_insert_before_#t~ret373|))} is VALID [2022-02-20 21:10:56,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {7875#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(36, 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; {7875#true} is VALID [2022-02-20 21:10:56,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {7875#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {7877#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:10:56,746 INFO L272 TraceCheckUtils]: 2: Hoare triple {7877#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {7875#true} is VALID [2022-02-20 21:10:56,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {7875#true} #res := #t~nondet13;havoc #t~nondet13; {7875#true} is VALID [2022-02-20 21:10:56,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,747 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7875#true} {7877#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} #208#return; {7877#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:10:56,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {7877#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {7877#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:10:56,747 INFO L272 TraceCheckUtils]: 7: Hoare triple {7877#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {7875#true} is VALID [2022-02-20 21:10:56,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-02-20 21:10:56,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {7875#true} assume !(0 == ~cond % 256); {7875#true} is VALID [2022-02-20 21:10:56,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,748 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7875#true} {7877#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} #210#return; {7877#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:10:56,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {7877#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {7885#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:10:56,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {7885#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {7885#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:10:56,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {7885#(and (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {7886#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) 24)))} is VALID [2022-02-20 21:10:56,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {7886#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) 24)))} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} is VALID [2022-02-20 21:10:56,752 INFO L272 TraceCheckUtils]: 16: Hoare triple {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {7875#true} is VALID [2022-02-20 21:10:56,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {7875#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {7875#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {7875#true} #t~short301#1 := #t~short299#1; {7875#true} is VALID [2022-02-20 21:10:56,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {7875#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {7875#true} is VALID [2022-02-20 21:10:56,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {7875#true} #t~short303#1 := #t~short301#1; {7875#true} is VALID [2022-02-20 21:10:56,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {7875#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {7875#true} #t~short305#1 := #t~short303#1; {7875#true} is VALID [2022-02-20 21:10:56,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {7875#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {7875#true} is VALID [2022-02-20 21:10:56,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {7875#true} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {7875#true} is VALID [2022-02-20 21:10:56,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {7875#true} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {7875#true} is VALID [2022-02-20 21:10:56,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {7875#true} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {7875#true} is VALID [2022-02-20 21:10:56,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {7875#true} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset); {7875#true} is VALID [2022-02-20 21:10:56,753 INFO L272 TraceCheckUtils]: 29: Hoare triple {7875#true} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {7875#true} is VALID [2022-02-20 21:10:56,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {7875#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {7875#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,753 INFO L290 TraceCheckUtils]: 32: Hoare triple {7875#true} #t~short311 := #t~short308; {7875#true} is VALID [2022-02-20 21:10:56,753 INFO L290 TraceCheckUtils]: 33: Hoare triple {7875#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {7875#true} is VALID [2022-02-20 21:10:56,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {7875#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {7875#true} is VALID [2022-02-20 21:10:56,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,754 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7875#true} {7875#true} #242#return; {7875#true} is VALID [2022-02-20 21:10:56,754 INFO L290 TraceCheckUtils]: 37: Hoare triple {7875#true} assume !(0 == aws_linked_list_is_valid_deep_#t~ret317#1 % 256);havoc aws_linked_list_is_valid_deep_#t~ret317#1;call aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset := read~$Pointer$(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, 8);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset;havoc aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset; {7875#true} is VALID [2022-02-20 21:10:56,754 INFO L290 TraceCheckUtils]: 38: Hoare triple {7875#true} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {7875#true} is VALID [2022-02-20 21:10:56,754 INFO L290 TraceCheckUtils]: 39: Hoare triple {7875#true} assume aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 1; {7875#true} is VALID [2022-02-20 21:10:56,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {7875#true} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {7875#true} is VALID [2022-02-20 21:10:56,754 INFO L290 TraceCheckUtils]: 41: Hoare triple {7875#true} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {7875#true} is VALID [2022-02-20 21:10:56,754 INFO L290 TraceCheckUtils]: 42: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,755 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {7875#true} {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} #212#return; {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} is VALID [2022-02-20 21:10:56,755 INFO L272 TraceCheckUtils]: 44: Hoare triple {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {7875#true} is VALID [2022-02-20 21:10:56,755 INFO L290 TraceCheckUtils]: 45: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-02-20 21:10:56,756 INFO L290 TraceCheckUtils]: 46: Hoare triple {7875#true} assume !(0 == ~cond % 256); {7875#true} is VALID [2022-02-20 21:10:56,756 INFO L290 TraceCheckUtils]: 47: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,756 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {7875#true} {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} #214#return; {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} is VALID [2022-02-20 21:10:56,757 INFO L290 TraceCheckUtils]: 49: Hoare triple {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} havoc aws_linked_list_push_back_#t~ret386#1; {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} is VALID [2022-02-20 21:10:56,757 INFO L272 TraceCheckUtils]: 50: Hoare triple {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {7875#true} is VALID [2022-02-20 21:10:56,757 INFO L290 TraceCheckUtils]: 51: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-02-20 21:10:56,757 INFO L290 TraceCheckUtils]: 52: Hoare triple {7875#true} assume !(0 == ~cond % 256); {7875#true} is VALID [2022-02-20 21:10:56,757 INFO L290 TraceCheckUtils]: 53: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,758 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7875#true} {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} #216#return; {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} is VALID [2022-02-20 21:10:56,759 INFO L272 TraceCheckUtils]: 55: Hoare triple {7887#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) 24) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|)))} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {7923#(and (= (select (select |#memory_$Pointer$.base| |aws_linked_list_insert_before_#in~before.base|) (+ |aws_linked_list_insert_before_#in~before.offset| 8)) |aws_linked_list_insert_before_#in~before.base|) (not (= |aws_linked_list_insert_before_#in~before.base| |aws_linked_list_insert_before_#in~to_add.base|)))} is VALID [2022-02-20 21:10:56,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {7923#(and (= (select (select |#memory_$Pointer$.base| |aws_linked_list_insert_before_#in~before.base|) (+ |aws_linked_list_insert_before_#in~before.offset| 8)) |aws_linked_list_insert_before_#in~before.base|) (not (= |aws_linked_list_insert_before_#in~before.base| |aws_linked_list_insert_before_#in~to_add.base|)))} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} is VALID [2022-02-20 21:10:56,760 INFO L272 TraceCheckUtils]: 57: Hoare triple {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {7875#true} is VALID [2022-02-20 21:10:56,760 INFO L290 TraceCheckUtils]: 58: Hoare triple {7875#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,760 INFO L290 TraceCheckUtils]: 59: Hoare triple {7875#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {7875#true} is VALID [2022-02-20 21:10:56,760 INFO L290 TraceCheckUtils]: 60: Hoare triple {7875#true} #t~short316 := #t~short313; {7875#true} is VALID [2022-02-20 21:10:56,760 INFO L290 TraceCheckUtils]: 61: Hoare triple {7875#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {7875#true} is VALID [2022-02-20 21:10:56,760 INFO L290 TraceCheckUtils]: 62: Hoare triple {7875#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {7875#true} is VALID [2022-02-20 21:10:56,760 INFO L290 TraceCheckUtils]: 63: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,761 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {7875#true} {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} #188#return; {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} is VALID [2022-02-20 21:10:56,761 INFO L272 TraceCheckUtils]: 65: Hoare triple {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} call assume_abort_if_not(#t~ret370); {7875#true} is VALID [2022-02-20 21:10:56,761 INFO L290 TraceCheckUtils]: 66: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-02-20 21:10:56,761 INFO L290 TraceCheckUtils]: 67: Hoare triple {7875#true} assume !(0 == ~cond % 256); {7875#true} is VALID [2022-02-20 21:10:56,762 INFO L290 TraceCheckUtils]: 68: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,762 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {7875#true} {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} #190#return; {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} is VALID [2022-02-20 21:10:56,763 INFO L290 TraceCheckUtils]: 70: Hoare triple {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} havoc #t~ret370; {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} is VALID [2022-02-20 21:10:56,763 INFO L272 TraceCheckUtils]: 71: Hoare triple {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {7875#true} is VALID [2022-02-20 21:10:56,763 INFO L290 TraceCheckUtils]: 72: Hoare triple {7875#true} ~cond := #in~cond; {7875#true} is VALID [2022-02-20 21:10:56,763 INFO L290 TraceCheckUtils]: 73: Hoare triple {7875#true} assume !(0 == ~cond % 256); {7875#true} is VALID [2022-02-20 21:10:56,763 INFO L290 TraceCheckUtils]: 74: Hoare triple {7875#true} assume true; {7875#true} is VALID [2022-02-20 21:10:56,764 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {7875#true} {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} #192#return; {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} is VALID [2022-02-20 21:10:56,765 INFO L290 TraceCheckUtils]: 76: Hoare triple {7924#(and (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) aws_linked_list_insert_before_~before.base) (not (= aws_linked_list_insert_before_~before.base aws_linked_list_insert_before_~to_add.base)))} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {7940#(and (= aws_linked_list_insert_before_~before.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8))) (select (select |#memory_$Pointer$.offset| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8))) (select (select |#memory_$Pointer$.offset| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8))) aws_linked_list_insert_before_~before.base))} is VALID [2022-02-20 21:10:56,765 INFO L272 TraceCheckUtils]: 77: Hoare triple {7940#(and (= aws_linked_list_insert_before_~before.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8))) (select (select |#memory_$Pointer$.offset| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8))) (select (select |#memory_$Pointer$.offset| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8))) aws_linked_list_insert_before_~before.base))} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {7875#true} is VALID [2022-02-20 21:10:56,766 INFO L290 TraceCheckUtils]: 78: Hoare triple {7875#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {7958#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} is VALID [2022-02-20 21:10:56,766 INFO L290 TraceCheckUtils]: 79: Hoare triple {7958#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {7958#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} is VALID [2022-02-20 21:10:56,767 INFO L290 TraceCheckUtils]: 80: Hoare triple {7958#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} #t~short316 := #t~short313; {7958#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} is VALID [2022-02-20 21:10:56,768 INFO L290 TraceCheckUtils]: 81: Hoare triple {7958#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {7959#(or (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|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))))) |aws_linked_list_node_prev_is_valid_#t~short316| (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) |aws_linked_list_node_prev_is_valid_#in~node.offset|)))} is VALID [2022-02-20 21:10:56,768 INFO L290 TraceCheckUtils]: 82: Hoare triple {7959#(or (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|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))))) |aws_linked_list_node_prev_is_valid_#t~short316| (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) |aws_linked_list_node_prev_is_valid_#in~node.offset|)))} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {7960#(or (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|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) |aws_linked_list_node_prev_is_valid_#in~node.offset|)) (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:10:56,769 INFO L290 TraceCheckUtils]: 83: Hoare triple {7960#(or (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|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) |aws_linked_list_node_prev_is_valid_#in~node.offset|)) (and (<= |aws_linked_list_node_prev_is_valid_#res| 1) (<= 1 |aws_linked_list_node_prev_is_valid_#res|)))} assume true; {7960#(or (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|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) |aws_linked_list_node_prev_is_valid_#in~node.offset|)) (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:10:56,770 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {7960#(or (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|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) (select (select |#memory_$Pointer$.offset| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8))) |aws_linked_list_node_prev_is_valid_#in~node.offset|)) (and (<= |aws_linked_list_node_prev_is_valid_#res| 1) (<= 1 |aws_linked_list_node_prev_is_valid_#res|)))} {7940#(and (= aws_linked_list_insert_before_~before.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8))) (select (select |#memory_$Pointer$.offset| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8))) (select (select |#memory_$Pointer$.offset| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8))) aws_linked_list_insert_before_~before.base))} #194#return; {7948#(and (<= |aws_linked_list_insert_before_#t~ret373| 1) (<= 1 |aws_linked_list_insert_before_#t~ret373|))} is VALID [2022-02-20 21:10:56,771 INFO L272 TraceCheckUtils]: 85: Hoare triple {7948#(and (<= |aws_linked_list_insert_before_#t~ret373| 1) (<= 1 |aws_linked_list_insert_before_#t~ret373|))} call __VERIFIER_assert(#t~ret373); {7949#(and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))} is VALID [2022-02-20 21:10:56,771 INFO L290 TraceCheckUtils]: 86: Hoare triple {7949#(and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1))} ~cond := #in~cond; {7950#(and (<= (div __VERIFIER_assert_~cond 256) 0) (<= 1 __VERIFIER_assert_~cond))} is VALID [2022-02-20 21:10:56,772 INFO L290 TraceCheckUtils]: 87: Hoare triple {7950#(and (<= (div __VERIFIER_assert_~cond 256) 0) (<= 1 __VERIFIER_assert_~cond))} assume 0 == ~cond % 256; {7876#false} is VALID [2022-02-20 21:10:56,772 INFO L290 TraceCheckUtils]: 88: Hoare triple {7876#false} assume !false; {7876#false} is VALID [2022-02-20 21:10:56,772 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-02-20 21:10:56,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:56,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647042600] [2022-02-20 21:10:56,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647042600] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:56,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:10:56,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-20 21:10:56,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115577083] [2022-02-20 21:10:56,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:56,773 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 89 [2022-02-20 21:10:56,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:56,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:10:56,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:56,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 21:10:56,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:56,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 21:10:56,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-02-20 21:10:56,838 INFO L87 Difference]: Start difference. First operand 108 states and 141 transitions. Second operand has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:10:59,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:59,535 INFO L93 Difference]: Finished difference Result 164 states and 230 transitions. [2022-02-20 21:10:59,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 21:10:59,535 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 89 [2022-02-20 21:10:59,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:59,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:10:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 216 transitions. [2022-02-20 21:10:59,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:10:59,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 216 transitions. [2022-02-20 21:10:59,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 216 transitions. [2022-02-20 21:10:59,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:59,733 INFO L225 Difference]: With dead ends: 164 [2022-02-20 21:10:59,734 INFO L226 Difference]: Without dead ends: 162 [2022-02-20 21:10:59,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-02-20 21:10:59,735 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 56 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:59,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 1384 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 21:10:59,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-02-20 21:10:59,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 143. [2022-02-20 21:10:59,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:59,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 143 states, 88 states have (on average 1.1590909090909092) internal successors, (102), 92 states have internal predecessors, (102), 43 states have call successors, (43), 9 states have call predecessors, (43), 11 states have return successors, (51), 41 states have call predecessors, (51), 42 states have call successors, (51) [2022-02-20 21:10:59,795 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 143 states, 88 states have (on average 1.1590909090909092) internal successors, (102), 92 states have internal predecessors, (102), 43 states have call successors, (43), 9 states have call predecessors, (43), 11 states have return successors, (51), 41 states have call predecessors, (51), 42 states have call successors, (51) [2022-02-20 21:10:59,795 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 143 states, 88 states have (on average 1.1590909090909092) internal successors, (102), 92 states have internal predecessors, (102), 43 states have call successors, (43), 9 states have call predecessors, (43), 11 states have return successors, (51), 41 states have call predecessors, (51), 42 states have call successors, (51) [2022-02-20 21:10:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:59,799 INFO L93 Difference]: Finished difference Result 162 states and 228 transitions. [2022-02-20 21:10:59,799 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 228 transitions. [2022-02-20 21:10:59,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:59,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:59,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 88 states have (on average 1.1590909090909092) internal successors, (102), 92 states have internal predecessors, (102), 43 states have call successors, (43), 9 states have call predecessors, (43), 11 states have return successors, (51), 41 states have call predecessors, (51), 42 states have call successors, (51) Second operand 162 states. [2022-02-20 21:10:59,800 INFO L87 Difference]: Start difference. First operand has 143 states, 88 states have (on average 1.1590909090909092) internal successors, (102), 92 states have internal predecessors, (102), 43 states have call successors, (43), 9 states have call predecessors, (43), 11 states have return successors, (51), 41 states have call predecessors, (51), 42 states have call successors, (51) Second operand 162 states. [2022-02-20 21:10:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:59,804 INFO L93 Difference]: Finished difference Result 162 states and 228 transitions. [2022-02-20 21:10:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 228 transitions. [2022-02-20 21:10:59,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:59,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:59,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:59,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:59,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 88 states have (on average 1.1590909090909092) internal successors, (102), 92 states have internal predecessors, (102), 43 states have call successors, (43), 9 states have call predecessors, (43), 11 states have return successors, (51), 41 states have call predecessors, (51), 42 states have call successors, (51) [2022-02-20 21:10:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 196 transitions. [2022-02-20 21:10:59,810 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 196 transitions. Word has length 89 [2022-02-20 21:10:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:59,810 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 196 transitions. [2022-02-20 21:10:59,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.153846153846154) internal successors, (54), 12 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:10:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 196 transitions. [2022-02-20 21:10:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-20 21:10:59,811 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:59,811 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:10:59,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 21:10:59,811 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:59,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash -50095425, now seen corresponding path program 1 times [2022-02-20 21:10:59,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:59,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949152598] [2022-02-20 21:10:59,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:59,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:00,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:11:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:00,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {8735#true} #res := #t~nondet13;havoc #t~nondet13; {8735#true} is VALID [2022-02-20 21:11:00,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8735#true} {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} #208#return; {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:11:00,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:11:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:00,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {8735#true} ~cond := #in~cond; {8735#true} is VALID [2022-02-20 21:11:00,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {8735#true} assume !(0 == ~cond % 256); {8735#true} is VALID [2022-02-20 21:11:00,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8735#true} {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} #210#return; {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:11:00,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:11:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:00,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 21:11:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:00,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {8735#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {8735#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {8735#true} #t~short311 := #t~short308; {8735#true} is VALID [2022-02-20 21:11:00,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {8735#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {8735#true} is VALID [2022-02-20 21:11:00,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {8735#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {8735#true} is VALID [2022-02-20 21:11:00,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,074 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8735#true} {8735#true} #242#return; {8735#true} is VALID [2022-02-20 21:11:00,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {8735#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {8735#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {8735#true} #t~short301#1 := #t~short299#1; {8735#true} is VALID [2022-02-20 21:11:00,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {8735#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {8735#true} is VALID [2022-02-20 21:11:00,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {8735#true} #t~short303#1 := #t~short301#1; {8735#true} is VALID [2022-02-20 21:11:00,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {8735#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {8735#true} #t~short305#1 := #t~short303#1; {8735#true} is VALID [2022-02-20 21:11:00,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {8735#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {8735#true} is VALID [2022-02-20 21:11:00,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {8735#true} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {8735#true} is VALID [2022-02-20 21:11:00,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {8735#true} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {8735#true} is VALID [2022-02-20 21:11:00,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {8735#true} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {8735#true} is VALID [2022-02-20 21:11:00,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {8735#true} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset); {8735#true} is VALID [2022-02-20 21:11:00,075 INFO L272 TraceCheckUtils]: 12: Hoare triple {8735#true} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {8735#true} is VALID [2022-02-20 21:11:00,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {8735#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {8735#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {8735#true} #t~short311 := #t~short308; {8735#true} is VALID [2022-02-20 21:11:00,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {8735#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {8735#true} is VALID [2022-02-20 21:11:00,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {8735#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {8735#true} is VALID [2022-02-20 21:11:00,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,076 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {8735#true} {8735#true} #242#return; {8735#true} is VALID [2022-02-20 21:11:00,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {8735#true} assume !(0 == aws_linked_list_is_valid_deep_#t~ret317#1 % 256);havoc aws_linked_list_is_valid_deep_#t~ret317#1;call aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset := read~$Pointer$(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, 8);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset;havoc aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset; {8735#true} is VALID [2022-02-20 21:11:00,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {8735#true} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {8735#true} is VALID [2022-02-20 21:11:00,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {8735#true} assume aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 1; {8735#true} is VALID [2022-02-20 21:11:00,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {8735#true} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {8735#true} is VALID [2022-02-20 21:11:00,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {8735#true} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {8735#true} is VALID [2022-02-20 21:11:00,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,078 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {8735#true} {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} #212#return; {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} is VALID [2022-02-20 21:11:00,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 21:11:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:00,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {8735#true} ~cond := #in~cond; {8735#true} is VALID [2022-02-20 21:11:00,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {8735#true} assume !(0 == ~cond % 256); {8735#true} is VALID [2022-02-20 21:11:00,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8735#true} {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} #214#return; {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} is VALID [2022-02-20 21:11:00,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 21:11:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:00,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {8735#true} ~cond := #in~cond; {8735#true} is VALID [2022-02-20 21:11:00,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {8735#true} assume !(0 == ~cond % 256); {8735#true} is VALID [2022-02-20 21:11:00,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8735#true} {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} #216#return; {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} is VALID [2022-02-20 21:11:00,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-02-20 21:11:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:00,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {8735#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {8735#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {8735#true} #t~short316 := #t~short313; {8735#true} is VALID [2022-02-20 21:11:00,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {8735#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {8735#true} is VALID [2022-02-20 21:11:00,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {8735#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {8735#true} is VALID [2022-02-20 21:11:00,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,102 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8735#true} {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} #188#return; {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} is VALID [2022-02-20 21:11:00,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 21:11:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:00,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {8735#true} ~cond := #in~cond; {8735#true} is VALID [2022-02-20 21:11:00,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {8735#true} assume !(0 == ~cond % 256); {8735#true} is VALID [2022-02-20 21:11:00,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8735#true} {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} #190#return; {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} is VALID [2022-02-20 21:11:00,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-02-20 21:11:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:00,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {8735#true} ~cond := #in~cond; {8735#true} is VALID [2022-02-20 21:11:00,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {8735#true} assume !(0 == ~cond % 256); {8735#true} is VALID [2022-02-20 21:11:00,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8735#true} {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} #192#return; {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} is VALID [2022-02-20 21:11:00,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-02-20 21:11:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:00,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {8735#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {8813#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} is VALID [2022-02-20 21:11:00,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {8813#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {8814#(or |aws_linked_list_node_prev_is_valid_#t~short313| (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0))} is VALID [2022-02-20 21:11:00,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {8814#(or |aws_linked_list_node_prev_is_valid_#t~short313| (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0))} #t~short316 := #t~short313; {8815#(or |aws_linked_list_node_prev_is_valid_#t~short316| (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0))} is VALID [2022-02-20 21:11:00,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {8815#(or |aws_linked_list_node_prev_is_valid_#t~short316| (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0))} assume !#t~short316; {8816#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0)} is VALID [2022-02-20 21:11:00,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {8816#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0)} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {8816#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0)} is VALID [2022-02-20 21:11:00,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {8816#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0)} assume true; {8816#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0)} is VALID [2022-02-20 21:11:00,178 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8816#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0)} {8798#(not (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) 0))} #194#return; {8736#false} is VALID [2022-02-20 21:11:00,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {8735#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(36, 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; {8735#true} is VALID [2022-02-20 21:11:00,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {8735#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:11:00,179 INFO L272 TraceCheckUtils]: 2: Hoare triple {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {8735#true} is VALID [2022-02-20 21:11:00,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {8735#true} #res := #t~nondet13;havoc #t~nondet13; {8735#true} is VALID [2022-02-20 21:11:00,180 INFO L290 TraceCheckUtils]: 4: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,180 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8735#true} {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} #208#return; {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:11:00,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:11:00,180 INFO L272 TraceCheckUtils]: 7: Hoare triple {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {8735#true} is VALID [2022-02-20 21:11:00,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {8735#true} ~cond := #in~cond; {8735#true} is VALID [2022-02-20 21:11:00,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {8735#true} assume !(0 == ~cond % 256); {8735#true} is VALID [2022-02-20 21:11:00,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,182 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {8735#true} {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} #210#return; {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:11:00,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:11:00,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:11:00,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:11:00,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {8737#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#to_add~0#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} is VALID [2022-02-20 21:11:00,185 INFO L272 TraceCheckUtils]: 16: Hoare triple {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {8735#true} is VALID [2022-02-20 21:11:00,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {8735#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {8735#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {8735#true} #t~short301#1 := #t~short299#1; {8735#true} is VALID [2022-02-20 21:11:00,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {8735#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {8735#true} is VALID [2022-02-20 21:11:00,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {8735#true} #t~short303#1 := #t~short301#1; {8735#true} is VALID [2022-02-20 21:11:00,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {8735#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {8735#true} #t~short305#1 := #t~short303#1; {8735#true} is VALID [2022-02-20 21:11:00,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {8735#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {8735#true} is VALID [2022-02-20 21:11:00,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {8735#true} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {8735#true} is VALID [2022-02-20 21:11:00,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {8735#true} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {8735#true} is VALID [2022-02-20 21:11:00,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {8735#true} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {8735#true} is VALID [2022-02-20 21:11:00,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {8735#true} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset); {8735#true} is VALID [2022-02-20 21:11:00,186 INFO L272 TraceCheckUtils]: 29: Hoare triple {8735#true} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {8735#true} is VALID [2022-02-20 21:11:00,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {8735#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {8735#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {8735#true} #t~short311 := #t~short308; {8735#true} is VALID [2022-02-20 21:11:00,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {8735#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {8735#true} is VALID [2022-02-20 21:11:00,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {8735#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {8735#true} is VALID [2022-02-20 21:11:00,187 INFO L290 TraceCheckUtils]: 35: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,187 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8735#true} {8735#true} #242#return; {8735#true} is VALID [2022-02-20 21:11:00,187 INFO L290 TraceCheckUtils]: 37: Hoare triple {8735#true} assume !(0 == aws_linked_list_is_valid_deep_#t~ret317#1 % 256);havoc aws_linked_list_is_valid_deep_#t~ret317#1;call aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset := read~$Pointer$(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, 8);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset;havoc aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset; {8735#true} is VALID [2022-02-20 21:11:00,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {8735#true} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {8735#true} is VALID [2022-02-20 21:11:00,187 INFO L290 TraceCheckUtils]: 39: Hoare triple {8735#true} assume aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 1; {8735#true} is VALID [2022-02-20 21:11:00,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {8735#true} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {8735#true} is VALID [2022-02-20 21:11:00,187 INFO L290 TraceCheckUtils]: 41: Hoare triple {8735#true} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {8735#true} is VALID [2022-02-20 21:11:00,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,188 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {8735#true} {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} #212#return; {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} is VALID [2022-02-20 21:11:00,188 INFO L272 TraceCheckUtils]: 44: Hoare triple {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {8735#true} is VALID [2022-02-20 21:11:00,188 INFO L290 TraceCheckUtils]: 45: Hoare triple {8735#true} ~cond := #in~cond; {8735#true} is VALID [2022-02-20 21:11:00,188 INFO L290 TraceCheckUtils]: 46: Hoare triple {8735#true} assume !(0 == ~cond % 256); {8735#true} is VALID [2022-02-20 21:11:00,188 INFO L290 TraceCheckUtils]: 47: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,189 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8735#true} {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} #214#return; {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} is VALID [2022-02-20 21:11:00,189 INFO L290 TraceCheckUtils]: 49: Hoare triple {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} havoc aws_linked_list_push_back_#t~ret386#1; {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} is VALID [2022-02-20 21:11:00,189 INFO L272 TraceCheckUtils]: 50: Hoare triple {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {8735#true} is VALID [2022-02-20 21:11:00,189 INFO L290 TraceCheckUtils]: 51: Hoare triple {8735#true} ~cond := #in~cond; {8735#true} is VALID [2022-02-20 21:11:00,189 INFO L290 TraceCheckUtils]: 52: Hoare triple {8735#true} assume !(0 == ~cond % 256); {8735#true} is VALID [2022-02-20 21:11:00,190 INFO L290 TraceCheckUtils]: 53: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,190 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8735#true} {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} #216#return; {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} is VALID [2022-02-20 21:11:00,191 INFO L272 TraceCheckUtils]: 55: Hoare triple {8745#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_push_back_~node#1.base| 0)))} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {8781#(not (= 0 |aws_linked_list_insert_before_#in~to_add.base|))} is VALID [2022-02-20 21:11:00,191 INFO L290 TraceCheckUtils]: 56: Hoare triple {8781#(not (= 0 |aws_linked_list_insert_before_#in~to_add.base|))} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} is VALID [2022-02-20 21:11:00,191 INFO L272 TraceCheckUtils]: 57: Hoare triple {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {8735#true} is VALID [2022-02-20 21:11:00,191 INFO L290 TraceCheckUtils]: 58: Hoare triple {8735#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,191 INFO L290 TraceCheckUtils]: 59: Hoare triple {8735#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {8735#true} is VALID [2022-02-20 21:11:00,191 INFO L290 TraceCheckUtils]: 60: Hoare triple {8735#true} #t~short316 := #t~short313; {8735#true} is VALID [2022-02-20 21:11:00,192 INFO L290 TraceCheckUtils]: 61: Hoare triple {8735#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {8735#true} is VALID [2022-02-20 21:11:00,192 INFO L290 TraceCheckUtils]: 62: Hoare triple {8735#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {8735#true} is VALID [2022-02-20 21:11:00,192 INFO L290 TraceCheckUtils]: 63: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,192 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {8735#true} {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} #188#return; {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} is VALID [2022-02-20 21:11:00,192 INFO L272 TraceCheckUtils]: 65: Hoare triple {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} call assume_abort_if_not(#t~ret370); {8735#true} is VALID [2022-02-20 21:11:00,192 INFO L290 TraceCheckUtils]: 66: Hoare triple {8735#true} ~cond := #in~cond; {8735#true} is VALID [2022-02-20 21:11:00,193 INFO L290 TraceCheckUtils]: 67: Hoare triple {8735#true} assume !(0 == ~cond % 256); {8735#true} is VALID [2022-02-20 21:11:00,193 INFO L290 TraceCheckUtils]: 68: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,193 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {8735#true} {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} #190#return; {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} is VALID [2022-02-20 21:11:00,193 INFO L290 TraceCheckUtils]: 70: Hoare triple {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} havoc #t~ret370; {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} is VALID [2022-02-20 21:11:00,193 INFO L272 TraceCheckUtils]: 71: Hoare triple {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {8735#true} is VALID [2022-02-20 21:11:00,193 INFO L290 TraceCheckUtils]: 72: Hoare triple {8735#true} ~cond := #in~cond; {8735#true} is VALID [2022-02-20 21:11:00,194 INFO L290 TraceCheckUtils]: 73: Hoare triple {8735#true} assume !(0 == ~cond % 256); {8735#true} is VALID [2022-02-20 21:11:00,194 INFO L290 TraceCheckUtils]: 74: Hoare triple {8735#true} assume true; {8735#true} is VALID [2022-02-20 21:11:00,194 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {8735#true} {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} #192#return; {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} is VALID [2022-02-20 21:11:00,196 INFO L290 TraceCheckUtils]: 76: Hoare triple {8782#(not (= aws_linked_list_insert_before_~to_add.base 0))} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {8798#(not (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) 0))} is VALID [2022-02-20 21:11:00,196 INFO L272 TraceCheckUtils]: 77: Hoare triple {8798#(not (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) 0))} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {8735#true} is VALID [2022-02-20 21:11:00,196 INFO L290 TraceCheckUtils]: 78: Hoare triple {8735#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {8813#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} is VALID [2022-02-20 21:11:00,197 INFO L290 TraceCheckUtils]: 79: Hoare triple {8813#(and (<= aws_linked_list_node_prev_is_valid_~node.offset |aws_linked_list_node_prev_is_valid_#in~node.offset|) (= |aws_linked_list_node_prev_is_valid_#in~node.base| aws_linked_list_node_prev_is_valid_~node.base) (<= |aws_linked_list_node_prev_is_valid_#in~node.offset| aws_linked_list_node_prev_is_valid_~node.offset))} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {8814#(or |aws_linked_list_node_prev_is_valid_#t~short313| (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0))} is VALID [2022-02-20 21:11:00,197 INFO L290 TraceCheckUtils]: 80: Hoare triple {8814#(or |aws_linked_list_node_prev_is_valid_#t~short313| (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0))} #t~short316 := #t~short313; {8815#(or |aws_linked_list_node_prev_is_valid_#t~short316| (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0))} is VALID [2022-02-20 21:11:00,198 INFO L290 TraceCheckUtils]: 81: Hoare triple {8815#(or |aws_linked_list_node_prev_is_valid_#t~short316| (= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0))} assume !#t~short316; {8816#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0)} is VALID [2022-02-20 21:11:00,198 INFO L290 TraceCheckUtils]: 82: Hoare triple {8816#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0)} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {8816#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0)} is VALID [2022-02-20 21:11:00,198 INFO L290 TraceCheckUtils]: 83: Hoare triple {8816#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0)} assume true; {8816#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0)} is VALID [2022-02-20 21:11:00,199 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {8816#(= (select (select |#memory_$Pointer$.base| |aws_linked_list_node_prev_is_valid_#in~node.base|) (+ |aws_linked_list_node_prev_is_valid_#in~node.offset| 8)) 0)} {8798#(not (= (select (select |#memory_$Pointer$.base| aws_linked_list_insert_before_~before.base) (+ aws_linked_list_insert_before_~before.offset 8)) 0))} #194#return; {8736#false} is VALID [2022-02-20 21:11:00,199 INFO L272 TraceCheckUtils]: 85: Hoare triple {8736#false} call __VERIFIER_assert(#t~ret373); {8736#false} is VALID [2022-02-20 21:11:00,199 INFO L290 TraceCheckUtils]: 86: Hoare triple {8736#false} ~cond := #in~cond; {8736#false} is VALID [2022-02-20 21:11:00,199 INFO L290 TraceCheckUtils]: 87: Hoare triple {8736#false} assume 0 == ~cond % 256; {8736#false} is VALID [2022-02-20 21:11:00,199 INFO L290 TraceCheckUtils]: 88: Hoare triple {8736#false} assume !false; {8736#false} is VALID [2022-02-20 21:11:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-02-20 21:11:00,200 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:11:00,200 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949152598] [2022-02-20 21:11:00,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949152598] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:11:00,200 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:11:00,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-20 21:11:00,200 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668128345] [2022-02-20 21:11:00,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:11:00,201 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 89 [2022-02-20 21:11:00,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:11:00,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:11:00,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:00,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 21:11:00,254 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:11:00,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 21:11:00,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-02-20 21:11:00,255 INFO L87 Difference]: Start difference. First operand 143 states and 196 transitions. Second operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:11:01,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:01,733 INFO L93 Difference]: Finished difference Result 243 states and 336 transitions. [2022-02-20 21:11:01,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 21:11:01,733 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 89 [2022-02-20 21:11:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:11:01,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:11:01,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 231 transitions. [2022-02-20 21:11:01,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:11:01,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 231 transitions. [2022-02-20 21:11:01,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 231 transitions. [2022-02-20 21:11:01,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:01,989 INFO L225 Difference]: With dead ends: 243 [2022-02-20 21:11:01,989 INFO L226 Difference]: Without dead ends: 149 [2022-02-20 21:11:01,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-02-20 21:11:01,990 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 54 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 21:11:01,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 960 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 21:11:01,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-02-20 21:11:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2022-02-20 21:11:02,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:11:02,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 148 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 97 states have internal predecessors, (107), 43 states have call successors, (43), 9 states have call predecessors, (43), 12 states have return successors, (56), 41 states have call predecessors, (56), 42 states have call successors, (56) [2022-02-20 21:11:02,057 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 148 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 97 states have internal predecessors, (107), 43 states have call successors, (43), 9 states have call predecessors, (43), 12 states have return successors, (56), 41 states have call predecessors, (56), 42 states have call successors, (56) [2022-02-20 21:11:02,058 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 148 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 97 states have internal predecessors, (107), 43 states have call successors, (43), 9 states have call predecessors, (43), 12 states have return successors, (56), 41 states have call predecessors, (56), 42 states have call successors, (56) [2022-02-20 21:11:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:02,063 INFO L93 Difference]: Finished difference Result 149 states and 207 transitions. [2022-02-20 21:11:02,063 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 207 transitions. [2022-02-20 21:11:02,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:02,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:02,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 97 states have internal predecessors, (107), 43 states have call successors, (43), 9 states have call predecessors, (43), 12 states have return successors, (56), 41 states have call predecessors, (56), 42 states have call successors, (56) Second operand 149 states. [2022-02-20 21:11:02,065 INFO L87 Difference]: Start difference. First operand has 148 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 97 states have internal predecessors, (107), 43 states have call successors, (43), 9 states have call predecessors, (43), 12 states have return successors, (56), 41 states have call predecessors, (56), 42 states have call successors, (56) Second operand 149 states. [2022-02-20 21:11:02,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:02,069 INFO L93 Difference]: Finished difference Result 149 states and 207 transitions. [2022-02-20 21:11:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 207 transitions. [2022-02-20 21:11:02,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:02,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:02,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:11:02,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:11:02,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 97 states have internal predecessors, (107), 43 states have call successors, (43), 9 states have call predecessors, (43), 12 states have return successors, (56), 41 states have call predecessors, (56), 42 states have call successors, (56) [2022-02-20 21:11:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 206 transitions. [2022-02-20 21:11:02,075 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 206 transitions. Word has length 89 [2022-02-20 21:11:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:11:02,076 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 206 transitions. [2022-02-20 21:11:02,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 21:11:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 206 transitions. [2022-02-20 21:11:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-02-20 21:11:02,077 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:11:02,077 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:11:02,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 21:11:02,078 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:11:02,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:11:02,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1974343619, now seen corresponding path program 1 times [2022-02-20 21:11:02,078 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:11:02,078 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656781746] [2022-02-20 21:11:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:11:02,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:11:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:02,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:11:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:02,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {9669#true} #res := #t~nondet13;havoc #t~nondet13; {9669#true} is VALID [2022-02-20 21:11:02,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9669#true} {9671#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} #208#return; {9671#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:11:02,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:11:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:02,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {9669#true} ~cond := #in~cond; {9669#true} is VALID [2022-02-20 21:11:02,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {9669#true} assume !(0 == ~cond % 256); {9669#true} is VALID [2022-02-20 21:11:02,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9669#true} {9671#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} #210#return; {9671#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:11:02,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 21:11:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:02,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 21:11:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:02,515 INFO L290 TraceCheckUtils]: 0: Hoare triple {9669#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {9669#true} is VALID [2022-02-20 21:11:02,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {9669#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {9669#true} is VALID [2022-02-20 21:11:02,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {9669#true} #t~short311 := #t~short308; {9669#true} is VALID [2022-02-20 21:11:02,516 INFO L290 TraceCheckUtils]: 3: Hoare triple {9669#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {9669#true} is VALID [2022-02-20 21:11:02,516 INFO L290 TraceCheckUtils]: 4: Hoare triple {9669#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {9669#true} is VALID [2022-02-20 21:11:02,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,517 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9669#true} {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} #242#return; {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} is VALID [2022-02-20 21:11:02,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {9669#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} #t~short301#1 := #t~short299#1; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,520 INFO L290 TraceCheckUtils]: 3: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,520 INFO L290 TraceCheckUtils]: 4: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} #t~short303#1 := #t~short301#1; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} #t~short305#1 := #t~short303#1; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {9741#(and (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|)))} is VALID [2022-02-20 21:11:02,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {9741#(and (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|)))} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} is VALID [2022-02-20 21:11:02,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} is VALID [2022-02-20 21:11:02,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset); {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} is VALID [2022-02-20 21:11:02,525 INFO L272 TraceCheckUtils]: 12: Hoare triple {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {9669#true} is VALID [2022-02-20 21:11:02,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {9669#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {9669#true} is VALID [2022-02-20 21:11:02,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {9669#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {9669#true} is VALID [2022-02-20 21:11:02,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {9669#true} #t~short311 := #t~short308; {9669#true} is VALID [2022-02-20 21:11:02,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {9669#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {9669#true} is VALID [2022-02-20 21:11:02,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {9669#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {9669#true} is VALID [2022-02-20 21:11:02,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,527 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {9669#true} {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} #242#return; {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} is VALID [2022-02-20 21:11:02,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} assume !(0 == aws_linked_list_is_valid_deep_#t~ret317#1 % 256);havoc aws_linked_list_is_valid_deep_#t~ret317#1;call aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset := read~$Pointer$(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, 8);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset;havoc aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset; {9750#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))} is VALID [2022-02-20 21:11:02,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {9750#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {9750#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))} is VALID [2022-02-20 21:11:02,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {9750#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))} assume aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 1; {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} is VALID [2022-02-20 21:11:02,530 INFO L290 TraceCheckUtils]: 23: Hoare triple {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} is VALID [2022-02-20 21:11:02,530 INFO L290 TraceCheckUtils]: 24: Hoare triple {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} is VALID [2022-02-20 21:11:02,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} assume true; {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} is VALID [2022-02-20 21:11:02,532 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} {9682#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset|) 0))} #212#return; {9670#false} is VALID [2022-02-20 21:11:02,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:11:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:02,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {9669#true} ~cond := #in~cond; {9669#true} is VALID [2022-02-20 21:11:02,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {9669#true} assume !(0 == ~cond % 256); {9669#true} is VALID [2022-02-20 21:11:02,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9669#true} {9670#false} #214#return; {9670#false} is VALID [2022-02-20 21:11:02,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 21:11:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:02,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {9669#true} ~cond := #in~cond; {9669#true} is VALID [2022-02-20 21:11:02,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {9669#true} assume !(0 == ~cond % 256); {9669#true} is VALID [2022-02-20 21:11:02,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9669#true} {9670#false} #216#return; {9670#false} is VALID [2022-02-20 21:11:02,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-02-20 21:11:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:02,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {9669#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {9669#true} is VALID [2022-02-20 21:11:02,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {9669#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {9669#true} is VALID [2022-02-20 21:11:02,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {9669#true} #t~short316 := #t~short313; {9669#true} is VALID [2022-02-20 21:11:02,556 INFO L290 TraceCheckUtils]: 3: Hoare triple {9669#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {9669#true} is VALID [2022-02-20 21:11:02,556 INFO L290 TraceCheckUtils]: 4: Hoare triple {9669#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {9669#true} is VALID [2022-02-20 21:11:02,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,556 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9669#true} {9670#false} #188#return; {9670#false} is VALID [2022-02-20 21:11:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 21:11:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:02,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {9669#true} ~cond := #in~cond; {9669#true} is VALID [2022-02-20 21:11:02,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {9669#true} assume !(0 == ~cond % 256); {9669#true} is VALID [2022-02-20 21:11:02,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9669#true} {9670#false} #190#return; {9670#false} is VALID [2022-02-20 21:11:02,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-02-20 21:11:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:02,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {9669#true} ~cond := #in~cond; {9669#true} is VALID [2022-02-20 21:11:02,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {9669#true} assume !(0 == ~cond % 256); {9669#true} is VALID [2022-02-20 21:11:02,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9669#true} {9670#false} #192#return; {9670#false} is VALID [2022-02-20 21:11:02,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-02-20 21:11:02,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:02,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {9669#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {9669#true} is VALID [2022-02-20 21:11:02,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {9669#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {9669#true} is VALID [2022-02-20 21:11:02,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {9669#true} #t~short316 := #t~short313; {9669#true} is VALID [2022-02-20 21:11:02,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {9669#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {9669#true} is VALID [2022-02-20 21:11:02,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {9669#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {9669#true} is VALID [2022-02-20 21:11:02,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,579 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9669#true} {9670#false} #194#return; {9670#false} is VALID [2022-02-20 21:11:02,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {9669#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(36, 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; {9669#true} is VALID [2022-02-20 21:11:02,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {9669#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {9671#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:11:02,581 INFO L272 TraceCheckUtils]: 2: Hoare triple {9671#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {9669#true} is VALID [2022-02-20 21:11:02,581 INFO L290 TraceCheckUtils]: 3: Hoare triple {9669#true} #res := #t~nondet13;havoc #t~nondet13; {9669#true} is VALID [2022-02-20 21:11:02,581 INFO L290 TraceCheckUtils]: 4: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,582 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {9669#true} {9671#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} #208#return; {9671#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:11:02,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {9671#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {9671#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:11:02,582 INFO L272 TraceCheckUtils]: 7: Hoare triple {9671#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} call assume_abort_if_not((if 0 == (if ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616 <= ensure_linked_list_is_allocated_~max_length#1 % 18446744073709551616 then 1 else 0) then 0 else 1)); {9669#true} is VALID [2022-02-20 21:11:02,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {9669#true} ~cond := #in~cond; {9669#true} is VALID [2022-02-20 21:11:02,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {9669#true} assume !(0 == ~cond % 256); {9669#true} is VALID [2022-02-20 21:11:02,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,584 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {9669#true} {9671#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} #210#return; {9671#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} is VALID [2022-02-20 21:11:02,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {9671#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0))} call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 8 + ensure_linked_list_is_allocated_~list#1.offset, 8);call write~$Pointer$(0, 0, ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0; {9679#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0) (not (= (+ |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|)))} is VALID [2022-02-20 21:11:02,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {9679#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0) (not (= (+ |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|)))} assume !!(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616);call ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset := #Ultimate.allocOnHeap(16);ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset := ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset;havoc ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset;call write~$Pointer$(ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~node~0#1.base, 8 + ensure_linked_list_is_allocated_~node~0#1.offset, 8);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset; {9680#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| (+ |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24))) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|) 0))} is VALID [2022-02-20 21:11:02,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {9680#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| (+ |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24))) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|) 0))} ensure_linked_list_is_allocated_#t~post548#1 := ensure_linked_list_is_allocated_~i~1#1;ensure_linked_list_is_allocated_~i~1#1 := 1 + ensure_linked_list_is_allocated_#t~post548#1;havoc ensure_linked_list_is_allocated_#t~post548#1; {9680#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| (+ |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24))) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|) 0))} is VALID [2022-02-20 21:11:02,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {9680#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| (+ |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24))) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|) 0))} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {9680#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| (+ |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24))) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|) 0))} is VALID [2022-02-20 21:11:02,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {9680#(and (not (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| (+ |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24))) (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0) (not (= |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|)) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|) 0))} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, 16 + ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, 24 + ensure_linked_list_is_allocated_~list#1.offset, 8); {9681#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|) 0))} is VALID [2022-02-20 21:11:02,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {9681#(and (= |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset| 0) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|) 0))} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, 24 + aws_linked_list_push_back_harness_~#list~0#1.offset, 8);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {9682#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset|) 0))} is VALID [2022-02-20 21:11:02,591 INFO L272 TraceCheckUtils]: 18: Hoare triple {9682#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset|) 0))} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {9669#true} is VALID [2022-02-20 21:11:02,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {9669#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0 || ~list#1.offset != 0; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8);#t~short299#1 := #t~mem298#1.base != 0 || #t~mem298#1.offset != 0; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} #t~short301#1 := #t~short299#1; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, 8 + ~list#1.offset, 8);#t~short301#1 := #t~mem300#1.base == 0 && #t~mem300#1.offset == 0; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} #t~short303#1 := #t~short301#1; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, 24 + ~list#1.offset, 8);#t~short303#1 := #t~mem302#1.base != 0 || #t~mem302#1.offset != 0; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} #t~short305#1 := #t~short303#1; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, 16 + ~list#1.offset, 8);#t~short305#1 := #t~mem304#1.base == 0 && #t~mem304#1.offset == 0; {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} is VALID [2022-02-20 21:11:02,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {9740#(and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|) (= |aws_linked_list_is_valid_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {9741#(and (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|)))} is VALID [2022-02-20 21:11:02,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {9741#(and (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|)))} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0 && aws_linked_list_is_valid_deep_~list#1.offset == 0);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0; {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} is VALID [2022-02-20 21:11:02,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} is VALID [2022-02-20 21:11:02,597 INFO L290 TraceCheckUtils]: 30: Hoare triple {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset); {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} is VALID [2022-02-20 21:11:02,597 INFO L272 TraceCheckUtils]: 31: Hoare triple {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {9669#true} is VALID [2022-02-20 21:11:02,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {9669#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0 || ~node.offset != 0; {9669#true} is VALID [2022-02-20 21:11:02,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {9669#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8);#t~short308 := #t~mem307.base != 0 || #t~mem307.offset != 0; {9669#true} is VALID [2022-02-20 21:11:02,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {9669#true} #t~short311 := #t~short308; {9669#true} is VALID [2022-02-20 21:11:02,598 INFO L290 TraceCheckUtils]: 35: Hoare triple {9669#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, 8 + #t~mem309.offset, 8);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {9669#true} is VALID [2022-02-20 21:11:02,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {9669#true} #res := (if 0 == (if #t~short311 then 1 else 0) then 0 else 1);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {9669#true} is VALID [2022-02-20 21:11:02,598 INFO L290 TraceCheckUtils]: 37: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,599 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {9669#true} {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} #242#return; {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} is VALID [2022-02-20 21:11:02,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {9742#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (and (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|))))} assume !(0 == aws_linked_list_is_valid_deep_#t~ret317#1 % 256);havoc aws_linked_list_is_valid_deep_#t~ret317#1;call aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset := read~$Pointer$(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, 8);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset;havoc aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset; {9750#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))} is VALID [2022-02-20 21:11:02,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {9750#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0); {9750#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))} is VALID [2022-02-20 21:11:02,601 INFO L290 TraceCheckUtils]: 41: Hoare triple {9750#(and (or (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (or (not (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| 0)) (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))} assume aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == 16 + aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 1; {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} is VALID [2022-02-20 21:11:02,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} is VALID [2022-02-20 21:11:02,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} is VALID [2022-02-20 21:11:02,603 INFO L290 TraceCheckUtils]: 44: Hoare triple {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} assume true; {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} is VALID [2022-02-20 21:11:02,604 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {9751#(or (<= 16 (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#in~list#1.offset|)) (not (= |aws_linked_list_is_valid_#in~list#1.offset| 0)))} {9682#(and (= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| 0) (<= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|) |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset|) 0))} #212#return; {9670#false} is VALID [2022-02-20 21:11:02,604 INFO L272 TraceCheckUtils]: 46: Hoare triple {9670#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {9669#true} is VALID [2022-02-20 21:11:02,604 INFO L290 TraceCheckUtils]: 47: Hoare triple {9669#true} ~cond := #in~cond; {9669#true} is VALID [2022-02-20 21:11:02,604 INFO L290 TraceCheckUtils]: 48: Hoare triple {9669#true} assume !(0 == ~cond % 256); {9669#true} is VALID [2022-02-20 21:11:02,604 INFO L290 TraceCheckUtils]: 49: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,604 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9669#true} {9670#false} #214#return; {9670#false} is VALID [2022-02-20 21:11:02,604 INFO L290 TraceCheckUtils]: 51: Hoare triple {9670#false} havoc aws_linked_list_push_back_#t~ret386#1; {9670#false} is VALID [2022-02-20 21:11:02,604 INFO L272 TraceCheckUtils]: 52: Hoare triple {9670#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_back_~node#1.base != 0 || aws_linked_list_push_back_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {9669#true} is VALID [2022-02-20 21:11:02,605 INFO L290 TraceCheckUtils]: 53: Hoare triple {9669#true} ~cond := #in~cond; {9669#true} is VALID [2022-02-20 21:11:02,605 INFO L290 TraceCheckUtils]: 54: Hoare triple {9669#true} assume !(0 == ~cond % 256); {9669#true} is VALID [2022-02-20 21:11:02,605 INFO L290 TraceCheckUtils]: 55: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,605 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {9669#true} {9670#false} #216#return; {9670#false} is VALID [2022-02-20 21:11:02,605 INFO L272 TraceCheckUtils]: 57: Hoare triple {9670#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, 16 + aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {9670#false} is VALID [2022-02-20 21:11:02,605 INFO L290 TraceCheckUtils]: 58: Hoare triple {9670#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {9670#false} is VALID [2022-02-20 21:11:02,605 INFO L272 TraceCheckUtils]: 59: Hoare triple {9670#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {9669#true} is VALID [2022-02-20 21:11:02,606 INFO L290 TraceCheckUtils]: 60: Hoare triple {9669#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {9669#true} is VALID [2022-02-20 21:11:02,606 INFO L290 TraceCheckUtils]: 61: Hoare triple {9669#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {9669#true} is VALID [2022-02-20 21:11:02,606 INFO L290 TraceCheckUtils]: 62: Hoare triple {9669#true} #t~short316 := #t~short313; {9669#true} is VALID [2022-02-20 21:11:02,606 INFO L290 TraceCheckUtils]: 63: Hoare triple {9669#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {9669#true} is VALID [2022-02-20 21:11:02,606 INFO L290 TraceCheckUtils]: 64: Hoare triple {9669#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {9669#true} is VALID [2022-02-20 21:11:02,606 INFO L290 TraceCheckUtils]: 65: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,606 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {9669#true} {9670#false} #188#return; {9670#false} is VALID [2022-02-20 21:11:02,606 INFO L272 TraceCheckUtils]: 67: Hoare triple {9670#false} call assume_abort_if_not(#t~ret370); {9669#true} is VALID [2022-02-20 21:11:02,607 INFO L290 TraceCheckUtils]: 68: Hoare triple {9669#true} ~cond := #in~cond; {9669#true} is VALID [2022-02-20 21:11:02,607 INFO L290 TraceCheckUtils]: 69: Hoare triple {9669#true} assume !(0 == ~cond % 256); {9669#true} is VALID [2022-02-20 21:11:02,607 INFO L290 TraceCheckUtils]: 70: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,607 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {9669#true} {9670#false} #190#return; {9670#false} is VALID [2022-02-20 21:11:02,607 INFO L290 TraceCheckUtils]: 72: Hoare triple {9670#false} havoc #t~ret370; {9670#false} is VALID [2022-02-20 21:11:02,607 INFO L272 TraceCheckUtils]: 73: Hoare triple {9670#false} call assume_abort_if_not((if 0 == (if ~to_add.base != 0 || ~to_add.offset != 0 then 1 else 0) then 0 else 1)); {9669#true} is VALID [2022-02-20 21:11:02,607 INFO L290 TraceCheckUtils]: 74: Hoare triple {9669#true} ~cond := #in~cond; {9669#true} is VALID [2022-02-20 21:11:02,608 INFO L290 TraceCheckUtils]: 75: Hoare triple {9669#true} assume !(0 == ~cond % 256); {9669#true} is VALID [2022-02-20 21:11:02,608 INFO L290 TraceCheckUtils]: 76: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,608 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {9669#true} {9670#false} #192#return; {9670#false} is VALID [2022-02-20 21:11:02,608 INFO L290 TraceCheckUtils]: 78: Hoare triple {9670#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, 8 + ~to_add.offset, 8);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, 8 + ~before.offset, 8);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, 8 + ~before.offset, 8); {9670#false} is VALID [2022-02-20 21:11:02,608 INFO L272 TraceCheckUtils]: 79: Hoare triple {9670#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {9669#true} is VALID [2022-02-20 21:11:02,608 INFO L290 TraceCheckUtils]: 80: Hoare triple {9669#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {9669#true} is VALID [2022-02-20 21:11:02,608 INFO L290 TraceCheckUtils]: 81: Hoare triple {9669#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);#t~short313 := #t~mem312.base != 0 || #t~mem312.offset != 0; {9669#true} is VALID [2022-02-20 21:11:02,608 INFO L290 TraceCheckUtils]: 82: Hoare triple {9669#true} #t~short316 := #t~short313; {9669#true} is VALID [2022-02-20 21:11:02,609 INFO L290 TraceCheckUtils]: 83: Hoare triple {9669#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, 8 + ~node.offset, 8);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {9669#true} is VALID [2022-02-20 21:11:02,609 INFO L290 TraceCheckUtils]: 84: Hoare triple {9669#true} #res := (if 0 == (if #t~short316 then 1 else 0) then 0 else 1);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {9669#true} is VALID [2022-02-20 21:11:02,609 INFO L290 TraceCheckUtils]: 85: Hoare triple {9669#true} assume true; {9669#true} is VALID [2022-02-20 21:11:02,609 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9669#true} {9670#false} #194#return; {9670#false} is VALID [2022-02-20 21:11:02,609 INFO L272 TraceCheckUtils]: 87: Hoare triple {9670#false} call __VERIFIER_assert(#t~ret373); {9670#false} is VALID [2022-02-20 21:11:02,609 INFO L290 TraceCheckUtils]: 88: Hoare triple {9670#false} ~cond := #in~cond; {9670#false} is VALID [2022-02-20 21:11:02,609 INFO L290 TraceCheckUtils]: 89: Hoare triple {9670#false} assume 0 == ~cond % 256; {9670#false} is VALID [2022-02-20 21:11:02,609 INFO L290 TraceCheckUtils]: 90: Hoare triple {9670#false} assume !false; {9670#false} is VALID [2022-02-20 21:11:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 21:11:02,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:11:02,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656781746] [2022-02-20 21:11:02,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656781746] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:11:02,611 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411486571] [2022-02-20 21:11:02,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:11:02,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:11:02,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:11:02,616 INFO L229 MonitoredProcess]: Starting monitored process 5 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:11:02,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 21:11:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:03,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 71 conjunts are in the unsatisfiable core [2022-02-20 21:11:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:03,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:11:03,232 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:11:03,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 21:11:03,239 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 21:11:03,326 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 21:11:03,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 21:11:03,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:11:03,547 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_33| 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:124) 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:11:03,551 INFO L158 Benchmark]: Toolchain (without parser) took 24232.70ms. Allocated memory was 96.5MB in the beginning and 314.6MB in the end (delta: 218.1MB). Free memory was 71.7MB in the beginning and 224.5MB in the end (delta: -152.7MB). Peak memory consumption was 66.5MB. Max. memory is 16.1GB. [2022-02-20 21:11:03,551 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 79.7MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 21:11:03,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1445.80ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 71.7MB in the beginning and 76.7MB in the end (delta: -4.9MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2022-02-20 21:11:03,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.53ms. Allocated memory is still 121.6MB. Free memory was 76.7MB in the beginning and 70.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 21:11:03,552 INFO L158 Benchmark]: Boogie Preprocessor took 58.24ms. Allocated memory is still 121.6MB. Free memory was 70.4MB in the beginning and 66.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 21:11:03,552 INFO L158 Benchmark]: RCFGBuilder took 624.55ms. Allocated memory is still 121.6MB. Free memory was 66.9MB in the beginning and 74.5MB in the end (delta: -7.6MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2022-02-20 21:11:03,552 INFO L158 Benchmark]: TraceAbstraction took 21985.95ms. Allocated memory was 121.6MB in the beginning and 314.6MB in the end (delta: 192.9MB). Free memory was 73.7MB in the beginning and 224.5MB in the end (delta: -150.8MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2022-02-20 21:11:03,553 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.14ms. Allocated memory is still 79.7MB. Free memory is still 61.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1445.80ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 71.7MB in the beginning and 76.7MB in the end (delta: -4.9MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.53ms. Allocated memory is still 121.6MB. Free memory was 76.7MB in the beginning and 70.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.24ms. Allocated memory is still 121.6MB. Free memory was 70.4MB in the beginning and 66.9MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 624.55ms. Allocated memory is still 121.6MB. Free memory was 66.9MB in the beginning and 74.5MB in the end (delta: -7.6MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21985.95ms. Allocated memory was 121.6MB in the beginning and 314.6MB in the end (delta: 192.9MB). Free memory was 73.7MB in the beginning and 224.5MB in the end (delta: -150.8MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_33| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_33|: 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:11:03,580 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_push_back_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 d155cc00d5c2ba6f5ef1d5e883c6d133605de01ed97e4300960f893025d81fd1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:11:05,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:11:05,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:11:05,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:11:05,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:11:05,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:11:05,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:11:05,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:11:05,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:11:05,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:11:05,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:11:05,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:11:05,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:11:05,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:11:05,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:11:05,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:11:05,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:11:05,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:11:05,689 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:11:05,694 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:11:05,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:11:05,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:11:05,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:11:05,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:11:05,702 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:11:05,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:11:05,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:11:05,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:11:05,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:11:05,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:11:05,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:11:05,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:11:05,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:11:05,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:11:05,708 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:11:05,708 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:11:05,709 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:11:05,709 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:11:05,709 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:11:05,710 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:11:05,711 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:11:05,714 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:11:05,742 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:11:05,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:11:05,743 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:11:05,743 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:11:05,744 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:11:05,744 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:11:05,745 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:11:05,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:11:05,745 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:11:05,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:11:05,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:11:05,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:11:05,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:11:05,747 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:11:05,747 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 21:11:05,747 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 21:11:05,747 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 21:11:05,747 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:11:05,747 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:11:05,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:11:05,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:11:05,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:11:05,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:11:05,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:11:05,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:11:05,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:11:05,748 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:11:05,754 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 21:11:05,755 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 21:11:05,755 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:11:05,755 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:11:05,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:11:05,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 21:11:05,756 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 -> d155cc00d5c2ba6f5ef1d5e883c6d133605de01ed97e4300960f893025d81fd1 [2022-02-20 21:11:06,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:11:06,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:11:06,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:11:06,048 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:11:06,049 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:11:06,050 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_push_back_harness.i [2022-02-20 21:11:06,090 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e5ed4d28/7c19a85f80654178ad4d76eb75017ca9/FLAG9f756534e [2022-02-20 21:11:06,760 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:11:06,761 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_push_back_harness.i [2022-02-20 21:11:06,787 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e5ed4d28/7c19a85f80654178ad4d76eb75017ca9/FLAG9f756534e [2022-02-20 21:11:07,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e5ed4d28/7c19a85f80654178ad4d76eb75017ca9 [2022-02-20 21:11:07,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:11:07,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:11:07,095 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:11:07,095 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:11:07,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:11:07,098 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:11:07" (1/1) ... [2022-02-20 21:11:07,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bfcda72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:11:07, skipping insertion in model container [2022-02-20 21:11:07,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:11:07" (1/1) ... [2022-02-20 21:11:07,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:11:07,166 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:11:07,400 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_push_back_harness.i[4499,4512] [2022-02-20 21:11:07,405 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_push_back_harness.i[4559,4572] [2022-02-20 21:11:07,932 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:07,932 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:07,933 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:07,933 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:07,939 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:07,966 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:07,967 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:07,968 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:07,969 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:07,970 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:07,970 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:07,971 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:07,971 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,160 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:11:08,161 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:11:08,162 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:11:08,162 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:11:08,163 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:11:08,164 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:11:08,164 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:11:08,165 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:11:08,172 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:11:08,173 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:11:08,253 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:11:08,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:11:08,290 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 21:11:08,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:11:08,324 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_push_back_harness.i[4499,4512] [2022-02-20 21:11:08,324 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_push_back_harness.i[4559,4572] [2022-02-20 21:11:08,380 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,390 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,390 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,390 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,391 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,394 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,397 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,398 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,400 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,400 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,402 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,402 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,402 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,428 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:11:08,429 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:11:08,429 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:11:08,431 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:11:08,441 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:11:08,442 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:11:08,442 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:11:08,442 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:11:08,443 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:11:08,443 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:11:08,460 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:11:08,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:11:08,484 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:11:08,500 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_push_back_harness.i[4499,4512] [2022-02-20 21:11:08,501 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_push_back_harness.i[4559,4572] [2022-02-20 21:11:08,546 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,546 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,546 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,547 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,547 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,553 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,554 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,555 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,555 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,556 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,556 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,557 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,557 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:11:08,593 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:11:08,593 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:11:08,594 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:11:08,595 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:11:08,596 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:11:08,596 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:11:08,596 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:11:08,597 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:11:08,597 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:11:08,597 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:11:08,621 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:11:08,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:11:08,846 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:11:08,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:11:08 WrapperNode [2022-02-20 21:11:08,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:11:08,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:11:08,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:11:08,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:11:08,853 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:11:08" (1/1) ... [2022-02-20 21:11:08,919 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:11:08" (1/1) ... [2022-02-20 21:11:08,956 INFO L137 Inliner]: procedures = 698, calls = 1048, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 151 [2022-02-20 21:11:08,956 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:11:08,957 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:11:08,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:11:08,958 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:11:08,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:11:08" (1/1) ... [2022-02-20 21:11:08,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:11:08" (1/1) ... [2022-02-20 21:11:08,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:11:08" (1/1) ... [2022-02-20 21:11:08,971 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:11:08" (1/1) ... [2022-02-20 21:11:08,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:11:08" (1/1) ... [2022-02-20 21:11:09,004 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:11:08" (1/1) ... [2022-02-20 21:11:09,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:11:08" (1/1) ... [2022-02-20 21:11:09,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:11:09,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:11:09,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:11:09,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:11:09,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:11:08" (1/1) ... [2022-02-20 21:11:09,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:11:09,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:11:09,043 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:11:09,045 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:11:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:11:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 21:11:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 21:11:09,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 21:11:09,069 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-02-20 21:11:09,070 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-02-20 21:11:09,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:11:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-02-20 21:11:09,071 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-02-20 21:11:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:11:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:11:09,071 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2022-02-20 21:11:09,071 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2022-02-20 21:11:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:11:09,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:11:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:11:09,072 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:11:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:11:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:11:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:11:09,072 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-02-20 21:11:09,073 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-02-20 21:11:09,073 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-02-20 21:11:09,073 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-02-20 21:11:09,234 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:11:09,235 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:11:09,621 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:11:09,626 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:11:09,626 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 21:11:09,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:11:09 BoogieIcfgContainer [2022-02-20 21:11:09,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:11:09,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:11:09,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:11:09,631 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:11:09,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:11:07" (1/3) ... [2022-02-20 21:11:09,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329592b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:11:09, skipping insertion in model container [2022-02-20 21:11:09,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:11:08" (2/3) ... [2022-02-20 21:11:09,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@329592b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:11:09, skipping insertion in model container [2022-02-20 21:11:09,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:11:09" (3/3) ... [2022-02-20 21:11:09,633 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_back_harness.i [2022-02-20 21:11:09,636 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:11:09,636 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:11:09,687 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:11:09,702 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:11:09,702 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:11:09,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2022-02-20 21:11:09,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 21:11:09,738 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:11:09,739 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:11:09,740 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:11:09,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:11:09,746 INFO L85 PathProgramCache]: Analyzing trace with hash 524704703, now seen corresponding path program 1 times [2022-02-20 21:11:09,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:11:09,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816424767] [2022-02-20 21:11:09,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:11:09,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:11:09,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:11:09,759 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:11:09,787 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:11:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:10,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 21:11:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:10,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:11:10,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {105#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(36bv64, 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; {105#true} is VALID [2022-02-20 21:11:10,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {105#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32bv64);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16bv64);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20bv64;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {105#true} is VALID [2022-02-20 21:11:10,260 INFO L272 TraceCheckUtils]: 2: Hoare triple {105#true} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {105#true} is VALID [2022-02-20 21:11:10,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {105#true} #res := #t~nondet13;havoc #t~nondet13; {105#true} is VALID [2022-02-20 21:11:10,261 INFO L290 TraceCheckUtils]: 4: Hoare triple {105#true} assume true; {105#true} is VALID [2022-02-20 21:11:10,261 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {105#true} {105#true} #208#return; {105#true} is VALID [2022-02-20 21:11:10,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {105#true} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {105#true} is VALID [2022-02-20 21:11:10,262 INFO L272 TraceCheckUtils]: 7: Hoare triple {105#true} call assume_abort_if_not((if 0bv32 == (if ~bvule64(ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~max_length#1) then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {105#true} is VALID [2022-02-20 21:11:10,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 21:11:10,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {105#true} assume 0bv8 == ~cond;assume false; {105#true} is VALID [2022-02-20 21:11:10,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {105#true} assume true; {105#true} is VALID [2022-02-20 21:11:10,263 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {105#true} {105#true} #210#return; {105#true} is VALID [2022-02-20 21:11:10,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {105#true} call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(8bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0bv64; {105#true} is VALID [2022-02-20 21:11:10,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {105#true} assume !~bvult64(ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~length~1#1); {105#true} is VALID [2022-02-20 21:11:10,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {105#true} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8bv64);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(24bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64); {105#true} is VALID [2022-02-20 21:11:10,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {105#true} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, ~bvadd64(24bv64, aws_linked_list_push_back_harness_~#list~0#1.offset), 8bv64);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {105#true} is VALID [2022-02-20 21:11:10,264 INFO L272 TraceCheckUtils]: 16: Hoare triple {105#true} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {105#true} is VALID [2022-02-20 21:11:10,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {105#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0bv64 || ~list#1.offset != 0bv64; {105#true} is VALID [2022-02-20 21:11:10,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {105#true} assume !#t~short299#1; {105#true} is VALID [2022-02-20 21:11:10,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {105#true} #t~short301#1 := #t~short299#1; {105#true} is VALID [2022-02-20 21:11:10,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {105#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(8bv64, ~list#1.offset), 8bv64);#t~short301#1 := #t~mem300#1.base == 0bv64 && #t~mem300#1.offset == 0bv64; {105#true} is VALID [2022-02-20 21:11:10,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {105#true} #t~short303#1 := #t~short301#1; {105#true} is VALID [2022-02-20 21:11:10,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {105#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(24bv64, ~list#1.offset), 8bv64);#t~short303#1 := #t~mem302#1.base != 0bv64 || #t~mem302#1.offset != 0bv64; {105#true} is VALID [2022-02-20 21:11:10,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {105#true} #t~short305#1 := #t~short303#1; {105#true} is VALID [2022-02-20 21:11:10,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {105#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(16bv64, ~list#1.offset), 8bv64);#t~short305#1 := #t~mem304#1.base == 0bv64 && #t~mem304#1.offset == 0bv64; {105#true} is VALID [2022-02-20 21:11:10,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {105#true} assume !#t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;#res#1 := 0bv8; {105#true} is VALID [2022-02-20 21:11:10,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {105#true} assume true; {105#true} is VALID [2022-02-20 21:11:10,267 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {105#true} {105#true} #212#return; {105#true} is VALID [2022-02-20 21:11:10,267 INFO L272 TraceCheckUtils]: 28: Hoare triple {105#true} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {105#true} is VALID [2022-02-20 21:11:10,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {105#true} ~cond := #in~cond; {105#true} is VALID [2022-02-20 21:11:10,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {105#true} assume 0bv8 == ~cond;assume false; {106#false} is VALID [2022-02-20 21:11:10,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:11:10,268 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {106#false} {105#true} #214#return; {106#false} is VALID [2022-02-20 21:11:10,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {106#false} havoc aws_linked_list_push_back_#t~ret386#1; {106#false} is VALID [2022-02-20 21:11:10,269 INFO L272 TraceCheckUtils]: 34: Hoare triple {106#false} call assume_abort_if_not((if 0bv32 == (if aws_linked_list_push_back_~node#1.base != 0bv64 || aws_linked_list_push_back_~node#1.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {106#false} is VALID [2022-02-20 21:11:10,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {106#false} ~cond := #in~cond; {106#false} is VALID [2022-02-20 21:11:10,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {106#false} assume 0bv8 == ~cond;assume false; {106#false} is VALID [2022-02-20 21:11:10,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:11:10,270 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {106#false} {106#false} #216#return; {106#false} is VALID [2022-02-20 21:11:10,270 INFO L272 TraceCheckUtils]: 39: Hoare triple {106#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, ~bvadd64(16bv64, aws_linked_list_push_back_~list#1.offset), aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {106#false} is VALID [2022-02-20 21:11:10,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {106#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {106#false} is VALID [2022-02-20 21:11:10,270 INFO L272 TraceCheckUtils]: 41: Hoare triple {106#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {106#false} is VALID [2022-02-20 21:11:10,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {106#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {106#false} is VALID [2022-02-20 21:11:10,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {106#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {106#false} is VALID [2022-02-20 21:11:10,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {106#false} #t~short316 := #t~short313; {106#false} is VALID [2022-02-20 21:11:10,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {106#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {106#false} is VALID [2022-02-20 21:11:10,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {106#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {106#false} is VALID [2022-02-20 21:11:10,272 INFO L290 TraceCheckUtils]: 47: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:11:10,274 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {106#false} {106#false} #188#return; {106#false} is VALID [2022-02-20 21:11:10,274 INFO L272 TraceCheckUtils]: 49: Hoare triple {106#false} call assume_abort_if_not(#t~ret370); {106#false} is VALID [2022-02-20 21:11:10,275 INFO L290 TraceCheckUtils]: 50: Hoare triple {106#false} ~cond := #in~cond; {106#false} is VALID [2022-02-20 21:11:10,275 INFO L290 TraceCheckUtils]: 51: Hoare triple {106#false} assume 0bv8 == ~cond;assume false; {106#false} is VALID [2022-02-20 21:11:10,275 INFO L290 TraceCheckUtils]: 52: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:11:10,275 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {106#false} {106#false} #190#return; {106#false} is VALID [2022-02-20 21:11:10,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {106#false} havoc #t~ret370; {106#false} is VALID [2022-02-20 21:11:10,276 INFO L272 TraceCheckUtils]: 55: Hoare triple {106#false} call assume_abort_if_not((if 0bv32 == (if ~to_add.base != 0bv64 || ~to_add.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {106#false} is VALID [2022-02-20 21:11:10,276 INFO L290 TraceCheckUtils]: 56: Hoare triple {106#false} ~cond := #in~cond; {106#false} is VALID [2022-02-20 21:11:10,276 INFO L290 TraceCheckUtils]: 57: Hoare triple {106#false} assume 0bv8 == ~cond;assume false; {106#false} is VALID [2022-02-20 21:11:10,276 INFO L290 TraceCheckUtils]: 58: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:11:10,276 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {106#false} {106#false} #192#return; {106#false} is VALID [2022-02-20 21:11:10,277 INFO L290 TraceCheckUtils]: 60: Hoare triple {106#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8bv64);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, ~bvadd64(8bv64, ~to_add.offset), 8bv64);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8bv64);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64); {106#false} is VALID [2022-02-20 21:11:10,277 INFO L272 TraceCheckUtils]: 61: Hoare triple {106#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {106#false} is VALID [2022-02-20 21:11:10,277 INFO L290 TraceCheckUtils]: 62: Hoare triple {106#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {106#false} is VALID [2022-02-20 21:11:10,277 INFO L290 TraceCheckUtils]: 63: Hoare triple {106#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {106#false} is VALID [2022-02-20 21:11:10,277 INFO L290 TraceCheckUtils]: 64: Hoare triple {106#false} #t~short316 := #t~short313; {106#false} is VALID [2022-02-20 21:11:10,278 INFO L290 TraceCheckUtils]: 65: Hoare triple {106#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {106#false} is VALID [2022-02-20 21:11:10,278 INFO L290 TraceCheckUtils]: 66: Hoare triple {106#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {106#false} is VALID [2022-02-20 21:11:10,278 INFO L290 TraceCheckUtils]: 67: Hoare triple {106#false} assume true; {106#false} is VALID [2022-02-20 21:11:10,278 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {106#false} {106#false} #194#return; {106#false} is VALID [2022-02-20 21:11:10,278 INFO L272 TraceCheckUtils]: 69: Hoare triple {106#false} call __VERIFIER_assert(#t~ret373); {106#false} is VALID [2022-02-20 21:11:10,278 INFO L290 TraceCheckUtils]: 70: Hoare triple {106#false} ~cond := #in~cond; {106#false} is VALID [2022-02-20 21:11:10,279 INFO L290 TraceCheckUtils]: 71: Hoare triple {106#false} assume 0bv8 == ~cond; {106#false} is VALID [2022-02-20 21:11:10,279 INFO L290 TraceCheckUtils]: 72: Hoare triple {106#false} assume !false; {106#false} is VALID [2022-02-20 21:11:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-02-20 21:11:10,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:11:10,280 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:11:10,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816424767] [2022-02-20 21:11:10,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816424767] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:11:10,281 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:11:10,281 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 21:11:10,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129012912] [2022-02-20 21:11:10,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:11:10,286 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2022-02-20 21:11:10,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:11:10,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:11:10,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:10,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 21:11:10,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:11:10,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 21:11:10,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 21:11:10,387 INFO L87 Difference]: Start difference. First operand has 102 states, 65 states have (on average 1.2923076923076924) internal successors, (84), 66 states have internal predecessors, (84), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:11:10,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:10,692 INFO L93 Difference]: Finished difference Result 196 states and 291 transitions. [2022-02-20 21:11:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 21:11:10,693 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2022-02-20 21:11:10,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:11:10,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:11:10,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions. [2022-02-20 21:11:10,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:11:10,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions. [2022-02-20 21:11:10,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 291 transitions. [2022-02-20 21:11:11,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:11,017 INFO L225 Difference]: With dead ends: 196 [2022-02-20 21:11:11,019 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 21:11:11,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 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:11:11,028 INFO L933 BasicCegarLoop]: 136 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, 136 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:11:11,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:11:11,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 21:11:11,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-02-20 21:11:11,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:11:11,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 62 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:11:11,061 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 62 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:11:11,064 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 62 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:11:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:11,080 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2022-02-20 21:11:11,080 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2022-02-20 21:11:11,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:11,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:11,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 62 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 97 states. [2022-02-20 21:11:11,087 INFO L87 Difference]: Start difference. First operand has 97 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 62 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 97 states. [2022-02-20 21:11:11,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:11,094 INFO L93 Difference]: Finished difference Result 97 states and 131 transitions. [2022-02-20 21:11:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2022-02-20 21:11:11,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:11,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:11,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:11:11,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:11:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 62 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:11:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2022-02-20 21:11:11,106 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 73 [2022-02-20 21:11:11,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:11:11,106 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2022-02-20 21:11:11,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 21:11:11,107 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2022-02-20 21:11:11,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 21:11:11,109 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:11:11,110 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:11:11,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 21:11:11,325 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:11:11,325 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:11:11,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:11:11,326 INFO L85 PathProgramCache]: Analyzing trace with hash -569763587, now seen corresponding path program 1 times [2022-02-20 21:11:11,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:11:11,326 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205128086] [2022-02-20 21:11:11,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:11:11,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:11:11,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:11:11,332 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:11:11,333 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:11:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:11,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 21:11:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:11,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:11:11,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {925#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(36bv64, 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; {925#true} is VALID [2022-02-20 21:11:11,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {925#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32bv64);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16bv64);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20bv64;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:11,908 INFO L272 TraceCheckUtils]: 2: Hoare triple {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {925#true} is VALID [2022-02-20 21:11:11,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {925#true} #res := #t~nondet13;havoc #t~nondet13; {925#true} is VALID [2022-02-20 21:11:11,908 INFO L290 TraceCheckUtils]: 4: Hoare triple {925#true} assume true; {925#true} is VALID [2022-02-20 21:11:11,909 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {925#true} {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} #208#return; {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:11,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:11,909 INFO L272 TraceCheckUtils]: 7: Hoare triple {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} call assume_abort_if_not((if 0bv32 == (if ~bvule64(ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~max_length#1) then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {925#true} is VALID [2022-02-20 21:11:11,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {925#true} ~cond := #in~cond; {925#true} is VALID [2022-02-20 21:11:11,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {925#true} assume !(0bv8 == ~cond); {925#true} is VALID [2022-02-20 21:11:11,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {925#true} assume true; {925#true} is VALID [2022-02-20 21:11:11,911 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {925#true} {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} #210#return; {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:11,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(8bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0bv64; {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:11,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} assume !~bvult64(ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~length~1#1); {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:11,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8bv64);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(24bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64); {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:11,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {933#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, ~bvadd64(24bv64, aws_linked_list_push_back_harness_~#list~0#1.offset), 8bv64);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {976#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} is VALID [2022-02-20 21:11:11,913 INFO L272 TraceCheckUtils]: 16: Hoare triple {976#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {925#true} is VALID [2022-02-20 21:11:11,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {925#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0bv64 || ~list#1.offset != 0bv64; {983#(or (= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#t~short299#1|)} is VALID [2022-02-20 21:11:11,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {983#(or (= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_#t~short299#1|)} assume !#t~short299#1; {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:11,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} #t~short301#1 := #t~short299#1; {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:11,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(8bv64, ~list#1.offset), 8bv64);#t~short301#1 := #t~mem300#1.base == 0bv64 && #t~mem300#1.offset == 0bv64; {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:11,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} #t~short303#1 := #t~short301#1; {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:11,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(24bv64, ~list#1.offset), 8bv64);#t~short303#1 := #t~mem302#1.base != 0bv64 || #t~mem302#1.offset != 0bv64; {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:11,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} #t~short305#1 := #t~short303#1; {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:11,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(16bv64, ~list#1.offset), 8bv64);#t~short305#1 := #t~mem304#1.base == 0bv64 && #t~mem304#1.offset == 0bv64; {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:11,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} assume !#t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;#res#1 := 0bv8; {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:11,917 INFO L290 TraceCheckUtils]: 26: Hoare triple {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} assume true; {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:11,917 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {987#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} {976#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} #212#return; {926#false} is VALID [2022-02-20 21:11:11,918 INFO L272 TraceCheckUtils]: 28: Hoare triple {926#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {926#false} is VALID [2022-02-20 21:11:11,918 INFO L290 TraceCheckUtils]: 29: Hoare triple {926#false} ~cond := #in~cond; {926#false} is VALID [2022-02-20 21:11:11,918 INFO L290 TraceCheckUtils]: 30: Hoare triple {926#false} assume !(0bv8 == ~cond); {926#false} is VALID [2022-02-20 21:11:11,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {926#false} assume true; {926#false} is VALID [2022-02-20 21:11:11,918 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {926#false} {926#false} #214#return; {926#false} is VALID [2022-02-20 21:11:11,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {926#false} havoc aws_linked_list_push_back_#t~ret386#1; {926#false} is VALID [2022-02-20 21:11:11,918 INFO L272 TraceCheckUtils]: 34: Hoare triple {926#false} call assume_abort_if_not((if 0bv32 == (if aws_linked_list_push_back_~node#1.base != 0bv64 || aws_linked_list_push_back_~node#1.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {926#false} is VALID [2022-02-20 21:11:11,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {926#false} ~cond := #in~cond; {926#false} is VALID [2022-02-20 21:11:11,919 INFO L290 TraceCheckUtils]: 36: Hoare triple {926#false} assume !(0bv8 == ~cond); {926#false} is VALID [2022-02-20 21:11:11,919 INFO L290 TraceCheckUtils]: 37: Hoare triple {926#false} assume true; {926#false} is VALID [2022-02-20 21:11:11,919 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {926#false} {926#false} #216#return; {926#false} is VALID [2022-02-20 21:11:11,919 INFO L272 TraceCheckUtils]: 39: Hoare triple {926#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, ~bvadd64(16bv64, aws_linked_list_push_back_~list#1.offset), aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {926#false} is VALID [2022-02-20 21:11:11,919 INFO L290 TraceCheckUtils]: 40: Hoare triple {926#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {926#false} is VALID [2022-02-20 21:11:11,920 INFO L272 TraceCheckUtils]: 41: Hoare triple {926#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {926#false} is VALID [2022-02-20 21:11:11,920 INFO L290 TraceCheckUtils]: 42: Hoare triple {926#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {926#false} is VALID [2022-02-20 21:11:11,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {926#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {926#false} is VALID [2022-02-20 21:11:11,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {926#false} #t~short316 := #t~short313; {926#false} is VALID [2022-02-20 21:11:11,920 INFO L290 TraceCheckUtils]: 45: Hoare triple {926#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {926#false} is VALID [2022-02-20 21:11:11,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {926#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {926#false} is VALID [2022-02-20 21:11:11,920 INFO L290 TraceCheckUtils]: 47: Hoare triple {926#false} assume true; {926#false} is VALID [2022-02-20 21:11:11,921 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {926#false} {926#false} #188#return; {926#false} is VALID [2022-02-20 21:11:11,921 INFO L272 TraceCheckUtils]: 49: Hoare triple {926#false} call assume_abort_if_not(#t~ret370); {926#false} is VALID [2022-02-20 21:11:11,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {926#false} ~cond := #in~cond; {926#false} is VALID [2022-02-20 21:11:11,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {926#false} assume !(0bv8 == ~cond); {926#false} is VALID [2022-02-20 21:11:11,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {926#false} assume true; {926#false} is VALID [2022-02-20 21:11:11,921 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {926#false} {926#false} #190#return; {926#false} is VALID [2022-02-20 21:11:11,921 INFO L290 TraceCheckUtils]: 54: Hoare triple {926#false} havoc #t~ret370; {926#false} is VALID [2022-02-20 21:11:11,922 INFO L272 TraceCheckUtils]: 55: Hoare triple {926#false} call assume_abort_if_not((if 0bv32 == (if ~to_add.base != 0bv64 || ~to_add.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {926#false} is VALID [2022-02-20 21:11:11,922 INFO L290 TraceCheckUtils]: 56: Hoare triple {926#false} ~cond := #in~cond; {926#false} is VALID [2022-02-20 21:11:11,922 INFO L290 TraceCheckUtils]: 57: Hoare triple {926#false} assume !(0bv8 == ~cond); {926#false} is VALID [2022-02-20 21:11:11,922 INFO L290 TraceCheckUtils]: 58: Hoare triple {926#false} assume true; {926#false} is VALID [2022-02-20 21:11:11,922 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {926#false} {926#false} #192#return; {926#false} is VALID [2022-02-20 21:11:11,922 INFO L290 TraceCheckUtils]: 60: Hoare triple {926#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8bv64);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, ~bvadd64(8bv64, ~to_add.offset), 8bv64);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8bv64);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64); {926#false} is VALID [2022-02-20 21:11:11,922 INFO L272 TraceCheckUtils]: 61: Hoare triple {926#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {926#false} is VALID [2022-02-20 21:11:11,922 INFO L290 TraceCheckUtils]: 62: Hoare triple {926#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {926#false} is VALID [2022-02-20 21:11:11,923 INFO L290 TraceCheckUtils]: 63: Hoare triple {926#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {926#false} is VALID [2022-02-20 21:11:11,923 INFO L290 TraceCheckUtils]: 64: Hoare triple {926#false} #t~short316 := #t~short313; {926#false} is VALID [2022-02-20 21:11:11,923 INFO L290 TraceCheckUtils]: 65: Hoare triple {926#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {926#false} is VALID [2022-02-20 21:11:11,923 INFO L290 TraceCheckUtils]: 66: Hoare triple {926#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {926#false} is VALID [2022-02-20 21:11:11,923 INFO L290 TraceCheckUtils]: 67: Hoare triple {926#false} assume true; {926#false} is VALID [2022-02-20 21:11:11,923 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {926#false} {926#false} #194#return; {926#false} is VALID [2022-02-20 21:11:11,923 INFO L272 TraceCheckUtils]: 69: Hoare triple {926#false} call __VERIFIER_assert(#t~ret373); {926#false} is VALID [2022-02-20 21:11:11,924 INFO L290 TraceCheckUtils]: 70: Hoare triple {926#false} ~cond := #in~cond; {926#false} is VALID [2022-02-20 21:11:11,924 INFO L290 TraceCheckUtils]: 71: Hoare triple {926#false} assume 0bv8 == ~cond; {926#false} is VALID [2022-02-20 21:11:11,924 INFO L290 TraceCheckUtils]: 72: Hoare triple {926#false} assume !false; {926#false} is VALID [2022-02-20 21:11:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-02-20 21:11:11,924 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:11:11,925 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:11:11,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205128086] [2022-02-20 21:11:11,925 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205128086] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:11:11,925 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:11:11,925 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:11:11,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030774863] [2022-02-20 21:11:11,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:11:11,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-02-20 21:11:11,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:11:11,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:12,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:12,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:11:12,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:11:12,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:11:12,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:11:12,009 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:12,993 INFO L93 Difference]: Finished difference Result 196 states and 272 transitions. [2022-02-20 21:11:12,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 21:11:12,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-02-20 21:11:12,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:11:12,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 272 transitions. [2022-02-20 21:11:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:13,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 272 transitions. [2022-02-20 21:11:13,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 272 transitions. [2022-02-20 21:11:13,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:13,269 INFO L225 Difference]: With dead ends: 196 [2022-02-20 21:11:13,270 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 21:11:13,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:11:13,271 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 56 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:11:13,271 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 457 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 21:11:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 21:11:13,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-02-20 21:11:13,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:11:13,287 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 97 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 62 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:11:13,287 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 97 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 62 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:11:13,288 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 97 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 62 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:11:13,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:13,292 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2022-02-20 21:11:13,293 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions. [2022-02-20 21:11:13,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:13,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:13,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 62 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 97 states. [2022-02-20 21:11:13,294 INFO L87 Difference]: Start difference. First operand has 97 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 62 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand 97 states. [2022-02-20 21:11:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:13,297 INFO L93 Difference]: Finished difference Result 97 states and 130 transitions. [2022-02-20 21:11:13,297 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions. [2022-02-20 21:11:13,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:13,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:13,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:11:13,298 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:11:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 62 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 21:11:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 130 transitions. [2022-02-20 21:11:13,301 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 130 transitions. Word has length 73 [2022-02-20 21:11:13,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:11:13,301 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 130 transitions. [2022-02-20 21:11:13,301 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 130 transitions. [2022-02-20 21:11:13,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 21:11:13,302 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:11:13,302 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:11:13,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 21:11:13,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 21:11:13,530 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:11:13,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:11:13,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1956548997, now seen corresponding path program 1 times [2022-02-20 21:11:13,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:11:13,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933238643] [2022-02-20 21:11:13,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:11:13,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:11:13,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:11:13,535 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:11:13,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 21:11:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:13,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 21:11:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:13,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:11:14,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {1750#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(36bv64, 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; {1750#true} is VALID [2022-02-20 21:11:14,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {1750#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32bv64);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16bv64);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20bv64;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {1750#true} is VALID [2022-02-20 21:11:14,061 INFO L272 TraceCheckUtils]: 2: Hoare triple {1750#true} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {1750#true} is VALID [2022-02-20 21:11:14,061 INFO L290 TraceCheckUtils]: 3: Hoare triple {1750#true} #res := #t~nondet13;havoc #t~nondet13; {1750#true} is VALID [2022-02-20 21:11:14,061 INFO L290 TraceCheckUtils]: 4: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 21:11:14,061 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1750#true} {1750#true} #208#return; {1750#true} is VALID [2022-02-20 21:11:14,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {1750#true} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {1750#true} is VALID [2022-02-20 21:11:14,061 INFO L272 TraceCheckUtils]: 7: Hoare triple {1750#true} call assume_abort_if_not((if 0bv32 == (if ~bvule64(ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~max_length#1) then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {1750#true} is VALID [2022-02-20 21:11:14,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {1750#true} ~cond := #in~cond; {1750#true} is VALID [2022-02-20 21:11:14,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {1750#true} assume !(0bv8 == ~cond); {1750#true} is VALID [2022-02-20 21:11:14,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {1750#true} assume true; {1750#true} is VALID [2022-02-20 21:11:14,062 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1750#true} {1750#true} #210#return; {1750#true} is VALID [2022-02-20 21:11:14,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {1750#true} call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(8bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0bv64; {1750#true} is VALID [2022-02-20 21:11:14,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {1750#true} assume !~bvult64(ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~length~1#1); {1750#true} is VALID [2022-02-20 21:11:14,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {1750#true} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8bv64);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(24bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64); {1750#true} is VALID [2022-02-20 21:11:14,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {1750#true} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, ~bvadd64(24bv64, aws_linked_list_push_back_harness_~#list~0#1.offset), 8bv64);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {1750#true} is VALID [2022-02-20 21:11:14,062 INFO L272 TraceCheckUtils]: 16: Hoare triple {1750#true} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {1750#true} is VALID [2022-02-20 21:11:14,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {1750#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0bv64 || ~list#1.offset != 0bv64; {1750#true} is VALID [2022-02-20 21:11:14,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {1750#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8bv64);#t~short299#1 := #t~mem298#1.base != 0bv64 || #t~mem298#1.offset != 0bv64; {1750#true} is VALID [2022-02-20 21:11:14,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {1750#true} #t~short301#1 := #t~short299#1; {1750#true} is VALID [2022-02-20 21:11:14,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {1750#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(8bv64, ~list#1.offset), 8bv64);#t~short301#1 := #t~mem300#1.base == 0bv64 && #t~mem300#1.offset == 0bv64; {1750#true} is VALID [2022-02-20 21:11:14,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {1750#true} #t~short303#1 := #t~short301#1; {1750#true} is VALID [2022-02-20 21:11:14,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {1750#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(24bv64, ~list#1.offset), 8bv64);#t~short303#1 := #t~mem302#1.base != 0bv64 || #t~mem302#1.offset != 0bv64; {1750#true} is VALID [2022-02-20 21:11:14,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {1750#true} #t~short305#1 := #t~short303#1; {1750#true} is VALID [2022-02-20 21:11:14,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {1750#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(16bv64, ~list#1.offset), 8bv64);#t~short305#1 := #t~mem304#1.base == 0bv64 && #t~mem304#1.offset == 0bv64; {1750#true} is VALID [2022-02-20 21:11:14,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {1750#true} assume !#t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;#res#1 := 0bv8; {1830#(= |aws_linked_list_is_valid_#res#1| (_ bv0 8))} is VALID [2022-02-20 21:11:14,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {1830#(= |aws_linked_list_is_valid_#res#1| (_ bv0 8))} assume true; {1830#(= |aws_linked_list_is_valid_#res#1| (_ bv0 8))} is VALID [2022-02-20 21:11:14,072 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1830#(= |aws_linked_list_is_valid_#res#1| (_ bv0 8))} {1750#true} #212#return; {1837#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| (_ bv0 8))} is VALID [2022-02-20 21:11:14,073 INFO L272 TraceCheckUtils]: 28: Hoare triple {1837#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| (_ bv0 8))} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {1750#true} is VALID [2022-02-20 21:11:14,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {1750#true} ~cond := #in~cond; {1844#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 21:11:14,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {1844#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv8 == ~cond); {1848#(not (= |assume_abort_if_not_#in~cond| (_ bv0 8)))} is VALID [2022-02-20 21:11:14,074 INFO L290 TraceCheckUtils]: 31: Hoare triple {1848#(not (= |assume_abort_if_not_#in~cond| (_ bv0 8)))} assume true; {1848#(not (= |assume_abort_if_not_#in~cond| (_ bv0 8)))} is VALID [2022-02-20 21:11:14,074 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1848#(not (= |assume_abort_if_not_#in~cond| (_ bv0 8)))} {1837#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| (_ bv0 8))} #214#return; {1751#false} is VALID [2022-02-20 21:11:14,074 INFO L290 TraceCheckUtils]: 33: Hoare triple {1751#false} havoc aws_linked_list_push_back_#t~ret386#1; {1751#false} is VALID [2022-02-20 21:11:14,074 INFO L272 TraceCheckUtils]: 34: Hoare triple {1751#false} call assume_abort_if_not((if 0bv32 == (if aws_linked_list_push_back_~node#1.base != 0bv64 || aws_linked_list_push_back_~node#1.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {1751#false} is VALID [2022-02-20 21:11:14,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {1751#false} ~cond := #in~cond; {1751#false} is VALID [2022-02-20 21:11:14,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {1751#false} assume !(0bv8 == ~cond); {1751#false} is VALID [2022-02-20 21:11:14,075 INFO L290 TraceCheckUtils]: 37: Hoare triple {1751#false} assume true; {1751#false} is VALID [2022-02-20 21:11:14,075 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1751#false} {1751#false} #216#return; {1751#false} is VALID [2022-02-20 21:11:14,075 INFO L272 TraceCheckUtils]: 39: Hoare triple {1751#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, ~bvadd64(16bv64, aws_linked_list_push_back_~list#1.offset), aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {1751#false} is VALID [2022-02-20 21:11:14,075 INFO L290 TraceCheckUtils]: 40: Hoare triple {1751#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {1751#false} is VALID [2022-02-20 21:11:14,075 INFO L272 TraceCheckUtils]: 41: Hoare triple {1751#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {1751#false} is VALID [2022-02-20 21:11:14,075 INFO L290 TraceCheckUtils]: 42: Hoare triple {1751#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {1751#false} is VALID [2022-02-20 21:11:14,075 INFO L290 TraceCheckUtils]: 43: Hoare triple {1751#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {1751#false} is VALID [2022-02-20 21:11:14,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {1751#false} #t~short316 := #t~short313; {1751#false} is VALID [2022-02-20 21:11:14,076 INFO L290 TraceCheckUtils]: 45: Hoare triple {1751#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {1751#false} is VALID [2022-02-20 21:11:14,076 INFO L290 TraceCheckUtils]: 46: Hoare triple {1751#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {1751#false} is VALID [2022-02-20 21:11:14,076 INFO L290 TraceCheckUtils]: 47: Hoare triple {1751#false} assume true; {1751#false} is VALID [2022-02-20 21:11:14,076 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1751#false} {1751#false} #188#return; {1751#false} is VALID [2022-02-20 21:11:14,076 INFO L272 TraceCheckUtils]: 49: Hoare triple {1751#false} call assume_abort_if_not(#t~ret370); {1751#false} is VALID [2022-02-20 21:11:14,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {1751#false} ~cond := #in~cond; {1751#false} is VALID [2022-02-20 21:11:14,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {1751#false} assume !(0bv8 == ~cond); {1751#false} is VALID [2022-02-20 21:11:14,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {1751#false} assume true; {1751#false} is VALID [2022-02-20 21:11:14,076 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1751#false} {1751#false} #190#return; {1751#false} is VALID [2022-02-20 21:11:14,076 INFO L290 TraceCheckUtils]: 54: Hoare triple {1751#false} havoc #t~ret370; {1751#false} is VALID [2022-02-20 21:11:14,076 INFO L272 TraceCheckUtils]: 55: Hoare triple {1751#false} call assume_abort_if_not((if 0bv32 == (if ~to_add.base != 0bv64 || ~to_add.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {1751#false} is VALID [2022-02-20 21:11:14,077 INFO L290 TraceCheckUtils]: 56: Hoare triple {1751#false} ~cond := #in~cond; {1751#false} is VALID [2022-02-20 21:11:14,077 INFO L290 TraceCheckUtils]: 57: Hoare triple {1751#false} assume !(0bv8 == ~cond); {1751#false} is VALID [2022-02-20 21:11:14,077 INFO L290 TraceCheckUtils]: 58: Hoare triple {1751#false} assume true; {1751#false} is VALID [2022-02-20 21:11:14,077 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {1751#false} {1751#false} #192#return; {1751#false} is VALID [2022-02-20 21:11:14,077 INFO L290 TraceCheckUtils]: 60: Hoare triple {1751#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8bv64);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, ~bvadd64(8bv64, ~to_add.offset), 8bv64);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8bv64);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64); {1751#false} is VALID [2022-02-20 21:11:14,077 INFO L272 TraceCheckUtils]: 61: Hoare triple {1751#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {1751#false} is VALID [2022-02-20 21:11:14,077 INFO L290 TraceCheckUtils]: 62: Hoare triple {1751#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {1751#false} is VALID [2022-02-20 21:11:14,077 INFO L290 TraceCheckUtils]: 63: Hoare triple {1751#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {1751#false} is VALID [2022-02-20 21:11:14,077 INFO L290 TraceCheckUtils]: 64: Hoare triple {1751#false} #t~short316 := #t~short313; {1751#false} is VALID [2022-02-20 21:11:14,077 INFO L290 TraceCheckUtils]: 65: Hoare triple {1751#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {1751#false} is VALID [2022-02-20 21:11:14,077 INFO L290 TraceCheckUtils]: 66: Hoare triple {1751#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {1751#false} is VALID [2022-02-20 21:11:14,077 INFO L290 TraceCheckUtils]: 67: Hoare triple {1751#false} assume true; {1751#false} is VALID [2022-02-20 21:11:14,078 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {1751#false} {1751#false} #194#return; {1751#false} is VALID [2022-02-20 21:11:14,078 INFO L272 TraceCheckUtils]: 69: Hoare triple {1751#false} call __VERIFIER_assert(#t~ret373); {1751#false} is VALID [2022-02-20 21:11:14,078 INFO L290 TraceCheckUtils]: 70: Hoare triple {1751#false} ~cond := #in~cond; {1751#false} is VALID [2022-02-20 21:11:14,078 INFO L290 TraceCheckUtils]: 71: Hoare triple {1751#false} assume 0bv8 == ~cond; {1751#false} is VALID [2022-02-20 21:11:14,078 INFO L290 TraceCheckUtils]: 72: Hoare triple {1751#false} assume !false; {1751#false} is VALID [2022-02-20 21:11:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 21:11:14,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:11:14,078 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:11:14,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933238643] [2022-02-20 21:11:14,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933238643] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:11:14,079 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:11:14,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:11:14,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662813352] [2022-02-20 21:11:14,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:11:14,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-02-20 21:11:14,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:11:14,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:14,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:14,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:11:14,150 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:11:14,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:11:14,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:11:14,151 INFO L87 Difference]: Start difference. First operand 97 states and 130 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:15,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:15,420 INFO L93 Difference]: Finished difference Result 182 states and 247 transitions. [2022-02-20 21:11:15,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 21:11:15,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-02-20 21:11:15,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:11:15,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 247 transitions. [2022-02-20 21:11:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 247 transitions. [2022-02-20 21:11:15,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 247 transitions. [2022-02-20 21:11:15,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:15,678 INFO L225 Difference]: With dead ends: 182 [2022-02-20 21:11:15,678 INFO L226 Difference]: Without dead ends: 99 [2022-02-20 21:11:15,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:11:15,679 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 2 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:11:15,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 602 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:11:15,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-20 21:11:15,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-02-20 21:11:15,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:11:15,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 99 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:15,687 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 99 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:15,687 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 99 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:15,691 INFO L93 Difference]: Finished difference Result 99 states and 133 transitions. [2022-02-20 21:11:15,692 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2022-02-20 21:11:15,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:15,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:15,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 99 states. [2022-02-20 21:11:15,693 INFO L87 Difference]: Start difference. First operand has 99 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 99 states. [2022-02-20 21:11:15,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:15,696 INFO L93 Difference]: Finished difference Result 99 states and 133 transitions. [2022-02-20 21:11:15,697 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2022-02-20 21:11:15,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:15,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:15,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:11:15,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:11:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:15,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 133 transitions. [2022-02-20 21:11:15,701 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 133 transitions. Word has length 73 [2022-02-20 21:11:15,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:11:15,701 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 133 transitions. [2022-02-20 21:11:15,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:15,701 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 133 transitions. [2022-02-20 21:11:15,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-20 21:11:15,702 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:11:15,702 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:11:15,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 21:11:15,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 21:11:15,916 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:11:15,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:11:15,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1237560575, now seen corresponding path program 1 times [2022-02-20 21:11:15,917 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:11:15,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374255749] [2022-02-20 21:11:15,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:11:15,918 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:11:15,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:11:15,919 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:11:15,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 21:11:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:16,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 21:11:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:16,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:11:16,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {2564#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(36bv64, 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; {2564#true} is VALID [2022-02-20 21:11:16,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {2564#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32bv64);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16bv64);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20bv64;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:16,482 INFO L272 TraceCheckUtils]: 2: Hoare triple {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {2564#true} is VALID [2022-02-20 21:11:16,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {2564#true} #res := #t~nondet13;havoc #t~nondet13; {2564#true} is VALID [2022-02-20 21:11:16,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {2564#true} assume true; {2564#true} is VALID [2022-02-20 21:11:16,483 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2564#true} {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} #208#return; {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:16,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:16,508 INFO L272 TraceCheckUtils]: 7: Hoare triple {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} call assume_abort_if_not((if 0bv32 == (if ~bvule64(ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~max_length#1) then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {2564#true} is VALID [2022-02-20 21:11:16,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {2564#true} ~cond := #in~cond; {2564#true} is VALID [2022-02-20 21:11:16,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {2564#true} assume !(0bv8 == ~cond); {2564#true} is VALID [2022-02-20 21:11:16,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {2564#true} assume true; {2564#true} is VALID [2022-02-20 21:11:16,509 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2564#true} {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} #210#return; {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:16,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(8bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0bv64; {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:16,510 INFO L290 TraceCheckUtils]: 13: Hoare triple {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} assume !~bvult64(ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~length~1#1); {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:16,510 INFO L290 TraceCheckUtils]: 14: Hoare triple {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8bv64);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(24bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64); {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:16,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {2572#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, ~bvadd64(24bv64, aws_linked_list_push_back_harness_~#list~0#1.offset), 8bv64);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {2615#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} is VALID [2022-02-20 21:11:16,511 INFO L272 TraceCheckUtils]: 16: Hoare triple {2615#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {2564#true} is VALID [2022-02-20 21:11:16,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {2564#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0bv64 || ~list#1.offset != 0bv64; {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:16,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8bv64);#t~short299#1 := #t~mem298#1.base != 0bv64 || #t~mem298#1.offset != 0bv64; {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:16,512 INFO L290 TraceCheckUtils]: 19: Hoare triple {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} #t~short301#1 := #t~short299#1; {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:16,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(8bv64, ~list#1.offset), 8bv64);#t~short301#1 := #t~mem300#1.base == 0bv64 && #t~mem300#1.offset == 0bv64; {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:16,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} #t~short303#1 := #t~short301#1; {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:16,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(24bv64, ~list#1.offset), 8bv64);#t~short303#1 := #t~mem302#1.base != 0bv64 || #t~mem302#1.offset != 0bv64; {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:16,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} #t~short305#1 := #t~short303#1; {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:16,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(16bv64, ~list#1.offset), 8bv64);#t~short305#1 := #t~mem304#1.base == 0bv64 && #t~mem304#1.offset == 0bv64; {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:16,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {2622#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {2647#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:16,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {2647#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} assume aws_linked_list_is_valid_deep_~list#1.base == 0bv64 && aws_linked_list_is_valid_deep_~list#1.offset == 0bv64;aws_linked_list_is_valid_deep_#res#1 := 0bv8; {2651#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:16,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {2651#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {2651#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:16,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {2651#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} assume true; {2651#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:16,526 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2651#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} {2615#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} #212#return; {2565#false} is VALID [2022-02-20 21:11:16,526 INFO L272 TraceCheckUtils]: 30: Hoare triple {2565#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {2565#false} is VALID [2022-02-20 21:11:16,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {2565#false} ~cond := #in~cond; {2565#false} is VALID [2022-02-20 21:11:16,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {2565#false} assume !(0bv8 == ~cond); {2565#false} is VALID [2022-02-20 21:11:16,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {2565#false} assume true; {2565#false} is VALID [2022-02-20 21:11:16,526 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2565#false} {2565#false} #214#return; {2565#false} is VALID [2022-02-20 21:11:16,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {2565#false} havoc aws_linked_list_push_back_#t~ret386#1; {2565#false} is VALID [2022-02-20 21:11:16,527 INFO L272 TraceCheckUtils]: 36: Hoare triple {2565#false} call assume_abort_if_not((if 0bv32 == (if aws_linked_list_push_back_~node#1.base != 0bv64 || aws_linked_list_push_back_~node#1.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {2565#false} is VALID [2022-02-20 21:11:16,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {2565#false} ~cond := #in~cond; {2565#false} is VALID [2022-02-20 21:11:16,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {2565#false} assume !(0bv8 == ~cond); {2565#false} is VALID [2022-02-20 21:11:16,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {2565#false} assume true; {2565#false} is VALID [2022-02-20 21:11:16,527 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2565#false} {2565#false} #216#return; {2565#false} is VALID [2022-02-20 21:11:16,527 INFO L272 TraceCheckUtils]: 41: Hoare triple {2565#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, ~bvadd64(16bv64, aws_linked_list_push_back_~list#1.offset), aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {2565#false} is VALID [2022-02-20 21:11:16,527 INFO L290 TraceCheckUtils]: 42: Hoare triple {2565#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {2565#false} is VALID [2022-02-20 21:11:16,527 INFO L272 TraceCheckUtils]: 43: Hoare triple {2565#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {2565#false} is VALID [2022-02-20 21:11:16,527 INFO L290 TraceCheckUtils]: 44: Hoare triple {2565#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {2565#false} is VALID [2022-02-20 21:11:16,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {2565#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {2565#false} is VALID [2022-02-20 21:11:16,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {2565#false} #t~short316 := #t~short313; {2565#false} is VALID [2022-02-20 21:11:16,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {2565#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {2565#false} is VALID [2022-02-20 21:11:16,527 INFO L290 TraceCheckUtils]: 48: Hoare triple {2565#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {2565#false} is VALID [2022-02-20 21:11:16,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {2565#false} assume true; {2565#false} is VALID [2022-02-20 21:11:16,528 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2565#false} {2565#false} #188#return; {2565#false} is VALID [2022-02-20 21:11:16,528 INFO L272 TraceCheckUtils]: 51: Hoare triple {2565#false} call assume_abort_if_not(#t~ret370); {2565#false} is VALID [2022-02-20 21:11:16,528 INFO L290 TraceCheckUtils]: 52: Hoare triple {2565#false} ~cond := #in~cond; {2565#false} is VALID [2022-02-20 21:11:16,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {2565#false} assume !(0bv8 == ~cond); {2565#false} is VALID [2022-02-20 21:11:16,528 INFO L290 TraceCheckUtils]: 54: Hoare triple {2565#false} assume true; {2565#false} is VALID [2022-02-20 21:11:16,529 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {2565#false} {2565#false} #190#return; {2565#false} is VALID [2022-02-20 21:11:16,529 INFO L290 TraceCheckUtils]: 56: Hoare triple {2565#false} havoc #t~ret370; {2565#false} is VALID [2022-02-20 21:11:16,529 INFO L272 TraceCheckUtils]: 57: Hoare triple {2565#false} call assume_abort_if_not((if 0bv32 == (if ~to_add.base != 0bv64 || ~to_add.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {2565#false} is VALID [2022-02-20 21:11:16,529 INFO L290 TraceCheckUtils]: 58: Hoare triple {2565#false} ~cond := #in~cond; {2565#false} is VALID [2022-02-20 21:11:16,529 INFO L290 TraceCheckUtils]: 59: Hoare triple {2565#false} assume !(0bv8 == ~cond); {2565#false} is VALID [2022-02-20 21:11:16,529 INFO L290 TraceCheckUtils]: 60: Hoare triple {2565#false} assume true; {2565#false} is VALID [2022-02-20 21:11:16,529 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {2565#false} {2565#false} #192#return; {2565#false} is VALID [2022-02-20 21:11:16,529 INFO L290 TraceCheckUtils]: 62: Hoare triple {2565#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8bv64);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, ~bvadd64(8bv64, ~to_add.offset), 8bv64);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8bv64);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64); {2565#false} is VALID [2022-02-20 21:11:16,530 INFO L272 TraceCheckUtils]: 63: Hoare triple {2565#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {2565#false} is VALID [2022-02-20 21:11:16,530 INFO L290 TraceCheckUtils]: 64: Hoare triple {2565#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {2565#false} is VALID [2022-02-20 21:11:16,530 INFO L290 TraceCheckUtils]: 65: Hoare triple {2565#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {2565#false} is VALID [2022-02-20 21:11:16,530 INFO L290 TraceCheckUtils]: 66: Hoare triple {2565#false} #t~short316 := #t~short313; {2565#false} is VALID [2022-02-20 21:11:16,530 INFO L290 TraceCheckUtils]: 67: Hoare triple {2565#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {2565#false} is VALID [2022-02-20 21:11:16,530 INFO L290 TraceCheckUtils]: 68: Hoare triple {2565#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {2565#false} is VALID [2022-02-20 21:11:16,530 INFO L290 TraceCheckUtils]: 69: Hoare triple {2565#false} assume true; {2565#false} is VALID [2022-02-20 21:11:16,531 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {2565#false} {2565#false} #194#return; {2565#false} is VALID [2022-02-20 21:11:16,531 INFO L272 TraceCheckUtils]: 71: Hoare triple {2565#false} call __VERIFIER_assert(#t~ret373); {2565#false} is VALID [2022-02-20 21:11:16,531 INFO L290 TraceCheckUtils]: 72: Hoare triple {2565#false} ~cond := #in~cond; {2565#false} is VALID [2022-02-20 21:11:16,531 INFO L290 TraceCheckUtils]: 73: Hoare triple {2565#false} assume 0bv8 == ~cond; {2565#false} is VALID [2022-02-20 21:11:16,531 INFO L290 TraceCheckUtils]: 74: Hoare triple {2565#false} assume !false; {2565#false} is VALID [2022-02-20 21:11:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-02-20 21:11:16,532 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:11:16,532 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:11:16,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374255749] [2022-02-20 21:11:16,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374255749] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:11:16,532 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:11:16,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:11:16,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151652684] [2022-02-20 21:11:16,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:11:16,533 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 75 [2022-02-20 21:11:16,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:11:16,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:16,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:16,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:11:16,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:11:16,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:11:16,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:11:16,602 INFO L87 Difference]: Start difference. First operand 99 states and 133 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:18,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:18,365 INFO L93 Difference]: Finished difference Result 187 states and 254 transitions. [2022-02-20 21:11:18,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:11:18,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 75 [2022-02-20 21:11:18,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:11:18,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:18,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 251 transitions. [2022-02-20 21:11:18,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 251 transitions. [2022-02-20 21:11:18,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 251 transitions. [2022-02-20 21:11:18,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:18,634 INFO L225 Difference]: With dead ends: 187 [2022-02-20 21:11:18,634 INFO L226 Difference]: Without dead ends: 99 [2022-02-20 21:11:18,635 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-20 21:11:18,635 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 49 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:11:18,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 616 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 21:11:18,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-20 21:11:18,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-02-20 21:11:18,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:11:18,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 99 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:18,642 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 99 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:18,642 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 99 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:18,645 INFO L93 Difference]: Finished difference Result 99 states and 132 transitions. [2022-02-20 21:11:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 132 transitions. [2022-02-20 21:11:18,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:18,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:18,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 99 states. [2022-02-20 21:11:18,646 INFO L87 Difference]: Start difference. First operand has 99 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 99 states. [2022-02-20 21:11:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:18,649 INFO L93 Difference]: Finished difference Result 99 states and 132 transitions. [2022-02-20 21:11:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 132 transitions. [2022-02-20 21:11:18,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:18,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:18,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:11:18,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:11:18,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 132 transitions. [2022-02-20 21:11:18,653 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 132 transitions. Word has length 75 [2022-02-20 21:11:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:11:18,653 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 132 transitions. [2022-02-20 21:11:18,653 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 132 transitions. [2022-02-20 21:11:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 21:11:18,655 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:11:18,655 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:11:18,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 21:11:18,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 21:11:18,869 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:11:18,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:11:18,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1187141198, now seen corresponding path program 1 times [2022-02-20 21:11:18,870 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:11:18,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184196152] [2022-02-20 21:11:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:11:18,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:11:18,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:11:18,872 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:11:18,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 21:11:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:19,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 21:11:19,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:19,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:11:19,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {3395#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(36bv64, 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; {3395#true} is VALID [2022-02-20 21:11:19,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {3395#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32bv64);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16bv64);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20bv64;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:19,451 INFO L272 TraceCheckUtils]: 2: Hoare triple {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {3395#true} is VALID [2022-02-20 21:11:19,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {3395#true} #res := #t~nondet13;havoc #t~nondet13; {3395#true} is VALID [2022-02-20 21:11:19,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {3395#true} assume true; {3395#true} is VALID [2022-02-20 21:11:19,452 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {3395#true} {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} #208#return; {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:19,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:19,452 INFO L272 TraceCheckUtils]: 7: Hoare triple {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} call assume_abort_if_not((if 0bv32 == (if ~bvule64(ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~max_length#1) then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {3395#true} is VALID [2022-02-20 21:11:19,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {3395#true} ~cond := #in~cond; {3395#true} is VALID [2022-02-20 21:11:19,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {3395#true} assume !(0bv8 == ~cond); {3395#true} is VALID [2022-02-20 21:11:19,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {3395#true} assume true; {3395#true} is VALID [2022-02-20 21:11:19,453 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3395#true} {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} #210#return; {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:19,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(8bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0bv64; {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:19,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} assume !~bvult64(ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~length~1#1); {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:19,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8bv64);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(24bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64); {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} is VALID [2022-02-20 21:11:19,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {3403#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.base|))} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, ~bvadd64(24bv64, aws_linked_list_push_back_harness_~#list~0#1.offset), 8bv64);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {3446#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} is VALID [2022-02-20 21:11:19,455 INFO L272 TraceCheckUtils]: 16: Hoare triple {3446#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {3395#true} is VALID [2022-02-20 21:11:19,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {3395#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0bv64 || ~list#1.offset != 0bv64; {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:19,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8bv64);#t~short299#1 := #t~mem298#1.base != 0bv64 || #t~mem298#1.offset != 0bv64; {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:19,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} #t~short301#1 := #t~short299#1; {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:19,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(8bv64, ~list#1.offset), 8bv64);#t~short301#1 := #t~mem300#1.base == 0bv64 && #t~mem300#1.offset == 0bv64; {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:19,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} #t~short303#1 := #t~short301#1; {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:19,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(24bv64, ~list#1.offset), 8bv64);#t~short303#1 := #t~mem302#1.base != 0bv64 || #t~mem302#1.offset != 0bv64; {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:19,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} #t~short305#1 := #t~short303#1; {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:19,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(16bv64, ~list#1.offset), 8bv64);#t~short305#1 := #t~mem304#1.base == 0bv64 && #t~mem304#1.offset == 0bv64; {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:19,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {3453#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {3478#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:19,460 INFO L290 TraceCheckUtils]: 26: Hoare triple {3478#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0bv64 && aws_linked_list_is_valid_deep_~list#1.offset == 0bv64);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0bv8; {3482#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|)} is VALID [2022-02-20 21:11:19,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {3482#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|)} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base != 0bv64 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0bv64); {3486#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:19,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {3486#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {3486#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:19,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {3486#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {3486#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:19,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {3486#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} assume true; {3486#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:19,462 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3486#(= (_ bv0 64) |aws_linked_list_is_valid_#in~list#1.base|)} {3446#(not (= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_~list#1.base|))} #212#return; {3396#false} is VALID [2022-02-20 21:11:19,462 INFO L272 TraceCheckUtils]: 32: Hoare triple {3396#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {3396#false} is VALID [2022-02-20 21:11:19,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {3396#false} ~cond := #in~cond; {3396#false} is VALID [2022-02-20 21:11:19,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {3396#false} assume !(0bv8 == ~cond); {3396#false} is VALID [2022-02-20 21:11:19,463 INFO L290 TraceCheckUtils]: 35: Hoare triple {3396#false} assume true; {3396#false} is VALID [2022-02-20 21:11:19,463 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3396#false} {3396#false} #214#return; {3396#false} is VALID [2022-02-20 21:11:19,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {3396#false} havoc aws_linked_list_push_back_#t~ret386#1; {3396#false} is VALID [2022-02-20 21:11:19,463 INFO L272 TraceCheckUtils]: 38: Hoare triple {3396#false} call assume_abort_if_not((if 0bv32 == (if aws_linked_list_push_back_~node#1.base != 0bv64 || aws_linked_list_push_back_~node#1.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {3396#false} is VALID [2022-02-20 21:11:19,463 INFO L290 TraceCheckUtils]: 39: Hoare triple {3396#false} ~cond := #in~cond; {3396#false} is VALID [2022-02-20 21:11:19,463 INFO L290 TraceCheckUtils]: 40: Hoare triple {3396#false} assume !(0bv8 == ~cond); {3396#false} is VALID [2022-02-20 21:11:19,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {3396#false} assume true; {3396#false} is VALID [2022-02-20 21:11:19,463 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {3396#false} {3396#false} #216#return; {3396#false} is VALID [2022-02-20 21:11:19,464 INFO L272 TraceCheckUtils]: 43: Hoare triple {3396#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, ~bvadd64(16bv64, aws_linked_list_push_back_~list#1.offset), aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {3396#false} is VALID [2022-02-20 21:11:19,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {3396#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {3396#false} is VALID [2022-02-20 21:11:19,464 INFO L272 TraceCheckUtils]: 45: Hoare triple {3396#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {3396#false} is VALID [2022-02-20 21:11:19,464 INFO L290 TraceCheckUtils]: 46: Hoare triple {3396#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {3396#false} is VALID [2022-02-20 21:11:19,464 INFO L290 TraceCheckUtils]: 47: Hoare triple {3396#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {3396#false} is VALID [2022-02-20 21:11:19,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {3396#false} #t~short316 := #t~short313; {3396#false} is VALID [2022-02-20 21:11:19,464 INFO L290 TraceCheckUtils]: 49: Hoare triple {3396#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {3396#false} is VALID [2022-02-20 21:11:19,464 INFO L290 TraceCheckUtils]: 50: Hoare triple {3396#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {3396#false} is VALID [2022-02-20 21:11:19,464 INFO L290 TraceCheckUtils]: 51: Hoare triple {3396#false} assume true; {3396#false} is VALID [2022-02-20 21:11:19,465 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {3396#false} {3396#false} #188#return; {3396#false} is VALID [2022-02-20 21:11:19,465 INFO L272 TraceCheckUtils]: 53: Hoare triple {3396#false} call assume_abort_if_not(#t~ret370); {3396#false} is VALID [2022-02-20 21:11:19,465 INFO L290 TraceCheckUtils]: 54: Hoare triple {3396#false} ~cond := #in~cond; {3396#false} is VALID [2022-02-20 21:11:19,465 INFO L290 TraceCheckUtils]: 55: Hoare triple {3396#false} assume !(0bv8 == ~cond); {3396#false} is VALID [2022-02-20 21:11:19,465 INFO L290 TraceCheckUtils]: 56: Hoare triple {3396#false} assume true; {3396#false} is VALID [2022-02-20 21:11:19,465 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {3396#false} {3396#false} #190#return; {3396#false} is VALID [2022-02-20 21:11:19,465 INFO L290 TraceCheckUtils]: 58: Hoare triple {3396#false} havoc #t~ret370; {3396#false} is VALID [2022-02-20 21:11:19,465 INFO L272 TraceCheckUtils]: 59: Hoare triple {3396#false} call assume_abort_if_not((if 0bv32 == (if ~to_add.base != 0bv64 || ~to_add.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {3396#false} is VALID [2022-02-20 21:11:19,466 INFO L290 TraceCheckUtils]: 60: Hoare triple {3396#false} ~cond := #in~cond; {3396#false} is VALID [2022-02-20 21:11:19,466 INFO L290 TraceCheckUtils]: 61: Hoare triple {3396#false} assume !(0bv8 == ~cond); {3396#false} is VALID [2022-02-20 21:11:19,466 INFO L290 TraceCheckUtils]: 62: Hoare triple {3396#false} assume true; {3396#false} is VALID [2022-02-20 21:11:19,466 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {3396#false} {3396#false} #192#return; {3396#false} is VALID [2022-02-20 21:11:19,466 INFO L290 TraceCheckUtils]: 64: Hoare triple {3396#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8bv64);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, ~bvadd64(8bv64, ~to_add.offset), 8bv64);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8bv64);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64); {3396#false} is VALID [2022-02-20 21:11:19,466 INFO L272 TraceCheckUtils]: 65: Hoare triple {3396#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {3396#false} is VALID [2022-02-20 21:11:19,466 INFO L290 TraceCheckUtils]: 66: Hoare triple {3396#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {3396#false} is VALID [2022-02-20 21:11:19,466 INFO L290 TraceCheckUtils]: 67: Hoare triple {3396#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {3396#false} is VALID [2022-02-20 21:11:19,467 INFO L290 TraceCheckUtils]: 68: Hoare triple {3396#false} #t~short316 := #t~short313; {3396#false} is VALID [2022-02-20 21:11:19,467 INFO L290 TraceCheckUtils]: 69: Hoare triple {3396#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {3396#false} is VALID [2022-02-20 21:11:19,467 INFO L290 TraceCheckUtils]: 70: Hoare triple {3396#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {3396#false} is VALID [2022-02-20 21:11:19,467 INFO L290 TraceCheckUtils]: 71: Hoare triple {3396#false} assume true; {3396#false} is VALID [2022-02-20 21:11:19,467 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {3396#false} {3396#false} #194#return; {3396#false} is VALID [2022-02-20 21:11:19,467 INFO L272 TraceCheckUtils]: 73: Hoare triple {3396#false} call __VERIFIER_assert(#t~ret373); {3396#false} is VALID [2022-02-20 21:11:19,467 INFO L290 TraceCheckUtils]: 74: Hoare triple {3396#false} ~cond := #in~cond; {3396#false} is VALID [2022-02-20 21:11:19,467 INFO L290 TraceCheckUtils]: 75: Hoare triple {3396#false} assume 0bv8 == ~cond; {3396#false} is VALID [2022-02-20 21:11:19,467 INFO L290 TraceCheckUtils]: 76: Hoare triple {3396#false} assume !false; {3396#false} is VALID [2022-02-20 21:11:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-02-20 21:11:19,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:11:19,468 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:11:19,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184196152] [2022-02-20 21:11:19,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184196152] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:11:19,468 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:11:19,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 21:11:19,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137758124] [2022-02-20 21:11:19,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:11:19,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2022-02-20 21:11:19,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:11:19,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:19,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:19,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 21:11:19,532 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:11:19,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 21:11:19,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:11:19,532 INFO L87 Difference]: Start difference. First operand 99 states and 132 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:21,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:21,338 INFO L93 Difference]: Finished difference Result 196 states and 267 transitions. [2022-02-20 21:11:21,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 21:11:21,338 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2022-02-20 21:11:21,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:11:21,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 264 transitions. [2022-02-20 21:11:21,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 264 transitions. [2022-02-20 21:11:21,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 264 transitions. [2022-02-20 21:11:21,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:21,659 INFO L225 Difference]: With dead ends: 196 [2022-02-20 21:11:21,659 INFO L226 Difference]: Without dead ends: 107 [2022-02-20 21:11:21,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-20 21:11:21,660 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 75 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:11:21,661 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 716 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 21:11:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-20 21:11:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2022-02-20 21:11:21,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:11:21,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 100 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 65 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:21,666 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 100 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 65 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:21,667 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 100 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 65 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:21,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:21,670 INFO L93 Difference]: Finished difference Result 107 states and 145 transitions. [2022-02-20 21:11:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2022-02-20 21:11:21,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:21,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:21,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 65 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 107 states. [2022-02-20 21:11:21,671 INFO L87 Difference]: Start difference. First operand has 100 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 65 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 107 states. [2022-02-20 21:11:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:21,674 INFO L93 Difference]: Finished difference Result 107 states and 145 transitions. [2022-02-20 21:11:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 145 transitions. [2022-02-20 21:11:21,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:21,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:21,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:11:21,675 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:11:21,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 65 states have internal predecessors, (76), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 133 transitions. [2022-02-20 21:11:21,677 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 133 transitions. Word has length 77 [2022-02-20 21:11:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:11:21,678 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 133 transitions. [2022-02-20 21:11:21,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 133 transitions. [2022-02-20 21:11:21,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 21:11:21,678 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:11:21,679 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:11:21,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 21:11:21,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 21:11:21,892 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:11:21,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:11:21,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1548809988, now seen corresponding path program 1 times [2022-02-20 21:11:21,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:11:21,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537989216] [2022-02-20 21:11:21,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:11:21,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:11:21,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:11:21,894 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:11:21,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 21:11:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:22,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 21:11:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:22,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:11:22,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {4265#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(36bv64, 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; {4265#true} is VALID [2022-02-20 21:11:22,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {4265#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32bv64);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16bv64);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20bv64;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} is VALID [2022-02-20 21:11:22,458 INFO L272 TraceCheckUtils]: 2: Hoare triple {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {4265#true} is VALID [2022-02-20 21:11:22,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {4265#true} #res := #t~nondet13;havoc #t~nondet13; {4265#true} is VALID [2022-02-20 21:11:22,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {4265#true} assume true; {4265#true} is VALID [2022-02-20 21:11:22,459 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {4265#true} {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} #208#return; {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} is VALID [2022-02-20 21:11:22,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} is VALID [2022-02-20 21:11:22,460 INFO L272 TraceCheckUtils]: 7: Hoare triple {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} call assume_abort_if_not((if 0bv32 == (if ~bvule64(ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~max_length#1) then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {4265#true} is VALID [2022-02-20 21:11:22,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {4265#true} ~cond := #in~cond; {4265#true} is VALID [2022-02-20 21:11:22,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {4265#true} assume !(0bv8 == ~cond); {4265#true} is VALID [2022-02-20 21:11:22,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {4265#true} assume true; {4265#true} is VALID [2022-02-20 21:11:22,464 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4265#true} {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} #210#return; {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} is VALID [2022-02-20 21:11:22,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(8bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0bv64; {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} is VALID [2022-02-20 21:11:22,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} assume !~bvult64(ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~length~1#1); {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} is VALID [2022-02-20 21:11:22,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8bv64);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(24bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64); {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} is VALID [2022-02-20 21:11:22,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {4273#(= (_ bv0 64) |ULTIMATE.start_aws_linked_list_push_back_harness_~#list~0#1.offset|)} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, ~bvadd64(24bv64, aws_linked_list_push_back_harness_~#list~0#1.offset), 8bv64);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {4316#(= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| (_ bv0 64))} is VALID [2022-02-20 21:11:22,466 INFO L272 TraceCheckUtils]: 16: Hoare triple {4316#(= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| (_ bv0 64))} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {4265#true} is VALID [2022-02-20 21:11:22,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {4265#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0bv64 || ~list#1.offset != 0bv64; {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} is VALID [2022-02-20 21:11:22,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8bv64);#t~short299#1 := #t~mem298#1.base != 0bv64 || #t~mem298#1.offset != 0bv64; {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} is VALID [2022-02-20 21:11:22,467 INFO L290 TraceCheckUtils]: 19: Hoare triple {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} #t~short301#1 := #t~short299#1; {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} is VALID [2022-02-20 21:11:22,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(8bv64, ~list#1.offset), 8bv64);#t~short301#1 := #t~mem300#1.base == 0bv64 && #t~mem300#1.offset == 0bv64; {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} is VALID [2022-02-20 21:11:22,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} #t~short303#1 := #t~short301#1; {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} is VALID [2022-02-20 21:11:22,468 INFO L290 TraceCheckUtils]: 22: Hoare triple {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(24bv64, ~list#1.offset), 8bv64);#t~short303#1 := #t~mem302#1.base != 0bv64 || #t~mem302#1.offset != 0bv64; {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} is VALID [2022-02-20 21:11:22,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} #t~short305#1 := #t~short303#1; {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} is VALID [2022-02-20 21:11:22,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(16bv64, ~list#1.offset), 8bv64);#t~short305#1 := #t~mem304#1.base == 0bv64 && #t~mem304#1.offset == 0bv64; {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} is VALID [2022-02-20 21:11:22,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {4323#(= |aws_linked_list_is_valid_#in~list#1.offset| |aws_linked_list_is_valid_~list#1.offset|)} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {4348#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|)} is VALID [2022-02-20 21:11:22,470 INFO L290 TraceCheckUtils]: 26: Hoare triple {4348#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|)} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0bv64 && aws_linked_list_is_valid_deep_~list#1.offset == 0bv64);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0bv8; {4352#(and (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))} is VALID [2022-02-20 21:11:22,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {4352#(and (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0bv64 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0bv64); {4352#(and (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))} is VALID [2022-02-20 21:11:22,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {4352#(and (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_#in~list#1.offset|) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))} assume aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == ~bvadd64(16bv64, aws_linked_list_is_valid_deep_~list#1.offset);aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 1bv8; {4266#false} is VALID [2022-02-20 21:11:22,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {4266#false} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {4266#false} is VALID [2022-02-20 21:11:22,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {4266#false} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {4266#false} is VALID [2022-02-20 21:11:22,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {4266#false} assume true; {4266#false} is VALID [2022-02-20 21:11:22,472 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4266#false} {4316#(= |ULTIMATE.start_aws_linked_list_push_back_~list#1.offset| (_ bv0 64))} #212#return; {4266#false} is VALID [2022-02-20 21:11:22,472 INFO L272 TraceCheckUtils]: 33: Hoare triple {4266#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {4266#false} is VALID [2022-02-20 21:11:22,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {4266#false} ~cond := #in~cond; {4266#false} is VALID [2022-02-20 21:11:22,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {4266#false} assume !(0bv8 == ~cond); {4266#false} is VALID [2022-02-20 21:11:22,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {4266#false} assume true; {4266#false} is VALID [2022-02-20 21:11:22,473 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4266#false} {4266#false} #214#return; {4266#false} is VALID [2022-02-20 21:11:22,473 INFO L290 TraceCheckUtils]: 38: Hoare triple {4266#false} havoc aws_linked_list_push_back_#t~ret386#1; {4266#false} is VALID [2022-02-20 21:11:22,473 INFO L272 TraceCheckUtils]: 39: Hoare triple {4266#false} call assume_abort_if_not((if 0bv32 == (if aws_linked_list_push_back_~node#1.base != 0bv64 || aws_linked_list_push_back_~node#1.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {4266#false} is VALID [2022-02-20 21:11:22,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {4266#false} ~cond := #in~cond; {4266#false} is VALID [2022-02-20 21:11:22,473 INFO L290 TraceCheckUtils]: 41: Hoare triple {4266#false} assume !(0bv8 == ~cond); {4266#false} is VALID [2022-02-20 21:11:22,473 INFO L290 TraceCheckUtils]: 42: Hoare triple {4266#false} assume true; {4266#false} is VALID [2022-02-20 21:11:22,473 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {4266#false} {4266#false} #216#return; {4266#false} is VALID [2022-02-20 21:11:22,473 INFO L272 TraceCheckUtils]: 44: Hoare triple {4266#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, ~bvadd64(16bv64, aws_linked_list_push_back_~list#1.offset), aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {4266#false} is VALID [2022-02-20 21:11:22,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {4266#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {4266#false} is VALID [2022-02-20 21:11:22,473 INFO L272 TraceCheckUtils]: 46: Hoare triple {4266#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {4266#false} is VALID [2022-02-20 21:11:22,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {4266#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {4266#false} is VALID [2022-02-20 21:11:22,473 INFO L290 TraceCheckUtils]: 48: Hoare triple {4266#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {4266#false} is VALID [2022-02-20 21:11:22,473 INFO L290 TraceCheckUtils]: 49: Hoare triple {4266#false} #t~short316 := #t~short313; {4266#false} is VALID [2022-02-20 21:11:22,473 INFO L290 TraceCheckUtils]: 50: Hoare triple {4266#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {4266#false} is VALID [2022-02-20 21:11:22,474 INFO L290 TraceCheckUtils]: 51: Hoare triple {4266#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {4266#false} is VALID [2022-02-20 21:11:22,474 INFO L290 TraceCheckUtils]: 52: Hoare triple {4266#false} assume true; {4266#false} is VALID [2022-02-20 21:11:22,474 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {4266#false} {4266#false} #188#return; {4266#false} is VALID [2022-02-20 21:11:22,474 INFO L272 TraceCheckUtils]: 54: Hoare triple {4266#false} call assume_abort_if_not(#t~ret370); {4266#false} is VALID [2022-02-20 21:11:22,474 INFO L290 TraceCheckUtils]: 55: Hoare triple {4266#false} ~cond := #in~cond; {4266#false} is VALID [2022-02-20 21:11:22,474 INFO L290 TraceCheckUtils]: 56: Hoare triple {4266#false} assume !(0bv8 == ~cond); {4266#false} is VALID [2022-02-20 21:11:22,474 INFO L290 TraceCheckUtils]: 57: Hoare triple {4266#false} assume true; {4266#false} is VALID [2022-02-20 21:11:22,474 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4266#false} {4266#false} #190#return; {4266#false} is VALID [2022-02-20 21:11:22,474 INFO L290 TraceCheckUtils]: 59: Hoare triple {4266#false} havoc #t~ret370; {4266#false} is VALID [2022-02-20 21:11:22,474 INFO L272 TraceCheckUtils]: 60: Hoare triple {4266#false} call assume_abort_if_not((if 0bv32 == (if ~to_add.base != 0bv64 || ~to_add.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {4266#false} is VALID [2022-02-20 21:11:22,474 INFO L290 TraceCheckUtils]: 61: Hoare triple {4266#false} ~cond := #in~cond; {4266#false} is VALID [2022-02-20 21:11:22,474 INFO L290 TraceCheckUtils]: 62: Hoare triple {4266#false} assume !(0bv8 == ~cond); {4266#false} is VALID [2022-02-20 21:11:22,474 INFO L290 TraceCheckUtils]: 63: Hoare triple {4266#false} assume true; {4266#false} is VALID [2022-02-20 21:11:22,474 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {4266#false} {4266#false} #192#return; {4266#false} is VALID [2022-02-20 21:11:22,474 INFO L290 TraceCheckUtils]: 65: Hoare triple {4266#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8bv64);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, ~bvadd64(8bv64, ~to_add.offset), 8bv64);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8bv64);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64); {4266#false} is VALID [2022-02-20 21:11:22,475 INFO L272 TraceCheckUtils]: 66: Hoare triple {4266#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {4266#false} is VALID [2022-02-20 21:11:22,475 INFO L290 TraceCheckUtils]: 67: Hoare triple {4266#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {4266#false} is VALID [2022-02-20 21:11:22,475 INFO L290 TraceCheckUtils]: 68: Hoare triple {4266#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {4266#false} is VALID [2022-02-20 21:11:22,475 INFO L290 TraceCheckUtils]: 69: Hoare triple {4266#false} #t~short316 := #t~short313; {4266#false} is VALID [2022-02-20 21:11:22,475 INFO L290 TraceCheckUtils]: 70: Hoare triple {4266#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {4266#false} is VALID [2022-02-20 21:11:22,475 INFO L290 TraceCheckUtils]: 71: Hoare triple {4266#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {4266#false} is VALID [2022-02-20 21:11:22,475 INFO L290 TraceCheckUtils]: 72: Hoare triple {4266#false} assume true; {4266#false} is VALID [2022-02-20 21:11:22,475 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {4266#false} {4266#false} #194#return; {4266#false} is VALID [2022-02-20 21:11:22,475 INFO L272 TraceCheckUtils]: 74: Hoare triple {4266#false} call __VERIFIER_assert(#t~ret373); {4266#false} is VALID [2022-02-20 21:11:22,475 INFO L290 TraceCheckUtils]: 75: Hoare triple {4266#false} ~cond := #in~cond; {4266#false} is VALID [2022-02-20 21:11:22,475 INFO L290 TraceCheckUtils]: 76: Hoare triple {4266#false} assume 0bv8 == ~cond; {4266#false} is VALID [2022-02-20 21:11:22,475 INFO L290 TraceCheckUtils]: 77: Hoare triple {4266#false} assume !false; {4266#false} is VALID [2022-02-20 21:11:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-02-20 21:11:22,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:11:22,476 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:11:22,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537989216] [2022-02-20 21:11:22,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537989216] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:11:22,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:11:22,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:11:22,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646403249] [2022-02-20 21:11:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:11:22,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2022-02-20 21:11:22,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:11:22,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:22,534 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:22,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:11:22,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:11:22,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:11:22,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:11:22,535 INFO L87 Difference]: Start difference. First operand 100 states and 133 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:23,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:23,889 INFO L93 Difference]: Finished difference Result 192 states and 263 transitions. [2022-02-20 21:11:23,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:11:23,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 78 [2022-02-20 21:11:23,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:11:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 259 transitions. [2022-02-20 21:11:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:23,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 259 transitions. [2022-02-20 21:11:23,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 259 transitions. [2022-02-20 21:11:24,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:24,120 INFO L225 Difference]: With dead ends: 192 [2022-02-20 21:11:24,120 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 21:11:24,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-20 21:11:24,121 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 57 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:11:24,121 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 506 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 21:11:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 21:11:24,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2022-02-20 21:11:24,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:11:24,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 101 states, 64 states have (on average 1.203125) internal successors, (77), 66 states have internal predecessors, (77), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:24,127 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 101 states, 64 states have (on average 1.203125) internal successors, (77), 66 states have internal predecessors, (77), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:24,127 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 101 states, 64 states have (on average 1.203125) internal successors, (77), 66 states have internal predecessors, (77), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:24,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:24,130 INFO L93 Difference]: Finished difference Result 106 states and 143 transitions. [2022-02-20 21:11:24,130 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 143 transitions. [2022-02-20 21:11:24,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:24,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:24,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 64 states have (on average 1.203125) internal successors, (77), 66 states have internal predecessors, (77), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 106 states. [2022-02-20 21:11:24,131 INFO L87 Difference]: Start difference. First operand has 101 states, 64 states have (on average 1.203125) internal successors, (77), 66 states have internal predecessors, (77), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 106 states. [2022-02-20 21:11:24,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:24,134 INFO L93 Difference]: Finished difference Result 106 states and 143 transitions. [2022-02-20 21:11:24,134 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 143 transitions. [2022-02-20 21:11:24,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:24,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:24,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:11:24,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:11:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 64 states have (on average 1.203125) internal successors, (77), 66 states have internal predecessors, (77), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2022-02-20 21:11:24,138 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 78 [2022-02-20 21:11:24,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:11:24,138 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 134 transitions. [2022-02-20 21:11:24,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 7 states have internal predecessors, (43), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:11:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 134 transitions. [2022-02-20 21:11:24,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-02-20 21:11:24,139 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:11:24,139 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:11:24,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 21:11:24,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 21:11:24,355 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:11:24,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:11:24,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1185344546, now seen corresponding path program 1 times [2022-02-20 21:11:24,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:11:24,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206892902] [2022-02-20 21:11:24,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:11:24,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:11:24,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:11:24,357 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:11:24,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 21:11:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:24,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 21:11:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:24,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:11:24,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {5130#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(36bv64, 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; {5130#true} is VALID [2022-02-20 21:11:24,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {5130#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32bv64);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16bv64);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20bv64;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {5130#true} is VALID [2022-02-20 21:11:24,872 INFO L272 TraceCheckUtils]: 2: Hoare triple {5130#true} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {5130#true} is VALID [2022-02-20 21:11:24,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {5130#true} #res := #t~nondet13;havoc #t~nondet13; {5130#true} is VALID [2022-02-20 21:11:24,872 INFO L290 TraceCheckUtils]: 4: Hoare triple {5130#true} assume true; {5130#true} is VALID [2022-02-20 21:11:24,872 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {5130#true} {5130#true} #208#return; {5130#true} is VALID [2022-02-20 21:11:24,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {5130#true} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {5130#true} is VALID [2022-02-20 21:11:24,872 INFO L272 TraceCheckUtils]: 7: Hoare triple {5130#true} call assume_abort_if_not((if 0bv32 == (if ~bvule64(ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~max_length#1) then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {5130#true} is VALID [2022-02-20 21:11:24,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {5130#true} ~cond := #in~cond; {5130#true} is VALID [2022-02-20 21:11:24,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {5130#true} assume !(0bv8 == ~cond); {5130#true} is VALID [2022-02-20 21:11:24,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {5130#true} assume true; {5130#true} is VALID [2022-02-20 21:11:24,873 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5130#true} {5130#true} #210#return; {5130#true} is VALID [2022-02-20 21:11:24,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {5130#true} call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(8bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0bv64; {5130#true} is VALID [2022-02-20 21:11:24,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {5130#true} assume !~bvult64(ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~length~1#1); {5130#true} is VALID [2022-02-20 21:11:24,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {5130#true} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8bv64);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(24bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64); {5130#true} is VALID [2022-02-20 21:11:24,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {5130#true} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, ~bvadd64(24bv64, aws_linked_list_push_back_harness_~#list~0#1.offset), 8bv64);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {5130#true} is VALID [2022-02-20 21:11:24,873 INFO L272 TraceCheckUtils]: 16: Hoare triple {5130#true} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {5130#true} is VALID [2022-02-20 21:11:24,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {5130#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0bv64 || ~list#1.offset != 0bv64; {5130#true} is VALID [2022-02-20 21:11:24,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {5130#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8bv64);#t~short299#1 := #t~mem298#1.base != 0bv64 || #t~mem298#1.offset != 0bv64; {5130#true} is VALID [2022-02-20 21:11:24,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {5130#true} #t~short301#1 := #t~short299#1; {5130#true} is VALID [2022-02-20 21:11:24,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {5130#true} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(8bv64, ~list#1.offset), 8bv64);#t~short301#1 := #t~mem300#1.base == 0bv64 && #t~mem300#1.offset == 0bv64; {5130#true} is VALID [2022-02-20 21:11:24,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {5130#true} #t~short303#1 := #t~short301#1; {5130#true} is VALID [2022-02-20 21:11:24,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {5130#true} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(24bv64, ~list#1.offset), 8bv64);#t~short303#1 := #t~mem302#1.base != 0bv64 || #t~mem302#1.offset != 0bv64; {5130#true} is VALID [2022-02-20 21:11:24,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {5130#true} #t~short305#1 := #t~short303#1; {5130#true} is VALID [2022-02-20 21:11:24,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {5130#true} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(16bv64, ~list#1.offset), 8bv64);#t~short305#1 := #t~mem304#1.base == 0bv64 && #t~mem304#1.offset == 0bv64; {5130#true} is VALID [2022-02-20 21:11:24,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {5130#true} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {5130#true} is VALID [2022-02-20 21:11:24,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {5130#true} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0bv64 && aws_linked_list_is_valid_deep_~list#1.offset == 0bv64);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0bv8; {5130#true} is VALID [2022-02-20 21:11:24,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {5130#true} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0bv64 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0bv64); {5130#true} is VALID [2022-02-20 21:11:24,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {5130#true} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == ~bvadd64(16bv64, aws_linked_list_is_valid_deep_~list#1.offset)); {5130#true} is VALID [2022-02-20 21:11:24,874 INFO L272 TraceCheckUtils]: 29: Hoare triple {5130#true} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {5130#true} is VALID [2022-02-20 21:11:24,874 INFO L290 TraceCheckUtils]: 30: Hoare triple {5130#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0bv64 || ~node.offset != 0bv64; {5130#true} is VALID [2022-02-20 21:11:24,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {5130#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);#t~short308 := #t~mem307.base != 0bv64 || #t~mem307.offset != 0bv64; {5130#true} is VALID [2022-02-20 21:11:24,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {5130#true} #t~short311 := #t~short308; {5130#true} is VALID [2022-02-20 21:11:24,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {5130#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, ~bvadd64(8bv64, #t~mem309.offset), 8bv64);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {5130#true} is VALID [2022-02-20 21:11:24,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {5130#true} #res := (if 0bv32 == (if #t~short311 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {5130#true} is VALID [2022-02-20 21:11:24,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {5130#true} assume true; {5130#true} is VALID [2022-02-20 21:11:24,874 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5130#true} {5130#true} #242#return; {5130#true} is VALID [2022-02-20 21:11:24,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {5130#true} assume 0bv8 == aws_linked_list_is_valid_deep_#t~ret317#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1;aws_linked_list_is_valid_deep_#res#1 := 0bv8; {5246#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1| (_ bv0 8))} is VALID [2022-02-20 21:11:24,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {5246#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1| (_ bv0 8))} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {5250#(= |aws_linked_list_is_valid_#res#1| (_ bv0 8))} is VALID [2022-02-20 21:11:24,875 INFO L290 TraceCheckUtils]: 39: Hoare triple {5250#(= |aws_linked_list_is_valid_#res#1| (_ bv0 8))} assume true; {5250#(= |aws_linked_list_is_valid_#res#1| (_ bv0 8))} is VALID [2022-02-20 21:11:24,876 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5250#(= |aws_linked_list_is_valid_#res#1| (_ bv0 8))} {5130#true} #212#return; {5257#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| (_ bv0 8))} is VALID [2022-02-20 21:11:24,876 INFO L272 TraceCheckUtils]: 41: Hoare triple {5257#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| (_ bv0 8))} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {5130#true} is VALID [2022-02-20 21:11:24,877 INFO L290 TraceCheckUtils]: 42: Hoare triple {5130#true} ~cond := #in~cond; {5264#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 21:11:24,877 INFO L290 TraceCheckUtils]: 43: Hoare triple {5264#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv8 == ~cond); {5268#(not (= |assume_abort_if_not_#in~cond| (_ bv0 8)))} is VALID [2022-02-20 21:11:24,877 INFO L290 TraceCheckUtils]: 44: Hoare triple {5268#(not (= |assume_abort_if_not_#in~cond| (_ bv0 8)))} assume true; {5268#(not (= |assume_abort_if_not_#in~cond| (_ bv0 8)))} is VALID [2022-02-20 21:11:24,878 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5268#(not (= |assume_abort_if_not_#in~cond| (_ bv0 8)))} {5257#(= |ULTIMATE.start_aws_linked_list_push_back_#t~ret386#1| (_ bv0 8))} #214#return; {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L290 TraceCheckUtils]: 46: Hoare triple {5131#false} havoc aws_linked_list_push_back_#t~ret386#1; {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L272 TraceCheckUtils]: 47: Hoare triple {5131#false} call assume_abort_if_not((if 0bv32 == (if aws_linked_list_push_back_~node#1.base != 0bv64 || aws_linked_list_push_back_~node#1.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L290 TraceCheckUtils]: 48: Hoare triple {5131#false} ~cond := #in~cond; {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L290 TraceCheckUtils]: 49: Hoare triple {5131#false} assume !(0bv8 == ~cond); {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L290 TraceCheckUtils]: 50: Hoare triple {5131#false} assume true; {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {5131#false} {5131#false} #216#return; {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L272 TraceCheckUtils]: 52: Hoare triple {5131#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, ~bvadd64(16bv64, aws_linked_list_push_back_~list#1.offset), aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L290 TraceCheckUtils]: 53: Hoare triple {5131#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L272 TraceCheckUtils]: 54: Hoare triple {5131#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L290 TraceCheckUtils]: 55: Hoare triple {5131#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L290 TraceCheckUtils]: 56: Hoare triple {5131#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L290 TraceCheckUtils]: 57: Hoare triple {5131#false} #t~short316 := #t~short313; {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L290 TraceCheckUtils]: 58: Hoare triple {5131#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L290 TraceCheckUtils]: 59: Hoare triple {5131#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L290 TraceCheckUtils]: 60: Hoare triple {5131#false} assume true; {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {5131#false} {5131#false} #188#return; {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L272 TraceCheckUtils]: 62: Hoare triple {5131#false} call assume_abort_if_not(#t~ret370); {5131#false} is VALID [2022-02-20 21:11:24,878 INFO L290 TraceCheckUtils]: 63: Hoare triple {5131#false} ~cond := #in~cond; {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L290 TraceCheckUtils]: 64: Hoare triple {5131#false} assume !(0bv8 == ~cond); {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L290 TraceCheckUtils]: 65: Hoare triple {5131#false} assume true; {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {5131#false} {5131#false} #190#return; {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L290 TraceCheckUtils]: 67: Hoare triple {5131#false} havoc #t~ret370; {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L272 TraceCheckUtils]: 68: Hoare triple {5131#false} call assume_abort_if_not((if 0bv32 == (if ~to_add.base != 0bv64 || ~to_add.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L290 TraceCheckUtils]: 69: Hoare triple {5131#false} ~cond := #in~cond; {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L290 TraceCheckUtils]: 70: Hoare triple {5131#false} assume !(0bv8 == ~cond); {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L290 TraceCheckUtils]: 71: Hoare triple {5131#false} assume true; {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {5131#false} {5131#false} #192#return; {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L290 TraceCheckUtils]: 73: Hoare triple {5131#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8bv64);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, ~bvadd64(8bv64, ~to_add.offset), 8bv64);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8bv64);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64); {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L272 TraceCheckUtils]: 74: Hoare triple {5131#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L290 TraceCheckUtils]: 75: Hoare triple {5131#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L290 TraceCheckUtils]: 76: Hoare triple {5131#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L290 TraceCheckUtils]: 77: Hoare triple {5131#false} #t~short316 := #t~short313; {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L290 TraceCheckUtils]: 78: Hoare triple {5131#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {5131#false} is VALID [2022-02-20 21:11:24,879 INFO L290 TraceCheckUtils]: 79: Hoare triple {5131#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {5131#false} is VALID [2022-02-20 21:11:24,880 INFO L290 TraceCheckUtils]: 80: Hoare triple {5131#false} assume true; {5131#false} is VALID [2022-02-20 21:11:24,880 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {5131#false} {5131#false} #194#return; {5131#false} is VALID [2022-02-20 21:11:24,880 INFO L272 TraceCheckUtils]: 82: Hoare triple {5131#false} call __VERIFIER_assert(#t~ret373); {5131#false} is VALID [2022-02-20 21:11:24,880 INFO L290 TraceCheckUtils]: 83: Hoare triple {5131#false} ~cond := #in~cond; {5131#false} is VALID [2022-02-20 21:11:24,880 INFO L290 TraceCheckUtils]: 84: Hoare triple {5131#false} assume 0bv8 == ~cond; {5131#false} is VALID [2022-02-20 21:11:24,880 INFO L290 TraceCheckUtils]: 85: Hoare triple {5131#false} assume !false; {5131#false} is VALID [2022-02-20 21:11:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-20 21:11:24,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:11:24,881 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:11:24,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206892902] [2022-02-20 21:11:24,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206892902] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:11:24,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:11:24,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:11:24,881 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980257667] [2022-02-20 21:11:24,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:11:24,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2022-02-20 21:11:24,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:11:24,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-20 21:11:24,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:24,945 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:11:24,945 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:11:24,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:11:24,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:11:24,946 INFO L87 Difference]: Start difference. First operand 101 states and 134 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-20 21:11:26,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:26,264 INFO L93 Difference]: Finished difference Result 191 states and 256 transitions. [2022-02-20 21:11:26,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 21:11:26,264 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 86 [2022-02-20 21:11:26,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:11:26,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-20 21:11:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 249 transitions. [2022-02-20 21:11:26,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-20 21:11:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 249 transitions. [2022-02-20 21:11:26,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 249 transitions. [2022-02-20 21:11:26,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:26,470 INFO L225 Difference]: With dead ends: 191 [2022-02-20 21:11:26,471 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 21:11:26,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:11:26,471 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 4 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:11:26,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 728 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 21:11:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 21:11:26,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2022-02-20 21:11:26,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:11:26,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 102 states, 65 states have (on average 1.2) internal successors, (78), 67 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:26,481 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 102 states, 65 states have (on average 1.2) internal successors, (78), 67 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:26,481 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 102 states, 65 states have (on average 1.2) internal successors, (78), 67 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:26,488 INFO L93 Difference]: Finished difference Result 104 states and 138 transitions. [2022-02-20 21:11:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2022-02-20 21:11:26,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:26,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:26,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 65 states have (on average 1.2) internal successors, (78), 67 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 104 states. [2022-02-20 21:11:26,489 INFO L87 Difference]: Start difference. First operand has 102 states, 65 states have (on average 1.2) internal successors, (78), 67 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) Second operand 104 states. [2022-02-20 21:11:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:26,492 INFO L93 Difference]: Finished difference Result 104 states and 138 transitions. [2022-02-20 21:11:26,492 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 138 transitions. [2022-02-20 21:11:26,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:26,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:26,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:11:26,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:11:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.2) internal successors, (78), 67 states have internal predecessors, (78), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2022-02-20 21:11:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2022-02-20 21:11:26,495 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 86 [2022-02-20 21:11:26,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:11:26,496 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2022-02-20 21:11:26,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-02-20 21:11:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2022-02-20 21:11:26,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-20 21:11:26,497 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:11:26,497 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:11:26,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 21:11:26,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 21:11:26,712 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:11:26,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:11:26,712 INFO L85 PathProgramCache]: Analyzing trace with hash 172862485, now seen corresponding path program 1 times [2022-02-20 21:11:26,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:11:26,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644967665] [2022-02-20 21:11:26,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:11:26,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:11:26,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:11:26,714 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:11:26,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 21:11:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:27,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 21:11:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:27,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:11:27,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {6013#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(36bv64, 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; {6013#true} is VALID [2022-02-20 21:11:27,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {6013#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32bv64);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16bv64);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20bv64;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {6013#true} is VALID [2022-02-20 21:11:27,952 INFO L272 TraceCheckUtils]: 2: Hoare triple {6013#true} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {6013#true} is VALID [2022-02-20 21:11:27,952 INFO L290 TraceCheckUtils]: 3: Hoare triple {6013#true} #res := #t~nondet13;havoc #t~nondet13; {6013#true} is VALID [2022-02-20 21:11:27,952 INFO L290 TraceCheckUtils]: 4: Hoare triple {6013#true} assume true; {6013#true} is VALID [2022-02-20 21:11:27,952 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6013#true} {6013#true} #208#return; {6013#true} is VALID [2022-02-20 21:11:27,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {6013#true} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {6013#true} is VALID [2022-02-20 21:11:27,952 INFO L272 TraceCheckUtils]: 7: Hoare triple {6013#true} call assume_abort_if_not((if 0bv32 == (if ~bvule64(ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~max_length#1) then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {6013#true} is VALID [2022-02-20 21:11:27,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {6013#true} ~cond := #in~cond; {6013#true} is VALID [2022-02-20 21:11:27,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {6013#true} assume !(0bv8 == ~cond); {6013#true} is VALID [2022-02-20 21:11:27,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {6013#true} assume true; {6013#true} is VALID [2022-02-20 21:11:27,952 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6013#true} {6013#true} #210#return; {6013#true} is VALID [2022-02-20 21:11:27,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {6013#true} call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(8bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0bv64; {6013#true} is VALID [2022-02-20 21:11:27,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {6013#true} assume !~bvult64(ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~length~1#1); {6013#true} is VALID [2022-02-20 21:11:27,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {6013#true} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8bv64);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(24bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64); {6013#true} is VALID [2022-02-20 21:11:27,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {6013#true} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, ~bvadd64(24bv64, aws_linked_list_push_back_harness_~#list~0#1.offset), 8bv64);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {6013#true} is VALID [2022-02-20 21:11:27,953 INFO L272 TraceCheckUtils]: 16: Hoare triple {6013#true} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {6013#true} is VALID [2022-02-20 21:11:27,953 INFO L290 TraceCheckUtils]: 17: Hoare triple {6013#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0bv64 || ~list#1.offset != 0bv64; {6069#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} is VALID [2022-02-20 21:11:27,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {6069#(= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|)} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8bv64);#t~short299#1 := #t~mem298#1.base != 0bv64 || #t~mem298#1.offset != 0bv64; {6073#(and (= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|) (or (and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) |aws_linked_list_is_valid_#t~short299#1|) (and (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|)) (not |aws_linked_list_is_valid_#t~short299#1|) (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))))} is VALID [2022-02-20 21:11:27,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {6073#(and (= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|) (or (and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) |aws_linked_list_is_valid_#t~short299#1|) (and (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|)) (not |aws_linked_list_is_valid_#t~short299#1|) (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))))} #t~short301#1 := #t~short299#1; {6077#(and (or (and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) |aws_linked_list_is_valid_#t~short301#1|) (and (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|)) (not |aws_linked_list_is_valid_#t~short301#1|) (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) (= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|))} is VALID [2022-02-20 21:11:27,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {6077#(and (or (and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) |aws_linked_list_is_valid_#t~short301#1|) (and (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|)) (not |aws_linked_list_is_valid_#t~short301#1|) (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) (= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|))} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(8bv64, ~list#1.offset), 8bv64);#t~short301#1 := #t~mem300#1.base == 0bv64 && #t~mem300#1.offset == 0bv64; {6081#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) (= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|))} is VALID [2022-02-20 21:11:27,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {6081#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) (= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|))} #t~short303#1 := #t~short301#1; {6081#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) (= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|))} is VALID [2022-02-20 21:11:27,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {6081#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) (= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|))} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(24bv64, ~list#1.offset), 8bv64);#t~short303#1 := #t~mem302#1.base != 0bv64 || #t~mem302#1.offset != 0bv64; {6081#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) (= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|))} is VALID [2022-02-20 21:11:27,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {6081#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) (= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|))} #t~short305#1 := #t~short303#1; {6081#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) (= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|))} is VALID [2022-02-20 21:11:27,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {6081#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) (= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|))} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(16bv64, ~list#1.offset), 8bv64);#t~short305#1 := #t~mem304#1.base == 0bv64 && #t~mem304#1.offset == 0bv64; {6081#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) (= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|))} is VALID [2022-02-20 21:11:27,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {6081#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64)))) (= |aws_linked_list_is_valid_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|))} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {6097#(and (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|) (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|)))))} is VALID [2022-02-20 21:11:27,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {6097#(and (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base| |aws_linked_list_is_valid_#in~list#1.base|) (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|)))))} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0bv64 && aws_linked_list_is_valid_deep_~list#1.offset == 0bv64);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0bv8; {6101#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|))} is VALID [2022-02-20 21:11:27,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {6101#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|))} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0bv64 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0bv64); {6101#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|))} is VALID [2022-02-20 21:11:27,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {6101#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|))} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == ~bvadd64(16bv64, aws_linked_list_is_valid_deep_~list#1.offset)); {6101#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|))} is VALID [2022-02-20 21:11:27,963 INFO L272 TraceCheckUtils]: 29: Hoare triple {6101#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|))} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {6111#(or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))))} is VALID [2022-02-20 21:11:27,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {6111#(or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))))} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0bv64 || ~node.offset != 0bv64; {6111#(or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))))} is VALID [2022-02-20 21:11:27,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {6111#(or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))))} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);#t~short308 := #t~mem307.base != 0bv64 || #t~mem307.offset != 0bv64; {6111#(or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))))} is VALID [2022-02-20 21:11:27,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {6111#(or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))))} #t~short311 := #t~short308; {6111#(or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))))} is VALID [2022-02-20 21:11:27,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {6111#(or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))))} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, ~bvadd64(8bv64, #t~mem309.offset), 8bv64);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {6111#(or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))))} is VALID [2022-02-20 21:11:27,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {6111#(or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))))} #res := (if 0bv32 == (if #t~short311 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {6111#(or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))))} is VALID [2022-02-20 21:11:27,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {6111#(or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))))} assume true; {6111#(or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))))} is VALID [2022-02-20 21:11:27,968 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6111#(or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))))} {6101#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|))} #242#return; {6101#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|))} is VALID [2022-02-20 21:11:27,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {6101#(and (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_#in~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)))) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|))} assume !(0bv8 == aws_linked_list_is_valid_deep_#t~ret317#1);havoc aws_linked_list_is_valid_deep_#t~ret317#1;call aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset := read~$Pointer$(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, 8bv64);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset;havoc aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset; {6136#(exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_11| (_ BitVec 64))) (and (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_11|)) (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_#in~list#1.base|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_11|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_11|)))) (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_#in~list#1.base|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_11|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|)))} is VALID [2022-02-20 21:11:27,970 INFO L290 TraceCheckUtils]: 38: Hoare triple {6136#(exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_11| (_ BitVec 64))) (and (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset| (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_11|)) (or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_#in~list#1.base|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_11|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_#in~list#1.base|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_11|)))) (= (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_#in~list#1.base|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_11|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|)))} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base != 0bv64 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0bv64); {6014#false} is VALID [2022-02-20 21:11:27,970 INFO L290 TraceCheckUtils]: 39: Hoare triple {6014#false} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {6014#false} is VALID [2022-02-20 21:11:27,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {6014#false} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {6014#false} is VALID [2022-02-20 21:11:27,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {6014#false} assume true; {6014#false} is VALID [2022-02-20 21:11:27,970 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6014#false} {6013#true} #212#return; {6014#false} is VALID [2022-02-20 21:11:27,970 INFO L272 TraceCheckUtils]: 43: Hoare triple {6014#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {6014#false} is VALID [2022-02-20 21:11:27,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {6014#false} ~cond := #in~cond; {6014#false} is VALID [2022-02-20 21:11:27,970 INFO L290 TraceCheckUtils]: 45: Hoare triple {6014#false} assume !(0bv8 == ~cond); {6014#false} is VALID [2022-02-20 21:11:27,970 INFO L290 TraceCheckUtils]: 46: Hoare triple {6014#false} assume true; {6014#false} is VALID [2022-02-20 21:11:27,970 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6014#false} {6014#false} #214#return; {6014#false} is VALID [2022-02-20 21:11:27,970 INFO L290 TraceCheckUtils]: 48: Hoare triple {6014#false} havoc aws_linked_list_push_back_#t~ret386#1; {6014#false} is VALID [2022-02-20 21:11:27,970 INFO L272 TraceCheckUtils]: 49: Hoare triple {6014#false} call assume_abort_if_not((if 0bv32 == (if aws_linked_list_push_back_~node#1.base != 0bv64 || aws_linked_list_push_back_~node#1.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {6014#false} is VALID [2022-02-20 21:11:27,970 INFO L290 TraceCheckUtils]: 50: Hoare triple {6014#false} ~cond := #in~cond; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L290 TraceCheckUtils]: 51: Hoare triple {6014#false} assume !(0bv8 == ~cond); {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L290 TraceCheckUtils]: 52: Hoare triple {6014#false} assume true; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6014#false} {6014#false} #216#return; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L272 TraceCheckUtils]: 54: Hoare triple {6014#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, ~bvadd64(16bv64, aws_linked_list_push_back_~list#1.offset), aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L290 TraceCheckUtils]: 55: Hoare triple {6014#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L272 TraceCheckUtils]: 56: Hoare triple {6014#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L290 TraceCheckUtils]: 57: Hoare triple {6014#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L290 TraceCheckUtils]: 58: Hoare triple {6014#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L290 TraceCheckUtils]: 59: Hoare triple {6014#false} #t~short316 := #t~short313; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L290 TraceCheckUtils]: 60: Hoare triple {6014#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L290 TraceCheckUtils]: 61: Hoare triple {6014#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L290 TraceCheckUtils]: 62: Hoare triple {6014#false} assume true; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6014#false} {6014#false} #188#return; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L272 TraceCheckUtils]: 64: Hoare triple {6014#false} call assume_abort_if_not(#t~ret370); {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L290 TraceCheckUtils]: 65: Hoare triple {6014#false} ~cond := #in~cond; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L290 TraceCheckUtils]: 66: Hoare triple {6014#false} assume !(0bv8 == ~cond); {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L290 TraceCheckUtils]: 67: Hoare triple {6014#false} assume true; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6014#false} {6014#false} #190#return; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L290 TraceCheckUtils]: 69: Hoare triple {6014#false} havoc #t~ret370; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L272 TraceCheckUtils]: 70: Hoare triple {6014#false} call assume_abort_if_not((if 0bv32 == (if ~to_add.base != 0bv64 || ~to_add.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L290 TraceCheckUtils]: 71: Hoare triple {6014#false} ~cond := #in~cond; {6014#false} is VALID [2022-02-20 21:11:27,971 INFO L290 TraceCheckUtils]: 72: Hoare triple {6014#false} assume !(0bv8 == ~cond); {6014#false} is VALID [2022-02-20 21:11:27,972 INFO L290 TraceCheckUtils]: 73: Hoare triple {6014#false} assume true; {6014#false} is VALID [2022-02-20 21:11:27,972 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6014#false} {6014#false} #192#return; {6014#false} is VALID [2022-02-20 21:11:27,972 INFO L290 TraceCheckUtils]: 75: Hoare triple {6014#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8bv64);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, ~bvadd64(8bv64, ~to_add.offset), 8bv64);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8bv64);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64); {6014#false} is VALID [2022-02-20 21:11:27,972 INFO L272 TraceCheckUtils]: 76: Hoare triple {6014#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {6014#false} is VALID [2022-02-20 21:11:27,972 INFO L290 TraceCheckUtils]: 77: Hoare triple {6014#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {6014#false} is VALID [2022-02-20 21:11:27,972 INFO L290 TraceCheckUtils]: 78: Hoare triple {6014#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {6014#false} is VALID [2022-02-20 21:11:27,972 INFO L290 TraceCheckUtils]: 79: Hoare triple {6014#false} #t~short316 := #t~short313; {6014#false} is VALID [2022-02-20 21:11:27,972 INFO L290 TraceCheckUtils]: 80: Hoare triple {6014#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {6014#false} is VALID [2022-02-20 21:11:27,972 INFO L290 TraceCheckUtils]: 81: Hoare triple {6014#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {6014#false} is VALID [2022-02-20 21:11:27,972 INFO L290 TraceCheckUtils]: 82: Hoare triple {6014#false} assume true; {6014#false} is VALID [2022-02-20 21:11:27,972 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {6014#false} {6014#false} #194#return; {6014#false} is VALID [2022-02-20 21:11:27,972 INFO L272 TraceCheckUtils]: 84: Hoare triple {6014#false} call __VERIFIER_assert(#t~ret373); {6014#false} is VALID [2022-02-20 21:11:27,972 INFO L290 TraceCheckUtils]: 85: Hoare triple {6014#false} ~cond := #in~cond; {6014#false} is VALID [2022-02-20 21:11:27,972 INFO L290 TraceCheckUtils]: 86: Hoare triple {6014#false} assume 0bv8 == ~cond; {6014#false} is VALID [2022-02-20 21:11:27,972 INFO L290 TraceCheckUtils]: 87: Hoare triple {6014#false} assume !false; {6014#false} is VALID [2022-02-20 21:11:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-02-20 21:11:27,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 21:11:28,411 INFO L290 TraceCheckUtils]: 87: Hoare triple {6014#false} assume !false; {6014#false} is VALID [2022-02-20 21:11:28,411 INFO L290 TraceCheckUtils]: 86: Hoare triple {6014#false} assume 0bv8 == ~cond; {6014#false} is VALID [2022-02-20 21:11:28,411 INFO L290 TraceCheckUtils]: 85: Hoare triple {6014#false} ~cond := #in~cond; {6014#false} is VALID [2022-02-20 21:11:28,411 INFO L272 TraceCheckUtils]: 84: Hoare triple {6014#false} call __VERIFIER_assert(#t~ret373); {6014#false} is VALID [2022-02-20 21:11:28,411 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {6013#true} {6014#false} #194#return; {6014#false} is VALID [2022-02-20 21:11:28,412 INFO L290 TraceCheckUtils]: 82: Hoare triple {6013#true} assume true; {6013#true} is VALID [2022-02-20 21:11:28,412 INFO L290 TraceCheckUtils]: 81: Hoare triple {6013#true} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {6013#true} is VALID [2022-02-20 21:11:28,412 INFO L290 TraceCheckUtils]: 80: Hoare triple {6013#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {6013#true} is VALID [2022-02-20 21:11:28,412 INFO L290 TraceCheckUtils]: 79: Hoare triple {6013#true} #t~short316 := #t~short313; {6013#true} is VALID [2022-02-20 21:11:28,412 INFO L290 TraceCheckUtils]: 78: Hoare triple {6013#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {6013#true} is VALID [2022-02-20 21:11:28,412 INFO L290 TraceCheckUtils]: 77: Hoare triple {6013#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {6013#true} is VALID [2022-02-20 21:11:28,412 INFO L272 TraceCheckUtils]: 76: Hoare triple {6014#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {6013#true} is VALID [2022-02-20 21:11:28,412 INFO L290 TraceCheckUtils]: 75: Hoare triple {6014#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8bv64);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, ~bvadd64(8bv64, ~to_add.offset), 8bv64);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8bv64);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64); {6014#false} is VALID [2022-02-20 21:11:28,412 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {6013#true} {6014#false} #192#return; {6014#false} is VALID [2022-02-20 21:11:28,412 INFO L290 TraceCheckUtils]: 73: Hoare triple {6013#true} assume true; {6013#true} is VALID [2022-02-20 21:11:28,412 INFO L290 TraceCheckUtils]: 72: Hoare triple {6013#true} assume !(0bv8 == ~cond); {6013#true} is VALID [2022-02-20 21:11:28,412 INFO L290 TraceCheckUtils]: 71: Hoare triple {6013#true} ~cond := #in~cond; {6013#true} is VALID [2022-02-20 21:11:28,412 INFO L272 TraceCheckUtils]: 70: Hoare triple {6014#false} call assume_abort_if_not((if 0bv32 == (if ~to_add.base != 0bv64 || ~to_add.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {6013#true} is VALID [2022-02-20 21:11:28,412 INFO L290 TraceCheckUtils]: 69: Hoare triple {6014#false} havoc #t~ret370; {6014#false} is VALID [2022-02-20 21:11:28,413 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6013#true} {6014#false} #190#return; {6014#false} is VALID [2022-02-20 21:11:28,413 INFO L290 TraceCheckUtils]: 67: Hoare triple {6013#true} assume true; {6013#true} is VALID [2022-02-20 21:11:28,413 INFO L290 TraceCheckUtils]: 66: Hoare triple {6013#true} assume !(0bv8 == ~cond); {6013#true} is VALID [2022-02-20 21:11:28,413 INFO L290 TraceCheckUtils]: 65: Hoare triple {6013#true} ~cond := #in~cond; {6013#true} is VALID [2022-02-20 21:11:28,413 INFO L272 TraceCheckUtils]: 64: Hoare triple {6014#false} call assume_abort_if_not(#t~ret370); {6013#true} is VALID [2022-02-20 21:11:28,413 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {6013#true} {6014#false} #188#return; {6014#false} is VALID [2022-02-20 21:11:28,413 INFO L290 TraceCheckUtils]: 62: Hoare triple {6013#true} assume true; {6013#true} is VALID [2022-02-20 21:11:28,413 INFO L290 TraceCheckUtils]: 61: Hoare triple {6013#true} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {6013#true} is VALID [2022-02-20 21:11:28,413 INFO L290 TraceCheckUtils]: 60: Hoare triple {6013#true} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {6013#true} is VALID [2022-02-20 21:11:28,413 INFO L290 TraceCheckUtils]: 59: Hoare triple {6013#true} #t~short316 := #t~short313; {6013#true} is VALID [2022-02-20 21:11:28,413 INFO L290 TraceCheckUtils]: 58: Hoare triple {6013#true} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {6013#true} is VALID [2022-02-20 21:11:28,413 INFO L290 TraceCheckUtils]: 57: Hoare triple {6013#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {6013#true} is VALID [2022-02-20 21:11:28,413 INFO L272 TraceCheckUtils]: 56: Hoare triple {6014#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {6013#true} is VALID [2022-02-20 21:11:28,413 INFO L290 TraceCheckUtils]: 55: Hoare triple {6014#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {6014#false} is VALID [2022-02-20 21:11:28,413 INFO L272 TraceCheckUtils]: 54: Hoare triple {6014#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, ~bvadd64(16bv64, aws_linked_list_push_back_~list#1.offset), aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {6014#false} is VALID [2022-02-20 21:11:28,413 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6013#true} {6014#false} #216#return; {6014#false} is VALID [2022-02-20 21:11:28,413 INFO L290 TraceCheckUtils]: 52: Hoare triple {6013#true} assume true; {6013#true} is VALID [2022-02-20 21:11:28,413 INFO L290 TraceCheckUtils]: 51: Hoare triple {6013#true} assume !(0bv8 == ~cond); {6013#true} is VALID [2022-02-20 21:11:28,413 INFO L290 TraceCheckUtils]: 50: Hoare triple {6013#true} ~cond := #in~cond; {6013#true} is VALID [2022-02-20 21:11:28,413 INFO L272 TraceCheckUtils]: 49: Hoare triple {6014#false} call assume_abort_if_not((if 0bv32 == (if aws_linked_list_push_back_~node#1.base != 0bv64 || aws_linked_list_push_back_~node#1.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {6013#true} is VALID [2022-02-20 21:11:28,414 INFO L290 TraceCheckUtils]: 48: Hoare triple {6014#false} havoc aws_linked_list_push_back_#t~ret386#1; {6014#false} is VALID [2022-02-20 21:11:28,414 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6013#true} {6014#false} #214#return; {6014#false} is VALID [2022-02-20 21:11:28,414 INFO L290 TraceCheckUtils]: 46: Hoare triple {6013#true} assume true; {6013#true} is VALID [2022-02-20 21:11:28,414 INFO L290 TraceCheckUtils]: 45: Hoare triple {6013#true} assume !(0bv8 == ~cond); {6013#true} is VALID [2022-02-20 21:11:28,414 INFO L290 TraceCheckUtils]: 44: Hoare triple {6013#true} ~cond := #in~cond; {6013#true} is VALID [2022-02-20 21:11:28,414 INFO L272 TraceCheckUtils]: 43: Hoare triple {6014#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {6013#true} is VALID [2022-02-20 21:11:28,414 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {6014#false} {6013#true} #212#return; {6014#false} is VALID [2022-02-20 21:11:28,414 INFO L290 TraceCheckUtils]: 41: Hoare triple {6014#false} assume true; {6014#false} is VALID [2022-02-20 21:11:28,414 INFO L290 TraceCheckUtils]: 40: Hoare triple {6014#false} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {6014#false} is VALID [2022-02-20 21:11:28,414 INFO L290 TraceCheckUtils]: 39: Hoare triple {6014#false} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {6014#false} is VALID [2022-02-20 21:11:28,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {6437#(or (not (= (_ bv0 64) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)) (not (= (_ bv0 64) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|)))} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base != 0bv64 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0bv64); {6014#false} is VALID [2022-02-20 21:11:28,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {6441#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))))} assume !(0bv8 == aws_linked_list_is_valid_deep_#t~ret317#1);havoc aws_linked_list_is_valid_deep_#t~ret317#1;call aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset := read~$Pointer$(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, 8bv64);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset;havoc aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset; {6437#(or (not (= (_ bv0 64) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|)) (not (= (_ bv0 64) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|)))} is VALID [2022-02-20 21:11:28,416 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6013#true} {6441#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))))} #242#return; {6441#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))))} is VALID [2022-02-20 21:11:28,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {6013#true} assume true; {6013#true} is VALID [2022-02-20 21:11:28,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {6013#true} #res := (if 0bv32 == (if #t~short311 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {6013#true} is VALID [2022-02-20 21:11:28,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {6013#true} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, ~bvadd64(8bv64, #t~mem309.offset), 8bv64);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {6013#true} is VALID [2022-02-20 21:11:28,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {6013#true} #t~short311 := #t~short308; {6013#true} is VALID [2022-02-20 21:11:28,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {6013#true} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);#t~short308 := #t~mem307.base != 0bv64 || #t~mem307.offset != 0bv64; {6013#true} is VALID [2022-02-20 21:11:28,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {6013#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0bv64 || ~node.offset != 0bv64; {6013#true} is VALID [2022-02-20 21:11:28,416 INFO L272 TraceCheckUtils]: 29: Hoare triple {6441#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))))} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {6013#true} is VALID [2022-02-20 21:11:28,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {6441#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))))} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == ~bvadd64(16bv64, aws_linked_list_is_valid_deep_~list#1.offset)); {6441#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))))} is VALID [2022-02-20 21:11:28,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {6441#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))))} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0bv64 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0bv64); {6441#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))))} is VALID [2022-02-20 21:11:28,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {6475#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|) (_ bv0 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|))))} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0bv64 && aws_linked_list_is_valid_deep_~list#1.offset == 0bv64);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0bv8; {6441#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset|))))} is VALID [2022-02-20 21:11:28,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {6479#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))))} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {6475#(or (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|) (_ bv0 64))) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.offset|))))} is VALID [2022-02-20 21:11:28,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {6479#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))))} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(16bv64, ~list#1.offset), 8bv64);#t~short305#1 := #t~mem304#1.base == 0bv64 && #t~mem304#1.offset == 0bv64; {6479#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))))} is VALID [2022-02-20 21:11:28,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {6479#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))))} #t~short305#1 := #t~short303#1; {6479#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))))} is VALID [2022-02-20 21:11:28,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {6479#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))))} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(24bv64, ~list#1.offset), 8bv64);#t~short303#1 := #t~mem302#1.base != 0bv64 || #t~mem302#1.offset != 0bv64; {6479#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))))} is VALID [2022-02-20 21:11:28,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {6479#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))))} #t~short303#1 := #t~short301#1; {6479#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))))} is VALID [2022-02-20 21:11:28,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {6495#(or (not |aws_linked_list_is_valid_#t~short301#1|) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))))} assume #t~short301#1;call #t~mem300#1.base, #t~mem300#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(8bv64, ~list#1.offset), 8bv64);#t~short301#1 := #t~mem300#1.base == 0bv64 && #t~mem300#1.offset == 0bv64; {6479#(or (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))))} is VALID [2022-02-20 21:11:28,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {6499#(or (not |aws_linked_list_is_valid_#t~short299#1|) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))))} #t~short301#1 := #t~short299#1; {6495#(or (not |aws_linked_list_is_valid_#t~short301#1|) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))))} is VALID [2022-02-20 21:11:28,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {6013#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8bv64);#t~short299#1 := #t~mem298#1.base != 0bv64 || #t~mem298#1.offset != 0bv64; {6499#(or (not |aws_linked_list_is_valid_#t~short299#1|) (not (= (_ bv0 64) (select (select |#memory_$Pointer$.base| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|))) (not (= (select (select |#memory_$Pointer$.offset| |aws_linked_list_is_valid_~list#1.base|) |aws_linked_list_is_valid_~list#1.offset|) (_ bv0 64))))} is VALID [2022-02-20 21:11:28,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {6013#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0bv64 || ~list#1.offset != 0bv64; {6013#true} is VALID [2022-02-20 21:11:28,422 INFO L272 TraceCheckUtils]: 16: Hoare triple {6013#true} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {6013#true} is VALID [2022-02-20 21:11:28,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {6013#true} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, ~bvadd64(24bv64, aws_linked_list_push_back_harness_~#list~0#1.offset), 8bv64);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {6013#true} is VALID [2022-02-20 21:11:28,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {6013#true} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8bv64);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(24bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64); {6013#true} is VALID [2022-02-20 21:11:28,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {6013#true} assume !~bvult64(ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~length~1#1); {6013#true} is VALID [2022-02-20 21:11:28,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {6013#true} call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(8bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0bv64; {6013#true} is VALID [2022-02-20 21:11:28,423 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6013#true} {6013#true} #210#return; {6013#true} is VALID [2022-02-20 21:11:28,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {6013#true} assume true; {6013#true} is VALID [2022-02-20 21:11:28,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {6013#true} assume !(0bv8 == ~cond); {6013#true} is VALID [2022-02-20 21:11:28,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {6013#true} ~cond := #in~cond; {6013#true} is VALID [2022-02-20 21:11:28,423 INFO L272 TraceCheckUtils]: 7: Hoare triple {6013#true} call assume_abort_if_not((if 0bv32 == (if ~bvule64(ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~max_length#1) then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {6013#true} is VALID [2022-02-20 21:11:28,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {6013#true} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {6013#true} is VALID [2022-02-20 21:11:28,423 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {6013#true} {6013#true} #208#return; {6013#true} is VALID [2022-02-20 21:11:28,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {6013#true} assume true; {6013#true} is VALID [2022-02-20 21:11:28,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {6013#true} #res := #t~nondet13;havoc #t~nondet13; {6013#true} is VALID [2022-02-20 21:11:28,424 INFO L272 TraceCheckUtils]: 2: Hoare triple {6013#true} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {6013#true} is VALID [2022-02-20 21:11:28,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {6013#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32bv64);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16bv64);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20bv64;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {6013#true} is VALID [2022-02-20 21:11:28,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {6013#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(36bv64, 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; {6013#true} is VALID [2022-02-20 21:11:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 21:11:28,424 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:11:28,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644967665] [2022-02-20 21:11:28,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644967665] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 21:11:28,425 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 21:11:28,425 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2022-02-20 21:11:28,425 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521382766] [2022-02-20 21:11:28,425 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 21:11:28,426 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 88 [2022-02-20 21:11:28,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:11:28,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 21:11:28,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:28,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 21:11:28,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:11:28,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 21:11:28,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-02-20 21:11:28,548 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 21:11:35,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:35,467 INFO L93 Difference]: Finished difference Result 224 states and 306 transitions. [2022-02-20 21:11:35,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 21:11:35,467 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 88 [2022-02-20 21:11:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:11:35,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 21:11:35,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 290 transitions. [2022-02-20 21:11:35,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 21:11:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 290 transitions. [2022-02-20 21:11:35,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 290 transitions. [2022-02-20 21:11:35,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:35,748 INFO L225 Difference]: With dead ends: 224 [2022-02-20 21:11:35,748 INFO L226 Difference]: Without dead ends: 136 [2022-02-20 21:11:35,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 160 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-02-20 21:11:35,748 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 88 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:11:35,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 1151 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 237 Invalid, 0 Unknown, 75 Unchecked, 1.0s Time] [2022-02-20 21:11:35,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-02-20 21:11:35,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2022-02-20 21:11:35,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:11:35,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 120 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 83 states have internal predecessors, (100), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 21:11:35,768 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 120 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 83 states have internal predecessors, (100), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 21:11:35,769 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 120 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 83 states have internal predecessors, (100), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 21:11:35,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:35,772 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2022-02-20 21:11:35,772 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 184 transitions. [2022-02-20 21:11:35,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:35,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:35,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 83 states have internal predecessors, (100), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) Second operand 136 states. [2022-02-20 21:11:35,774 INFO L87 Difference]: Start difference. First operand has 120 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 83 states have internal predecessors, (100), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) Second operand 136 states. [2022-02-20 21:11:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:35,777 INFO L93 Difference]: Finished difference Result 136 states and 184 transitions. [2022-02-20 21:11:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 184 transitions. [2022-02-20 21:11:35,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:35,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:35,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:11:35,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:11:35,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 83 states have internal predecessors, (100), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 21:11:35,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 159 transitions. [2022-02-20 21:11:35,781 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 159 transitions. Word has length 88 [2022-02-20 21:11:35,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:11:35,781 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 159 transitions. [2022-02-20 21:11:35,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.8125) internal successors, (77), 16 states have internal predecessors, (77), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-02-20 21:11:35,782 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 159 transitions. [2022-02-20 21:11:35,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-20 21:11:35,782 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:11:35,782 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:11:35,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 21:11:35,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 21:11:35,989 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:11:35,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:11:35,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1126802643, now seen corresponding path program 1 times [2022-02-20 21:11:35,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:11:35,991 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886360322] [2022-02-20 21:11:35,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:11:35,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:11:35,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:11:35,992 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:11:35,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 21:11:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:36,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 21:11:36,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:36,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:11:36,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {7306#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(36bv64, 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; {7306#true} is VALID [2022-02-20 21:11:36,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {7306#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32bv64);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16bv64);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20bv64;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {7306#true} is VALID [2022-02-20 21:11:36,560 INFO L272 TraceCheckUtils]: 2: Hoare triple {7306#true} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {7306#true} is VALID [2022-02-20 21:11:36,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {7306#true} #res := #t~nondet13;havoc #t~nondet13; {7306#true} is VALID [2022-02-20 21:11:36,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {7306#true} assume true; {7306#true} is VALID [2022-02-20 21:11:36,560 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {7306#true} {7306#true} #208#return; {7306#true} is VALID [2022-02-20 21:11:36,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {7306#true} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {7306#true} is VALID [2022-02-20 21:11:36,560 INFO L272 TraceCheckUtils]: 7: Hoare triple {7306#true} call assume_abort_if_not((if 0bv32 == (if ~bvule64(ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~max_length#1) then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {7306#true} is VALID [2022-02-20 21:11:36,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {7306#true} ~cond := #in~cond; {7306#true} is VALID [2022-02-20 21:11:36,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {7306#true} assume !(0bv8 == ~cond); {7306#true} is VALID [2022-02-20 21:11:36,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {7306#true} assume true; {7306#true} is VALID [2022-02-20 21:11:36,560 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7306#true} {7306#true} #210#return; {7306#true} is VALID [2022-02-20 21:11:36,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {7306#true} call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(8bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0bv64; {7306#true} is VALID [2022-02-20 21:11:36,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {7306#true} assume !~bvult64(ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~length~1#1); {7306#true} is VALID [2022-02-20 21:11:36,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {7306#true} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8bv64);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(24bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64); {7306#true} is VALID [2022-02-20 21:11:36,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {7306#true} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, ~bvadd64(24bv64, aws_linked_list_push_back_harness_~#list~0#1.offset), 8bv64);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {7306#true} is VALID [2022-02-20 21:11:36,561 INFO L272 TraceCheckUtils]: 16: Hoare triple {7306#true} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {7306#true} is VALID [2022-02-20 21:11:36,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {7306#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0bv64 || ~list#1.offset != 0bv64; {7306#true} is VALID [2022-02-20 21:11:36,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {7306#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8bv64);#t~short299#1 := #t~mem298#1.base != 0bv64 || #t~mem298#1.offset != 0bv64; {7306#true} is VALID [2022-02-20 21:11:36,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {7306#true} #t~short301#1 := #t~short299#1; {7306#true} is VALID [2022-02-20 21:11:36,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {7306#true} assume !#t~short301#1; {7371#(not |aws_linked_list_is_valid_#t~short301#1|)} is VALID [2022-02-20 21:11:36,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {7371#(not |aws_linked_list_is_valid_#t~short301#1|)} #t~short303#1 := #t~short301#1; {7375#(not |aws_linked_list_is_valid_#t~short303#1|)} is VALID [2022-02-20 21:11:36,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {7375#(not |aws_linked_list_is_valid_#t~short303#1|)} assume #t~short303#1;call #t~mem302#1.base, #t~mem302#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(24bv64, ~list#1.offset), 8bv64);#t~short303#1 := #t~mem302#1.base != 0bv64 || #t~mem302#1.offset != 0bv64; {7307#false} is VALID [2022-02-20 21:11:36,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {7307#false} #t~short305#1 := #t~short303#1; {7307#false} is VALID [2022-02-20 21:11:36,562 INFO L290 TraceCheckUtils]: 24: Hoare triple {7307#false} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(16bv64, ~list#1.offset), 8bv64);#t~short305#1 := #t~mem304#1.base == 0bv64 && #t~mem304#1.offset == 0bv64; {7307#false} is VALID [2022-02-20 21:11:36,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {7307#false} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {7307#false} is VALID [2022-02-20 21:11:36,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {7307#false} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0bv64 && aws_linked_list_is_valid_deep_~list#1.offset == 0bv64);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0bv8; {7307#false} is VALID [2022-02-20 21:11:36,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {7307#false} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0bv64 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0bv64); {7307#false} is VALID [2022-02-20 21:11:36,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {7307#false} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == ~bvadd64(16bv64, aws_linked_list_is_valid_deep_~list#1.offset)); {7307#false} is VALID [2022-02-20 21:11:36,562 INFO L272 TraceCheckUtils]: 29: Hoare triple {7307#false} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {7307#false} is VALID [2022-02-20 21:11:36,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {7307#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0bv64 || ~node.offset != 0bv64; {7307#false} is VALID [2022-02-20 21:11:36,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {7307#false} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);#t~short308 := #t~mem307.base != 0bv64 || #t~mem307.offset != 0bv64; {7307#false} is VALID [2022-02-20 21:11:36,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {7307#false} #t~short311 := #t~short308; {7307#false} is VALID [2022-02-20 21:11:36,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {7307#false} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, ~bvadd64(8bv64, #t~mem309.offset), 8bv64);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {7307#false} #res := (if 0bv32 == (if #t~short311 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {7307#false} assume true; {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7307#false} {7307#false} #242#return; {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L290 TraceCheckUtils]: 37: Hoare triple {7307#false} assume !(0bv8 == aws_linked_list_is_valid_deep_#t~ret317#1);havoc aws_linked_list_is_valid_deep_#t~ret317#1;call aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset := read~$Pointer$(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, 8bv64);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset;havoc aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset; {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L290 TraceCheckUtils]: 38: Hoare triple {7307#false} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base != 0bv64 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0bv64); {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L290 TraceCheckUtils]: 39: Hoare triple {7307#false} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L290 TraceCheckUtils]: 40: Hoare triple {7307#false} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L290 TraceCheckUtils]: 41: Hoare triple {7307#false} assume true; {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {7307#false} {7306#true} #212#return; {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L272 TraceCheckUtils]: 43: Hoare triple {7307#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L290 TraceCheckUtils]: 44: Hoare triple {7307#false} ~cond := #in~cond; {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L290 TraceCheckUtils]: 45: Hoare triple {7307#false} assume !(0bv8 == ~cond); {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L290 TraceCheckUtils]: 46: Hoare triple {7307#false} assume true; {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7307#false} {7307#false} #214#return; {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L290 TraceCheckUtils]: 48: Hoare triple {7307#false} havoc aws_linked_list_push_back_#t~ret386#1; {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L272 TraceCheckUtils]: 49: Hoare triple {7307#false} call assume_abort_if_not((if 0bv32 == (if aws_linked_list_push_back_~node#1.base != 0bv64 || aws_linked_list_push_back_~node#1.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L290 TraceCheckUtils]: 50: Hoare triple {7307#false} ~cond := #in~cond; {7307#false} is VALID [2022-02-20 21:11:36,563 INFO L290 TraceCheckUtils]: 51: Hoare triple {7307#false} assume !(0bv8 == ~cond); {7307#false} is VALID [2022-02-20 21:11:36,564 INFO L290 TraceCheckUtils]: 52: Hoare triple {7307#false} assume true; {7307#false} is VALID [2022-02-20 21:11:36,564 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {7307#false} {7307#false} #216#return; {7307#false} is VALID [2022-02-20 21:11:36,564 INFO L272 TraceCheckUtils]: 54: Hoare triple {7307#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, ~bvadd64(16bv64, aws_linked_list_push_back_~list#1.offset), aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {7307#false} is VALID [2022-02-20 21:11:36,564 INFO L290 TraceCheckUtils]: 55: Hoare triple {7307#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {7307#false} is VALID [2022-02-20 21:11:36,564 INFO L272 TraceCheckUtils]: 56: Hoare triple {7307#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {7307#false} is VALID [2022-02-20 21:11:36,564 INFO L290 TraceCheckUtils]: 57: Hoare triple {7307#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {7307#false} is VALID [2022-02-20 21:11:36,564 INFO L290 TraceCheckUtils]: 58: Hoare triple {7307#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {7307#false} is VALID [2022-02-20 21:11:36,564 INFO L290 TraceCheckUtils]: 59: Hoare triple {7307#false} #t~short316 := #t~short313; {7307#false} is VALID [2022-02-20 21:11:36,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {7307#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {7307#false} is VALID [2022-02-20 21:11:36,565 INFO L290 TraceCheckUtils]: 61: Hoare triple {7307#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {7307#false} is VALID [2022-02-20 21:11:36,565 INFO L290 TraceCheckUtils]: 62: Hoare triple {7307#false} assume true; {7307#false} is VALID [2022-02-20 21:11:36,565 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {7307#false} {7307#false} #188#return; {7307#false} is VALID [2022-02-20 21:11:36,565 INFO L272 TraceCheckUtils]: 64: Hoare triple {7307#false} call assume_abort_if_not(#t~ret370); {7307#false} is VALID [2022-02-20 21:11:36,565 INFO L290 TraceCheckUtils]: 65: Hoare triple {7307#false} ~cond := #in~cond; {7307#false} is VALID [2022-02-20 21:11:36,565 INFO L290 TraceCheckUtils]: 66: Hoare triple {7307#false} assume !(0bv8 == ~cond); {7307#false} is VALID [2022-02-20 21:11:36,565 INFO L290 TraceCheckUtils]: 67: Hoare triple {7307#false} assume true; {7307#false} is VALID [2022-02-20 21:11:36,565 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7307#false} {7307#false} #190#return; {7307#false} is VALID [2022-02-20 21:11:36,565 INFO L290 TraceCheckUtils]: 69: Hoare triple {7307#false} havoc #t~ret370; {7307#false} is VALID [2022-02-20 21:11:36,566 INFO L272 TraceCheckUtils]: 70: Hoare triple {7307#false} call assume_abort_if_not((if 0bv32 == (if ~to_add.base != 0bv64 || ~to_add.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {7307#false} is VALID [2022-02-20 21:11:36,566 INFO L290 TraceCheckUtils]: 71: Hoare triple {7307#false} ~cond := #in~cond; {7307#false} is VALID [2022-02-20 21:11:36,566 INFO L290 TraceCheckUtils]: 72: Hoare triple {7307#false} assume !(0bv8 == ~cond); {7307#false} is VALID [2022-02-20 21:11:36,566 INFO L290 TraceCheckUtils]: 73: Hoare triple {7307#false} assume true; {7307#false} is VALID [2022-02-20 21:11:36,566 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {7307#false} {7307#false} #192#return; {7307#false} is VALID [2022-02-20 21:11:36,566 INFO L290 TraceCheckUtils]: 75: Hoare triple {7307#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8bv64);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, ~bvadd64(8bv64, ~to_add.offset), 8bv64);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8bv64);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64); {7307#false} is VALID [2022-02-20 21:11:36,566 INFO L272 TraceCheckUtils]: 76: Hoare triple {7307#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {7307#false} is VALID [2022-02-20 21:11:36,566 INFO L290 TraceCheckUtils]: 77: Hoare triple {7307#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {7307#false} is VALID [2022-02-20 21:11:36,566 INFO L290 TraceCheckUtils]: 78: Hoare triple {7307#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {7307#false} is VALID [2022-02-20 21:11:36,567 INFO L290 TraceCheckUtils]: 79: Hoare triple {7307#false} #t~short316 := #t~short313; {7307#false} is VALID [2022-02-20 21:11:36,567 INFO L290 TraceCheckUtils]: 80: Hoare triple {7307#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {7307#false} is VALID [2022-02-20 21:11:36,567 INFO L290 TraceCheckUtils]: 81: Hoare triple {7307#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {7307#false} is VALID [2022-02-20 21:11:36,567 INFO L290 TraceCheckUtils]: 82: Hoare triple {7307#false} assume true; {7307#false} is VALID [2022-02-20 21:11:36,567 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {7307#false} {7307#false} #194#return; {7307#false} is VALID [2022-02-20 21:11:36,567 INFO L272 TraceCheckUtils]: 84: Hoare triple {7307#false} call __VERIFIER_assert(#t~ret373); {7307#false} is VALID [2022-02-20 21:11:36,567 INFO L290 TraceCheckUtils]: 85: Hoare triple {7307#false} ~cond := #in~cond; {7307#false} is VALID [2022-02-20 21:11:36,567 INFO L290 TraceCheckUtils]: 86: Hoare triple {7307#false} assume 0bv8 == ~cond; {7307#false} is VALID [2022-02-20 21:11:36,567 INFO L290 TraceCheckUtils]: 87: Hoare triple {7307#false} assume !false; {7307#false} is VALID [2022-02-20 21:11:36,568 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-20 21:11:36,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:11:36,568 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:11:36,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886360322] [2022-02-20 21:11:36,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [886360322] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:11:36,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:11:36,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:11:36,568 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086535433] [2022-02-20 21:11:36,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:11:36,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2022-02-20 21:11:36,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:11:36,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:11:36,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:36,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:11:36,636 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:11:36,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:11:36,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:11:36,636 INFO L87 Difference]: Start difference. First operand 120 states and 159 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:11:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:37,294 INFO L93 Difference]: Finished difference Result 229 states and 311 transitions. [2022-02-20 21:11:37,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:11:37,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2022-02-20 21:11:37,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:11:37,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:11:37,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2022-02-20 21:11:37,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:11:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2022-02-20 21:11:37,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 257 transitions. [2022-02-20 21:11:37,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:37,500 INFO L225 Difference]: With dead ends: 229 [2022-02-20 21:11:37,500 INFO L226 Difference]: Without dead ends: 123 [2022-02-20 21:11:37,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:11:37,502 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 8 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:11:37,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 385 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:11:37,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-02-20 21:11:37,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2022-02-20 21:11:37,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:11:37,515 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 120 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 83 states have internal predecessors, (99), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 21:11:37,515 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 120 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 83 states have internal predecessors, (99), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 21:11:37,516 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 120 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 83 states have internal predecessors, (99), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 21:11:37,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:37,520 INFO L93 Difference]: Finished difference Result 123 states and 163 transitions. [2022-02-20 21:11:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 163 transitions. [2022-02-20 21:11:37,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:37,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:37,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 83 states have internal predecessors, (99), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) Second operand 123 states. [2022-02-20 21:11:37,521 INFO L87 Difference]: Start difference. First operand has 120 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 83 states have internal predecessors, (99), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) Second operand 123 states. [2022-02-20 21:11:37,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:37,524 INFO L93 Difference]: Finished difference Result 123 states and 163 transitions. [2022-02-20 21:11:37,524 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 163 transitions. [2022-02-20 21:11:37,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:37,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:37,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:11:37,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:11:37,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 83 states have internal predecessors, (99), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 21:11:37,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 158 transitions. [2022-02-20 21:11:37,530 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 158 transitions. Word has length 88 [2022-02-20 21:11:37,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:11:37,531 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 158 transitions. [2022-02-20 21:11:37,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:11:37,531 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 158 transitions. [2022-02-20 21:11:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-20 21:11:37,532 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:11:37,532 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:11:37,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 21:11:37,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 21:11:37,746 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:11:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:11:37,747 INFO L85 PathProgramCache]: Analyzing trace with hash 394835217, now seen corresponding path program 1 times [2022-02-20 21:11:37,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:11:37,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261073423] [2022-02-20 21:11:37,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:11:37,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:11:37,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:11:37,748 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:11:37,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 21:11:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:38,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 21:11:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:38,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:11:38,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {8297#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(36bv64, 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; {8297#true} is VALID [2022-02-20 21:11:38,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {8297#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_back_harness } true;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset, aws_linked_list_push_back_harness_#t~ret679#1, aws_linked_list_push_back_harness_#t~ret680#1, aws_linked_list_push_back_harness_#t~ret681#1, aws_linked_list_push_back_harness_#t~mem682#1.base, aws_linked_list_push_back_harness_#t~mem682#1.offset, aws_linked_list_push_back_harness_#t~mem683#1.base, aws_linked_list_push_back_harness_#t~mem683#1.offset, aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset, aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset;call aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32bv64);call aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset := #Ultimate.allocOnStack(16bv64);assume { :begin_inline_ensure_linked_list_is_allocated } true;ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset, ensure_linked_list_is_allocated_#in~max_length#1 := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, 20bv64;havoc ensure_linked_list_is_allocated_#t~ret547#1, ensure_linked_list_is_allocated_#t~malloc549#1.base, ensure_linked_list_is_allocated_#t~malloc549#1.offset, ensure_linked_list_is_allocated_#t~post548#1, ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~node~0#1.base, ensure_linked_list_is_allocated_~node~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset, ensure_linked_list_is_allocated_~max_length#1, ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset;ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset := ensure_linked_list_is_allocated_#in~list#1.base, ensure_linked_list_is_allocated_#in~list#1.offset;ensure_linked_list_is_allocated_~max_length#1 := ensure_linked_list_is_allocated_#in~max_length#1; {8297#true} is VALID [2022-02-20 21:11:38,193 INFO L272 TraceCheckUtils]: 2: Hoare triple {8297#true} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {8297#true} is VALID [2022-02-20 21:11:38,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {8297#true} #res := #t~nondet13;havoc #t~nondet13; {8297#true} is VALID [2022-02-20 21:11:38,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {8297#true} assume true; {8297#true} is VALID [2022-02-20 21:11:38,193 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {8297#true} {8297#true} #208#return; {8297#true} is VALID [2022-02-20 21:11:38,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {8297#true} ensure_linked_list_is_allocated_~length~1#1 := ensure_linked_list_is_allocated_#t~ret547#1;havoc ensure_linked_list_is_allocated_#t~ret547#1; {8297#true} is VALID [2022-02-20 21:11:38,193 INFO L272 TraceCheckUtils]: 7: Hoare triple {8297#true} call assume_abort_if_not((if 0bv32 == (if ~bvule64(ensure_linked_list_is_allocated_~length~1#1, ensure_linked_list_is_allocated_~max_length#1) then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {8297#true} is VALID [2022-02-20 21:11:38,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {8297#true} ~cond := #in~cond; {8297#true} is VALID [2022-02-20 21:11:38,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {8297#true} assume !(0bv8 == ~cond); {8297#true} is VALID [2022-02-20 21:11:38,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {8297#true} assume true; {8297#true} is VALID [2022-02-20 21:11:38,194 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {8297#true} {8297#true} #210#return; {8297#true} is VALID [2022-02-20 21:11:38,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {8297#true} call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(8bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);call write~$Pointer$(0bv64, 0bv64, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64);ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset := ensure_linked_list_is_allocated_~list#1.base, ensure_linked_list_is_allocated_~list#1.offset;ensure_linked_list_is_allocated_~i~1#1 := 0bv64; {8297#true} is VALID [2022-02-20 21:11:38,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {8297#true} assume !~bvult64(ensure_linked_list_is_allocated_~i~1#1, ensure_linked_list_is_allocated_~length~1#1); {8297#true} is VALID [2022-02-20 21:11:38,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {8297#true} call write~$Pointer$(ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(16bv64, ensure_linked_list_is_allocated_~list#1.offset), ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, 8bv64);call write~$Pointer$(ensure_linked_list_is_allocated_~curr~0#1.base, ensure_linked_list_is_allocated_~curr~0#1.offset, ensure_linked_list_is_allocated_~list#1.base, ~bvadd64(24bv64, ensure_linked_list_is_allocated_~list#1.offset), 8bv64); {8297#true} is VALID [2022-02-20 21:11:38,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {8297#true} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_back_harness_~#list~0#1.base, ~bvadd64(24bv64, aws_linked_list_push_back_harness_~#list~0#1.offset), 8bv64);aws_linked_list_push_back_harness_~old_last~0#1.base, aws_linked_list_push_back_harness_~old_last~0#1.offset := aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;havoc aws_linked_list_push_back_harness_#t~mem678#1.base, aws_linked_list_push_back_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_back } true;aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset, aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset := aws_linked_list_push_back_harness_~#list~0#1.base, aws_linked_list_push_back_harness_~#list~0#1.offset, aws_linked_list_push_back_harness_~#to_add~0#1.base, aws_linked_list_push_back_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_back_#t~ret386#1, aws_linked_list_push_back_#t~ret387#1, aws_linked_list_push_back_#t~mem388#1.base, aws_linked_list_push_back_#t~mem388#1.offset, aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset, aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset;aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset := aws_linked_list_push_back_#in~list#1.base, aws_linked_list_push_back_#in~list#1.offset;aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset := aws_linked_list_push_back_#in~node#1.base, aws_linked_list_push_back_#in~node#1.offset; {8297#true} is VALID [2022-02-20 21:11:38,194 INFO L272 TraceCheckUtils]: 16: Hoare triple {8297#true} call aws_linked_list_push_back_#t~ret386#1 := aws_linked_list_is_valid(aws_linked_list_push_back_~list#1.base, aws_linked_list_push_back_~list#1.offset); {8297#true} is VALID [2022-02-20 21:11:38,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {8297#true} ~list#1.base, ~list#1.offset := #in~list#1.base, #in~list#1.offset;#t~short299#1 := ~list#1.base != 0bv64 || ~list#1.offset != 0bv64; {8297#true} is VALID [2022-02-20 21:11:38,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {8297#true} assume #t~short299#1;call #t~mem298#1.base, #t~mem298#1.offset := read~$Pointer$(~list#1.base, ~list#1.offset, 8bv64);#t~short299#1 := #t~mem298#1.base != 0bv64 || #t~mem298#1.offset != 0bv64; {8297#true} is VALID [2022-02-20 21:11:38,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {8297#true} #t~short301#1 := #t~short299#1; {8297#true} is VALID [2022-02-20 21:11:38,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {8297#true} assume !#t~short301#1; {8362#(not |aws_linked_list_is_valid_#t~short301#1|)} is VALID [2022-02-20 21:11:38,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {8362#(not |aws_linked_list_is_valid_#t~short301#1|)} #t~short303#1 := #t~short301#1; {8366#(not |aws_linked_list_is_valid_#t~short303#1|)} is VALID [2022-02-20 21:11:38,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {8366#(not |aws_linked_list_is_valid_#t~short303#1|)} assume !#t~short303#1; {8366#(not |aws_linked_list_is_valid_#t~short303#1|)} is VALID [2022-02-20 21:11:38,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {8366#(not |aws_linked_list_is_valid_#t~short303#1|)} #t~short305#1 := #t~short303#1; {8373#(not |aws_linked_list_is_valid_#t~short305#1|)} is VALID [2022-02-20 21:11:38,196 INFO L290 TraceCheckUtils]: 24: Hoare triple {8373#(not |aws_linked_list_is_valid_#t~short305#1|)} assume #t~short305#1;call #t~mem304#1.base, #t~mem304#1.offset := read~$Pointer$(~list#1.base, ~bvadd64(16bv64, ~list#1.offset), 8bv64);#t~short305#1 := #t~mem304#1.base == 0bv64 && #t~mem304#1.offset == 0bv64; {8298#false} is VALID [2022-02-20 21:11:38,196 INFO L290 TraceCheckUtils]: 25: Hoare triple {8298#false} assume #t~short305#1;havoc #t~mem298#1.base, #t~mem298#1.offset;havoc #t~short299#1;havoc #t~mem300#1.base, #t~mem300#1.offset;havoc #t~short301#1;havoc #t~mem302#1.base, #t~mem302#1.offset;havoc #t~short303#1;havoc #t~mem304#1.base, #t~mem304#1.offset;havoc #t~short305#1;assume { :begin_inline_aws_linked_list_is_valid_deep } true;aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset := ~list#1.base, ~list#1.offset;havoc aws_linked_list_is_valid_deep_#res#1;havoc aws_linked_list_is_valid_deep_#t~ret317#1, aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset, aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset, aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, aws_linked_list_is_valid_deep_~head_reaches_tail~0#1;aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset := aws_linked_list_is_valid_deep_#in~list#1.base, aws_linked_list_is_valid_deep_#in~list#1.offset; {8298#false} is VALID [2022-02-20 21:11:38,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {8298#false} assume !(aws_linked_list_is_valid_deep_~list#1.base == 0bv64 && aws_linked_list_is_valid_deep_~list#1.offset == 0bv64);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_~list#1.base, aws_linked_list_is_valid_deep_~list#1.offset;aws_linked_list_is_valid_deep_~head_reaches_tail~0#1 := 0bv8; {8298#false} is VALID [2022-02-20 21:11:38,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {8298#false} assume !!(aws_linked_list_is_valid_deep_~temp~0#1.base != 0bv64 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0bv64); {8298#false} is VALID [2022-02-20 21:11:38,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {8298#false} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base == aws_linked_list_is_valid_deep_~list#1.base && aws_linked_list_is_valid_deep_~temp~0#1.offset == ~bvadd64(16bv64, aws_linked_list_is_valid_deep_~list#1.offset)); {8298#false} is VALID [2022-02-20 21:11:38,196 INFO L272 TraceCheckUtils]: 29: Hoare triple {8298#false} call aws_linked_list_is_valid_deep_#t~ret317#1 := aws_linked_list_node_next_is_valid(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset); {8298#false} is VALID [2022-02-20 21:11:38,197 INFO L290 TraceCheckUtils]: 30: Hoare triple {8298#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short308 := ~node.base != 0bv64 || ~node.offset != 0bv64; {8298#false} is VALID [2022-02-20 21:11:38,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {8298#false} assume #t~short308;call #t~mem307.base, #t~mem307.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);#t~short308 := #t~mem307.base != 0bv64 || #t~mem307.offset != 0bv64; {8298#false} is VALID [2022-02-20 21:11:38,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {8298#false} #t~short311 := #t~short308; {8298#false} is VALID [2022-02-20 21:11:38,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {8298#false} assume #t~short311;call #t~mem309.base, #t~mem309.offset := read~$Pointer$(~node.base, ~node.offset, 8bv64);call #t~mem310.base, #t~mem310.offset := read~$Pointer$(#t~mem309.base, ~bvadd64(8bv64, #t~mem309.offset), 8bv64);#t~short311 := #t~mem310.base == ~node.base && #t~mem310.offset == ~node.offset; {8298#false} is VALID [2022-02-20 21:11:38,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {8298#false} #res := (if 0bv32 == (if #t~short311 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem307.base, #t~mem307.offset;havoc #t~short308;havoc #t~mem309.base, #t~mem309.offset;havoc #t~mem310.base, #t~mem310.offset;havoc #t~short311; {8298#false} is VALID [2022-02-20 21:11:38,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {8298#false} assume true; {8298#false} is VALID [2022-02-20 21:11:38,197 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8298#false} {8298#false} #242#return; {8298#false} is VALID [2022-02-20 21:11:38,197 INFO L290 TraceCheckUtils]: 37: Hoare triple {8298#false} assume !(0bv8 == aws_linked_list_is_valid_deep_#t~ret317#1);havoc aws_linked_list_is_valid_deep_#t~ret317#1;call aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset := read~$Pointer$(aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset, 8bv64);aws_linked_list_is_valid_deep_~temp~0#1.base, aws_linked_list_is_valid_deep_~temp~0#1.offset := aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset;havoc aws_linked_list_is_valid_deep_#t~mem318#1.base, aws_linked_list_is_valid_deep_#t~mem318#1.offset; {8298#false} is VALID [2022-02-20 21:11:38,197 INFO L290 TraceCheckUtils]: 38: Hoare triple {8298#false} assume !(aws_linked_list_is_valid_deep_~temp~0#1.base != 0bv64 || aws_linked_list_is_valid_deep_~temp~0#1.offset != 0bv64); {8298#false} is VALID [2022-02-20 21:11:38,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {8298#false} aws_linked_list_is_valid_deep_#res#1 := aws_linked_list_is_valid_deep_~head_reaches_tail~0#1; {8298#false} is VALID [2022-02-20 21:11:38,198 INFO L290 TraceCheckUtils]: 40: Hoare triple {8298#false} #t~ret306#1 := aws_linked_list_is_valid_deep_#res#1;assume { :end_inline_aws_linked_list_is_valid_deep } true;#res#1 := #t~ret306#1;havoc #t~ret306#1; {8298#false} is VALID [2022-02-20 21:11:38,198 INFO L290 TraceCheckUtils]: 41: Hoare triple {8298#false} assume true; {8298#false} is VALID [2022-02-20 21:11:38,198 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {8298#false} {8297#true} #212#return; {8298#false} is VALID [2022-02-20 21:11:38,198 INFO L272 TraceCheckUtils]: 43: Hoare triple {8298#false} call assume_abort_if_not(aws_linked_list_push_back_#t~ret386#1); {8298#false} is VALID [2022-02-20 21:11:38,198 INFO L290 TraceCheckUtils]: 44: Hoare triple {8298#false} ~cond := #in~cond; {8298#false} is VALID [2022-02-20 21:11:38,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {8298#false} assume !(0bv8 == ~cond); {8298#false} is VALID [2022-02-20 21:11:38,198 INFO L290 TraceCheckUtils]: 46: Hoare triple {8298#false} assume true; {8298#false} is VALID [2022-02-20 21:11:38,198 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8298#false} {8298#false} #214#return; {8298#false} is VALID [2022-02-20 21:11:38,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {8298#false} havoc aws_linked_list_push_back_#t~ret386#1; {8298#false} is VALID [2022-02-20 21:11:38,199 INFO L272 TraceCheckUtils]: 49: Hoare triple {8298#false} call assume_abort_if_not((if 0bv32 == (if aws_linked_list_push_back_~node#1.base != 0bv64 || aws_linked_list_push_back_~node#1.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {8298#false} is VALID [2022-02-20 21:11:38,199 INFO L290 TraceCheckUtils]: 50: Hoare triple {8298#false} ~cond := #in~cond; {8298#false} is VALID [2022-02-20 21:11:38,199 INFO L290 TraceCheckUtils]: 51: Hoare triple {8298#false} assume !(0bv8 == ~cond); {8298#false} is VALID [2022-02-20 21:11:38,199 INFO L290 TraceCheckUtils]: 52: Hoare triple {8298#false} assume true; {8298#false} is VALID [2022-02-20 21:11:38,199 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8298#false} {8298#false} #216#return; {8298#false} is VALID [2022-02-20 21:11:38,199 INFO L272 TraceCheckUtils]: 54: Hoare triple {8298#false} call aws_linked_list_insert_before(aws_linked_list_push_back_~list#1.base, ~bvadd64(16bv64, aws_linked_list_push_back_~list#1.offset), aws_linked_list_push_back_~node#1.base, aws_linked_list_push_back_~node#1.offset); {8298#false} is VALID [2022-02-20 21:11:38,199 INFO L290 TraceCheckUtils]: 55: Hoare triple {8298#false} ~before.base, ~before.offset := #in~before.base, #in~before.offset;~to_add.base, ~to_add.offset := #in~to_add.base, #in~to_add.offset; {8298#false} is VALID [2022-02-20 21:11:38,199 INFO L272 TraceCheckUtils]: 56: Hoare triple {8298#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {8298#false} is VALID [2022-02-20 21:11:38,199 INFO L290 TraceCheckUtils]: 57: Hoare triple {8298#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {8298#false} is VALID [2022-02-20 21:11:38,200 INFO L290 TraceCheckUtils]: 58: Hoare triple {8298#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {8298#false} is VALID [2022-02-20 21:11:38,200 INFO L290 TraceCheckUtils]: 59: Hoare triple {8298#false} #t~short316 := #t~short313; {8298#false} is VALID [2022-02-20 21:11:38,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {8298#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {8298#false} is VALID [2022-02-20 21:11:38,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {8298#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {8298#false} is VALID [2022-02-20 21:11:38,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {8298#false} assume true; {8298#false} is VALID [2022-02-20 21:11:38,200 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {8298#false} {8298#false} #188#return; {8298#false} is VALID [2022-02-20 21:11:38,200 INFO L272 TraceCheckUtils]: 64: Hoare triple {8298#false} call assume_abort_if_not(#t~ret370); {8298#false} is VALID [2022-02-20 21:11:38,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {8298#false} ~cond := #in~cond; {8298#false} is VALID [2022-02-20 21:11:38,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {8298#false} assume !(0bv8 == ~cond); {8298#false} is VALID [2022-02-20 21:11:38,200 INFO L290 TraceCheckUtils]: 67: Hoare triple {8298#false} assume true; {8298#false} is VALID [2022-02-20 21:11:38,201 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8298#false} {8298#false} #190#return; {8298#false} is VALID [2022-02-20 21:11:38,201 INFO L290 TraceCheckUtils]: 69: Hoare triple {8298#false} havoc #t~ret370; {8298#false} is VALID [2022-02-20 21:11:38,201 INFO L272 TraceCheckUtils]: 70: Hoare triple {8298#false} call assume_abort_if_not((if 0bv32 == (if ~to_add.base != 0bv64 || ~to_add.offset != 0bv64 then 1bv32 else 0bv32) then 0bv8 else 1bv8)); {8298#false} is VALID [2022-02-20 21:11:38,201 INFO L290 TraceCheckUtils]: 71: Hoare triple {8298#false} ~cond := #in~cond; {8298#false} is VALID [2022-02-20 21:11:38,201 INFO L290 TraceCheckUtils]: 72: Hoare triple {8298#false} assume !(0bv8 == ~cond); {8298#false} is VALID [2022-02-20 21:11:38,201 INFO L290 TraceCheckUtils]: 73: Hoare triple {8298#false} assume true; {8298#false} is VALID [2022-02-20 21:11:38,201 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {8298#false} {8298#false} #192#return; {8298#false} is VALID [2022-02-20 21:11:38,201 INFO L290 TraceCheckUtils]: 75: Hoare triple {8298#false} call write~$Pointer$(~before.base, ~before.offset, ~to_add.base, ~to_add.offset, 8bv64);call #t~mem371.base, #t~mem371.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(#t~mem371.base, #t~mem371.offset, ~to_add.base, ~bvadd64(8bv64, ~to_add.offset), 8bv64);havoc #t~mem371.base, #t~mem371.offset;call #t~mem372.base, #t~mem372.offset := read~$Pointer$(~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64);call write~$Pointer$(~to_add.base, ~to_add.offset, #t~mem372.base, #t~mem372.offset, 8bv64);havoc #t~mem372.base, #t~mem372.offset;call write~$Pointer$(~to_add.base, ~to_add.offset, ~before.base, ~bvadd64(8bv64, ~before.offset), 8bv64); {8298#false} is VALID [2022-02-20 21:11:38,201 INFO L272 TraceCheckUtils]: 76: Hoare triple {8298#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {8298#false} is VALID [2022-02-20 21:11:38,201 INFO L290 TraceCheckUtils]: 77: Hoare triple {8298#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0bv64 || ~node.offset != 0bv64; {8298#false} is VALID [2022-02-20 21:11:38,202 INFO L290 TraceCheckUtils]: 78: Hoare triple {8298#false} assume #t~short313;call #t~mem312.base, #t~mem312.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);#t~short313 := #t~mem312.base != 0bv64 || #t~mem312.offset != 0bv64; {8298#false} is VALID [2022-02-20 21:11:38,202 INFO L290 TraceCheckUtils]: 79: Hoare triple {8298#false} #t~short316 := #t~short313; {8298#false} is VALID [2022-02-20 21:11:38,202 INFO L290 TraceCheckUtils]: 80: Hoare triple {8298#false} assume #t~short316;call #t~mem314.base, #t~mem314.offset := read~$Pointer$(~node.base, ~bvadd64(8bv64, ~node.offset), 8bv64);call #t~mem315.base, #t~mem315.offset := read~$Pointer$(#t~mem314.base, #t~mem314.offset, 8bv64);#t~short316 := #t~mem315.base == ~node.base && #t~mem315.offset == ~node.offset; {8298#false} is VALID [2022-02-20 21:11:38,202 INFO L290 TraceCheckUtils]: 81: Hoare triple {8298#false} #res := (if 0bv32 == (if #t~short316 then 1bv32 else 0bv32) then 0bv8 else 1bv8);havoc #t~mem312.base, #t~mem312.offset;havoc #t~short313;havoc #t~mem314.base, #t~mem314.offset;havoc #t~mem315.base, #t~mem315.offset;havoc #t~short316; {8298#false} is VALID [2022-02-20 21:11:38,202 INFO L290 TraceCheckUtils]: 82: Hoare triple {8298#false} assume true; {8298#false} is VALID [2022-02-20 21:11:38,202 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {8298#false} {8298#false} #194#return; {8298#false} is VALID [2022-02-20 21:11:38,202 INFO L272 TraceCheckUtils]: 84: Hoare triple {8298#false} call __VERIFIER_assert(#t~ret373); {8298#false} is VALID [2022-02-20 21:11:38,202 INFO L290 TraceCheckUtils]: 85: Hoare triple {8298#false} ~cond := #in~cond; {8298#false} is VALID [2022-02-20 21:11:38,202 INFO L290 TraceCheckUtils]: 86: Hoare triple {8298#false} assume 0bv8 == ~cond; {8298#false} is VALID [2022-02-20 21:11:38,203 INFO L290 TraceCheckUtils]: 87: Hoare triple {8298#false} assume !false; {8298#false} is VALID [2022-02-20 21:11:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-02-20 21:11:38,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:11:38,203 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 21:11:38,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261073423] [2022-02-20 21:11:38,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261073423] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:11:38,203 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:11:38,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:11:38,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505149560] [2022-02-20 21:11:38,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:11:38,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2022-02-20 21:11:38,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:11:38,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:11:38,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:38,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:11:38,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 21:11:38,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:11:38,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:11:38,262 INFO L87 Difference]: Start difference. First operand 120 states and 158 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:11:39,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:39,092 INFO L93 Difference]: Finished difference Result 227 states and 308 transitions. [2022-02-20 21:11:39,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 21:11:39,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 88 [2022-02-20 21:11:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:11:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:11:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-02-20 21:11:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:11:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2022-02-20 21:11:39,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 258 transitions. [2022-02-20 21:11:39,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:11:39,352 INFO L225 Difference]: With dead ends: 227 [2022-02-20 21:11:39,352 INFO L226 Difference]: Without dead ends: 121 [2022-02-20 21:11:39,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:11:39,353 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 6 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:11:39,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 499 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:11:39,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-02-20 21:11:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2022-02-20 21:11:39,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:11:39,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 117 states, 78 states have (on average 1.205128205128205) internal successors, (94), 80 states have internal predecessors, (94), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 21:11:39,357 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 117 states, 78 states have (on average 1.205128205128205) internal successors, (94), 80 states have internal predecessors, (94), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 21:11:39,357 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 117 states, 78 states have (on average 1.205128205128205) internal successors, (94), 80 states have internal predecessors, (94), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 21:11:39,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:39,361 INFO L93 Difference]: Finished difference Result 121 states and 157 transitions. [2022-02-20 21:11:39,361 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 157 transitions. [2022-02-20 21:11:39,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:39,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:39,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 78 states have (on average 1.205128205128205) internal successors, (94), 80 states have internal predecessors, (94), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) Second operand 121 states. [2022-02-20 21:11:39,363 INFO L87 Difference]: Start difference. First operand has 117 states, 78 states have (on average 1.205128205128205) internal successors, (94), 80 states have internal predecessors, (94), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) Second operand 121 states. [2022-02-20 21:11:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:11:39,382 INFO L93 Difference]: Finished difference Result 121 states and 157 transitions. [2022-02-20 21:11:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 157 transitions. [2022-02-20 21:11:39,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:11:39,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:11:39,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:11:39,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:11:39,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 78 states have (on average 1.205128205128205) internal successors, (94), 80 states have internal predecessors, (94), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (30), 28 states have call predecessors, (30), 28 states have call successors, (30) [2022-02-20 21:11:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 153 transitions. [2022-02-20 21:11:39,385 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 153 transitions. Word has length 88 [2022-02-20 21:11:39,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:11:39,385 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 153 transitions. [2022-02-20 21:11:39,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-02-20 21:11:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 153 transitions. [2022-02-20 21:11:39,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-20 21:11:39,389 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:11:39,389 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:11:39,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 21:11:39,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 21:11:39,603 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:11:39,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:11:39,604 INFO L85 PathProgramCache]: Analyzing trace with hash 759251201, now seen corresponding path program 1 times [2022-02-20 21:11:39,604 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 21:11:39,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919864577] [2022-02-20 21:11:39,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:11:39,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 21:11:39,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 21:11:39,606 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 21:11:39,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 21:11:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:40,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 165 conjunts are in the unsatisfiable core [2022-02-20 21:11:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:11:40,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:11:40,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 21:11:40,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-02-20 21:11:40,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5