./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_push_front_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_front_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 52a5b40e07f9d2025e21e89532c54ecb2612af1d6384644534b1ef79f7198c6a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:10:42,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:10:42,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:10:42,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:10:42,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:10:42,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:10:42,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:10:42,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:10:42,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:10:42,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:10:42,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:10:42,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:10:42,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:10:42,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:10:42,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:10:42,254 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:10:42,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:10:42,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:10:42,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:10:42,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:10:42,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:10:42,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:10:42,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:10:42,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:10:42,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:10:42,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:10:42,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:10:42,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:10:42,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:10:42,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:10:42,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:10:42,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:10:42,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:10:42,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:10:42,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:10:42,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:10:42,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:10:42,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:10:42,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:10:42,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:10:42,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:10:42,278 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:42,307 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:10:42,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:10:42,307 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:10:42,308 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:10:42,308 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:10:42,308 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:10:42,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:10:42,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:10:42,309 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:10:42,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:10:42,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:10:42,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:10:42,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:10:42,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:10:42,310 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:10:42,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:10:42,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:10:42,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:10:42,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:10:42,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:10:42,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:10:42,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:10:42,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:10:42,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:10:42,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:10:42,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:10:42,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:10:42,312 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:10:42,313 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:10:42,313 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:10:42,313 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 -> 52a5b40e07f9d2025e21e89532c54ecb2612af1d6384644534b1ef79f7198c6a [2022-02-20 21:10:42,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:10:42,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:10:42,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:10:42,510 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:10:42,510 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:10:42,511 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_front_harness.i [2022-02-20 21:10:42,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5c805ac/849154c8551544d3983bd84958e953e9/FLAGcd7f502ab [2022-02-20 21:10:43,105 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:10:43,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_push_front_harness.i [2022-02-20 21:10:43,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5c805ac/849154c8551544d3983bd84958e953e9/FLAGcd7f502ab [2022-02-20 21:10:43,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5c805ac/849154c8551544d3983bd84958e953e9 [2022-02-20 21:10:43,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:10:43,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:10:43,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:10:43,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:10:43,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:10:43,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:10:43" (1/1) ... [2022-02-20 21:10:43,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eda37f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:43, skipping insertion in model container [2022-02-20 21:10:43,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:10:43" (1/1) ... [2022-02-20 21:10:43,556 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:10:43,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:10:43,832 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_front_harness.i[4500,4513] [2022-02-20 21:10:43,837 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_front_harness.i[4560,4573] [2022-02-20 21:10:44,479 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,480 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,481 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,481 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,483 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,504 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,504 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,507 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,508 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,511 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,511 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,512 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,513 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,728 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:10:44,729 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:10:44,730 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:10:44,730 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:10:44,731 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:10:44,731 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:10:44,733 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:10:44,734 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:10:44,734 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:10:44,738 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:10:44,832 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:10:44,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:10:44,873 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:10:44,891 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_front_harness.i[4500,4513] [2022-02-20 21:10:44,892 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_front_harness.i[4560,4573] [2022-02-20 21:10:44,951 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,952 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,952 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,952 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,953 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,957 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,958 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,959 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,960 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,960 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,961 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,961 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,962 WARN L1545 CHandler]: Possible shadowing of function index [2022-02-20 21:10:44,989 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-02-20 21:10:44,991 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-02-20 21:10:44,992 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-02-20 21:10:44,992 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-02-20 21:10:44,996 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-02-20 21:10:44,997 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-02-20 21:10:44,998 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-02-20 21:10:44,998 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-02-20 21:10:44,999 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-02-20 21:10:44,999 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-02-20 21:10:45,019 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-02-20 21:10:45,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:10:45,148 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:10:45,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:45 WrapperNode [2022-02-20 21:10:45,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:10:45,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:10:45,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:10:45,150 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:10:45,155 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:45" (1/1) ... [2022-02-20 21:10:45,217 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:45" (1/1) ... [2022-02-20 21:10:45,252 INFO L137 Inliner]: procedures = 679, calls = 1048, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 152 [2022-02-20 21:10:45,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:10:45,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:10:45,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:10:45,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:10:45,258 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:45" (1/1) ... [2022-02-20 21:10:45,259 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:45" (1/1) ... [2022-02-20 21:10:45,262 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:45" (1/1) ... [2022-02-20 21:10:45,262 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:45" (1/1) ... [2022-02-20 21:10:45,273 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:45" (1/1) ... [2022-02-20 21:10:45,276 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:45" (1/1) ... [2022-02-20 21:10:45,278 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:45" (1/1) ... [2022-02-20 21:10:45,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:10:45,283 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:10:45,283 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:10:45,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:10:45,284 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:45" (1/1) ... [2022-02-20 21:10:45,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:10:45,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:10:45,313 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:45,321 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:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:10:45,368 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 21:10:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 21:10:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-02-20 21:10:45,369 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-02-20 21:10:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:10:45,369 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-02-20 21:10:45,370 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-02-20 21:10:45,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:10:45,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:10:45,371 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2022-02-20 21:10:45,371 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2022-02-20 21:10:45,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:10:45,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:10:45,372 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:10:45,372 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:10:45,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:10:45,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:10:45,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:10:45,373 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-02-20 21:10:45,373 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-02-20 21:10:45,373 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-02-20 21:10:45,373 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-02-20 21:10:45,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:10:45,543 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:10:45,545 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:10:45,881 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:10:45,886 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:10:45,892 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 21:10:45,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:10:45 BoogieIcfgContainer [2022-02-20 21:10:45,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:10:45,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:10:45,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:10:45,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:10:45,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:10:43" (1/3) ... [2022-02-20 21:10:45,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b11fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:10:45, skipping insertion in model container [2022-02-20 21:10:45,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:10:45" (2/3) ... [2022-02-20 21:10:45,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b11fb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:10:45, skipping insertion in model container [2022-02-20 21:10:45,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:10:45" (3/3) ... [2022-02-20 21:10:45,900 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_front_harness.i [2022-02-20 21:10:45,903 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:10:45,904 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:10:45,938 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:10:45,943 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:45,943 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:10:45,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 68 states have internal predecessors, (86), 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:45,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 21:10:45,965 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:45,965 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] [2022-02-20 21:10:45,966 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:45,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:45,969 INFO L85 PathProgramCache]: Analyzing trace with hash 2111829670, now seen corresponding path program 1 times [2022-02-20 21:10:45,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:45,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021218898] [2022-02-20 21:10:45,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:45,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:46,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:10:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:46,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#true} #res := #t~nondet13;havoc #t~nondet13; {107#true} is VALID [2022-02-20 21:10:46,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 21:10:46,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107#true} {107#true} #210#return; {107#true} is VALID [2022-02-20 21:10:46,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:10:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:46,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#true} ~cond := #in~cond; {107#true} is VALID [2022-02-20 21:10:46,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} assume 0 == ~cond % 256;assume false; {108#false} is VALID [2022-02-20 21:10:46,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 21:10:46,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108#false} {107#true} #212#return; {108#false} is VALID [2022-02-20 21:10:46,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:46,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} #t~short301#1 := #t~short299#1; {107#true} is VALID [2022-02-20 21:10:46,338 INFO L290 TraceCheckUtils]: 3: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,338 INFO L290 TraceCheckUtils]: 4: Hoare triple {107#true} #t~short303#1 := #t~short301#1; {107#true} is VALID [2022-02-20 21:10:46,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#true} assume !#t~short303#1; {157#(not |aws_linked_list_is_valid_#t~short303#1|)} is VALID [2022-02-20 21:10:46,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#(not |aws_linked_list_is_valid_#t~short303#1|)} #t~short305#1 := #t~short303#1; {158#(not |aws_linked_list_is_valid_#t~short305#1|)} is VALID [2022-02-20 21:10:46,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {158#(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; {108#false} is VALID [2022-02-20 21:10:46,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {108#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; {108#false} is VALID [2022-02-20 21:10:46,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 21:10:46,343 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {108#false} {108#false} #214#return; {108#false} is VALID [2022-02-20 21:10:46,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 21:10:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:46,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#true} ~cond := #in~cond; {107#true} is VALID [2022-02-20 21:10:46,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} assume 0 == ~cond % 256;assume false; {108#false} is VALID [2022-02-20 21:10:46,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 21:10:46,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108#false} {108#false} #216#return; {108#false} is VALID [2022-02-20 21:10:46,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 21:10:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:46,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#true} ~cond := #in~cond; {107#true} is VALID [2022-02-20 21:10:46,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} assume 0 == ~cond % 256;assume false; {108#false} is VALID [2022-02-20 21:10:46,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 21:10:46,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108#false} {108#false} #218#return; {108#false} is VALID [2022-02-20 21:10:46,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 21:10:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:46,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {107#true} is VALID [2022-02-20 21:10:46,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} #t~short316 := #t~short313; {107#true} is VALID [2022-02-20 21:10:46,412 INFO L290 TraceCheckUtils]: 3: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 21:10:46,413 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {107#true} {108#false} #190#return; {108#false} is VALID [2022-02-20 21:10:46,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 21:10:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:46,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#true} ~cond := #in~cond; {107#true} is VALID [2022-02-20 21:10:46,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} assume 0 == ~cond % 256;assume false; {108#false} is VALID [2022-02-20 21:10:46,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 21:10:46,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108#false} {108#false} #192#return; {108#false} is VALID [2022-02-20 21:10:46,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-20 21:10:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:46,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#true} ~cond := #in~cond; {107#true} is VALID [2022-02-20 21:10:46,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} assume 0 == ~cond % 256;assume false; {108#false} is VALID [2022-02-20 21:10:46,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 21:10:46,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {108#false} {108#false} #194#return; {108#false} is VALID [2022-02-20 21:10:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-20 21:10:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:46,473 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {107#true} is VALID [2022-02-20 21:10:46,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {107#true} #t~short316 := #t~short313; {107#true} is VALID [2022-02-20 21:10:46,474 INFO L290 TraceCheckUtils]: 3: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,474 INFO L290 TraceCheckUtils]: 4: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 21:10:46,477 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {107#true} {108#false} #196#return; {108#false} is VALID [2022-02-20 21:10:46,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {107#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(37, 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; {107#true} is VALID [2022-02-20 21:10:46,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {107#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_front_harness } true;havoc aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset, aws_linked_list_push_front_harness_#t~ret679#1, aws_linked_list_push_front_harness_#t~ret680#1, aws_linked_list_push_front_harness_#t~ret681#1, aws_linked_list_push_front_harness_#t~mem682#1.base, aws_linked_list_push_front_harness_#t~mem682#1.offset, aws_linked_list_push_front_harness_#t~mem683#1.base, aws_linked_list_push_front_harness_#t~mem683#1.offset, aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_harness_~#to_add~0#1.offset, aws_linked_list_push_front_harness_~old_first~0#1.base, aws_linked_list_push_front_harness_~old_first~0#1.offset;call aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_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_front_harness_~#list~0#1.base, aws_linked_list_push_front_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; {107#true} is VALID [2022-02-20 21:10:46,481 INFO L272 TraceCheckUtils]: 2: Hoare triple {107#true} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {107#true} is VALID [2022-02-20 21:10:46,481 INFO L290 TraceCheckUtils]: 3: Hoare triple {107#true} #res := #t~nondet13;havoc #t~nondet13; {107#true} is VALID [2022-02-20 21:10:46,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 21:10:46,482 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {107#true} {107#true} #210#return; {107#true} is VALID [2022-02-20 21:10:46,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,482 INFO L272 TraceCheckUtils]: 7: Hoare triple {107#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)); {107#true} is VALID [2022-02-20 21:10:46,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {107#true} ~cond := #in~cond; {107#true} is VALID [2022-02-20 21:10:46,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {107#true} assume 0 == ~cond % 256;assume false; {108#false} is VALID [2022-02-20 21:10:46,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 21:10:46,484 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {108#false} {107#true} #212#return; {108#false} is VALID [2022-02-20 21:10:46,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {108#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; {108#false} is VALID [2022-02-20 21:10:46,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {108#false} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {108#false} is VALID [2022-02-20 21:10:46,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {108#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); {108#false} is VALID [2022-02-20 21:10:46,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {108#false} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, 8);aws_linked_list_push_front_harness_~old_first~0#1.base, aws_linked_list_push_front_harness_~old_first~0#1.offset := aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset;havoc aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_front } true;aws_linked_list_push_front_#in~list#1.base, aws_linked_list_push_front_#in~list#1.offset, aws_linked_list_push_front_#in~node#1.base, aws_linked_list_push_front_#in~node#1.offset := aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_front_#t~ret402#1, aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset, aws_linked_list_push_front_#t~ret404#1, aws_linked_list_push_front_#t~mem405#1.base, aws_linked_list_push_front_#t~mem405#1.offset, aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset, aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset;aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset := aws_linked_list_push_front_#in~list#1.base, aws_linked_list_push_front_#in~list#1.offset;aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset := aws_linked_list_push_front_#in~node#1.base, aws_linked_list_push_front_#in~node#1.offset; {108#false} is VALID [2022-02-20 21:10:46,486 INFO L272 TraceCheckUtils]: 16: Hoare triple {108#false} call aws_linked_list_push_front_#t~ret402#1 := aws_linked_list_is_valid(aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset); {107#true} is VALID [2022-02-20 21:10:46,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {107#true} #t~short301#1 := #t~short299#1; {107#true} is VALID [2022-02-20 21:10:46,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {107#true} #t~short303#1 := #t~short301#1; {107#true} is VALID [2022-02-20 21:10:46,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {107#true} assume !#t~short303#1; {157#(not |aws_linked_list_is_valid_#t~short303#1|)} is VALID [2022-02-20 21:10:46,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {157#(not |aws_linked_list_is_valid_#t~short303#1|)} #t~short305#1 := #t~short303#1; {158#(not |aws_linked_list_is_valid_#t~short305#1|)} is VALID [2022-02-20 21:10:46,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {158#(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; {108#false} is VALID [2022-02-20 21:10:46,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {108#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; {108#false} is VALID [2022-02-20 21:10:46,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 21:10:46,493 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {108#false} {108#false} #214#return; {108#false} is VALID [2022-02-20 21:10:46,493 INFO L272 TraceCheckUtils]: 28: Hoare triple {108#false} call assume_abort_if_not(aws_linked_list_push_front_#t~ret402#1); {107#true} is VALID [2022-02-20 21:10:46,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {107#true} ~cond := #in~cond; {107#true} is VALID [2022-02-20 21:10:46,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {107#true} assume 0 == ~cond % 256;assume false; {108#false} is VALID [2022-02-20 21:10:46,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 21:10:46,494 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {108#false} {108#false} #216#return; {108#false} is VALID [2022-02-20 21:10:46,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {108#false} havoc aws_linked_list_push_front_#t~ret402#1; {108#false} is VALID [2022-02-20 21:10:46,495 INFO L272 TraceCheckUtils]: 34: Hoare triple {108#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_front_~node#1.base != 0 || aws_linked_list_push_front_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {107#true} is VALID [2022-02-20 21:10:46,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {107#true} ~cond := #in~cond; {107#true} is VALID [2022-02-20 21:10:46,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {107#true} assume 0 == ~cond % 256;assume false; {108#false} is VALID [2022-02-20 21:10:46,496 INFO L290 TraceCheckUtils]: 37: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 21:10:46,497 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {108#false} {108#false} #218#return; {108#false} is VALID [2022-02-20 21:10:46,497 INFO L290 TraceCheckUtils]: 39: Hoare triple {108#false} call aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset := read~$Pointer$(aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset, 8); {108#false} is VALID [2022-02-20 21:10:46,497 INFO L272 TraceCheckUtils]: 40: Hoare triple {108#false} call aws_linked_list_insert_before(aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset, aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset); {108#false} is VALID [2022-02-20 21:10:46,497 INFO L290 TraceCheckUtils]: 41: Hoare triple {108#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; {108#false} is VALID [2022-02-20 21:10:46,498 INFO L272 TraceCheckUtils]: 42: Hoare triple {108#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {107#true} is VALID [2022-02-20 21:10:46,498 INFO L290 TraceCheckUtils]: 43: Hoare triple {107#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {107#true} is VALID [2022-02-20 21:10:46,498 INFO L290 TraceCheckUtils]: 44: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,498 INFO L290 TraceCheckUtils]: 45: Hoare triple {107#true} #t~short316 := #t~short313; {107#true} is VALID [2022-02-20 21:10:46,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,499 INFO L290 TraceCheckUtils]: 47: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,499 INFO L290 TraceCheckUtils]: 48: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 21:10:46,499 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {107#true} {108#false} #190#return; {108#false} is VALID [2022-02-20 21:10:46,500 INFO L272 TraceCheckUtils]: 50: Hoare triple {108#false} call assume_abort_if_not(#t~ret370); {107#true} is VALID [2022-02-20 21:10:46,500 INFO L290 TraceCheckUtils]: 51: Hoare triple {107#true} ~cond := #in~cond; {107#true} is VALID [2022-02-20 21:10:46,502 INFO L290 TraceCheckUtils]: 52: Hoare triple {107#true} assume 0 == ~cond % 256;assume false; {108#false} is VALID [2022-02-20 21:10:46,503 INFO L290 TraceCheckUtils]: 53: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 21:10:46,503 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {108#false} {108#false} #192#return; {108#false} is VALID [2022-02-20 21:10:46,503 INFO L290 TraceCheckUtils]: 55: Hoare triple {108#false} havoc #t~ret370; {108#false} is VALID [2022-02-20 21:10:46,503 INFO L272 TraceCheckUtils]: 56: Hoare triple {108#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)); {107#true} is VALID [2022-02-20 21:10:46,504 INFO L290 TraceCheckUtils]: 57: Hoare triple {107#true} ~cond := #in~cond; {107#true} is VALID [2022-02-20 21:10:46,504 INFO L290 TraceCheckUtils]: 58: Hoare triple {107#true} assume 0 == ~cond % 256;assume false; {108#false} is VALID [2022-02-20 21:10:46,504 INFO L290 TraceCheckUtils]: 59: Hoare triple {108#false} assume true; {108#false} is VALID [2022-02-20 21:10:46,505 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {108#false} {108#false} #194#return; {108#false} is VALID [2022-02-20 21:10:46,506 INFO L290 TraceCheckUtils]: 61: Hoare triple {108#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); {108#false} is VALID [2022-02-20 21:10:46,506 INFO L272 TraceCheckUtils]: 62: Hoare triple {108#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {107#true} is VALID [2022-02-20 21:10:46,506 INFO L290 TraceCheckUtils]: 63: Hoare triple {107#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {107#true} is VALID [2022-02-20 21:10:46,508 INFO L290 TraceCheckUtils]: 64: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,508 INFO L290 TraceCheckUtils]: 65: Hoare triple {107#true} #t~short316 := #t~short313; {107#true} is VALID [2022-02-20 21:10:46,518 INFO L290 TraceCheckUtils]: 66: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,519 INFO L290 TraceCheckUtils]: 67: Hoare triple {107#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; {107#true} is VALID [2022-02-20 21:10:46,519 INFO L290 TraceCheckUtils]: 68: Hoare triple {107#true} assume true; {107#true} is VALID [2022-02-20 21:10:46,519 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {107#true} {108#false} #196#return; {108#false} is VALID [2022-02-20 21:10:46,519 INFO L272 TraceCheckUtils]: 70: Hoare triple {108#false} call __VERIFIER_assert(#t~ret373); {108#false} is VALID [2022-02-20 21:10:46,520 INFO L290 TraceCheckUtils]: 71: Hoare triple {108#false} ~cond := #in~cond; {108#false} is VALID [2022-02-20 21:10:46,520 INFO L290 TraceCheckUtils]: 72: Hoare triple {108#false} assume 0 == ~cond % 256; {108#false} is VALID [2022-02-20 21:10:46,520 INFO L290 TraceCheckUtils]: 73: Hoare triple {108#false} assume !false; {108#false} is VALID [2022-02-20 21:10:46,521 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:46,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:46,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021218898] [2022-02-20 21:10:46,522 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021218898] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:46,522 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:10:46,522 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:10:46,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191852165] [2022-02-20 21:10:46,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:46,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 74 [2022-02-20 21:10:46,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:46,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:46,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:46,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:10:46,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:46,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:10:46,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:10:46,621 INFO L87 Difference]: Start difference. First operand has 104 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 68 states have internal predecessors, (86), 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 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:46,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:46,984 INFO L93 Difference]: Finished difference Result 204 states and 302 transitions. [2022-02-20 21:10:46,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:10:46,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 74 [2022-02-20 21:10:46,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 302 transitions. [2022-02-20 21:10:46,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 302 transitions. [2022-02-20 21:10:47,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 302 transitions. [2022-02-20 21:10:47,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 302 edges. 302 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:47,254 INFO L225 Difference]: With dead ends: 204 [2022-02-20 21:10:47,255 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 21:10:47,260 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:47,264 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 3 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:47,266 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 400 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:10:47,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 21:10:47,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2022-02-20 21:10:47,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:47,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 102 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 67 states have internal predecessors, (81), 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:47,292 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 102 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 67 states have internal predecessors, (81), 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:47,293 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 102 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 67 states have internal predecessors, (81), 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:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:47,299 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2022-02-20 21:10:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2022-02-20 21:10:47,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:47,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:47,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 67 states have internal predecessors, (81), 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 103 states. [2022-02-20 21:10:47,302 INFO L87 Difference]: Start difference. First operand has 102 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 67 states have internal predecessors, (81), 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 103 states. [2022-02-20 21:10:47,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:47,308 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2022-02-20 21:10:47,308 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 137 transitions. [2022-02-20 21:10:47,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:47,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:47,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:47,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:47,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 67 states have internal predecessors, (81), 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:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 136 transitions. [2022-02-20 21:10:47,315 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 136 transitions. Word has length 74 [2022-02-20 21:10:47,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:47,316 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 136 transitions. [2022-02-20 21:10:47,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 136 transitions. [2022-02-20 21:10:47,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 21:10:47,318 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:47,318 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] [2022-02-20 21:10:47,318 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:10:47,318 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:47,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:47,319 INFO L85 PathProgramCache]: Analyzing trace with hash 358576094, now seen corresponding path program 1 times [2022-02-20 21:10:47,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:47,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849999451] [2022-02-20 21:10:47,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:47,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:47,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:10:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:47,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {788#true} #res := #t~nondet13;havoc #t~nondet13; {788#true} is VALID [2022-02-20 21:10:47,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:47,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {788#true} {788#true} #210#return; {788#true} is VALID [2022-02-20 21:10:47,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:10:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:47,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {788#true} ~cond := #in~cond; {788#true} is VALID [2022-02-20 21:10:47,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#true} assume !(0 == ~cond % 256); {788#true} is VALID [2022-02-20 21:10:47,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:47,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {788#true} {788#true} #212#return; {788#true} is VALID [2022-02-20 21:10:47,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:47,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} #t~short301#1 := #t~short299#1; {788#true} is VALID [2022-02-20 21:10:47,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,499 INFO L290 TraceCheckUtils]: 4: Hoare triple {788#true} #t~short303#1 := #t~short301#1; {788#true} is VALID [2022-02-20 21:10:47,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {788#true} assume !#t~short303#1; {788#true} is VALID [2022-02-20 21:10:47,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {788#true} #t~short305#1 := #t~short303#1; {788#true} is VALID [2022-02-20 21:10:47,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {788#true} assume !#t~short305#1; {788#true} is VALID [2022-02-20 21:10:47,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {788#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; {839#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:47,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {839#(= 0 |aws_linked_list_is_valid_#res#1|)} assume true; {839#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:47,501 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {839#(= 0 |aws_linked_list_is_valid_#res#1|)} {788#true} #214#return; {808#(= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0)} is VALID [2022-02-20 21:10:47,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 21:10:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:47,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {788#true} ~cond := #in~cond; {840#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:10:47,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {840#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {841#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:47,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {841#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} assume true; {841#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:47,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {841#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} {808#(= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0)} #216#return; {789#false} is VALID [2022-02-20 21:10:47,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 21:10:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:47,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {788#true} ~cond := #in~cond; {788#true} is VALID [2022-02-20 21:10:47,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#true} assume !(0 == ~cond % 256); {788#true} is VALID [2022-02-20 21:10:47,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:47,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {788#true} {789#false} #218#return; {789#false} is VALID [2022-02-20 21:10:47,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-20 21:10:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:47,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {788#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {788#true} is VALID [2022-02-20 21:10:47,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} #t~short316 := #t~short313; {788#true} is VALID [2022-02-20 21:10:47,556 INFO L290 TraceCheckUtils]: 3: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,556 INFO L290 TraceCheckUtils]: 4: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:47,557 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {788#true} {789#false} #190#return; {789#false} is VALID [2022-02-20 21:10:47,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 21:10:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:47,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {788#true} ~cond := #in~cond; {788#true} is VALID [2022-02-20 21:10:47,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#true} assume !(0 == ~cond % 256); {788#true} is VALID [2022-02-20 21:10:47,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:47,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {788#true} {789#false} #192#return; {789#false} is VALID [2022-02-20 21:10:47,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-02-20 21:10:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:47,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {788#true} ~cond := #in~cond; {788#true} is VALID [2022-02-20 21:10:47,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#true} assume !(0 == ~cond % 256); {788#true} is VALID [2022-02-20 21:10:47,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:47,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {788#true} {789#false} #194#return; {789#false} is VALID [2022-02-20 21:10:47,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-20 21:10:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:47,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {788#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {788#true} is VALID [2022-02-20 21:10:47,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} #t~short316 := #t~short313; {788#true} is VALID [2022-02-20 21:10:47,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:47,585 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {788#true} {789#false} #196#return; {789#false} is VALID [2022-02-20 21:10:47,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {788#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(37, 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; {788#true} is VALID [2022-02-20 21:10:47,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_front_harness } true;havoc aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset, aws_linked_list_push_front_harness_#t~ret679#1, aws_linked_list_push_front_harness_#t~ret680#1, aws_linked_list_push_front_harness_#t~ret681#1, aws_linked_list_push_front_harness_#t~mem682#1.base, aws_linked_list_push_front_harness_#t~mem682#1.offset, aws_linked_list_push_front_harness_#t~mem683#1.base, aws_linked_list_push_front_harness_#t~mem683#1.offset, aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_harness_~#to_add~0#1.offset, aws_linked_list_push_front_harness_~old_first~0#1.base, aws_linked_list_push_front_harness_~old_first~0#1.offset;call aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_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_front_harness_~#list~0#1.base, aws_linked_list_push_front_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; {788#true} is VALID [2022-02-20 21:10:47,585 INFO L272 TraceCheckUtils]: 2: Hoare triple {788#true} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {788#true} is VALID [2022-02-20 21:10:47,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {788#true} #res := #t~nondet13;havoc #t~nondet13; {788#true} is VALID [2022-02-20 21:10:47,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:47,586 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {788#true} {788#true} #210#return; {788#true} is VALID [2022-02-20 21:10:47,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,586 INFO L272 TraceCheckUtils]: 7: Hoare triple {788#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)); {788#true} is VALID [2022-02-20 21:10:47,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {788#true} ~cond := #in~cond; {788#true} is VALID [2022-02-20 21:10:47,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {788#true} assume !(0 == ~cond % 256); {788#true} is VALID [2022-02-20 21:10:47,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:47,587 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {788#true} {788#true} #212#return; {788#true} is VALID [2022-02-20 21:10:47,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#true} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {788#true} is VALID [2022-02-20 21:10:47,587 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#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); {788#true} is VALID [2022-02-20 21:10:47,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {788#true} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, 8);aws_linked_list_push_front_harness_~old_first~0#1.base, aws_linked_list_push_front_harness_~old_first~0#1.offset := aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset;havoc aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_front } true;aws_linked_list_push_front_#in~list#1.base, aws_linked_list_push_front_#in~list#1.offset, aws_linked_list_push_front_#in~node#1.base, aws_linked_list_push_front_#in~node#1.offset := aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_front_#t~ret402#1, aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset, aws_linked_list_push_front_#t~ret404#1, aws_linked_list_push_front_#t~mem405#1.base, aws_linked_list_push_front_#t~mem405#1.offset, aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset, aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset;aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset := aws_linked_list_push_front_#in~list#1.base, aws_linked_list_push_front_#in~list#1.offset;aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset := aws_linked_list_push_front_#in~node#1.base, aws_linked_list_push_front_#in~node#1.offset; {788#true} is VALID [2022-02-20 21:10:47,587 INFO L272 TraceCheckUtils]: 16: Hoare triple {788#true} call aws_linked_list_push_front_#t~ret402#1 := aws_linked_list_is_valid(aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset); {788#true} is VALID [2022-02-20 21:10:47,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {788#true} #t~short301#1 := #t~short299#1; {788#true} is VALID [2022-02-20 21:10:47,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {788#true} #t~short303#1 := #t~short301#1; {788#true} is VALID [2022-02-20 21:10:47,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {788#true} assume !#t~short303#1; {788#true} is VALID [2022-02-20 21:10:47,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {788#true} #t~short305#1 := #t~short303#1; {788#true} is VALID [2022-02-20 21:10:47,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {788#true} assume !#t~short305#1; {788#true} is VALID [2022-02-20 21:10:47,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {788#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; {839#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:47,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {839#(= 0 |aws_linked_list_is_valid_#res#1|)} assume true; {839#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:47,590 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {839#(= 0 |aws_linked_list_is_valid_#res#1|)} {788#true} #214#return; {808#(= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0)} is VALID [2022-02-20 21:10:47,590 INFO L272 TraceCheckUtils]: 28: Hoare triple {808#(= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0)} call assume_abort_if_not(aws_linked_list_push_front_#t~ret402#1); {788#true} is VALID [2022-02-20 21:10:47,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {788#true} ~cond := #in~cond; {840#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:10:47,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {840#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {841#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:47,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {841#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} assume true; {841#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:47,592 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {841#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} {808#(= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0)} #216#return; {789#false} is VALID [2022-02-20 21:10:47,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {789#false} havoc aws_linked_list_push_front_#t~ret402#1; {789#false} is VALID [2022-02-20 21:10:47,593 INFO L272 TraceCheckUtils]: 34: Hoare triple {789#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_front_~node#1.base != 0 || aws_linked_list_push_front_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {788#true} is VALID [2022-02-20 21:10:47,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {788#true} ~cond := #in~cond; {788#true} is VALID [2022-02-20 21:10:47,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {788#true} assume !(0 == ~cond % 256); {788#true} is VALID [2022-02-20 21:10:47,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:47,593 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {788#true} {789#false} #218#return; {789#false} is VALID [2022-02-20 21:10:47,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {789#false} call aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset := read~$Pointer$(aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset, 8); {789#false} is VALID [2022-02-20 21:10:47,594 INFO L272 TraceCheckUtils]: 40: Hoare triple {789#false} call aws_linked_list_insert_before(aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset, aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset); {789#false} is VALID [2022-02-20 21:10:47,594 INFO L290 TraceCheckUtils]: 41: Hoare triple {789#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; {789#false} is VALID [2022-02-20 21:10:47,594 INFO L272 TraceCheckUtils]: 42: Hoare triple {789#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {788#true} is VALID [2022-02-20 21:10:47,594 INFO L290 TraceCheckUtils]: 43: Hoare triple {788#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {788#true} is VALID [2022-02-20 21:10:47,594 INFO L290 TraceCheckUtils]: 44: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,594 INFO L290 TraceCheckUtils]: 45: Hoare triple {788#true} #t~short316 := #t~short313; {788#true} is VALID [2022-02-20 21:10:47,594 INFO L290 TraceCheckUtils]: 46: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,595 INFO L290 TraceCheckUtils]: 47: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,595 INFO L290 TraceCheckUtils]: 48: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:47,595 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {788#true} {789#false} #190#return; {789#false} is VALID [2022-02-20 21:10:47,595 INFO L272 TraceCheckUtils]: 50: Hoare triple {789#false} call assume_abort_if_not(#t~ret370); {788#true} is VALID [2022-02-20 21:10:47,595 INFO L290 TraceCheckUtils]: 51: Hoare triple {788#true} ~cond := #in~cond; {788#true} is VALID [2022-02-20 21:10:47,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {788#true} assume !(0 == ~cond % 256); {788#true} is VALID [2022-02-20 21:10:47,595 INFO L290 TraceCheckUtils]: 53: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:47,596 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {788#true} {789#false} #192#return; {789#false} is VALID [2022-02-20 21:10:47,596 INFO L290 TraceCheckUtils]: 55: Hoare triple {789#false} havoc #t~ret370; {789#false} is VALID [2022-02-20 21:10:47,596 INFO L272 TraceCheckUtils]: 56: Hoare triple {789#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)); {788#true} is VALID [2022-02-20 21:10:47,596 INFO L290 TraceCheckUtils]: 57: Hoare triple {788#true} ~cond := #in~cond; {788#true} is VALID [2022-02-20 21:10:47,596 INFO L290 TraceCheckUtils]: 58: Hoare triple {788#true} assume !(0 == ~cond % 256); {788#true} is VALID [2022-02-20 21:10:47,596 INFO L290 TraceCheckUtils]: 59: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:47,596 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {788#true} {789#false} #194#return; {789#false} is VALID [2022-02-20 21:10:47,597 INFO L290 TraceCheckUtils]: 61: Hoare triple {789#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); {789#false} is VALID [2022-02-20 21:10:47,597 INFO L272 TraceCheckUtils]: 62: Hoare triple {789#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {788#true} is VALID [2022-02-20 21:10:47,597 INFO L290 TraceCheckUtils]: 63: Hoare triple {788#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {788#true} is VALID [2022-02-20 21:10:47,597 INFO L290 TraceCheckUtils]: 64: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,597 INFO L290 TraceCheckUtils]: 65: Hoare triple {788#true} #t~short316 := #t~short313; {788#true} is VALID [2022-02-20 21:10:47,597 INFO L290 TraceCheckUtils]: 66: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,598 INFO L290 TraceCheckUtils]: 67: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:47,598 INFO L290 TraceCheckUtils]: 68: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:47,598 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {788#true} {789#false} #196#return; {789#false} is VALID [2022-02-20 21:10:47,598 INFO L272 TraceCheckUtils]: 70: Hoare triple {789#false} call __VERIFIER_assert(#t~ret373); {789#false} is VALID [2022-02-20 21:10:47,598 INFO L290 TraceCheckUtils]: 71: Hoare triple {789#false} ~cond := #in~cond; {789#false} is VALID [2022-02-20 21:10:47,598 INFO L290 TraceCheckUtils]: 72: Hoare triple {789#false} assume 0 == ~cond % 256; {789#false} is VALID [2022-02-20 21:10:47,598 INFO L290 TraceCheckUtils]: 73: Hoare triple {789#false} assume !false; {789#false} is VALID [2022-02-20 21:10:47,599 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:47,599 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:47,599 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849999451] [2022-02-20 21:10:47,599 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849999451] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:10:47,600 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943090029] [2022-02-20 21:10:47,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:47,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:47,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:10:47,602 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:47,603 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:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:47,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 21:10:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:47,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:10:48,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {788#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(37, 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; {845#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 21:10:48,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {845#(< 0 |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_front_harness } true;havoc aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset, aws_linked_list_push_front_harness_#t~ret679#1, aws_linked_list_push_front_harness_#t~ret680#1, aws_linked_list_push_front_harness_#t~ret681#1, aws_linked_list_push_front_harness_#t~mem682#1.base, aws_linked_list_push_front_harness_#t~mem682#1.offset, aws_linked_list_push_front_harness_#t~mem683#1.base, aws_linked_list_push_front_harness_#t~mem683#1.offset, aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_harness_~#to_add~0#1.offset, aws_linked_list_push_front_harness_~old_first~0#1.base, aws_linked_list_push_front_harness_~old_first~0#1.offset;call aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_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_front_harness_~#list~0#1.base, aws_linked_list_push_front_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; {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:48,106 INFO L272 TraceCheckUtils]: 2: Hoare triple {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {788#true} is VALID [2022-02-20 21:10:48,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {788#true} #res := #t~nondet13;havoc #t~nondet13; {788#true} is VALID [2022-02-20 21:10:48,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:48,106 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {788#true} {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} #210#return; {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:48,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_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; {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:48,107 INFO L272 TraceCheckUtils]: 7: Hoare triple {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_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)); {788#true} is VALID [2022-02-20 21:10:48,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {788#true} ~cond := #in~cond; {788#true} is VALID [2022-02-20 21:10:48,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {788#true} assume !(0 == ~cond % 256); {788#true} is VALID [2022-02-20 21:10:48,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {788#true} assume true; {788#true} is VALID [2022-02-20 21:10:48,108 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {788#true} {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} #212#return; {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:48,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_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; {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:48,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_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); {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:48,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_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); {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:48,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {849#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, 8);aws_linked_list_push_front_harness_~old_first~0#1.base, aws_linked_list_push_front_harness_~old_first~0#1.offset := aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset;havoc aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_front } true;aws_linked_list_push_front_#in~list#1.base, aws_linked_list_push_front_#in~list#1.offset, aws_linked_list_push_front_#in~node#1.base, aws_linked_list_push_front_#in~node#1.offset := aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_front_#t~ret402#1, aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset, aws_linked_list_push_front_#t~ret404#1, aws_linked_list_push_front_#t~mem405#1.base, aws_linked_list_push_front_#t~mem405#1.offset, aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset, aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset;aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset := aws_linked_list_push_front_#in~list#1.base, aws_linked_list_push_front_#in~list#1.offset;aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset := aws_linked_list_push_front_#in~node#1.base, aws_linked_list_push_front_#in~node#1.offset; {892#(< 1 |ULTIMATE.start_aws_linked_list_push_front_~node#1.base|)} is VALID [2022-02-20 21:10:48,110 INFO L272 TraceCheckUtils]: 16: Hoare triple {892#(< 1 |ULTIMATE.start_aws_linked_list_push_front_~node#1.base|)} call aws_linked_list_push_front_#t~ret402#1 := aws_linked_list_is_valid(aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset); {788#true} is VALID [2022-02-20 21:10:48,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:48,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:48,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {788#true} #t~short301#1 := #t~short299#1; {788#true} is VALID [2022-02-20 21:10:48,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {788#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; {788#true} is VALID [2022-02-20 21:10:48,111 INFO L290 TraceCheckUtils]: 21: Hoare triple {788#true} #t~short303#1 := #t~short301#1; {788#true} is VALID [2022-02-20 21:10:48,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {788#true} assume !#t~short303#1; {788#true} is VALID [2022-02-20 21:10:48,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {788#true} #t~short305#1 := #t~short303#1; {788#true} is VALID [2022-02-20 21:10:48,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {788#true} assume !#t~short305#1; {788#true} is VALID [2022-02-20 21:10:48,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {788#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; {839#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:48,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {839#(= 0 |aws_linked_list_is_valid_#res#1|)} assume true; {839#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:48,113 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {839#(= 0 |aws_linked_list_is_valid_#res#1|)} {892#(< 1 |ULTIMATE.start_aws_linked_list_push_front_~node#1.base|)} #214#return; {929#(and (< 1 |ULTIMATE.start_aws_linked_list_push_front_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0))} is VALID [2022-02-20 21:10:48,113 INFO L272 TraceCheckUtils]: 28: Hoare triple {929#(and (< 1 |ULTIMATE.start_aws_linked_list_push_front_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0))} call assume_abort_if_not(aws_linked_list_push_front_#t~ret402#1); {788#true} is VALID [2022-02-20 21:10:48,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {788#true} ~cond := #in~cond; {840#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:10:48,114 INFO L290 TraceCheckUtils]: 30: Hoare triple {840#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {939#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} is VALID [2022-02-20 21:10:48,114 INFO L290 TraceCheckUtils]: 31: Hoare triple {939#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} assume true; {939#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} is VALID [2022-02-20 21:10:48,115 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {939#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} {929#(and (< 1 |ULTIMATE.start_aws_linked_list_push_front_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0))} #216#return; {789#false} is VALID [2022-02-20 21:10:48,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {789#false} havoc aws_linked_list_push_front_#t~ret402#1; {789#false} is VALID [2022-02-20 21:10:48,115 INFO L272 TraceCheckUtils]: 34: Hoare triple {789#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_front_~node#1.base != 0 || aws_linked_list_push_front_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {789#false} is VALID [2022-02-20 21:10:48,115 INFO L290 TraceCheckUtils]: 35: Hoare triple {789#false} ~cond := #in~cond; {789#false} is VALID [2022-02-20 21:10:48,115 INFO L290 TraceCheckUtils]: 36: Hoare triple {789#false} assume !(0 == ~cond % 256); {789#false} is VALID [2022-02-20 21:10:48,115 INFO L290 TraceCheckUtils]: 37: Hoare triple {789#false} assume true; {789#false} is VALID [2022-02-20 21:10:48,116 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {789#false} {789#false} #218#return; {789#false} is VALID [2022-02-20 21:10:48,116 INFO L290 TraceCheckUtils]: 39: Hoare triple {789#false} call aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset := read~$Pointer$(aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset, 8); {789#false} is VALID [2022-02-20 21:10:48,116 INFO L272 TraceCheckUtils]: 40: Hoare triple {789#false} call aws_linked_list_insert_before(aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset, aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset); {789#false} is VALID [2022-02-20 21:10:48,116 INFO L290 TraceCheckUtils]: 41: Hoare triple {789#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; {789#false} is VALID [2022-02-20 21:10:48,116 INFO L272 TraceCheckUtils]: 42: Hoare triple {789#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {789#false} is VALID [2022-02-20 21:10:48,116 INFO L290 TraceCheckUtils]: 43: Hoare triple {789#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {789#false} is VALID [2022-02-20 21:10:48,116 INFO L290 TraceCheckUtils]: 44: Hoare triple {789#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; {789#false} is VALID [2022-02-20 21:10:48,117 INFO L290 TraceCheckUtils]: 45: Hoare triple {789#false} #t~short316 := #t~short313; {789#false} is VALID [2022-02-20 21:10:48,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {789#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; {789#false} is VALID [2022-02-20 21:10:48,117 INFO L290 TraceCheckUtils]: 47: Hoare triple {789#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; {789#false} is VALID [2022-02-20 21:10:48,117 INFO L290 TraceCheckUtils]: 48: Hoare triple {789#false} assume true; {789#false} is VALID [2022-02-20 21:10:48,117 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {789#false} {789#false} #190#return; {789#false} is VALID [2022-02-20 21:10:48,117 INFO L272 TraceCheckUtils]: 50: Hoare triple {789#false} call assume_abort_if_not(#t~ret370); {789#false} is VALID [2022-02-20 21:10:48,117 INFO L290 TraceCheckUtils]: 51: Hoare triple {789#false} ~cond := #in~cond; {789#false} is VALID [2022-02-20 21:10:48,117 INFO L290 TraceCheckUtils]: 52: Hoare triple {789#false} assume !(0 == ~cond % 256); {789#false} is VALID [2022-02-20 21:10:48,118 INFO L290 TraceCheckUtils]: 53: Hoare triple {789#false} assume true; {789#false} is VALID [2022-02-20 21:10:48,118 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {789#false} {789#false} #192#return; {789#false} is VALID [2022-02-20 21:10:48,118 INFO L290 TraceCheckUtils]: 55: Hoare triple {789#false} havoc #t~ret370; {789#false} is VALID [2022-02-20 21:10:48,118 INFO L272 TraceCheckUtils]: 56: Hoare triple {789#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)); {789#false} is VALID [2022-02-20 21:10:48,118 INFO L290 TraceCheckUtils]: 57: Hoare triple {789#false} ~cond := #in~cond; {789#false} is VALID [2022-02-20 21:10:48,118 INFO L290 TraceCheckUtils]: 58: Hoare triple {789#false} assume !(0 == ~cond % 256); {789#false} is VALID [2022-02-20 21:10:48,118 INFO L290 TraceCheckUtils]: 59: Hoare triple {789#false} assume true; {789#false} is VALID [2022-02-20 21:10:48,119 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {789#false} {789#false} #194#return; {789#false} is VALID [2022-02-20 21:10:48,119 INFO L290 TraceCheckUtils]: 61: Hoare triple {789#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); {789#false} is VALID [2022-02-20 21:10:48,119 INFO L272 TraceCheckUtils]: 62: Hoare triple {789#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {789#false} is VALID [2022-02-20 21:10:48,119 INFO L290 TraceCheckUtils]: 63: Hoare triple {789#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {789#false} is VALID [2022-02-20 21:10:48,119 INFO L290 TraceCheckUtils]: 64: Hoare triple {789#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; {789#false} is VALID [2022-02-20 21:10:48,119 INFO L290 TraceCheckUtils]: 65: Hoare triple {789#false} #t~short316 := #t~short313; {789#false} is VALID [2022-02-20 21:10:48,119 INFO L290 TraceCheckUtils]: 66: Hoare triple {789#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; {789#false} is VALID [2022-02-20 21:10:48,119 INFO L290 TraceCheckUtils]: 67: Hoare triple {789#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; {789#false} is VALID [2022-02-20 21:10:48,120 INFO L290 TraceCheckUtils]: 68: Hoare triple {789#false} assume true; {789#false} is VALID [2022-02-20 21:10:48,120 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {789#false} {789#false} #196#return; {789#false} is VALID [2022-02-20 21:10:48,120 INFO L272 TraceCheckUtils]: 70: Hoare triple {789#false} call __VERIFIER_assert(#t~ret373); {789#false} is VALID [2022-02-20 21:10:48,120 INFO L290 TraceCheckUtils]: 71: Hoare triple {789#false} ~cond := #in~cond; {789#false} is VALID [2022-02-20 21:10:48,120 INFO L290 TraceCheckUtils]: 72: Hoare triple {789#false} assume 0 == ~cond % 256; {789#false} is VALID [2022-02-20 21:10:48,120 INFO L290 TraceCheckUtils]: 73: Hoare triple {789#false} assume !false; {789#false} is VALID [2022-02-20 21:10:48,121 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:48,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:10:48,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943090029] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:48,121 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 21:10:48,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 11 [2022-02-20 21:10:48,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374671653] [2022-02-20 21:10:48,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:48,123 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 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 74 [2022-02-20 21:10:48,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:48,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 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:48,167 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:10:48,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 21:10:48,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:48,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 21:10:48,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-20 21:10:48,168 INFO L87 Difference]: Start difference. First operand 102 states and 136 transitions. Second operand has 9 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 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:49,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:49,222 INFO L93 Difference]: Finished difference Result 194 states and 261 transitions. [2022-02-20 21:10:49,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 21:10:49,223 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 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 74 [2022-02-20 21:10:49,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 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:49,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 255 transitions. [2022-02-20 21:10:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 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:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 255 transitions. [2022-02-20 21:10:49,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 255 transitions. [2022-02-20 21:10:49,442 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:49,445 INFO L225 Difference]: With dead ends: 194 [2022-02-20 21:10:49,445 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 21:10:49,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 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:49,446 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 137 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 730 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:49,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 730 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:49,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 21:10:49,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-02-20 21:10:49,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:49,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 104 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 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:49,483 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 104 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 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:49,484 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 104 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 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:49,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:49,488 INFO L93 Difference]: Finished difference Result 106 states and 141 transitions. [2022-02-20 21:10:49,488 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 141 transitions. [2022-02-20 21:10:49,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:49,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:49,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 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 106 states. [2022-02-20 21:10:49,490 INFO L87 Difference]: Start difference. First operand has 104 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 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 106 states. [2022-02-20 21:10:49,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:49,494 INFO L93 Difference]: Finished difference Result 106 states and 141 transitions. [2022-02-20 21:10:49,494 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 141 transitions. [2022-02-20 21:10:49,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:49,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:49,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:49,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 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:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 139 transitions. [2022-02-20 21:10:49,499 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 139 transitions. Word has length 74 [2022-02-20 21:10:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:49,500 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 139 transitions. [2022-02-20 21:10:49,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 6.0) internal successors, (42), 8 states have internal predecessors, (42), 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:49,500 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 139 transitions. [2022-02-20 21:10:49,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 21:10:49,501 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:49,502 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] [2022-02-20 21:10:49,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 21:10:49,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:49,720 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:49,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash 87330846, now seen corresponding path program 1 times [2022-02-20 21:10:49,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:49,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796499263] [2022-02-20 21:10:49,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:49,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:10:49,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {1702#true} #res := #t~nondet13;havoc #t~nondet13; {1702#true} is VALID [2022-02-20 21:10:49,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:49,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1702#true} {1702#true} #210#return; {1702#true} is VALID [2022-02-20 21:10:49,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:10:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {1702#true} ~cond := #in~cond; {1702#true} is VALID [2022-02-20 21:10:49,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {1702#true} assume !(0 == ~cond % 256); {1702#true} is VALID [2022-02-20 21:10:49,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:49,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1702#true} {1702#true} #212#return; {1702#true} is VALID [2022-02-20 21:10:49,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,854 INFO L290 TraceCheckUtils]: 0: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {1702#true} #t~short301#1 := #t~short299#1; {1702#true} is VALID [2022-02-20 21:10:49,854 INFO L290 TraceCheckUtils]: 3: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,855 INFO L290 TraceCheckUtils]: 4: Hoare triple {1702#true} #t~short303#1 := #t~short301#1; {1702#true} is VALID [2022-02-20 21:10:49,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,855 INFO L290 TraceCheckUtils]: 6: Hoare triple {1702#true} #t~short305#1 := #t~short303#1; {1702#true} is VALID [2022-02-20 21:10:49,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {1702#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_#res#1 := 0; {1755#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1| 0)} is VALID [2022-02-20 21:10:49,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {1755#(= |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; {1756#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:49,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {1756#(= 0 |aws_linked_list_is_valid_#res#1|)} assume true; {1756#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:49,857 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1756#(= 0 |aws_linked_list_is_valid_#res#1|)} {1702#true} #214#return; {1724#(= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0)} is VALID [2022-02-20 21:10:49,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:10:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {1702#true} ~cond := #in~cond; {1757#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:10:49,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {1757#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {1758#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:49,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {1758#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} assume true; {1758#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:49,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1758#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} {1724#(= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0)} #216#return; {1703#false} is VALID [2022-02-20 21:10:49,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 21:10:49,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {1702#true} ~cond := #in~cond; {1702#true} is VALID [2022-02-20 21:10:49,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {1702#true} assume !(0 == ~cond % 256); {1702#true} is VALID [2022-02-20 21:10:49,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:49,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1702#true} {1703#false} #218#return; {1703#false} is VALID [2022-02-20 21:10:49,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 21:10:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {1702#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {1702#true} is VALID [2022-02-20 21:10:49,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {1702#true} #t~short316 := #t~short313; {1702#true} is VALID [2022-02-20 21:10:49,918 INFO L290 TraceCheckUtils]: 3: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,918 INFO L290 TraceCheckUtils]: 4: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:49,918 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1702#true} {1703#false} #190#return; {1703#false} is VALID [2022-02-20 21:10:49,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 21:10:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {1702#true} ~cond := #in~cond; {1702#true} is VALID [2022-02-20 21:10:49,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {1702#true} assume !(0 == ~cond % 256); {1702#true} is VALID [2022-02-20 21:10:49,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:49,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1702#true} {1703#false} #192#return; {1703#false} is VALID [2022-02-20 21:10:49,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-20 21:10:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,938 INFO L290 TraceCheckUtils]: 0: Hoare triple {1702#true} ~cond := #in~cond; {1702#true} is VALID [2022-02-20 21:10:49,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {1702#true} assume !(0 == ~cond % 256); {1702#true} is VALID [2022-02-20 21:10:49,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:49,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1702#true} {1703#false} #194#return; {1703#false} is VALID [2022-02-20 21:10:49,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-02-20 21:10:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:49,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {1702#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {1702#true} is VALID [2022-02-20 21:10:49,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {1702#true} #t~short316 := #t~short313; {1702#true} is VALID [2022-02-20 21:10:49,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,954 INFO L290 TraceCheckUtils]: 4: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:49,955 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1702#true} {1703#false} #196#return; {1703#false} is VALID [2022-02-20 21:10:49,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {1702#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(37, 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; {1702#true} is VALID [2022-02-20 21:10:49,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {1702#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_front_harness } true;havoc aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset, aws_linked_list_push_front_harness_#t~ret679#1, aws_linked_list_push_front_harness_#t~ret680#1, aws_linked_list_push_front_harness_#t~ret681#1, aws_linked_list_push_front_harness_#t~mem682#1.base, aws_linked_list_push_front_harness_#t~mem682#1.offset, aws_linked_list_push_front_harness_#t~mem683#1.base, aws_linked_list_push_front_harness_#t~mem683#1.offset, aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_harness_~#to_add~0#1.offset, aws_linked_list_push_front_harness_~old_first~0#1.base, aws_linked_list_push_front_harness_~old_first~0#1.offset;call aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_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_front_harness_~#list~0#1.base, aws_linked_list_push_front_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; {1702#true} is VALID [2022-02-20 21:10:49,959 INFO L272 TraceCheckUtils]: 2: Hoare triple {1702#true} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {1702#true} is VALID [2022-02-20 21:10:49,960 INFO L290 TraceCheckUtils]: 3: Hoare triple {1702#true} #res := #t~nondet13;havoc #t~nondet13; {1702#true} is VALID [2022-02-20 21:10:49,960 INFO L290 TraceCheckUtils]: 4: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:49,960 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1702#true} {1702#true} #210#return; {1702#true} is VALID [2022-02-20 21:10:49,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,961 INFO L272 TraceCheckUtils]: 7: Hoare triple {1702#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)); {1702#true} is VALID [2022-02-20 21:10:49,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {1702#true} ~cond := #in~cond; {1702#true} is VALID [2022-02-20 21:10:49,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {1702#true} assume !(0 == ~cond % 256); {1702#true} is VALID [2022-02-20 21:10:49,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:49,961 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1702#true} {1702#true} #212#return; {1702#true} is VALID [2022-02-20 21:10:49,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {1702#true} assume !(ensure_linked_list_is_allocated_~i~1#1 % 18446744073709551616 < ensure_linked_list_is_allocated_~length~1#1 % 18446744073709551616); {1702#true} is VALID [2022-02-20 21:10:49,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {1702#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); {1702#true} is VALID [2022-02-20 21:10:49,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {1702#true} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, 8);aws_linked_list_push_front_harness_~old_first~0#1.base, aws_linked_list_push_front_harness_~old_first~0#1.offset := aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset;havoc aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_front } true;aws_linked_list_push_front_#in~list#1.base, aws_linked_list_push_front_#in~list#1.offset, aws_linked_list_push_front_#in~node#1.base, aws_linked_list_push_front_#in~node#1.offset := aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_front_#t~ret402#1, aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset, aws_linked_list_push_front_#t~ret404#1, aws_linked_list_push_front_#t~mem405#1.base, aws_linked_list_push_front_#t~mem405#1.offset, aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset, aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset;aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset := aws_linked_list_push_front_#in~list#1.base, aws_linked_list_push_front_#in~list#1.offset;aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset := aws_linked_list_push_front_#in~node#1.base, aws_linked_list_push_front_#in~node#1.offset; {1702#true} is VALID [2022-02-20 21:10:49,962 INFO L272 TraceCheckUtils]: 16: Hoare triple {1702#true} call aws_linked_list_push_front_#t~ret402#1 := aws_linked_list_is_valid(aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset); {1702#true} is VALID [2022-02-20 21:10:49,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,962 INFO L290 TraceCheckUtils]: 18: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {1702#true} #t~short301#1 := #t~short299#1; {1702#true} is VALID [2022-02-20 21:10:49,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {1702#true} #t~short303#1 := #t~short301#1; {1702#true} is VALID [2022-02-20 21:10:49,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {1702#true} #t~short305#1 := #t~short303#1; {1702#true} is VALID [2022-02-20 21:10:49,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {1702#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_#res#1 := 0; {1755#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1| 0)} is VALID [2022-02-20 21:10:49,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {1755#(= |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; {1756#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:49,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {1756#(= 0 |aws_linked_list_is_valid_#res#1|)} assume true; {1756#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:49,965 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1756#(= 0 |aws_linked_list_is_valid_#res#1|)} {1702#true} #214#return; {1724#(= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0)} is VALID [2022-02-20 21:10:49,965 INFO L272 TraceCheckUtils]: 30: Hoare triple {1724#(= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0)} call assume_abort_if_not(aws_linked_list_push_front_#t~ret402#1); {1702#true} is VALID [2022-02-20 21:10:49,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {1702#true} ~cond := #in~cond; {1757#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:10:49,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {1757#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {1758#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:49,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {1758#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} assume true; {1758#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} is VALID [2022-02-20 21:10:49,967 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1758#(or (<= 1 |assume_abort_if_not_#in~cond|) (<= (+ |assume_abort_if_not_#in~cond| 1) 0))} {1724#(= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0)} #216#return; {1703#false} is VALID [2022-02-20 21:10:49,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {1703#false} havoc aws_linked_list_push_front_#t~ret402#1; {1703#false} is VALID [2022-02-20 21:10:49,967 INFO L272 TraceCheckUtils]: 36: Hoare triple {1703#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_front_~node#1.base != 0 || aws_linked_list_push_front_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {1702#true} is VALID [2022-02-20 21:10:49,967 INFO L290 TraceCheckUtils]: 37: Hoare triple {1702#true} ~cond := #in~cond; {1702#true} is VALID [2022-02-20 21:10:49,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {1702#true} assume !(0 == ~cond % 256); {1702#true} is VALID [2022-02-20 21:10:49,967 INFO L290 TraceCheckUtils]: 39: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:49,967 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1702#true} {1703#false} #218#return; {1703#false} is VALID [2022-02-20 21:10:49,967 INFO L290 TraceCheckUtils]: 41: Hoare triple {1703#false} call aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset := read~$Pointer$(aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset, 8); {1703#false} is VALID [2022-02-20 21:10:49,967 INFO L272 TraceCheckUtils]: 42: Hoare triple {1703#false} call aws_linked_list_insert_before(aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset, aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset); {1703#false} is VALID [2022-02-20 21:10:49,969 INFO L290 TraceCheckUtils]: 43: Hoare triple {1703#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; {1703#false} is VALID [2022-02-20 21:10:49,969 INFO L272 TraceCheckUtils]: 44: Hoare triple {1703#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {1702#true} is VALID [2022-02-20 21:10:49,969 INFO L290 TraceCheckUtils]: 45: Hoare triple {1702#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {1702#true} is VALID [2022-02-20 21:10:49,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,969 INFO L290 TraceCheckUtils]: 47: Hoare triple {1702#true} #t~short316 := #t~short313; {1702#true} is VALID [2022-02-20 21:10:49,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,970 INFO L290 TraceCheckUtils]: 49: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,970 INFO L290 TraceCheckUtils]: 50: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:49,970 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {1702#true} {1703#false} #190#return; {1703#false} is VALID [2022-02-20 21:10:49,970 INFO L272 TraceCheckUtils]: 52: Hoare triple {1703#false} call assume_abort_if_not(#t~ret370); {1702#true} is VALID [2022-02-20 21:10:49,970 INFO L290 TraceCheckUtils]: 53: Hoare triple {1702#true} ~cond := #in~cond; {1702#true} is VALID [2022-02-20 21:10:49,970 INFO L290 TraceCheckUtils]: 54: Hoare triple {1702#true} assume !(0 == ~cond % 256); {1702#true} is VALID [2022-02-20 21:10:49,970 INFO L290 TraceCheckUtils]: 55: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:49,970 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {1702#true} {1703#false} #192#return; {1703#false} is VALID [2022-02-20 21:10:49,970 INFO L290 TraceCheckUtils]: 57: Hoare triple {1703#false} havoc #t~ret370; {1703#false} is VALID [2022-02-20 21:10:49,971 INFO L272 TraceCheckUtils]: 58: Hoare triple {1703#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)); {1702#true} is VALID [2022-02-20 21:10:49,971 INFO L290 TraceCheckUtils]: 59: Hoare triple {1702#true} ~cond := #in~cond; {1702#true} is VALID [2022-02-20 21:10:49,971 INFO L290 TraceCheckUtils]: 60: Hoare triple {1702#true} assume !(0 == ~cond % 256); {1702#true} is VALID [2022-02-20 21:10:49,971 INFO L290 TraceCheckUtils]: 61: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:49,971 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {1702#true} {1703#false} #194#return; {1703#false} is VALID [2022-02-20 21:10:49,971 INFO L290 TraceCheckUtils]: 63: Hoare triple {1703#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); {1703#false} is VALID [2022-02-20 21:10:49,971 INFO L272 TraceCheckUtils]: 64: Hoare triple {1703#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {1702#true} is VALID [2022-02-20 21:10:49,972 INFO L290 TraceCheckUtils]: 65: Hoare triple {1702#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {1702#true} is VALID [2022-02-20 21:10:49,972 INFO L290 TraceCheckUtils]: 66: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,972 INFO L290 TraceCheckUtils]: 67: Hoare triple {1702#true} #t~short316 := #t~short313; {1702#true} is VALID [2022-02-20 21:10:49,972 INFO L290 TraceCheckUtils]: 68: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,972 INFO L290 TraceCheckUtils]: 69: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:49,972 INFO L290 TraceCheckUtils]: 70: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:49,972 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {1702#true} {1703#false} #196#return; {1703#false} is VALID [2022-02-20 21:10:49,972 INFO L272 TraceCheckUtils]: 72: Hoare triple {1703#false} call __VERIFIER_assert(#t~ret373); {1703#false} is VALID [2022-02-20 21:10:49,972 INFO L290 TraceCheckUtils]: 73: Hoare triple {1703#false} ~cond := #in~cond; {1703#false} is VALID [2022-02-20 21:10:49,973 INFO L290 TraceCheckUtils]: 74: Hoare triple {1703#false} assume 0 == ~cond % 256; {1703#false} is VALID [2022-02-20 21:10:49,973 INFO L290 TraceCheckUtils]: 75: Hoare triple {1703#false} assume !false; {1703#false} is VALID [2022-02-20 21:10:49,974 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:49,974 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:49,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796499263] [2022-02-20 21:10:49,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796499263] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 21:10:49,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879871551] [2022-02-20 21:10:49,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:49,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 21:10:49,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:10:49,977 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:50,016 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:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:50,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 21:10:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:50,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 21:10:50,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {1702#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(37, 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; {1762#(< 0 |#StackHeapBarrier|)} is VALID [2022-02-20 21:10:50,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {1762#(< 0 |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_front_harness } true;havoc aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset, aws_linked_list_push_front_harness_#t~ret679#1, aws_linked_list_push_front_harness_#t~ret680#1, aws_linked_list_push_front_harness_#t~ret681#1, aws_linked_list_push_front_harness_#t~mem682#1.base, aws_linked_list_push_front_harness_#t~mem682#1.offset, aws_linked_list_push_front_harness_#t~mem683#1.base, aws_linked_list_push_front_harness_#t~mem683#1.offset, aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_harness_~#to_add~0#1.offset, aws_linked_list_push_front_harness_~old_first~0#1.base, aws_linked_list_push_front_harness_~old_first~0#1.offset;call aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_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_front_harness_~#list~0#1.base, aws_linked_list_push_front_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; {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:50,478 INFO L272 TraceCheckUtils]: 2: Hoare triple {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {1702#true} is VALID [2022-02-20 21:10:50,478 INFO L290 TraceCheckUtils]: 3: Hoare triple {1702#true} #res := #t~nondet13;havoc #t~nondet13; {1702#true} is VALID [2022-02-20 21:10:50,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:50,479 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1702#true} {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} #210#return; {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:50,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_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; {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:50,479 INFO L272 TraceCheckUtils]: 7: Hoare triple {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_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)); {1702#true} is VALID [2022-02-20 21:10:50,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {1702#true} ~cond := #in~cond; {1702#true} is VALID [2022-02-20 21:10:50,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {1702#true} assume !(0 == ~cond % 256); {1702#true} is VALID [2022-02-20 21:10:50,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {1702#true} assume true; {1702#true} is VALID [2022-02-20 21:10:50,480 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1702#true} {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} #212#return; {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:50,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_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; {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:50,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_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); {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:50,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_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); {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} is VALID [2022-02-20 21:10:50,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {1766#(< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|)} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, 8);aws_linked_list_push_front_harness_~old_first~0#1.base, aws_linked_list_push_front_harness_~old_first~0#1.offset := aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset;havoc aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_front } true;aws_linked_list_push_front_#in~list#1.base, aws_linked_list_push_front_#in~list#1.offset, aws_linked_list_push_front_#in~node#1.base, aws_linked_list_push_front_#in~node#1.offset := aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_front_#t~ret402#1, aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset, aws_linked_list_push_front_#t~ret404#1, aws_linked_list_push_front_#t~mem405#1.base, aws_linked_list_push_front_#t~mem405#1.offset, aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset, aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset;aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset := aws_linked_list_push_front_#in~list#1.base, aws_linked_list_push_front_#in~list#1.offset;aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset := aws_linked_list_push_front_#in~node#1.base, aws_linked_list_push_front_#in~node#1.offset; {1809#(< 1 |ULTIMATE.start_aws_linked_list_push_front_~node#1.base|)} is VALID [2022-02-20 21:10:50,481 INFO L272 TraceCheckUtils]: 16: Hoare triple {1809#(< 1 |ULTIMATE.start_aws_linked_list_push_front_~node#1.base|)} call aws_linked_list_push_front_#t~ret402#1 := aws_linked_list_is_valid(aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset); {1702#true} is VALID [2022-02-20 21:10:50,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:50,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:50,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {1702#true} #t~short301#1 := #t~short299#1; {1702#true} is VALID [2022-02-20 21:10:50,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:50,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {1702#true} #t~short303#1 := #t~short301#1; {1702#true} is VALID [2022-02-20 21:10:50,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:50,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {1702#true} #t~short305#1 := #t~short303#1; {1702#true} is VALID [2022-02-20 21:10:50,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:50,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {1702#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; {1702#true} is VALID [2022-02-20 21:10:50,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {1702#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_#res#1 := 0; {1755#(= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1| 0)} is VALID [2022-02-20 21:10:50,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {1755#(= |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; {1756#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:50,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {1756#(= 0 |aws_linked_list_is_valid_#res#1|)} assume true; {1756#(= 0 |aws_linked_list_is_valid_#res#1|)} is VALID [2022-02-20 21:10:50,484 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1756#(= 0 |aws_linked_list_is_valid_#res#1|)} {1809#(< 1 |ULTIMATE.start_aws_linked_list_push_front_~node#1.base|)} #214#return; {1852#(and (< 1 |ULTIMATE.start_aws_linked_list_push_front_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0))} is VALID [2022-02-20 21:10:50,484 INFO L272 TraceCheckUtils]: 30: Hoare triple {1852#(and (< 1 |ULTIMATE.start_aws_linked_list_push_front_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0))} call assume_abort_if_not(aws_linked_list_push_front_#t~ret402#1); {1702#true} is VALID [2022-02-20 21:10:50,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {1702#true} ~cond := #in~cond; {1757#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 21:10:50,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {1757#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond % 256); {1862#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} is VALID [2022-02-20 21:10:50,485 INFO L290 TraceCheckUtils]: 33: Hoare triple {1862#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} assume true; {1862#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} is VALID [2022-02-20 21:10:50,485 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1862#(not (= (mod |assume_abort_if_not_#in~cond| 256) 0))} {1852#(and (< 1 |ULTIMATE.start_aws_linked_list_push_front_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0))} #216#return; {1703#false} is VALID [2022-02-20 21:10:50,485 INFO L290 TraceCheckUtils]: 35: Hoare triple {1703#false} havoc aws_linked_list_push_front_#t~ret402#1; {1703#false} is VALID [2022-02-20 21:10:50,486 INFO L272 TraceCheckUtils]: 36: Hoare triple {1703#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_front_~node#1.base != 0 || aws_linked_list_push_front_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {1703#false} is VALID [2022-02-20 21:10:50,486 INFO L290 TraceCheckUtils]: 37: Hoare triple {1703#false} ~cond := #in~cond; {1703#false} is VALID [2022-02-20 21:10:50,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {1703#false} assume !(0 == ~cond % 256); {1703#false} is VALID [2022-02-20 21:10:50,486 INFO L290 TraceCheckUtils]: 39: Hoare triple {1703#false} assume true; {1703#false} is VALID [2022-02-20 21:10:50,486 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {1703#false} {1703#false} #218#return; {1703#false} is VALID [2022-02-20 21:10:50,486 INFO L290 TraceCheckUtils]: 41: Hoare triple {1703#false} call aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset := read~$Pointer$(aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset, 8); {1703#false} is VALID [2022-02-20 21:10:50,486 INFO L272 TraceCheckUtils]: 42: Hoare triple {1703#false} call aws_linked_list_insert_before(aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset, aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset); {1703#false} is VALID [2022-02-20 21:10:50,486 INFO L290 TraceCheckUtils]: 43: Hoare triple {1703#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; {1703#false} is VALID [2022-02-20 21:10:50,486 INFO L272 TraceCheckUtils]: 44: Hoare triple {1703#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {1703#false} is VALID [2022-02-20 21:10:50,487 INFO L290 TraceCheckUtils]: 45: Hoare triple {1703#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {1703#false} is VALID [2022-02-20 21:10:50,487 INFO L290 TraceCheckUtils]: 46: Hoare triple {1703#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; {1703#false} is VALID [2022-02-20 21:10:50,487 INFO L290 TraceCheckUtils]: 47: Hoare triple {1703#false} #t~short316 := #t~short313; {1703#false} is VALID [2022-02-20 21:10:50,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {1703#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; {1703#false} is VALID [2022-02-20 21:10:50,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {1703#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; {1703#false} is VALID [2022-02-20 21:10:50,488 INFO L290 TraceCheckUtils]: 50: Hoare triple {1703#false} assume true; {1703#false} is VALID [2022-02-20 21:10:50,490 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {1703#false} {1703#false} #190#return; {1703#false} is VALID [2022-02-20 21:10:50,491 INFO L272 TraceCheckUtils]: 52: Hoare triple {1703#false} call assume_abort_if_not(#t~ret370); {1703#false} is VALID [2022-02-20 21:10:50,492 INFO L290 TraceCheckUtils]: 53: Hoare triple {1703#false} ~cond := #in~cond; {1703#false} is VALID [2022-02-20 21:10:50,492 INFO L290 TraceCheckUtils]: 54: Hoare triple {1703#false} assume !(0 == ~cond % 256); {1703#false} is VALID [2022-02-20 21:10:50,492 INFO L290 TraceCheckUtils]: 55: Hoare triple {1703#false} assume true; {1703#false} is VALID [2022-02-20 21:10:50,492 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {1703#false} {1703#false} #192#return; {1703#false} is VALID [2022-02-20 21:10:50,492 INFO L290 TraceCheckUtils]: 57: Hoare triple {1703#false} havoc #t~ret370; {1703#false} is VALID [2022-02-20 21:10:50,492 INFO L272 TraceCheckUtils]: 58: Hoare triple {1703#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)); {1703#false} is VALID [2022-02-20 21:10:50,492 INFO L290 TraceCheckUtils]: 59: Hoare triple {1703#false} ~cond := #in~cond; {1703#false} is VALID [2022-02-20 21:10:50,492 INFO L290 TraceCheckUtils]: 60: Hoare triple {1703#false} assume !(0 == ~cond % 256); {1703#false} is VALID [2022-02-20 21:10:50,493 INFO L290 TraceCheckUtils]: 61: Hoare triple {1703#false} assume true; {1703#false} is VALID [2022-02-20 21:10:50,493 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {1703#false} {1703#false} #194#return; {1703#false} is VALID [2022-02-20 21:10:50,493 INFO L290 TraceCheckUtils]: 63: Hoare triple {1703#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); {1703#false} is VALID [2022-02-20 21:10:50,494 INFO L272 TraceCheckUtils]: 64: Hoare triple {1703#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {1703#false} is VALID [2022-02-20 21:10:50,494 INFO L290 TraceCheckUtils]: 65: Hoare triple {1703#false} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {1703#false} is VALID [2022-02-20 21:10:50,494 INFO L290 TraceCheckUtils]: 66: Hoare triple {1703#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; {1703#false} is VALID [2022-02-20 21:10:50,494 INFO L290 TraceCheckUtils]: 67: Hoare triple {1703#false} #t~short316 := #t~short313; {1703#false} is VALID [2022-02-20 21:10:50,494 INFO L290 TraceCheckUtils]: 68: Hoare triple {1703#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; {1703#false} is VALID [2022-02-20 21:10:50,494 INFO L290 TraceCheckUtils]: 69: Hoare triple {1703#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; {1703#false} is VALID [2022-02-20 21:10:50,494 INFO L290 TraceCheckUtils]: 70: Hoare triple {1703#false} assume true; {1703#false} is VALID [2022-02-20 21:10:50,494 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {1703#false} {1703#false} #196#return; {1703#false} is VALID [2022-02-20 21:10:50,494 INFO L272 TraceCheckUtils]: 72: Hoare triple {1703#false} call __VERIFIER_assert(#t~ret373); {1703#false} is VALID [2022-02-20 21:10:50,495 INFO L290 TraceCheckUtils]: 73: Hoare triple {1703#false} ~cond := #in~cond; {1703#false} is VALID [2022-02-20 21:10:50,495 INFO L290 TraceCheckUtils]: 74: Hoare triple {1703#false} assume 0 == ~cond % 256; {1703#false} is VALID [2022-02-20 21:10:50,495 INFO L290 TraceCheckUtils]: 75: Hoare triple {1703#false} assume !false; {1703#false} is VALID [2022-02-20 21:10:50,495 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:50,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 21:10:50,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879871551] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:50,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 21:10:50,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 12 [2022-02-20 21:10:50,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803791916] [2022-02-20 21:10:50,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:50,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 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 76 [2022-02-20 21:10:50,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:50,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 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:50,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:50,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 21:10:50,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:50,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 21:10:50,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-02-20 21:10:50,538 INFO L87 Difference]: Start difference. First operand 104 states and 139 transitions. Second operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 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:51,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:51,610 INFO L93 Difference]: Finished difference Result 199 states and 268 transitions. [2022-02-20 21:10:51,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 21:10:51,611 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 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 76 [2022-02-20 21:10:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:51,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 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:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 259 transitions. [2022-02-20 21:10:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 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:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 259 transitions. [2022-02-20 21:10:51,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 259 transitions. [2022-02-20 21:10:51,798 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:10:51,801 INFO L225 Difference]: With dead ends: 199 [2022-02-20 21:10:51,801 INFO L226 Difference]: Without dead ends: 109 [2022-02-20 21:10:51,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 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:51,802 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 140 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:51,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [142 Valid, 734 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 21:10:51,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-02-20 21:10:51,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2022-02-20 21:10:51,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:51,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 105 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 70 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:51,841 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 105 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 70 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:51,841 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 105 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 70 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:51,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:51,845 INFO L93 Difference]: Finished difference Result 109 states and 145 transitions. [2022-02-20 21:10:51,845 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 145 transitions. [2022-02-20 21:10:51,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:51,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:51,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 70 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 109 states. [2022-02-20 21:10:51,846 INFO L87 Difference]: Start difference. First operand has 105 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 70 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 109 states. [2022-02-20 21:10:51,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:51,850 INFO L93 Difference]: Finished difference Result 109 states and 145 transitions. [2022-02-20 21:10:51,850 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 145 transitions. [2022-02-20 21:10:51,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:51,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:51,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:51,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:51,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 70 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:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 140 transitions. [2022-02-20 21:10:51,854 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 140 transitions. Word has length 76 [2022-02-20 21:10:51,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:51,855 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 140 transitions. [2022-02-20 21:10:51,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 5.5) internal successors, (44), 9 states have internal predecessors, (44), 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:51,855 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 140 transitions. [2022-02-20 21:10:51,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 21:10:51,856 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:10:51,856 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:51,876 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:52,074 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,SelfDestructingSolverStorable2 [2022-02-20 21:10:52,074 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:10:52,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:10:52,074 INFO L85 PathProgramCache]: Analyzing trace with hash 958884107, now seen corresponding path program 1 times [2022-02-20 21:10:52,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:10:52,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838810118] [2022-02-20 21:10:52,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:10:52,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:10:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:52,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:10:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:52,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {2643#true} #res := #t~nondet13;havoc #t~nondet13; {2643#true} is VALID [2022-02-20 21:10:52,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2643#true} {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0))} #210#return; {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:52,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:10:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:52,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {2643#true} ~cond := #in~cond; {2643#true} is VALID [2022-02-20 21:10:52,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {2643#true} assume !(0 == ~cond % 256); {2643#true} is VALID [2022-02-20 21:10:52,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2643#true} {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0))} #212#return; {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:52,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:10:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:52,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {2643#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; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {2699#(= |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; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short301#1 := #t~short299#1; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,175 INFO L290 TraceCheckUtils]: 3: Hoare triple {2699#(= |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; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,175 INFO L290 TraceCheckUtils]: 4: Hoare triple {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short303#1 := #t~short301#1; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {2699#(= |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; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short305#1 := #t~short303#1; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {2699#(= |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; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {2699#(= |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; {2700#(= |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:52,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {2700#(= |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; {2701#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:52,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {2701#(= |aws_linked_list_is_valid_#in~list#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); {2701#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:52,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {2701#(= |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; {2701#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:52,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {2701#(= |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; {2701#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:52,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {2701#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume true; {2701#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:52,179 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2701#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} {2653#(not (= |ULTIMATE.start_aws_linked_list_push_front_~list#1.base| 0))} #214#return; {2644#false} is VALID [2022-02-20 21:10:52,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 21:10:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:52,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {2643#true} ~cond := #in~cond; {2643#true} is VALID [2022-02-20 21:10:52,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {2643#true} assume !(0 == ~cond % 256); {2643#true} is VALID [2022-02-20 21:10:52,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2643#true} {2644#false} #216#return; {2644#false} is VALID [2022-02-20 21:10:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 21:10:52,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:52,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {2643#true} ~cond := #in~cond; {2643#true} is VALID [2022-02-20 21:10:52,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {2643#true} assume !(0 == ~cond % 256); {2643#true} is VALID [2022-02-20 21:10:52,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2643#true} {2644#false} #218#return; {2644#false} is VALID [2022-02-20 21:10:52,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:10:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:52,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {2643#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {2643#true} is VALID [2022-02-20 21:10:52,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {2643#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; {2643#true} is VALID [2022-02-20 21:10:52,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {2643#true} #t~short316 := #t~short313; {2643#true} is VALID [2022-02-20 21:10:52,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {2643#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; {2643#true} is VALID [2022-02-20 21:10:52,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {2643#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; {2643#true} is VALID [2022-02-20 21:10:52,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,199 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2643#true} {2644#false} #190#return; {2644#false} is VALID [2022-02-20 21:10:52,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-20 21:10:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:52,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {2643#true} ~cond := #in~cond; {2643#true} is VALID [2022-02-20 21:10:52,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {2643#true} assume !(0 == ~cond % 256); {2643#true} is VALID [2022-02-20 21:10:52,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2643#true} {2644#false} #192#return; {2644#false} is VALID [2022-02-20 21:10:52,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-02-20 21:10:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:52,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {2643#true} ~cond := #in~cond; {2643#true} is VALID [2022-02-20 21:10:52,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {2643#true} assume !(0 == ~cond % 256); {2643#true} is VALID [2022-02-20 21:10:52,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2643#true} {2644#false} #194#return; {2644#false} is VALID [2022-02-20 21:10:52,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-02-20 21:10:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:10:52,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {2643#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {2643#true} is VALID [2022-02-20 21:10:52,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {2643#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; {2643#true} is VALID [2022-02-20 21:10:52,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {2643#true} #t~short316 := #t~short313; {2643#true} is VALID [2022-02-20 21:10:52,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {2643#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; {2643#true} is VALID [2022-02-20 21:10:52,220 INFO L290 TraceCheckUtils]: 4: Hoare triple {2643#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; {2643#true} is VALID [2022-02-20 21:10:52,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,220 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2643#true} {2644#false} #196#return; {2644#false} is VALID [2022-02-20 21:10:52,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {2643#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(37, 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; {2643#true} is VALID [2022-02-20 21:10:52,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {2643#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;assume { :begin_inline_aws_linked_list_push_front_harness } true;havoc aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset, aws_linked_list_push_front_harness_#t~ret679#1, aws_linked_list_push_front_harness_#t~ret680#1, aws_linked_list_push_front_harness_#t~ret681#1, aws_linked_list_push_front_harness_#t~mem682#1.base, aws_linked_list_push_front_harness_#t~mem682#1.offset, aws_linked_list_push_front_harness_#t~mem683#1.base, aws_linked_list_push_front_harness_#t~mem683#1.offset, aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_harness_~#to_add~0#1.offset, aws_linked_list_push_front_harness_~old_first~0#1.base, aws_linked_list_push_front_harness_~old_first~0#1.offset;call aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset := #Ultimate.allocOnStack(32);call aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_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_front_harness_~#list~0#1.base, aws_linked_list_push_front_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; {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:52,220 INFO L272 TraceCheckUtils]: 2: Hoare triple {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0))} call ensure_linked_list_is_allocated_#t~ret547#1 := nondet_uint64_t(); {2643#true} is VALID [2022-02-20 21:10:52,220 INFO L290 TraceCheckUtils]: 3: Hoare triple {2643#true} #res := #t~nondet13;havoc #t~nondet13; {2643#true} is VALID [2022-02-20 21:10:52,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,221 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {2643#true} {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0))} #210#return; {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:52,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_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; {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:52,221 INFO L272 TraceCheckUtils]: 7: Hoare triple {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_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)); {2643#true} is VALID [2022-02-20 21:10:52,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {2643#true} ~cond := #in~cond; {2643#true} is VALID [2022-02-20 21:10:52,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {2643#true} assume !(0 == ~cond % 256); {2643#true} is VALID [2022-02-20 21:10:52,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,222 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2643#true} {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0))} #212#return; {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:52,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_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; {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:52,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_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); {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:52,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_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); {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0))} is VALID [2022-02-20 21:10:52,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {2645#(not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0))} assume { :end_inline_ensure_linked_list_is_allocated } true;call aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset := read~$Pointer$(aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, 8);aws_linked_list_push_front_harness_~old_first~0#1.base, aws_linked_list_push_front_harness_~old_first~0#1.offset := aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset;havoc aws_linked_list_push_front_harness_#t~mem678#1.base, aws_linked_list_push_front_harness_#t~mem678#1.offset;assume { :begin_inline_aws_linked_list_push_front } true;aws_linked_list_push_front_#in~list#1.base, aws_linked_list_push_front_#in~list#1.offset, aws_linked_list_push_front_#in~node#1.base, aws_linked_list_push_front_#in~node#1.offset := aws_linked_list_push_front_harness_~#list~0#1.base, aws_linked_list_push_front_harness_~#list~0#1.offset, aws_linked_list_push_front_harness_~#to_add~0#1.base, aws_linked_list_push_front_harness_~#to_add~0#1.offset;havoc aws_linked_list_push_front_#t~ret402#1, aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset, aws_linked_list_push_front_#t~ret404#1, aws_linked_list_push_front_#t~mem405#1.base, aws_linked_list_push_front_#t~mem405#1.offset, aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset, aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset;aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset := aws_linked_list_push_front_#in~list#1.base, aws_linked_list_push_front_#in~list#1.offset;aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset := aws_linked_list_push_front_#in~node#1.base, aws_linked_list_push_front_#in~node#1.offset; {2653#(not (= |ULTIMATE.start_aws_linked_list_push_front_~list#1.base| 0))} is VALID [2022-02-20 21:10:52,224 INFO L272 TraceCheckUtils]: 16: Hoare triple {2653#(not (= |ULTIMATE.start_aws_linked_list_push_front_~list#1.base| 0))} call aws_linked_list_push_front_#t~ret402#1 := aws_linked_list_is_valid(aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset); {2643#true} is VALID [2022-02-20 21:10:52,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {2643#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; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {2699#(= |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; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short301#1 := #t~short299#1; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {2699#(= |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; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short303#1 := #t~short301#1; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {2699#(= |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; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} #t~short305#1 := #t~short303#1; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {2699#(= |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; {2699#(= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)} is VALID [2022-02-20 21:10:52,227 INFO L290 TraceCheckUtils]: 25: Hoare triple {2699#(= |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; {2700#(= |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:52,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {2700#(= |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; {2701#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:52,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {2701#(= |aws_linked_list_is_valid_#in~list#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); {2701#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:52,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {2701#(= |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; {2701#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:52,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {2701#(= |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; {2701#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:52,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {2701#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} assume true; {2701#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} is VALID [2022-02-20 21:10:52,229 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2701#(= |aws_linked_list_is_valid_#in~list#1.base| 0)} {2653#(not (= |ULTIMATE.start_aws_linked_list_push_front_~list#1.base| 0))} #214#return; {2644#false} is VALID [2022-02-20 21:10:52,229 INFO L272 TraceCheckUtils]: 32: Hoare triple {2644#false} call assume_abort_if_not(aws_linked_list_push_front_#t~ret402#1); {2643#true} is VALID [2022-02-20 21:10:52,229 INFO L290 TraceCheckUtils]: 33: Hoare triple {2643#true} ~cond := #in~cond; {2643#true} is VALID [2022-02-20 21:10:52,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {2643#true} assume !(0 == ~cond % 256); {2643#true} is VALID [2022-02-20 21:10:52,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,230 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2643#true} {2644#false} #216#return; {2644#false} is VALID [2022-02-20 21:10:52,230 INFO L290 TraceCheckUtils]: 37: Hoare triple {2644#false} havoc aws_linked_list_push_front_#t~ret402#1; {2644#false} is VALID [2022-02-20 21:10:52,230 INFO L272 TraceCheckUtils]: 38: Hoare triple {2644#false} call assume_abort_if_not((if 0 == (if aws_linked_list_push_front_~node#1.base != 0 || aws_linked_list_push_front_~node#1.offset != 0 then 1 else 0) then 0 else 1)); {2643#true} is VALID [2022-02-20 21:10:52,230 INFO L290 TraceCheckUtils]: 39: Hoare triple {2643#true} ~cond := #in~cond; {2643#true} is VALID [2022-02-20 21:10:52,230 INFO L290 TraceCheckUtils]: 40: Hoare triple {2643#true} assume !(0 == ~cond % 256); {2643#true} is VALID [2022-02-20 21:10:52,230 INFO L290 TraceCheckUtils]: 41: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,230 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2643#true} {2644#false} #218#return; {2644#false} is VALID [2022-02-20 21:10:52,231 INFO L290 TraceCheckUtils]: 43: Hoare triple {2644#false} call aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset := read~$Pointer$(aws_linked_list_push_front_~list#1.base, aws_linked_list_push_front_~list#1.offset, 8); {2644#false} is VALID [2022-02-20 21:10:52,231 INFO L272 TraceCheckUtils]: 44: Hoare triple {2644#false} call aws_linked_list_insert_before(aws_linked_list_push_front_#t~mem403#1.base, aws_linked_list_push_front_#t~mem403#1.offset, aws_linked_list_push_front_~node#1.base, aws_linked_list_push_front_~node#1.offset); {2644#false} is VALID [2022-02-20 21:10:52,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {2644#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; {2644#false} is VALID [2022-02-20 21:10:52,231 INFO L272 TraceCheckUtils]: 46: Hoare triple {2644#false} call #t~ret370 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {2643#true} is VALID [2022-02-20 21:10:52,231 INFO L290 TraceCheckUtils]: 47: Hoare triple {2643#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {2643#true} is VALID [2022-02-20 21:10:52,231 INFO L290 TraceCheckUtils]: 48: Hoare triple {2643#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; {2643#true} is VALID [2022-02-20 21:10:52,231 INFO L290 TraceCheckUtils]: 49: Hoare triple {2643#true} #t~short316 := #t~short313; {2643#true} is VALID [2022-02-20 21:10:52,231 INFO L290 TraceCheckUtils]: 50: Hoare triple {2643#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; {2643#true} is VALID [2022-02-20 21:10:52,231 INFO L290 TraceCheckUtils]: 51: Hoare triple {2643#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; {2643#true} is VALID [2022-02-20 21:10:52,232 INFO L290 TraceCheckUtils]: 52: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,232 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {2643#true} {2644#false} #190#return; {2644#false} is VALID [2022-02-20 21:10:52,232 INFO L272 TraceCheckUtils]: 54: Hoare triple {2644#false} call assume_abort_if_not(#t~ret370); {2643#true} is VALID [2022-02-20 21:10:52,232 INFO L290 TraceCheckUtils]: 55: Hoare triple {2643#true} ~cond := #in~cond; {2643#true} is VALID [2022-02-20 21:10:52,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {2643#true} assume !(0 == ~cond % 256); {2643#true} is VALID [2022-02-20 21:10:52,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,232 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2643#true} {2644#false} #192#return; {2644#false} is VALID [2022-02-20 21:10:52,232 INFO L290 TraceCheckUtils]: 59: Hoare triple {2644#false} havoc #t~ret370; {2644#false} is VALID [2022-02-20 21:10:52,232 INFO L272 TraceCheckUtils]: 60: Hoare triple {2644#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)); {2643#true} is VALID [2022-02-20 21:10:52,232 INFO L290 TraceCheckUtils]: 61: Hoare triple {2643#true} ~cond := #in~cond; {2643#true} is VALID [2022-02-20 21:10:52,233 INFO L290 TraceCheckUtils]: 62: Hoare triple {2643#true} assume !(0 == ~cond % 256); {2643#true} is VALID [2022-02-20 21:10:52,233 INFO L290 TraceCheckUtils]: 63: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,233 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {2643#true} {2644#false} #194#return; {2644#false} is VALID [2022-02-20 21:10:52,233 INFO L290 TraceCheckUtils]: 65: Hoare triple {2644#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); {2644#false} is VALID [2022-02-20 21:10:52,233 INFO L272 TraceCheckUtils]: 66: Hoare triple {2644#false} call #t~ret373 := aws_linked_list_node_prev_is_valid(~before.base, ~before.offset); {2643#true} is VALID [2022-02-20 21:10:52,233 INFO L290 TraceCheckUtils]: 67: Hoare triple {2643#true} ~node.base, ~node.offset := #in~node.base, #in~node.offset;#t~short313 := ~node.base != 0 || ~node.offset != 0; {2643#true} is VALID [2022-02-20 21:10:52,233 INFO L290 TraceCheckUtils]: 68: Hoare triple {2643#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; {2643#true} is VALID [2022-02-20 21:10:52,233 INFO L290 TraceCheckUtils]: 69: Hoare triple {2643#true} #t~short316 := #t~short313; {2643#true} is VALID [2022-02-20 21:10:52,233 INFO L290 TraceCheckUtils]: 70: Hoare triple {2643#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; {2643#true} is VALID [2022-02-20 21:10:52,234 INFO L290 TraceCheckUtils]: 71: Hoare triple {2643#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; {2643#true} is VALID [2022-02-20 21:10:52,234 INFO L290 TraceCheckUtils]: 72: Hoare triple {2643#true} assume true; {2643#true} is VALID [2022-02-20 21:10:52,234 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {2643#true} {2644#false} #196#return; {2644#false} is VALID [2022-02-20 21:10:52,234 INFO L272 TraceCheckUtils]: 74: Hoare triple {2644#false} call __VERIFIER_assert(#t~ret373); {2644#false} is VALID [2022-02-20 21:10:52,234 INFO L290 TraceCheckUtils]: 75: Hoare triple {2644#false} ~cond := #in~cond; {2644#false} is VALID [2022-02-20 21:10:52,234 INFO L290 TraceCheckUtils]: 76: Hoare triple {2644#false} assume 0 == ~cond % 256; {2644#false} is VALID [2022-02-20 21:10:52,234 INFO L290 TraceCheckUtils]: 77: Hoare triple {2644#false} assume !false; {2644#false} is VALID [2022-02-20 21:10:52,234 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:52,235 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:10:52,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838810118] [2022-02-20 21:10:52,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838810118] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:10:52,235 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:10:52,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:10:52,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646908969] [2022-02-20 21:10:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:10:52,236 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), 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:52,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:10:52,236 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), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:52,278 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:52,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:10:52,279 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:10:52,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:10:52,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:10:52,279 INFO L87 Difference]: Start difference. First operand 105 states and 140 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), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:52,501 INFO L93 Difference]: Finished difference Result 145 states and 186 transitions. [2022-02-20 21:10:52,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:10:52,501 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), 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:52,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:10:52,501 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), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:52,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2022-02-20 21:10:52,503 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), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:52,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2022-02-20 21:10:52,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 174 transitions. [2022-02-20 21:10:52,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:10:52,626 INFO L225 Difference]: With dead ends: 145 [2022-02-20 21:10:52,626 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 21:10:52,627 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:52,627 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 36 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:10:52,628 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 230 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:10:52,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 21:10:52,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 21:10:52,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:10:52,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:10:52,628 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:10:52,629 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:10:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:52,629 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 21:10:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 21:10:52,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:52,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:52,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 21:10:52,629 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 21:10:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:10:52,629 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 21:10:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 21:10:52,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:52,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:10:52,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:10:52,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:10:52,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:10:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 21:10:52,630 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2022-02-20 21:10:52,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:10:52,630 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 21:10:52,630 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), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-02-20 21:10:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 21:10:52,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:10:52,632 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 21:10:52,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:10:52,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 21:10:52,775 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validFINAL(lines 4715 4719) no Hoare annotation was computed. [2022-02-20 21:10:52,775 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4715 4719) no Hoare annotation was computed. [2022-02-20 21:10:52,775 INFO L858 garLoopResultBuilder]: For program point L4718(line 4718) no Hoare annotation was computed. [2022-02-20 21:10:52,775 INFO L858 garLoopResultBuilder]: For program point L4718-3(line 4718) no Hoare annotation was computed. [2022-02-20 21:10:52,775 INFO L858 garLoopResultBuilder]: For program point L4718-2(line 4718) no Hoare annotation was computed. [2022-02-20 21:10:52,775 INFO L858 garLoopResultBuilder]: For program point L4718-5(line 4718) no Hoare annotation was computed. [2022-02-20 21:10:52,775 INFO L861 garLoopResultBuilder]: At program point aws_linked_list_node_next_is_validENTRY(lines 4715 4719) the Hoare annotation is: true [2022-02-20 21:10:52,777 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validFINAL(lines 4726 4730) no Hoare annotation was computed. [2022-02-20 21:10:52,777 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4726 4730) no Hoare annotation was computed. [2022-02-20 21:10:52,777 INFO L858 garLoopResultBuilder]: For program point L4729-2(line 4729) no Hoare annotation was computed. [2022-02-20 21:10:52,777 INFO L858 garLoopResultBuilder]: For program point L4729-3(line 4729) no Hoare annotation was computed. [2022-02-20 21:10:52,777 INFO L858 garLoopResultBuilder]: For program point L4729(line 4729) no Hoare annotation was computed. [2022-02-20 21:10:52,777 INFO L858 garLoopResultBuilder]: For program point L4729-5(line 4729) no Hoare annotation was computed. [2022-02-20 21:10:52,777 INFO L861 garLoopResultBuilder]: At program point aws_linked_list_node_prev_is_validENTRY(lines 4726 4730) the Hoare annotation is: true [2022-02-20 21:10:52,777 INFO L858 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-02-20 21:10:52,777 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-02-20 21:10:52,777 INFO L858 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-02-20 21:10:52,777 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-02-20 21:10:52,777 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tEXIT(line 266) no Hoare annotation was computed. [2022-02-20 21:10:52,777 INFO L861 garLoopResultBuilder]: At program point nondet_uint64_tENTRY(line 266) the Hoare annotation is: true [2022-02-20 21:10:52,777 INFO L858 garLoopResultBuilder]: For program point nondet_uint64_tFINAL(line 266) no Hoare annotation was computed. [2022-02-20 21:10:52,777 INFO L861 garLoopResultBuilder]: At program point L4923(line 4923) the Hoare annotation is: true [2022-02-20 21:10:52,777 INFO L861 garLoopResultBuilder]: At program point L4922(line 4922) the Hoare annotation is: true [2022-02-20 21:10:52,777 INFO L858 garLoopResultBuilder]: For program point L4923-1(line 4923) no Hoare annotation was computed. [2022-02-20 21:10:52,777 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_insert_beforeFINAL(lines 4909 4924) no Hoare annotation was computed. [2022-02-20 21:10:52,777 INFO L861 garLoopResultBuilder]: At program point L4920-1(line 4920) the Hoare annotation is: true [2022-02-20 21:10:52,777 INFO L858 garLoopResultBuilder]: For program point L4921-2(line 4921) no Hoare annotation was computed. [2022-02-20 21:10:52,777 INFO L858 garLoopResultBuilder]: For program point L4920-2(line 4920) no Hoare annotation was computed. [2022-02-20 21:10:52,778 INFO L861 garLoopResultBuilder]: At program point L4921(line 4921) the Hoare annotation is: true [2022-02-20 21:10:52,778 INFO L861 garLoopResultBuilder]: At program point L4922-1(line 4922) the Hoare annotation is: true [2022-02-20 21:10:52,778 INFO L861 garLoopResultBuilder]: At program point L4920(line 4920) the Hoare annotation is: true [2022-02-20 21:10:52,778 INFO L861 garLoopResultBuilder]: At program point L4921-1(line 4921) the Hoare annotation is: true [2022-02-20 21:10:52,778 INFO L858 garLoopResultBuilder]: For program point L4922-2(line 4922) no Hoare annotation was computed. [2022-02-20 21:10:52,778 INFO L861 garLoopResultBuilder]: At program point L4912-1(line 4912) the Hoare annotation is: true [2022-02-20 21:10:52,778 INFO L858 garLoopResultBuilder]: For program point L4912-2(line 4912) no Hoare annotation was computed. [2022-02-20 21:10:52,778 INFO L861 garLoopResultBuilder]: At program point L4913(lines 4913 4915) the Hoare annotation is: true [2022-02-20 21:10:52,778 INFO L861 garLoopResultBuilder]: At program point L4912(line 4912) the Hoare annotation is: true [2022-02-20 21:10:52,778 INFO L858 garLoopResultBuilder]: For program point L4913-1(lines 4913 4915) no Hoare annotation was computed. [2022-02-20 21:10:52,778 INFO L861 garLoopResultBuilder]: At program point aws_linked_list_insert_beforeENTRY(lines 4909 4924) the Hoare annotation is: true [2022-02-20 21:10:52,778 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_insert_beforeEXIT(lines 4909 4924) no Hoare annotation was computed. [2022-02-20 21:10:52,778 INFO L854 garLoopResultBuilder]: At program point L4990(line 4990) the Hoare annotation is: (and (< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0)) (< 1 |ULTIMATE.start_aws_linked_list_push_front_~node#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_front_~list#1.base| 0)) (< 0 |#StackHeapBarrier|)) [2022-02-20 21:10:52,778 INFO L858 garLoopResultBuilder]: For program point L4994-1(line 4994) no Hoare annotation was computed. [2022-02-20 21:10:52,778 INFO L854 garLoopResultBuilder]: At program point L4990-1(line 4990) the Hoare annotation is: (and (< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|) (< 1 |ULTIMATE.start_aws_linked_list_push_front_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_push_front_#t~ret402#1| 0) (< 0 |#StackHeapBarrier|)) [2022-02-20 21:10:52,778 INFO L858 garLoopResultBuilder]: For program point L7389-1(line 7389) no Hoare annotation was computed. [2022-02-20 21:10:52,778 INFO L858 garLoopResultBuilder]: For program point L4990-2(line 4990) no Hoare annotation was computed. [2022-02-20 21:10:52,778 INFO L854 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: false [2022-02-20 21:10:52,778 INFO L858 garLoopResultBuilder]: For program point L6754(lines 6754 6778) no Hoare annotation was computed. [2022-02-20 21:10:52,778 INFO L854 garLoopResultBuilder]: At program point L4995(line 4995) the Hoare annotation is: false [2022-02-20 21:10:52,779 INFO L854 garLoopResultBuilder]: At program point L4995-1(line 4995) the Hoare annotation is: false [2022-02-20 21:10:52,779 INFO L854 garLoopResultBuilder]: At program point L4991(lines 4991 4993) the Hoare annotation is: false [2022-02-20 21:10:52,779 INFO L854 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: false [2022-02-20 21:10:52,779 INFO L858 garLoopResultBuilder]: For program point L4991-1(lines 4991 4993) no Hoare annotation was computed. [2022-02-20 21:10:52,779 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 21:10:52,779 INFO L858 garLoopResultBuilder]: For program point L4995-2(line 4995) no Hoare annotation was computed. [2022-02-20 21:10:52,779 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 21:10:52,779 INFO L854 garLoopResultBuilder]: At program point L7386(line 7386) the Hoare annotation is: false [2022-02-20 21:10:52,779 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 21:10:52,779 INFO L858 garLoopResultBuilder]: For program point L7390-1(line 7390) no Hoare annotation was computed. [2022-02-20 21:10:52,779 INFO L858 garLoopResultBuilder]: For program point L7386-2(line 7386) no Hoare annotation was computed. [2022-02-20 21:10:52,779 INFO L854 garLoopResultBuilder]: At program point L7386-1(line 7386) the Hoare annotation is: false [2022-02-20 21:10:52,779 INFO L858 garLoopResultBuilder]: For program point L7374(lines 7374 7391) no Hoare annotation was computed. [2022-02-20 21:10:52,779 INFO L858 garLoopResultBuilder]: For program point L6767-4(lines 6767 6774) no Hoare annotation was computed. [2022-02-20 21:10:52,779 INFO L854 garLoopResultBuilder]: At program point L6767-3(lines 6767 6774) the Hoare annotation is: (and (< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0)) (< 0 |#StackHeapBarrier|)) [2022-02-20 21:10:52,780 INFO L858 garLoopResultBuilder]: For program point L6767-2(lines 6767 6774) no Hoare annotation was computed. [2022-02-20 21:10:52,780 INFO L858 garLoopResultBuilder]: For program point L6755-1(line 6755) no Hoare annotation was computed. [2022-02-20 21:10:52,780 INFO L858 garLoopResultBuilder]: For program point L4996-1(line 4996) no Hoare annotation was computed. [2022-02-20 21:10:52,780 INFO L854 garLoopResultBuilder]: At program point L6755(line 6755) the Hoare annotation is: (and (< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0)) (< 0 |#StackHeapBarrier|)) [2022-02-20 21:10:52,780 INFO L854 garLoopResultBuilder]: At program point L4996(line 4996) the Hoare annotation is: false [2022-02-20 21:10:52,780 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 21:10:52,780 INFO L854 garLoopResultBuilder]: At program point L7387-1(line 7387) the Hoare annotation is: false [2022-02-20 21:10:52,780 INFO L854 garLoopResultBuilder]: At program point L7387(line 7387) the Hoare annotation is: false [2022-02-20 21:10:52,780 INFO L858 garLoopResultBuilder]: For program point L7387-2(line 7387) no Hoare annotation was computed. [2022-02-20 21:10:52,780 INFO L858 garLoopResultBuilder]: For program point L6756-1(line 6756) no Hoare annotation was computed. [2022-02-20 21:10:52,781 INFO L854 garLoopResultBuilder]: At program point L6756(line 6756) the Hoare annotation is: (and (< 1 |ULTIMATE.start_aws_linked_list_push_front_harness_~#to_add~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_push_front_harness_~#list~0#1.base| 0)) (< 0 |#StackHeapBarrier|)) [2022-02-20 21:10:52,781 INFO L861 garLoopResultBuilder]: At program point L7392(line 7392) the Hoare annotation is: true [2022-02-20 21:10:52,781 INFO L858 garLoopResultBuilder]: For program point L7388-2(line 7388) no Hoare annotation was computed. [2022-02-20 21:10:52,781 INFO L854 garLoopResultBuilder]: At program point L7388-1(line 7388) the Hoare annotation is: false [2022-02-20 21:10:52,781 INFO L858 garLoopResultBuilder]: For program point L4989(lines 4989 4997) no Hoare annotation was computed. [2022-02-20 21:10:52,781 INFO L854 garLoopResultBuilder]: At program point L7388(line 7388) the Hoare annotation is: false [2022-02-20 21:10:52,781 INFO L854 garLoopResultBuilder]: At program point L4994(line 4994) the Hoare annotation is: false [2022-02-20 21:10:52,781 INFO L858 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-02-20 21:10:52,781 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-02-20 21:10:52,781 INFO L858 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-02-20 21:10:52,782 INFO L858 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-02-20 21:10:52,782 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-02-20 21:10:52,782 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-02-20 21:10:52,782 INFO L858 garLoopResultBuilder]: For program point L4734(lines 4734 4738) no Hoare annotation was computed. [2022-02-20 21:10:52,782 INFO L858 garLoopResultBuilder]: For program point L4751(lines 4751 4761) no Hoare annotation was computed. [2022-02-20 21:10:52,782 INFO L854 garLoopResultBuilder]: At program point L4764(lines 4731 4765) the Hoare annotation is: (or (and (= |aws_linked_list_is_valid_#in~list#1.base| 0) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)) (not (< 0 |#StackHeapBarrier|)) (= |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_#res#1| 0)) [2022-02-20 21:10:52,782 INFO L858 garLoopResultBuilder]: For program point L4694(line 4694) no Hoare annotation was computed. [2022-02-20 21:10:52,782 INFO L858 garLoopResultBuilder]: For program point L4694-3(lines 4694 4695) no Hoare annotation was computed. [2022-02-20 21:10:52,782 INFO L858 garLoopResultBuilder]: For program point L4756-1(lines 4756 4761) no Hoare annotation was computed. [2022-02-20 21:10:52,782 INFO L858 garLoopResultBuilder]: For program point L4694-2(line 4694) no Hoare annotation was computed. [2022-02-20 21:10:52,783 INFO L854 garLoopResultBuilder]: At program point L4756(line 4756) the Hoare annotation is: (or (and (= |aws_linked_list_is_valid_#in~list#1.base| 0) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)) (not (< 0 |#StackHeapBarrier|))) [2022-02-20 21:10:52,783 INFO L858 garLoopResultBuilder]: For program point L4694-8(lines 4694 4696) no Hoare annotation was computed. [2022-02-20 21:10:52,783 INFO L858 garLoopResultBuilder]: For program point L4694-5(lines 4694 4695) no Hoare annotation was computed. [2022-02-20 21:10:52,783 INFO L858 garLoopResultBuilder]: For program point L4694-6(lines 4694 4696) no Hoare annotation was computed. [2022-02-20 21:10:52,783 INFO L858 garLoopResultBuilder]: For program point L4694-11(lines 4694 4704) no Hoare annotation was computed. [2022-02-20 21:10:52,783 INFO L858 garLoopResultBuilder]: For program point L4694-9(lines 4694 4697) no Hoare annotation was computed. [2022-02-20 21:10:52,783 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_is_validEXIT(lines 4691 4708) no Hoare annotation was computed. [2022-02-20 21:10:52,783 INFO L861 garLoopResultBuilder]: At program point aws_linked_list_is_validENTRY(lines 4691 4708) the Hoare annotation is: true [2022-02-20 21:10:52,783 INFO L858 garLoopResultBuilder]: For program point aws_linked_list_is_validFINAL(lines 4691 4708) no Hoare annotation was computed. [2022-02-20 21:10:52,783 INFO L858 garLoopResultBuilder]: For program point L4750-3(lines 4750 4763) no Hoare annotation was computed. [2022-02-20 21:10:52,784 INFO L854 garLoopResultBuilder]: At program point L4750-2(lines 4750 4763) the Hoare annotation is: (or (and (= |aws_linked_list_is_valid_#in~list#1.base| 0) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~list#1.base|) (= |aws_linked_list_is_valid_#in~list#1.base| |aws_linked_list_is_valid_~list#1.base|)) (not (< 0 |#StackHeapBarrier|))) [2022-02-20 21:10:52,786 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 21:10:52,786 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 21:10:52,788 WARN L170 areAnnotationChecker]: L4718 has no Hoare annotation [2022-02-20 21:10:52,788 WARN L170 areAnnotationChecker]: nondet_uint64_tFINAL has no Hoare annotation [2022-02-20 21:10:52,788 WARN L170 areAnnotationChecker]: L4729 has no Hoare annotation [2022-02-20 21:10:52,789 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 21:10:52,789 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2022-02-20 21:10:52,789 WARN L170 areAnnotationChecker]: L223 has no Hoare annotation [2022-02-20 21:10:52,789 WARN L170 areAnnotationChecker]: L4694 has no Hoare annotation [2022-02-20 21:10:52,789 WARN L170 areAnnotationChecker]: L4718 has no Hoare annotation [2022-02-20 21:10:52,789 WARN L170 areAnnotationChecker]: L4718 has no Hoare annotation [2022-02-20 21:10:52,789 WARN L170 areAnnotationChecker]: nondet_uint64_tFINAL has no Hoare annotation [2022-02-20 21:10:52,789 WARN L170 areAnnotationChecker]: L4729 has no Hoare annotation [2022-02-20 21:10:52,789 WARN L170 areAnnotationChecker]: L4729 has no Hoare annotation [2022-02-20 21:10:52,789 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 21:10:52,789 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2022-02-20 21:10:52,789 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2022-02-20 21:10:52,790 WARN L170 areAnnotationChecker]: L223 has no Hoare annotation [2022-02-20 21:10:52,790 WARN L170 areAnnotationChecker]: L223 has no Hoare annotation [2022-02-20 21:10:52,790 WARN L170 areAnnotationChecker]: L4694 has no Hoare annotation [2022-02-20 21:10:52,790 WARN L170 areAnnotationChecker]: L4694 has no Hoare annotation [2022-02-20 21:10:52,790 WARN L170 areAnnotationChecker]: L4718-2 has no Hoare annotation [2022-02-20 21:10:52,790 WARN L170 areAnnotationChecker]: nondet_uint64_tEXIT has no Hoare annotation [2022-02-20 21:10:52,790 WARN L170 areAnnotationChecker]: L4729-2 has no Hoare annotation [2022-02-20 21:10:52,790 WARN L170 areAnnotationChecker]: L4912-2 has no Hoare annotation [2022-02-20 21:10:52,790 WARN L170 areAnnotationChecker]: L6755-1 has no Hoare annotation [2022-02-20 21:10:52,790 WARN L170 areAnnotationChecker]: L211-2 has no Hoare annotation [2022-02-20 21:10:52,790 WARN L170 areAnnotationChecker]: L223-1 has no Hoare annotation [2022-02-20 21:10:52,790 WARN L170 areAnnotationChecker]: L223-1 has no Hoare annotation [2022-02-20 21:10:52,791 WARN L170 areAnnotationChecker]: L223-3 has no Hoare annotation [2022-02-20 21:10:52,791 WARN L170 areAnnotationChecker]: L4694-2 has no Hoare annotation [2022-02-20 21:10:52,791 WARN L170 areAnnotationChecker]: L4718-3 has no Hoare annotation [2022-02-20 21:10:52,791 WARN L170 areAnnotationChecker]: L4718-3 has no Hoare annotation [2022-02-20 21:10:52,791 WARN L170 areAnnotationChecker]: L6755-1 has no Hoare annotation [2022-02-20 21:10:52,791 WARN L170 areAnnotationChecker]: L4729-3 has no Hoare annotation [2022-02-20 21:10:52,791 WARN L170 areAnnotationChecker]: L4729-3 has no Hoare annotation [2022-02-20 21:10:52,791 WARN L170 areAnnotationChecker]: L4912-2 has no Hoare annotation [2022-02-20 21:10:52,791 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:10:52,791 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:10:52,791 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:10:52,791 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:10:52,792 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:10:52,792 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:10:52,792 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:10:52,792 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:10:52,792 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:10:52,792 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:10:52,792 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:10:52,792 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:10:52,792 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:10:52,792 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:10:52,792 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:10:52,792 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 21:10:52,792 WARN L170 areAnnotationChecker]: L4694-3 has no Hoare annotation [2022-02-20 21:10:52,793 WARN L170 areAnnotationChecker]: L4694-3 has no Hoare annotation [2022-02-20 21:10:52,793 WARN L170 areAnnotationChecker]: L4718-5 has no Hoare annotation [2022-02-20 21:10:52,793 WARN L170 areAnnotationChecker]: L6756-1 has no Hoare annotation [2022-02-20 21:10:52,793 WARN L170 areAnnotationChecker]: L4729-5 has no Hoare annotation [2022-02-20 21:10:52,793 WARN L170 areAnnotationChecker]: L4913-1 has no Hoare annotation [2022-02-20 21:10:52,793 WARN L170 areAnnotationChecker]: L4913-1 has no Hoare annotation [2022-02-20 21:10:52,793 WARN L170 areAnnotationChecker]: L6756-1 has no Hoare annotation [2022-02-20 21:10:52,793 WARN L170 areAnnotationChecker]: L4990-2 has no Hoare annotation [2022-02-20 21:10:52,793 WARN L170 areAnnotationChecker]: L4991-1 has no Hoare annotation [2022-02-20 21:10:52,793 WARN L170 areAnnotationChecker]: L4920-2 has no Hoare annotation [2022-02-20 21:10:52,793 WARN L170 areAnnotationChecker]: L4921-2 has no Hoare annotation [2022-02-20 21:10:52,793 WARN L170 areAnnotationChecker]: L4922-2 has no Hoare annotation [2022-02-20 21:10:52,794 WARN L170 areAnnotationChecker]: L4923-1 has no Hoare annotation [2022-02-20 21:10:52,794 WARN L170 areAnnotationChecker]: L4995-2 has no Hoare annotation [2022-02-20 21:10:52,794 WARN L170 areAnnotationChecker]: L4996-1 has no Hoare annotation [2022-02-20 21:10:52,794 WARN L170 areAnnotationChecker]: L7386-2 has no Hoare annotation [2022-02-20 21:10:52,794 WARN L170 areAnnotationChecker]: L7387-2 has no Hoare annotation [2022-02-20 21:10:52,794 WARN L170 areAnnotationChecker]: L7388-2 has no Hoare annotation [2022-02-20 21:10:52,794 WARN L170 areAnnotationChecker]: L7389-1 has no Hoare annotation [2022-02-20 21:10:52,794 WARN L170 areAnnotationChecker]: L7390-1 has no Hoare annotation [2022-02-20 21:10:52,794 WARN L170 areAnnotationChecker]: L4694-5 has no Hoare annotation [2022-02-20 21:10:52,794 WARN L170 areAnnotationChecker]: aws_linked_list_node_next_is_validFINAL has no Hoare annotation [2022-02-20 21:10:52,794 WARN L170 areAnnotationChecker]: aws_linked_list_node_prev_is_validFINAL has no Hoare annotation [2022-02-20 21:10:52,794 WARN L170 areAnnotationChecker]: L6767-4 has no Hoare annotation [2022-02-20 21:10:52,794 WARN L170 areAnnotationChecker]: L6767-4 has no Hoare annotation [2022-02-20 21:10:52,795 WARN L170 areAnnotationChecker]: L6767-2 has no Hoare annotation [2022-02-20 21:10:52,795 WARN L170 areAnnotationChecker]: L4991-1 has no Hoare annotation [2022-02-20 21:10:52,795 WARN L170 areAnnotationChecker]: L4994-1 has no Hoare annotation [2022-02-20 21:10:52,795 WARN L170 areAnnotationChecker]: L4923-1 has no Hoare annotation [2022-02-20 21:10:52,795 WARN L170 areAnnotationChecker]: aws_linked_list_insert_beforeFINAL has no Hoare annotation [2022-02-20 21:10:52,795 WARN L170 areAnnotationChecker]: L4996-1 has no Hoare annotation [2022-02-20 21:10:52,795 WARN L170 areAnnotationChecker]: L4989 has no Hoare annotation [2022-02-20 21:10:52,795 WARN L170 areAnnotationChecker]: L7389-1 has no Hoare annotation [2022-02-20 21:10:52,795 WARN L170 areAnnotationChecker]: L7390-1 has no Hoare annotation [2022-02-20 21:10:52,795 WARN L170 areAnnotationChecker]: L7374 has no Hoare annotation [2022-02-20 21:10:52,795 WARN L170 areAnnotationChecker]: L4694-6 has no Hoare annotation [2022-02-20 21:10:52,796 WARN L170 areAnnotationChecker]: L4694-6 has no Hoare annotation [2022-02-20 21:10:52,796 WARN L170 areAnnotationChecker]: aws_linked_list_node_next_is_validEXIT has no Hoare annotation [2022-02-20 21:10:52,796 WARN L170 areAnnotationChecker]: aws_linked_list_node_next_is_validEXIT has no Hoare annotation [2022-02-20 21:10:52,796 WARN L170 areAnnotationChecker]: aws_linked_list_node_next_is_validEXIT has no Hoare annotation [2022-02-20 21:10:52,796 WARN L170 areAnnotationChecker]: aws_linked_list_node_prev_is_validEXIT has no Hoare annotation [2022-02-20 21:10:52,796 WARN L170 areAnnotationChecker]: aws_linked_list_node_prev_is_validEXIT has no Hoare annotation [2022-02-20 21:10:52,796 WARN L170 areAnnotationChecker]: aws_linked_list_node_prev_is_validEXIT has no Hoare annotation [2022-02-20 21:10:52,796 WARN L170 areAnnotationChecker]: aws_linked_list_node_prev_is_validEXIT has no Hoare annotation [2022-02-20 21:10:52,796 WARN L170 areAnnotationChecker]: L4920-2 has no Hoare annotation [2022-02-20 21:10:52,796 WARN L170 areAnnotationChecker]: L6767-4 has no Hoare annotation [2022-02-20 21:10:52,796 WARN L170 areAnnotationChecker]: L6767-2 has no Hoare annotation [2022-02-20 21:10:52,796 WARN L170 areAnnotationChecker]: L4994-1 has no Hoare annotation [2022-02-20 21:10:52,796 WARN L170 areAnnotationChecker]: L4921-2 has no Hoare annotation [2022-02-20 21:10:52,797 WARN L170 areAnnotationChecker]: L4922-2 has no Hoare annotation [2022-02-20 21:10:52,797 WARN L170 areAnnotationChecker]: aws_linked_list_insert_beforeEXIT has no Hoare annotation [2022-02-20 21:10:52,797 WARN L170 areAnnotationChecker]: L7387-2 has no Hoare annotation [2022-02-20 21:10:52,797 WARN L170 areAnnotationChecker]: L7388-2 has no Hoare annotation [2022-02-20 21:10:52,797 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 21:10:52,797 WARN L170 areAnnotationChecker]: L4694-8 has no Hoare annotation [2022-02-20 21:10:52,797 WARN L170 areAnnotationChecker]: L4756-1 has no Hoare annotation [2022-02-20 21:10:52,797 WARN L170 areAnnotationChecker]: L4756-1 has no Hoare annotation [2022-02-20 21:10:52,797 WARN L170 areAnnotationChecker]: L6754 has no Hoare annotation [2022-02-20 21:10:52,797 WARN L170 areAnnotationChecker]: L7386-2 has no Hoare annotation [2022-02-20 21:10:52,797 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 21:10:52,797 WARN L170 areAnnotationChecker]: L4694-9 has no Hoare annotation [2022-02-20 21:10:52,798 WARN L170 areAnnotationChecker]: L4694-9 has no Hoare annotation [2022-02-20 21:10:52,798 WARN L170 areAnnotationChecker]: aws_linked_list_is_validFINAL has no Hoare annotation [2022-02-20 21:10:52,798 WARN L170 areAnnotationChecker]: L4750-3 has no Hoare annotation [2022-02-20 21:10:52,798 WARN L170 areAnnotationChecker]: L4750-3 has no Hoare annotation [2022-02-20 21:10:52,798 WARN L170 areAnnotationChecker]: L4751 has no Hoare annotation [2022-02-20 21:10:52,798 WARN L170 areAnnotationChecker]: L4995-2 has no Hoare annotation [2022-02-20 21:10:52,798 WARN L170 areAnnotationChecker]: L4694-11 has no Hoare annotation [2022-02-20 21:10:52,798 WARN L170 areAnnotationChecker]: L4694-11 has no Hoare annotation [2022-02-20 21:10:52,798 WARN L170 areAnnotationChecker]: aws_linked_list_is_validFINAL has no Hoare annotation [2022-02-20 21:10:52,798 WARN L170 areAnnotationChecker]: L4750-3 has no Hoare annotation [2022-02-20 21:10:52,798 WARN L170 areAnnotationChecker]: L4751 has no Hoare annotation [2022-02-20 21:10:52,798 WARN L170 areAnnotationChecker]: L4751 has no Hoare annotation [2022-02-20 21:10:52,799 WARN L170 areAnnotationChecker]: L4990-2 has no Hoare annotation [2022-02-20 21:10:52,799 WARN L170 areAnnotationChecker]: L4734 has no Hoare annotation [2022-02-20 21:10:52,799 WARN L170 areAnnotationChecker]: L4734 has no Hoare annotation [2022-02-20 21:10:52,799 WARN L170 areAnnotationChecker]: aws_linked_list_is_validEXIT has no Hoare annotation [2022-02-20 21:10:52,799 WARN L170 areAnnotationChecker]: aws_linked_list_is_validEXIT has no Hoare annotation [2022-02-20 21:10:52,799 WARN L170 areAnnotationChecker]: aws_linked_list_is_validEXIT has no Hoare annotation [2022-02-20 21:10:52,799 WARN L170 areAnnotationChecker]: L4756-1 has no Hoare annotation [2022-02-20 21:10:52,799 INFO L163 areAnnotationChecker]: CFG has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 21:10:52,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 09:10:52 BoogieIcfgContainer [2022-02-20 21:10:52,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 21:10:52,808 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 21:10:52,808 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 21:10:52,808 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 21:10:52,809 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:10:45" (3/4) ... [2022-02-20 21:10:52,811 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 21:10:52,814 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2022-02-20 21:10:52,814 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure nondet_uint64_t [2022-02-20 21:10:52,814 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2022-02-20 21:10:52,814 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_insert_before [2022-02-20 21:10:52,815 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 21:10:52,815 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 21:10:52,815 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_is_valid [2022-02-20 21:10:52,818 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2022-02-20 21:10:52,819 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 21:10:52,819 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 21:10:52,819 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 21:10:52,836 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((list == 0 && list == list) && list == list) || !(0 < unknown-#StackHeapBarrier-unknown)) || \result == 0 [2022-02-20 21:10:52,854 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 21:10:52,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 21:10:52,855 INFO L158 Benchmark]: Toolchain (without parser) took 9316.39ms. Allocated memory was 119.5MB in the beginning and 237.0MB in the end (delta: 117.4MB). Free memory was 83.6MB in the beginning and 154.6MB in the end (delta: -71.1MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2022-02-20 21:10:52,871 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 119.5MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 21:10:52,871 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1601.74ms. Allocated memory was 119.5MB in the beginning and 146.8MB in the end (delta: 27.3MB). Free memory was 83.6MB in the beginning and 69.6MB in the end (delta: 14.0MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2022-02-20 21:10:52,871 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.45ms. Allocated memory is still 146.8MB. Free memory was 69.6MB in the beginning and 64.3MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 21:10:52,872 INFO L158 Benchmark]: Boogie Preprocessor took 29.96ms. Allocated memory is still 146.8MB. Free memory was 64.3MB in the beginning and 60.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 21:10:52,872 INFO L158 Benchmark]: RCFGBuilder took 611.12ms. Allocated memory is still 146.8MB. Free memory was 60.1MB in the beginning and 79.6MB in the end (delta: -19.5MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-02-20 21:10:52,872 INFO L158 Benchmark]: TraceAbstraction took 6912.81ms. Allocated memory was 146.8MB in the beginning and 237.0MB in the end (delta: 90.2MB). Free memory was 78.5MB in the beginning and 159.9MB in the end (delta: -81.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-02-20 21:10:52,872 INFO L158 Benchmark]: Witness Printer took 46.39ms. Allocated memory is still 237.0MB. Free memory was 159.9MB in the beginning and 154.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 21:10:52,873 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 119.5MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1601.74ms. Allocated memory was 119.5MB in the beginning and 146.8MB in the end (delta: 27.3MB). Free memory was 83.6MB in the beginning and 69.6MB in the end (delta: 14.0MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 102.45ms. Allocated memory is still 146.8MB. Free memory was 69.6MB in the beginning and 64.3MB in the end (delta: 5.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.96ms. Allocated memory is still 146.8MB. Free memory was 64.3MB in the beginning and 60.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 611.12ms. Allocated memory is still 146.8MB. Free memory was 60.1MB in the beginning and 79.6MB in the end (delta: -19.5MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6912.81ms. Allocated memory was 146.8MB in the beginning and 237.0MB in the end (delta: 90.2MB). Free memory was 78.5MB in the beginning and 159.9MB in the end (delta: -81.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Witness Printer took 46.39ms. Allocated memory is still 237.0MB. Free memory was 159.9MB in the beginning and 154.6MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 104 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 320 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 316 mSDsluCounter, 2094 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1692 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 384 IncrementalHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 402 mSDtfsCounter, 384 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=3, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 194 PreInvPairs, 204 NumberOfFragments, 143 HoareAnnotationTreeSize, 194 FomulaSimplifications, 55 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 39 FomulaSimplificationsInter, 91 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 452 NumberOfCodeBlocks, 452 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 446 ConstructedInterpolants, 0 QuantifiedInterpolants, 632 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1333 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 264/282 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4750]: Loop Invariant Derived loop invariant: ((list == 0 && list == list) && list == list) || !(0 < unknown-#StackHeapBarrier-unknown) - InvariantResult [Line: 4731]: Loop Invariant Derived loop invariant: (((list == 0 && list == list) && list == list) || !(0 < unknown-#StackHeapBarrier-unknown)) || \result == 0 - InvariantResult [Line: 7392]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6767]: Loop Invariant Derived loop invariant: (1 < to_add && !(list == 0)) && 0 < unknown-#StackHeapBarrier-unknown RESULT: Ultimate proved your program to be correct! [2022-02-20 21:10:52,900 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 Writing output log to file Ultimate.log Result: TRUE