./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.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/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.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 0b6cec80466d26e7f9fcd66257be2e9ddc0be03c06ed1a001e454a4fe37aa1e9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:01:15,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:01:15,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:01:15,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:01:15,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:01:15,420 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:01:15,421 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:01:15,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:01:15,424 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:01:15,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:01:15,428 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:01:15,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:01:15,429 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:01:15,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:01:15,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:01:15,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:01:15,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:01:15,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:01:15,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:01:15,441 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:01:15,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:01:15,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:01:15,444 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:01:15,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:01:15,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:01:15,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:01:15,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:01:15,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:01:15,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:01:15,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:01:15,451 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:01:15,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:01:15,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:01:15,454 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:01:15,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:01:15,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:01:15,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:01:15,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:01:15,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:01:15,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:01:15,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:01:15,458 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 22:01:15,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:01:15,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:01:15,484 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:01:15,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:01:15,485 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:01:15,486 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:01:15,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:01:15,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:01:15,486 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:01:15,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:01:15,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:01:15,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:01:15,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:01:15,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:01:15,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:01:15,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:01:15,488 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:01:15,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:01:15,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:01:15,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:01:15,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:01:15,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:01:15,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:01:15,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:01:15,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:01:15,490 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:01:15,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:01:15,490 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:01:15,490 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:01:15,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:01:15,490 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 -> 0b6cec80466d26e7f9fcd66257be2e9ddc0be03c06ed1a001e454a4fe37aa1e9 [2022-02-20 22:01:15,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:01:15,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:01:15,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:01:15,678 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:01:15,678 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:01:15,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i [2022-02-20 22:01:15,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8cd2d489/db6e1f31e5574bc28d48e011ecffba1a/FLAG7a1612797 [2022-02-20 22:01:16,247 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:01:16,247 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i [2022-02-20 22:01:16,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8cd2d489/db6e1f31e5574bc28d48e011ecffba1a/FLAG7a1612797 [2022-02-20 22:01:16,696 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8cd2d489/db6e1f31e5574bc28d48e011ecffba1a [2022-02-20 22:01:16,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:01:16,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:01:16,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:01:16,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:01:16,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:01:16,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:01:16" (1/1) ... [2022-02-20 22:01:16,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf9b0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:01:16, skipping insertion in model container [2022-02-20 22:01:16,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:01:16" (1/1) ... [2022-02-20 22:01:16,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:01:16,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:01:16,987 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [2715] [2022-02-20 22:01:16,987 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [2716-2717] [2022-02-20 22:01:17,051 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/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i[78841,78854] [2022-02-20 22:01:17,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:01:17,469 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:01:17,574 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [2715] [2022-02-20 22:01:17,575 WARN L1246 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [2716-2717] [2022-02-20 22:01:17,581 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/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i[78841,78854] [2022-02-20 22:01:17,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:01:17,742 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:01:17,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:01:17 WrapperNode [2022-02-20 22:01:17,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:01:17,743 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:01:17,743 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:01:17,743 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:01:17,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:01:17" (1/1) ... [2022-02-20 22:01:17,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:01:17" (1/1) ... [2022-02-20 22:01:17,922 INFO L137 Inliner]: procedures = 143, calls = 649, calls flagged for inlining = 56, calls inlined = 52, statements flattened = 1896 [2022-02-20 22:01:17,923 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:01:17,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:01:17,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:01:17,924 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:01:17,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:01:17" (1/1) ... [2022-02-20 22:01:17,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:01:17" (1/1) ... [2022-02-20 22:01:17,941 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:01:17" (1/1) ... [2022-02-20 22:01:17,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:01:17" (1/1) ... [2022-02-20 22:01:18,000 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:01:17" (1/1) ... [2022-02-20 22:01:18,007 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:01:17" (1/1) ... [2022-02-20 22:01:18,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:01:17" (1/1) ... [2022-02-20 22:01:18,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:01:18,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:01:18,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:01:18,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:01:18,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:01:17" (1/1) ... [2022-02-20 22:01:18,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:01:18,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:01:18,069 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 22:01:18,076 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 22:01:18,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 22:01:18,102 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-02-20 22:01:18,102 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-02-20 22:01:18,102 INFO L130 BoogieDeclarations]: Found specification of procedure devm_request_threaded_irq [2022-02-20 22:01:18,102 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_request_threaded_irq [2022-02-20 22:01:18,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 22:01:18,102 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_skb [2022-02-20 22:01:18,103 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_skb [2022-02-20 22:01:18,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 22:01:18,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:01:18,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:01:18,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:01:18,103 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-02-20 22:01:18,103 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-02-20 22:01:18,103 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_get_clientdata [2022-02-20 22:01:18,103 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_get_clientdata [2022-02-20 22:01:18,104 INFO L130 BoogieDeclarations]: Found specification of procedure reg_check_1 [2022-02-20 22:01:18,104 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_check_1 [2022-02-20 22:01:18,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:01:18,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:01:18,104 INFO L130 BoogieDeclarations]: Found specification of procedure skb_trim [2022-02-20 22:01:18,104 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_trim [2022-02-20 22:01:18,104 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-02-20 22:01:18,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-02-20 22:01:18,104 INFO L130 BoogieDeclarations]: Found specification of procedure print_hex_dump [2022-02-20 22:01:18,105 INFO L138 BoogieDeclarations]: Found implementation of procedure print_hex_dump [2022-02-20 22:01:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure usleep_range [2022-02-20 22:01:18,105 INFO L138 BoogieDeclarations]: Found implementation of procedure usleep_range [2022-02-20 22:01:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure devm_gpio_request [2022-02-20 22:01:18,105 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_gpio_request [2022-02-20 22:01:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:01:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-02-20 22:01:18,105 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-02-20 22:01:18,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:01:18,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:01:18,106 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-02-20 22:01:18,106 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-02-20 22:01:18,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 22:01:18,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 22:01:18,106 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_set_value [2022-02-20 22:01:18,107 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_set_value [2022-02-20 22:01:18,107 INFO L130 BoogieDeclarations]: Found specification of procedure activate_suitable_irq_1 [2022-02-20 22:01:18,107 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_suitable_irq_1 [2022-02-20 22:01:18,107 INFO L130 BoogieDeclarations]: Found specification of procedure st21nfca_hci_irq_thread_fn [2022-02-20 22:01:18,107 INFO L138 BoogieDeclarations]: Found implementation of procedure st21nfca_hci_irq_thread_fn [2022-02-20 22:01:18,107 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:01:18,107 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:01:18,108 INFO L130 BoogieDeclarations]: Found specification of procedure gpio_to_desc [2022-02-20 22:01:18,108 INFO L138 BoogieDeclarations]: Found implementation of procedure gpio_to_desc [2022-02-20 22:01:18,108 INFO L130 BoogieDeclarations]: Found specification of procedure nfc_hci_recv_frame [2022-02-20 22:01:18,108 INFO L138 BoogieDeclarations]: Found implementation of procedure nfc_hci_recv_frame [2022-02-20 22:01:18,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:01:18,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:01:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:01:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:01:18,109 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_master_send [2022-02-20 22:01:18,110 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_master_send [2022-02-20 22:01:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2022-02-20 22:01:18,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2022-02-20 22:01:18,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_2 [2022-02-20 22:01:18,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_2 [2022-02-20 22:01:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure crc_ccitt [2022-02-20 22:01:18,111 INFO L138 BoogieDeclarations]: Found implementation of procedure crc_ccitt [2022-02-20 22:01:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:01:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:01:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:01:18,111 INFO L130 BoogieDeclarations]: Found specification of procedure st21nfca_hci_i2c_disable [2022-02-20 22:01:18,112 INFO L138 BoogieDeclarations]: Found implementation of procedure st21nfca_hci_i2c_disable [2022-02-20 22:01:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-02-20 22:01:18,112 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-02-20 22:01:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure i2c_master_recv [2022-02-20 22:01:18,112 INFO L138 BoogieDeclarations]: Found implementation of procedure i2c_master_recv [2022-02-20 22:01:18,112 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-02-20 22:01:18,113 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-02-20 22:01:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:01:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 22:01:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 22:01:18,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 22:01:18,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:01:18,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:01:18,514 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:01:18,515 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:01:18,732 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:01:20,753 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:01:20,775 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:01:20,775 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:01:20,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:01:20 BoogieIcfgContainer [2022-02-20 22:01:20,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:01:20,780 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:01:20,780 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:01:20,782 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:01:20,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:01:16" (1/3) ... [2022-02-20 22:01:20,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe9c253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:01:20, skipping insertion in model container [2022-02-20 22:01:20,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:01:17" (2/3) ... [2022-02-20 22:01:20,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fe9c253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:01:20, skipping insertion in model container [2022-02-20 22:01:20,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:01:20" (3/3) ... [2022-02-20 22:01:20,785 INFO L111 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--nfc--st21nfca--st21nfca_i2c.ko-entry_point.cil.out.i [2022-02-20 22:01:20,789 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:01:20,789 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:01:20,822 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:01:20,827 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 22:01:20,827 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:01:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 523 states, 393 states have (on average 1.3740458015267176) internal successors, (540), 405 states have internal predecessors, (540), 97 states have call successors, (97), 32 states have call predecessors, (97), 31 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) [2022-02-20 22:01:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 22:01:20,883 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:01:20,884 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:20,884 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:01:20,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:01:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1147093237, now seen corresponding path program 1 times [2022-02-20 22:01:20,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:01:20,895 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067615797] [2022-02-20 22:01:20,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:01:20,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:01:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:21,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:01:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:21,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {554#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {526#true} is VALID [2022-02-20 22:01:21,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {526#true} is VALID [2022-02-20 22:01:21,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 22:01:21,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {528#(= ~ldv_irq_2_0~0 0)} #1284#return; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:01:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:21,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {554#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {526#true} is VALID [2022-02-20 22:01:21,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {526#true} is VALID [2022-02-20 22:01:21,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 22:01:21,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {528#(= ~ldv_irq_2_0~0 0)} #1286#return; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:01:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:21,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {554#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {526#true} is VALID [2022-02-20 22:01:21,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {526#true} is VALID [2022-02-20 22:01:21,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 22:01:21,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {528#(= ~ldv_irq_2_0~0 0)} #1288#return; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 22:01:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:21,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {554#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {526#true} is VALID [2022-02-20 22:01:21,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {526#true} is VALID [2022-02-20 22:01:21,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 22:01:21,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {528#(= ~ldv_irq_2_0~0 0)} #1290#return; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 22:01:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:21,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {554#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {526#true} is VALID [2022-02-20 22:01:21,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {526#true} is VALID [2022-02-20 22:01:21,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 22:01:21,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {528#(= ~ldv_irq_2_0~0 0)} #1292#return; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:01:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:21,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {526#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {526#true} is VALID [2022-02-20 22:01:21,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 22:01:21,469 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {526#true} {527#false} #1238#return; {527#false} is VALID [2022-02-20 22:01:21,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {526#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(108, 2);call #Ultimate.allocInit(17, 3);call #Ultimate.allocInit(13, 4);call #Ultimate.allocInit(23, 5);call #Ultimate.allocInit(216, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(115, 7, 1, 1);call write~init~int(58, 7, 2, 1);call write~init~int(10, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(23, 9);call #Ultimate.allocInit(2, 10);call write~init~int(15, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(6, 11);call write~init~int(105, 11, 0, 1);call write~init~int(50, 11, 1, 1);call write~init~int(99, 11, 2, 1);call write~init~int(58, 11, 3, 1);call write~init~int(32, 11, 4, 1);call write~init~int(0, 11, 5, 1);call #Ultimate.allocInit(58, 12);call #Ultimate.allocInit(58, 13);call #Ultimate.allocInit(10, 14);call #Ultimate.allocInit(2, 15);call write~init~int(15, 15, 0, 1);call write~init~int(0, 15, 1, 1);call #Ultimate.allocInit(6, 16);call write~init~int(99, 16, 0, 1);call write~init~int(114, 16, 1, 1);call write~init~int(99, 16, 2, 1);call write~init~int(58, 16, 3, 1);call write~init~int(32, 16, 4, 1);call write~init~int(0, 16, 5, 1);call #Ultimate.allocInit(216, 17);call #Ultimate.allocInit(13, 18);call #Ultimate.allocInit(27, 19);call #Ultimate.allocInit(216, 20);call #Ultimate.allocInit(5, 21);call write~init~int(73, 21, 0, 1);call write~init~int(82, 21, 1, 1);call write~init~int(81, 21, 2, 1);call write~init~int(10, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(5, 22);call write~init~int(73, 22, 0, 1);call write~init~int(82, 22, 1, 1);call write~init~int(81, 22, 2, 1);call write~init~int(10, 22, 3, 1);call write~init~int(0, 22, 4, 1);call #Ultimate.allocInit(23, 23);call #Ultimate.allocInit(8, 24);call #Ultimate.allocInit(41, 25);call #Ultimate.allocInit(216, 26);call #Ultimate.allocInit(49, 27);call #Ultimate.allocInit(216, 28);call #Ultimate.allocInit(11, 29);call #Ultimate.allocInit(45, 30);call #Ultimate.allocInit(216, 31);call #Ultimate.allocInit(54, 32);call #Ultimate.allocInit(216, 33);call #Ultimate.allocInit(52, 34);call #Ultimate.allocInit(13, 35);call #Ultimate.allocInit(23, 36);call #Ultimate.allocInit(216, 37);call #Ultimate.allocInit(4, 38);call write~init~int(37, 38, 0, 1);call write~init~int(115, 38, 1, 1);call write~init~int(10, 38, 2, 1);call write~init~int(0, 38, 3, 1);call #Ultimate.allocInit(4, 39);call write~init~int(37, 39, 0, 1);call write~init~int(115, 39, 1, 1);call write~init~int(10, 39, 2, 1);call write~init~int(0, 39, 3, 1);call #Ultimate.allocInit(23, 40);call #Ultimate.allocInit(13, 41);call #Ultimate.allocInit(23, 42);call #Ultimate.allocInit(216, 43);call #Ultimate.allocInit(9, 44);call #Ultimate.allocInit(9, 45);call #Ultimate.allocInit(24, 46);call #Ultimate.allocInit(51, 47);call #Ultimate.allocInit(15, 48);call #Ultimate.allocInit(23, 49);call #Ultimate.allocInit(36, 50);call #Ultimate.allocInit(48, 51);call #Ultimate.allocInit(32, 52);call #Ultimate.allocInit(13, 53);call #Ultimate.allocInit(37, 54);call #Ultimate.allocInit(6, 55);call write~init~int(115, 55, 0, 1);call write~init~int(104, 55, 1, 1);call write~init~int(100, 55, 2, 1);call write~init~int(108, 55, 3, 1);call write~init~int(99, 55, 4, 1);call write~init~int(0, 55, 5, 1);call #Ultimate.allocInit(13, 56);call #Ultimate.allocInit(24, 57);call #Ultimate.allocInit(216, 58);call #Ultimate.allocInit(4, 59);call write~init~int(37, 59, 0, 1);call write~init~int(115, 59, 1, 1);call write~init~int(10, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(4, 60);call write~init~int(37, 60, 0, 1);call write~init~int(115, 60, 1, 1);call write~init~int(10, 60, 2, 1);call write~init~int(0, 60, 3, 1);call #Ultimate.allocInit(24, 61);call #Ultimate.allocInit(17, 62);~ldv_irq_data_2_1~0.base, ~ldv_irq_data_2_1~0.offset := 0, 0;~ldv_irq_dev_1_1~0.base, ~ldv_irq_dev_1_1~0.offset := 0, 0;~ldv_irq_1_3~0 := 0;~ldv_irq_line_2_2~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_0~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_irq_line_2_1~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_2_0~0 := 0;~ldv_irq_dev_1_3~0.base, ~ldv_irq_dev_1_3~0.offset := 0, 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ldv_irq_dev_1_0~0.base, ~ldv_irq_dev_1_0~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_irq_data_2_0~0.base, ~ldv_irq_data_2_0~0.offset := 0, 0;~ldv_irq_dev_2_3~0.base, ~ldv_irq_dev_2_3~0.offset := 0, 0;~ldv_irq_dev_2_0~0.base, ~ldv_irq_dev_2_0~0.offset := 0, 0;~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_1~0 := 0;~ldv_irq_2_3~0 := 0;~st21nfca_hci_i2c_driver_group0~0.base, ~st21nfca_hci_i2c_driver_group0~0.offset := 0, 0;~ldv_irq_data_2_3~0.base, ~ldv_irq_data_2_3~0.offset := 0, 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_2_2~0 := 0;~ldv_irq_dev_1_2~0.base, ~ldv_irq_dev_1_2~0.offset := 0, 0;~ldv_irq_line_2_0~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_irq_dev_2_1~0.base, ~ldv_irq_dev_2_1~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_data_2_2~0.base, ~ldv_irq_data_2_2~0.offset := 0, 0;~ldv_irq_line_1_1~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~ldv_state_variable_4~0 := 0;~ldv_irq_dev_2_2~0.base, ~ldv_irq_dev_2_2~0.offset := 0, 0;~ldv_irq_line_2_3~0 := 0;~ldv_irq_2_1~0 := 0;~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset := 63, 0;call #Ultimate.allocInit(56, 63);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#st21nfca_hci_i2c_id_table~0.base);call write~unchecked~int(115, ~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(116, ~#st21nfca_hci_i2c_id_table~0.base, 1 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(50, ~#st21nfca_hci_i2c_id_table~0.base, 2 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(49, ~#st21nfca_hci_i2c_id_table~0.base, 3 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(110, ~#st21nfca_hci_i2c_id_table~0.base, 4 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(102, ~#st21nfca_hci_i2c_id_table~0.base, 5 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(99, ~#st21nfca_hci_i2c_id_table~0.base, 6 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(97, ~#st21nfca_hci_i2c_id_table~0.base, 7 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(95, ~#st21nfca_hci_i2c_id_table~0.base, 8 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(104, ~#st21nfca_hci_i2c_id_table~0.base, 9 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(99, ~#st21nfca_hci_i2c_id_table~0.base, 10 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(105, ~#st21nfca_hci_i2c_id_table~0.base, 11 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(0, ~#st21nfca_hci_i2c_id_table~0.base, 12 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(0, ~#st21nfca_hci_i2c_id_table~0.base, 20 + ~#st21nfca_hci_i2c_id_table~0.offset, 8);~__mod_i2c__st21nfca_hci_i2c_id_table_device_table~0.name := ~const~array~~LB~int~RB~int();~__mod_i2c__st21nfca_hci_i2c_id_table_device_table~0.driver_data := 0;~#len_seq~0.base, ~#len_seq~0.offset := 64, 0;call #Ultimate.allocInit(4, 64);call write~init~int(13, ~#len_seq~0.base, ~#len_seq~0.offset, 1);call write~init~int(24, ~#len_seq~0.base, 1 + ~#len_seq~0.offset, 1);call write~init~int(15, ~#len_seq~0.base, 2 + ~#len_seq~0.offset, 1);call write~init~int(29, ~#len_seq~0.base, 3 + ~#len_seq~0.offset, 1);~#wait_tab~0.base, ~#wait_tab~0.offset := 65, 0;call #Ultimate.allocInit(12, 65);call write~init~int(2, ~#wait_tab~0.base, ~#wait_tab~0.offset, 2);call write~init~int(3, ~#wait_tab~0.base, 2 + ~#wait_tab~0.offset, 2);call write~init~int(5, ~#wait_tab~0.base, 4 + ~#wait_tab~0.offset, 2);call write~init~int(15, ~#wait_tab~0.base, 6 + ~#wait_tab~0.offset, 2);call write~init~int(20, ~#wait_tab~0.base, 8 + ~#wait_tab~0.offset, 2);call write~init~int(40, ~#wait_tab~0.base, 10 + ~#wait_tab~0.offset, 2);~#i2c_phy_ops~0.base, ~#i2c_phy_ops~0.offset := 66, 0;call #Ultimate.allocInit(24, 66);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_write.base, #funAddr~st21nfca_hci_i2c_write.offset, ~#i2c_phy_ops~0.base, ~#i2c_phy_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_enable.base, #funAddr~st21nfca_hci_i2c_enable.offset, ~#i2c_phy_ops~0.base, 8 + ~#i2c_phy_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_disable.base, #funAddr~st21nfca_hci_i2c_disable.offset, ~#i2c_phy_ops~0.base, 16 + ~#i2c_phy_ops~0.offset, 8);~#st21nfca_hci_i2c_driver~0.base, ~#st21nfca_hci_i2c_driver~0.offset := 67, 0;call #Ultimate.allocInit(221, 67);call write~init~int(0, ~#st21nfca_hci_i2c_driver~0.base, ~#st21nfca_hci_i2c_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 4 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_probe.base, #funAddr~st21nfca_hci_i2c_probe.offset, ~#st21nfca_hci_i2c_driver~0.base, 12 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_remove.base, #funAddr~st21nfca_hci_i2c_remove.offset, ~#st21nfca_hci_i2c_driver~0.base, 20 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 28 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 36 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 44 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 52 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 60 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(62, 0, ~#st21nfca_hci_i2c_driver~0.base, 68 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 76 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#st21nfca_hci_i2c_driver~0.base, 84 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 92 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~int(0, ~#st21nfca_hci_i2c_driver~0.base, 100 + ~#st21nfca_hci_i2c_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 101 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 109 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 117 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 125 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 133 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 141 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 149 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 157 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 165 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 173 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset, ~#st21nfca_hci_i2c_driver~0.base, 181 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 189 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 197 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 205 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 213 + ~#st21nfca_hci_i2c_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_spin~0 := 0; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret333#1.base, main_#t~ret333#1.offset, main_#t~ret334#1.base, main_#t~ret334#1.offset, main_#t~ret335#1.base, main_#t~ret335#1.offset, main_#t~ret336#1.base, main_#t~ret336#1.offset, main_#t~ret337#1.base, main_#t~ret337#1.offset, main_#t~nondet338#1, main_#t~switch339#1, main_#t~nondet340#1, main_#t~switch341#1, main_#t~ret342#1, main_#t~ret343#1, main_#t~nondet344#1, main_#t~switch345#1, main_#t~ret346#1, main_#t~nondet347#1, main_#t~switch348#1, main_#t~ret349#1, main_#t~ret350#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~26#1.base, main_~tmp~26#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~26#1.base, main_~tmp~26#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,472 INFO L272 TraceCheckUtils]: 2: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} call main_#t~ret333#1.base, main_#t~ret333#1.offset := ldv_zalloc(1); {554#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:21,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {554#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {526#true} is VALID [2022-02-20 22:01:21,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {526#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {526#true} is VALID [2022-02-20 22:01:21,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 22:01:21,473 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {526#true} {528#(= ~ldv_irq_2_0~0 0)} #1284#return; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} main_~tmp~26#1.base, main_~tmp~26#1.offset := main_#t~ret333#1.base, main_#t~ret333#1.offset;havoc main_#t~ret333#1.base, main_#t~ret333#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~26#1.base, main_~tmp~26#1.offset; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,474 INFO L272 TraceCheckUtils]: 8: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} call main_#t~ret334#1.base, main_#t~ret334#1.offset := ldv_zalloc(1); {554#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:21,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {526#true} is VALID [2022-02-20 22:01:21,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {526#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {526#true} is VALID [2022-02-20 22:01:21,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 22:01:21,476 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {526#true} {528#(= ~ldv_irq_2_0~0 0)} #1286#return; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset := main_#t~ret334#1.base, main_#t~ret334#1.offset;havoc main_#t~ret334#1.base, main_#t~ret334#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,477 INFO L272 TraceCheckUtils]: 14: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} call main_#t~ret335#1.base, main_#t~ret335#1.offset := ldv_zalloc(1); {554#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:21,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {554#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {526#true} is VALID [2022-02-20 22:01:21,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {526#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {526#true} is VALID [2022-02-20 22:01:21,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 22:01:21,478 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {526#true} {528#(= ~ldv_irq_2_0~0 0)} #1288#return; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset := main_#t~ret335#1.base, main_#t~ret335#1.offset;havoc main_#t~ret335#1.base, main_#t~ret335#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,479 INFO L272 TraceCheckUtils]: 20: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} call main_#t~ret336#1.base, main_#t~ret336#1.offset := ldv_zalloc(232); {554#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:21,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {554#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {526#true} is VALID [2022-02-20 22:01:21,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {526#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {526#true} is VALID [2022-02-20 22:01:21,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 22:01:21,481 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {526#true} {528#(= ~ldv_irq_2_0~0 0)} #1290#return; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset := main_#t~ret336#1.base, main_#t~ret336#1.offset;havoc main_#t~ret336#1.base, main_#t~ret336#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,482 INFO L272 TraceCheckUtils]: 26: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} call main_#t~ret337#1.base, main_#t~ret337#1.offset := ldv_zalloc(32); {554#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:21,482 INFO L290 TraceCheckUtils]: 27: Hoare triple {554#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {526#true} is VALID [2022-02-20 22:01:21,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {526#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {526#true} is VALID [2022-02-20 22:01:21,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 22:01:21,483 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {526#true} {528#(= ~ldv_irq_2_0~0 0)} #1292#return; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset := main_#t~ret337#1.base, main_#t~ret337#1.offset;havoc main_#t~ret337#1.base, main_#t~ret337#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset;assume { :begin_inline_ldv_initialize } true; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_4~0 := 0;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 1; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} assume -2147483648 <= main_#t~nondet338#1 && main_#t~nondet338#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet338#1;havoc main_#t~nondet338#1;main_#t~switch339#1 := 0 == main_~tmp___4~0#1; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,485 INFO L290 TraceCheckUtils]: 34: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} assume !main_#t~switch339#1;main_#t~switch339#1 := main_#t~switch339#1 || 1 == main_~tmp___4~0#1; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,485 INFO L290 TraceCheckUtils]: 35: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} assume !main_#t~switch339#1;main_#t~switch339#1 := main_#t~switch339#1 || 2 == main_~tmp___4~0#1; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} assume !main_#t~switch339#1;main_#t~switch339#1 := main_#t~switch339#1 || 3 == main_~tmp___4~0#1; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,486 INFO L290 TraceCheckUtils]: 37: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} assume !main_#t~switch339#1;main_#t~switch339#1 := main_#t~switch339#1 || 4 == main_~tmp___4~0#1; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,486 INFO L290 TraceCheckUtils]: 38: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} assume main_#t~switch339#1; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,487 INFO L290 TraceCheckUtils]: 39: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} assume 0 != ~ldv_state_variable_2~0;assume { :begin_inline_choose_interrupt_2 } true;havoc choose_interrupt_2_#t~nondet312#1, choose_interrupt_2_#t~switch313#1, choose_interrupt_2_#t~ret314#1, choose_interrupt_2_#t~ret315#1, choose_interrupt_2_#t~ret316#1, choose_interrupt_2_#t~ret317#1, choose_interrupt_2_~tmp~21#1;havoc choose_interrupt_2_~tmp~21#1;assume -2147483648 <= choose_interrupt_2_#t~nondet312#1 && choose_interrupt_2_#t~nondet312#1 <= 2147483647;choose_interrupt_2_~tmp~21#1 := choose_interrupt_2_#t~nondet312#1;havoc choose_interrupt_2_#t~nondet312#1;choose_interrupt_2_#t~switch313#1 := 0 == choose_interrupt_2_~tmp~21#1; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} assume choose_interrupt_2_#t~switch313#1; {528#(= ~ldv_irq_2_0~0 0)} is VALID [2022-02-20 22:01:21,488 INFO L272 TraceCheckUtils]: 41: Hoare triple {528#(= ~ldv_irq_2_0~0 0)} call choose_interrupt_2_#t~ret314#1 := ldv_irq_2(~ldv_irq_2_0~0, ~ldv_irq_line_2_0~0, ~ldv_irq_data_2_0~0.base, ~ldv_irq_data_2_0~0.offset); {549#(= |ldv_irq_2_#in~state#1| 0)} is VALID [2022-02-20 22:01:21,488 INFO L290 TraceCheckUtils]: 42: Hoare triple {549#(= |ldv_irq_2_#in~state#1| 0)} ~state#1 := #in~state#1;~line#1 := #in~line#1;~data#1.base, ~data#1.offset := #in~data#1.base, #in~data#1.offset;havoc ~irq_retval~1#1;havoc ~tmp~23#1;havoc ~tmp___0~12#1; {550#(= |ldv_irq_2_~state#1| 0)} is VALID [2022-02-20 22:01:21,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {550#(= |ldv_irq_2_~state#1| 0)} assume 0 != ~state#1;assume -2147483648 <= #t~nondet322#1 && #t~nondet322#1 <= 2147483647;~tmp~23#1 := #t~nondet322#1;havoc #t~nondet322#1;#t~switch323#1 := 0 == ~tmp~23#1; {527#false} is VALID [2022-02-20 22:01:21,489 INFO L290 TraceCheckUtils]: 44: Hoare triple {527#false} assume !#t~switch323#1;#t~switch323#1 := #t~switch323#1 || 1 == ~tmp~23#1; {527#false} is VALID [2022-02-20 22:01:21,489 INFO L290 TraceCheckUtils]: 45: Hoare triple {527#false} assume #t~switch323#1; {527#false} is VALID [2022-02-20 22:01:21,489 INFO L290 TraceCheckUtils]: 46: Hoare triple {527#false} assume 2 == ~state#1; {527#false} is VALID [2022-02-20 22:01:21,490 INFO L272 TraceCheckUtils]: 47: Hoare triple {527#false} call #t~ret325#1 := st21nfca_hci_irq_thread_fn(~line#1, ~data#1.base, ~data#1.offset); {527#false} is VALID [2022-02-20 22:01:21,490 INFO L290 TraceCheckUtils]: 48: Hoare triple {527#false} ~irq#1 := #in~irq#1;~phy_id#1.base, ~phy_id#1.offset := #in~phy_id#1.base, #in~phy_id#1.offset;havoc ~phy~3#1.base, ~phy~3#1.offset;havoc ~client~2#1.base, ~client~2#1.offset;havoc ~r~4#1;havoc ~__warned~0#1;havoc ~__ret_warn_once~0#1;havoc ~__ret_warn_on~0#1;havoc ~tmp~16#1;havoc ~tmp___0~8#1;havoc ~tmp___1~3#1;call ~#descriptor~1#1.base, ~#descriptor~1#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp___2~2#1;~phy~3#1.base, ~phy~3#1.offset := ~phy_id#1.base, ~phy_id#1.offset;#t~short225#1 := 0 == (~phy~3#1.base + ~phy~3#1.offset) % 18446744073709551616; {527#false} is VALID [2022-02-20 22:01:21,490 INFO L290 TraceCheckUtils]: 49: Hoare triple {527#false} assume #t~short225#1; {527#false} is VALID [2022-02-20 22:01:21,490 INFO L290 TraceCheckUtils]: 50: Hoare triple {527#false} assume !#t~short225#1;havoc #t~mem223#1.base, #t~mem223#1.offset;havoc #t~mem224#1;havoc #t~short225#1;call #t~mem230#1.base, #t~mem230#1.offset := read~$Pointer$(~phy~3#1.base, ~phy~3#1.offset, 8);~client~2#1.base, ~client~2#1.offset := #t~mem230#1.base, #t~mem230#1.offset;havoc #t~mem230#1.base, #t~mem230#1.offset;call write~$Pointer$(18, 0, ~#descriptor~1#1.base, ~#descriptor~1#1.offset, 8);call write~$Pointer$(19, 0, ~#descriptor~1#1.base, 8 + ~#descriptor~1#1.offset, 8);call write~$Pointer$(20, 0, ~#descriptor~1#1.base, 16 + ~#descriptor~1#1.offset, 8);call write~$Pointer$(21, 0, ~#descriptor~1#1.base, 24 + ~#descriptor~1#1.offset, 8);call write~int(526, ~#descriptor~1#1.base, 32 + ~#descriptor~1#1.offset, 4);call write~int(0, ~#descriptor~1#1.base, 36 + ~#descriptor~1#1.offset, 1);call #t~mem231#1 := read~int(~#descriptor~1#1.base, 36 + ~#descriptor~1#1.offset, 1); {527#false} is VALID [2022-02-20 22:01:21,490 INFO L272 TraceCheckUtils]: 51: Hoare triple {527#false} call #t~ret232#1 := ldv__builtin_expect(#t~mem231#1 % 256, 0); {526#true} is VALID [2022-02-20 22:01:21,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {526#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {526#true} is VALID [2022-02-20 22:01:21,491 INFO L290 TraceCheckUtils]: 53: Hoare triple {526#true} assume true; {526#true} is VALID [2022-02-20 22:01:21,491 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {526#true} {527#false} #1238#return; {527#false} is VALID [2022-02-20 22:01:21,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {527#false} assume -9223372036854775808 <= #t~ret232#1 && #t~ret232#1 <= 9223372036854775807;~tmp___2~2#1 := #t~ret232#1;havoc #t~mem231#1;havoc #t~ret232#1; {527#false} is VALID [2022-02-20 22:01:21,491 INFO L290 TraceCheckUtils]: 56: Hoare triple {527#false} assume 0 != ~tmp___2~2#1;havoc #t~nondet233#1; {527#false} is VALID [2022-02-20 22:01:21,491 INFO L290 TraceCheckUtils]: 57: Hoare triple {527#false} call #t~mem234#1 := read~int(~phy~3#1.base, 52 + ~phy~3#1.offset, 4); {527#false} is VALID [2022-02-20 22:01:21,492 INFO L290 TraceCheckUtils]: 58: Hoare triple {527#false} assume !(0 != #t~mem234#1);havoc #t~mem234#1;call #t~mem235#1.base, #t~mem235#1.offset := read~$Pointer$(~phy~3#1.base, 28 + ~phy~3#1.offset, 8);assume { :begin_inline_st21nfca_hci_i2c_read } true;st21nfca_hci_i2c_read_#in~phy#1.base, st21nfca_hci_i2c_read_#in~phy#1.offset, st21nfca_hci_i2c_read_#in~skb#1.base, st21nfca_hci_i2c_read_#in~skb#1.offset := ~phy~3#1.base, ~phy~3#1.offset, #t~mem235#1.base, #t~mem235#1.offset;havoc st21nfca_hci_i2c_read_#res#1;havoc st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset, st21nfca_hci_i2c_read_#t~mem203#1, st21nfca_hci_i2c_read_#t~mem204#1, st21nfca_hci_i2c_read_#t~mem205#1, st21nfca_hci_i2c_read_#t~ret206#1, st21nfca_hci_i2c_read_#t~mem207#1, st21nfca_hci_i2c_read_#t~mem208#1, st21nfca_hci_i2c_read_#t~mem209#1, st21nfca_hci_i2c_read_#t~short210#1, st21nfca_hci_i2c_read_#t~mem211#1, st21nfca_hci_i2c_read_#t~mem212#1, st21nfca_hci_i2c_read_#t~mem213#1, st21nfca_hci_i2c_read_#t~short214#1, st21nfca_hci_i2c_read_#t~short215#1, st21nfca_hci_i2c_read_#t~ret216#1.base, st21nfca_hci_i2c_read_#t~ret216#1.offset, st21nfca_hci_i2c_read_#t~memcpy~res217#1.base, st21nfca_hci_i2c_read_#t~memcpy~res217#1.offset, st21nfca_hci_i2c_read_#t~mem219#1.base, st21nfca_hci_i2c_read_#t~mem219#1.offset, st21nfca_hci_i2c_read_#t~mem218#1, st21nfca_hci_i2c_read_#t~mem220#1, st21nfca_hci_i2c_read_#t~ret221#1, st21nfca_hci_i2c_read_#t~mem222#1, st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset, st21nfca_hci_i2c_read_~skb#1.base, st21nfca_hci_i2c_read_~skb#1.offset, st21nfca_hci_i2c_read_~r~3#1, st21nfca_hci_i2c_read_~i~3#1, st21nfca_hci_i2c_read_~len~1#1, st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset, st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset, st21nfca_hci_i2c_read_~__len~0#1, st21nfca_hci_i2c_read_~__ret~0#1.base, st21nfca_hci_i2c_read_~__ret~0#1.offset, st21nfca_hci_i2c_read_~tmp___0~7#1.base, st21nfca_hci_i2c_read_~tmp___0~7#1.offset, st21nfca_hci_i2c_read_~tmp___1~2#1;st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset := st21nfca_hci_i2c_read_#in~phy#1.base, st21nfca_hci_i2c_read_#in~phy#1.offset;st21nfca_hci_i2c_read_~skb#1.base, st21nfca_hci_i2c_read_~skb#1.offset := st21nfca_hci_i2c_read_#in~skb#1.base, st21nfca_hci_i2c_read_#in~skb#1.offset;havoc st21nfca_hci_i2c_read_~r~3#1;havoc st21nfca_hci_i2c_read_~i~3#1;havoc st21nfca_hci_i2c_read_~len~1#1;call st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset := #Ultimate.allocOnStack(29);havoc st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset;havoc st21nfca_hci_i2c_read_~__len~0#1;havoc st21nfca_hci_i2c_read_~__ret~0#1.base, st21nfca_hci_i2c_read_~__ret~0#1.offset;havoc st21nfca_hci_i2c_read_~tmp___0~7#1.base, st21nfca_hci_i2c_read_~tmp___0~7#1.offset;havoc st21nfca_hci_i2c_read_~tmp___1~2#1;call st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset := read~$Pointer$(st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset, 8);st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset := st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset;havoc st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset;call st21nfca_hci_i2c_read_#t~mem203#1 := read~int(st21nfca_hci_i2c_read_~phy#1.base, 36 + st21nfca_hci_i2c_read_~phy#1.offset, 4); {527#false} is VALID [2022-02-20 22:01:21,492 INFO L290 TraceCheckUtils]: 59: Hoare triple {527#false} assume !(st21nfca_hci_i2c_read_#t~mem203#1 % 4294967296 <= 3);havoc st21nfca_hci_i2c_read_#t~mem203#1;st21nfca_hci_i2c_read_#res#1 := -5;call ULTIMATE.dealloc(st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset);havoc st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset; {527#false} is VALID [2022-02-20 22:01:21,492 INFO L290 TraceCheckUtils]: 60: Hoare triple {527#false} #t~ret236#1 := st21nfca_hci_i2c_read_#res#1;assume { :end_inline_st21nfca_hci_i2c_read } true;assume -2147483648 <= #t~ret236#1 && #t~ret236#1 <= 2147483647;~r~4#1 := #t~ret236#1;havoc #t~mem235#1.base, #t~mem235#1.offset;havoc #t~ret236#1; {527#false} is VALID [2022-02-20 22:01:21,492 INFO L290 TraceCheckUtils]: 61: Hoare triple {527#false} assume !(-121 == ~r~4#1); {527#false} is VALID [2022-02-20 22:01:21,493 INFO L290 TraceCheckUtils]: 62: Hoare triple {527#false} assume !(-11 == ~r~4#1 || -5 == ~r~4#1);#t~short239#1 := -74 == ~r~4#1; {527#false} is VALID [2022-02-20 22:01:21,493 INFO L290 TraceCheckUtils]: 63: Hoare triple {527#false} assume #t~short239#1;call #t~mem238#1 := read~int(~phy~3#1.base, 40 + ~phy~3#1.offset, 4);#t~short239#1 := #t~mem238#1 % 4294967296 <= 5; {527#false} is VALID [2022-02-20 22:01:21,493 INFO L290 TraceCheckUtils]: 64: Hoare triple {527#false} assume !#t~short239#1;havoc #t~mem238#1;havoc #t~short239#1; {527#false} is VALID [2022-02-20 22:01:21,493 INFO L290 TraceCheckUtils]: 65: Hoare triple {527#false} assume !(~r~4#1 > 0); {527#false} is VALID [2022-02-20 22:01:21,493 INFO L272 TraceCheckUtils]: 66: Hoare triple {527#false} call #t~ret246#1.base, #t~ret246#1.offset := alloc_skb(74, 208); {527#false} is VALID [2022-02-20 22:01:21,493 INFO L290 TraceCheckUtils]: 67: Hoare triple {527#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~28#1.base, ~tmp~28#1.offset; {527#false} is VALID [2022-02-20 22:01:21,494 INFO L272 TraceCheckUtils]: 68: Hoare triple {527#false} call ldv_check_alloc_flags(~flags#1); {527#false} is VALID [2022-02-20 22:01:21,494 INFO L290 TraceCheckUtils]: 69: Hoare triple {527#false} ~flags := #in~flags; {527#false} is VALID [2022-02-20 22:01:21,494 INFO L290 TraceCheckUtils]: 70: Hoare triple {527#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {527#false} is VALID [2022-02-20 22:01:21,494 INFO L272 TraceCheckUtils]: 71: Hoare triple {527#false} call ldv_error(); {527#false} is VALID [2022-02-20 22:01:21,494 INFO L290 TraceCheckUtils]: 72: Hoare triple {527#false} assume !false; {527#false} is VALID [2022-02-20 22:01:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 22:01:21,495 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:01:21,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067615797] [2022-02-20 22:01:21,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067615797] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:01:21,496 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:01:21,497 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:01:21,498 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340451024] [2022-02-20 22:01:21,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:01:21,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-02-20 22:01:21,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:01:21,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:21,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:01:21,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:01:21,569 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:01:21,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:01:21,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:01:21,589 INFO L87 Difference]: Start difference. First operand has 523 states, 393 states have (on average 1.3740458015267176) internal successors, (540), 405 states have internal predecessors, (540), 97 states have call successors, (97), 32 states have call predecessors, (97), 31 states have return successors, (89), 89 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:01:28,669 INFO L93 Difference]: Finished difference Result 1612 states and 2333 transitions. [2022-02-20 22:01:28,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 22:01:28,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-02-20 22:01:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:01:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2333 transitions. [2022-02-20 22:01:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2333 transitions. [2022-02-20 22:01:28,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2333 transitions. [2022-02-20 22:01:30,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2333 edges. 2333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:01:30,636 INFO L225 Difference]: With dead ends: 1612 [2022-02-20 22:01:30,636 INFO L226 Difference]: Without dead ends: 1060 [2022-02-20 22:01:30,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 22:01:30,657 INFO L933 BasicCegarLoop]: 789 mSDtfsCounter, 919 mSDsluCounter, 2081 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 22:01:30,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [988 Valid, 2870 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 22:01:30,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2022-02-20 22:01:30,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 995. [2022-02-20 22:01:30,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:01:30,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1060 states. Second operand has 995 states, 761 states have (on average 1.3495400788436267) internal successors, (1027), 769 states have internal predecessors, (1027), 172 states have call successors, (172), 62 states have call predecessors, (172), 61 states have return successors, (171), 167 states have call predecessors, (171), 171 states have call successors, (171) [2022-02-20 22:01:30,766 INFO L74 IsIncluded]: Start isIncluded. First operand 1060 states. Second operand has 995 states, 761 states have (on average 1.3495400788436267) internal successors, (1027), 769 states have internal predecessors, (1027), 172 states have call successors, (172), 62 states have call predecessors, (172), 61 states have return successors, (171), 167 states have call predecessors, (171), 171 states have call successors, (171) [2022-02-20 22:01:30,769 INFO L87 Difference]: Start difference. First operand 1060 states. Second operand has 995 states, 761 states have (on average 1.3495400788436267) internal successors, (1027), 769 states have internal predecessors, (1027), 172 states have call successors, (172), 62 states have call predecessors, (172), 61 states have return successors, (171), 167 states have call predecessors, (171), 171 states have call successors, (171) [2022-02-20 22:01:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:01:30,836 INFO L93 Difference]: Finished difference Result 1060 states and 1483 transitions. [2022-02-20 22:01:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1483 transitions. [2022-02-20 22:01:30,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:01:30,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:01:30,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 995 states, 761 states have (on average 1.3495400788436267) internal successors, (1027), 769 states have internal predecessors, (1027), 172 states have call successors, (172), 62 states have call predecessors, (172), 61 states have return successors, (171), 167 states have call predecessors, (171), 171 states have call successors, (171) Second operand 1060 states. [2022-02-20 22:01:30,853 INFO L87 Difference]: Start difference. First operand has 995 states, 761 states have (on average 1.3495400788436267) internal successors, (1027), 769 states have internal predecessors, (1027), 172 states have call successors, (172), 62 states have call predecessors, (172), 61 states have return successors, (171), 167 states have call predecessors, (171), 171 states have call successors, (171) Second operand 1060 states. [2022-02-20 22:01:30,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:01:30,901 INFO L93 Difference]: Finished difference Result 1060 states and 1483 transitions. [2022-02-20 22:01:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1483 transitions. [2022-02-20 22:01:30,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:01:30,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:01:30,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:01:30,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:01:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 761 states have (on average 1.3495400788436267) internal successors, (1027), 769 states have internal predecessors, (1027), 172 states have call successors, (172), 62 states have call predecessors, (172), 61 states have return successors, (171), 167 states have call predecessors, (171), 171 states have call successors, (171) [2022-02-20 22:01:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1370 transitions. [2022-02-20 22:01:30,964 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1370 transitions. Word has length 73 [2022-02-20 22:01:30,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:01:30,965 INFO L470 AbstractCegarLoop]: Abstraction has 995 states and 1370 transitions. [2022-02-20 22:01:30,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:30,966 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1370 transitions. [2022-02-20 22:01:30,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 22:01:30,968 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:01:30,968 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:30,969 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:01:30,969 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:01:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:01:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1025511413, now seen corresponding path program 1 times [2022-02-20 22:01:30,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:01:30,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436298041] [2022-02-20 22:01:30,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:01:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:01:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:31,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:01:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:31,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {6277#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {6249#true} is VALID [2022-02-20 22:01:31,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {6249#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {6249#true} is VALID [2022-02-20 22:01:31,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {6249#true} assume true; {6249#true} is VALID [2022-02-20 22:01:31,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6249#true} {6251#(= ~ldv_irq_1_0~0 0)} #1284#return; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:01:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:31,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {6277#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {6249#true} is VALID [2022-02-20 22:01:31,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {6249#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {6249#true} is VALID [2022-02-20 22:01:31,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {6249#true} assume true; {6249#true} is VALID [2022-02-20 22:01:31,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6249#true} {6251#(= ~ldv_irq_1_0~0 0)} #1286#return; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:01:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:31,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {6277#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {6249#true} is VALID [2022-02-20 22:01:31,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {6249#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {6249#true} is VALID [2022-02-20 22:01:31,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {6249#true} assume true; {6249#true} is VALID [2022-02-20 22:01:31,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6249#true} {6251#(= ~ldv_irq_1_0~0 0)} #1288#return; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 22:01:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:31,111 INFO L290 TraceCheckUtils]: 0: Hoare triple {6277#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {6249#true} is VALID [2022-02-20 22:01:31,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {6249#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {6249#true} is VALID [2022-02-20 22:01:31,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {6249#true} assume true; {6249#true} is VALID [2022-02-20 22:01:31,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6249#true} {6251#(= ~ldv_irq_1_0~0 0)} #1290#return; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 22:01:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:31,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {6277#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {6249#true} is VALID [2022-02-20 22:01:31,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {6249#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {6249#true} is VALID [2022-02-20 22:01:31,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {6249#true} assume true; {6249#true} is VALID [2022-02-20 22:01:31,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6249#true} {6251#(= ~ldv_irq_1_0~0 0)} #1292#return; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-02-20 22:01:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:31,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {6249#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {6249#true} is VALID [2022-02-20 22:01:31,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {6249#true} assume true; {6249#true} is VALID [2022-02-20 22:01:31,127 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6249#true} {6250#false} #1238#return; {6250#false} is VALID [2022-02-20 22:01:31,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {6249#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(108, 2);call #Ultimate.allocInit(17, 3);call #Ultimate.allocInit(13, 4);call #Ultimate.allocInit(23, 5);call #Ultimate.allocInit(216, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(115, 7, 1, 1);call write~init~int(58, 7, 2, 1);call write~init~int(10, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(23, 9);call #Ultimate.allocInit(2, 10);call write~init~int(15, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(6, 11);call write~init~int(105, 11, 0, 1);call write~init~int(50, 11, 1, 1);call write~init~int(99, 11, 2, 1);call write~init~int(58, 11, 3, 1);call write~init~int(32, 11, 4, 1);call write~init~int(0, 11, 5, 1);call #Ultimate.allocInit(58, 12);call #Ultimate.allocInit(58, 13);call #Ultimate.allocInit(10, 14);call #Ultimate.allocInit(2, 15);call write~init~int(15, 15, 0, 1);call write~init~int(0, 15, 1, 1);call #Ultimate.allocInit(6, 16);call write~init~int(99, 16, 0, 1);call write~init~int(114, 16, 1, 1);call write~init~int(99, 16, 2, 1);call write~init~int(58, 16, 3, 1);call write~init~int(32, 16, 4, 1);call write~init~int(0, 16, 5, 1);call #Ultimate.allocInit(216, 17);call #Ultimate.allocInit(13, 18);call #Ultimate.allocInit(27, 19);call #Ultimate.allocInit(216, 20);call #Ultimate.allocInit(5, 21);call write~init~int(73, 21, 0, 1);call write~init~int(82, 21, 1, 1);call write~init~int(81, 21, 2, 1);call write~init~int(10, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(5, 22);call write~init~int(73, 22, 0, 1);call write~init~int(82, 22, 1, 1);call write~init~int(81, 22, 2, 1);call write~init~int(10, 22, 3, 1);call write~init~int(0, 22, 4, 1);call #Ultimate.allocInit(23, 23);call #Ultimate.allocInit(8, 24);call #Ultimate.allocInit(41, 25);call #Ultimate.allocInit(216, 26);call #Ultimate.allocInit(49, 27);call #Ultimate.allocInit(216, 28);call #Ultimate.allocInit(11, 29);call #Ultimate.allocInit(45, 30);call #Ultimate.allocInit(216, 31);call #Ultimate.allocInit(54, 32);call #Ultimate.allocInit(216, 33);call #Ultimate.allocInit(52, 34);call #Ultimate.allocInit(13, 35);call #Ultimate.allocInit(23, 36);call #Ultimate.allocInit(216, 37);call #Ultimate.allocInit(4, 38);call write~init~int(37, 38, 0, 1);call write~init~int(115, 38, 1, 1);call write~init~int(10, 38, 2, 1);call write~init~int(0, 38, 3, 1);call #Ultimate.allocInit(4, 39);call write~init~int(37, 39, 0, 1);call write~init~int(115, 39, 1, 1);call write~init~int(10, 39, 2, 1);call write~init~int(0, 39, 3, 1);call #Ultimate.allocInit(23, 40);call #Ultimate.allocInit(13, 41);call #Ultimate.allocInit(23, 42);call #Ultimate.allocInit(216, 43);call #Ultimate.allocInit(9, 44);call #Ultimate.allocInit(9, 45);call #Ultimate.allocInit(24, 46);call #Ultimate.allocInit(51, 47);call #Ultimate.allocInit(15, 48);call #Ultimate.allocInit(23, 49);call #Ultimate.allocInit(36, 50);call #Ultimate.allocInit(48, 51);call #Ultimate.allocInit(32, 52);call #Ultimate.allocInit(13, 53);call #Ultimate.allocInit(37, 54);call #Ultimate.allocInit(6, 55);call write~init~int(115, 55, 0, 1);call write~init~int(104, 55, 1, 1);call write~init~int(100, 55, 2, 1);call write~init~int(108, 55, 3, 1);call write~init~int(99, 55, 4, 1);call write~init~int(0, 55, 5, 1);call #Ultimate.allocInit(13, 56);call #Ultimate.allocInit(24, 57);call #Ultimate.allocInit(216, 58);call #Ultimate.allocInit(4, 59);call write~init~int(37, 59, 0, 1);call write~init~int(115, 59, 1, 1);call write~init~int(10, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(4, 60);call write~init~int(37, 60, 0, 1);call write~init~int(115, 60, 1, 1);call write~init~int(10, 60, 2, 1);call write~init~int(0, 60, 3, 1);call #Ultimate.allocInit(24, 61);call #Ultimate.allocInit(17, 62);~ldv_irq_data_2_1~0.base, ~ldv_irq_data_2_1~0.offset := 0, 0;~ldv_irq_dev_1_1~0.base, ~ldv_irq_dev_1_1~0.offset := 0, 0;~ldv_irq_1_3~0 := 0;~ldv_irq_line_2_2~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_0~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_irq_line_2_1~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_2_0~0 := 0;~ldv_irq_dev_1_3~0.base, ~ldv_irq_dev_1_3~0.offset := 0, 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ldv_irq_dev_1_0~0.base, ~ldv_irq_dev_1_0~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_irq_data_2_0~0.base, ~ldv_irq_data_2_0~0.offset := 0, 0;~ldv_irq_dev_2_3~0.base, ~ldv_irq_dev_2_3~0.offset := 0, 0;~ldv_irq_dev_2_0~0.base, ~ldv_irq_dev_2_0~0.offset := 0, 0;~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_1~0 := 0;~ldv_irq_2_3~0 := 0;~st21nfca_hci_i2c_driver_group0~0.base, ~st21nfca_hci_i2c_driver_group0~0.offset := 0, 0;~ldv_irq_data_2_3~0.base, ~ldv_irq_data_2_3~0.offset := 0, 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_2_2~0 := 0;~ldv_irq_dev_1_2~0.base, ~ldv_irq_dev_1_2~0.offset := 0, 0;~ldv_irq_line_2_0~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_irq_dev_2_1~0.base, ~ldv_irq_dev_2_1~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_data_2_2~0.base, ~ldv_irq_data_2_2~0.offset := 0, 0;~ldv_irq_line_1_1~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~ldv_state_variable_4~0 := 0;~ldv_irq_dev_2_2~0.base, ~ldv_irq_dev_2_2~0.offset := 0, 0;~ldv_irq_line_2_3~0 := 0;~ldv_irq_2_1~0 := 0;~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset := 63, 0;call #Ultimate.allocInit(56, 63);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#st21nfca_hci_i2c_id_table~0.base);call write~unchecked~int(115, ~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(116, ~#st21nfca_hci_i2c_id_table~0.base, 1 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(50, ~#st21nfca_hci_i2c_id_table~0.base, 2 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(49, ~#st21nfca_hci_i2c_id_table~0.base, 3 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(110, ~#st21nfca_hci_i2c_id_table~0.base, 4 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(102, ~#st21nfca_hci_i2c_id_table~0.base, 5 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(99, ~#st21nfca_hci_i2c_id_table~0.base, 6 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(97, ~#st21nfca_hci_i2c_id_table~0.base, 7 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(95, ~#st21nfca_hci_i2c_id_table~0.base, 8 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(104, ~#st21nfca_hci_i2c_id_table~0.base, 9 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(99, ~#st21nfca_hci_i2c_id_table~0.base, 10 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(105, ~#st21nfca_hci_i2c_id_table~0.base, 11 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(0, ~#st21nfca_hci_i2c_id_table~0.base, 12 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(0, ~#st21nfca_hci_i2c_id_table~0.base, 20 + ~#st21nfca_hci_i2c_id_table~0.offset, 8);~__mod_i2c__st21nfca_hci_i2c_id_table_device_table~0.name := ~const~array~~LB~int~RB~int();~__mod_i2c__st21nfca_hci_i2c_id_table_device_table~0.driver_data := 0;~#len_seq~0.base, ~#len_seq~0.offset := 64, 0;call #Ultimate.allocInit(4, 64);call write~init~int(13, ~#len_seq~0.base, ~#len_seq~0.offset, 1);call write~init~int(24, ~#len_seq~0.base, 1 + ~#len_seq~0.offset, 1);call write~init~int(15, ~#len_seq~0.base, 2 + ~#len_seq~0.offset, 1);call write~init~int(29, ~#len_seq~0.base, 3 + ~#len_seq~0.offset, 1);~#wait_tab~0.base, ~#wait_tab~0.offset := 65, 0;call #Ultimate.allocInit(12, 65);call write~init~int(2, ~#wait_tab~0.base, ~#wait_tab~0.offset, 2);call write~init~int(3, ~#wait_tab~0.base, 2 + ~#wait_tab~0.offset, 2);call write~init~int(5, ~#wait_tab~0.base, 4 + ~#wait_tab~0.offset, 2);call write~init~int(15, ~#wait_tab~0.base, 6 + ~#wait_tab~0.offset, 2);call write~init~int(20, ~#wait_tab~0.base, 8 + ~#wait_tab~0.offset, 2);call write~init~int(40, ~#wait_tab~0.base, 10 + ~#wait_tab~0.offset, 2);~#i2c_phy_ops~0.base, ~#i2c_phy_ops~0.offset := 66, 0;call #Ultimate.allocInit(24, 66);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_write.base, #funAddr~st21nfca_hci_i2c_write.offset, ~#i2c_phy_ops~0.base, ~#i2c_phy_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_enable.base, #funAddr~st21nfca_hci_i2c_enable.offset, ~#i2c_phy_ops~0.base, 8 + ~#i2c_phy_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_disable.base, #funAddr~st21nfca_hci_i2c_disable.offset, ~#i2c_phy_ops~0.base, 16 + ~#i2c_phy_ops~0.offset, 8);~#st21nfca_hci_i2c_driver~0.base, ~#st21nfca_hci_i2c_driver~0.offset := 67, 0;call #Ultimate.allocInit(221, 67);call write~init~int(0, ~#st21nfca_hci_i2c_driver~0.base, ~#st21nfca_hci_i2c_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 4 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_probe.base, #funAddr~st21nfca_hci_i2c_probe.offset, ~#st21nfca_hci_i2c_driver~0.base, 12 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_remove.base, #funAddr~st21nfca_hci_i2c_remove.offset, ~#st21nfca_hci_i2c_driver~0.base, 20 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 28 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 36 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 44 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 52 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 60 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(62, 0, ~#st21nfca_hci_i2c_driver~0.base, 68 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 76 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#st21nfca_hci_i2c_driver~0.base, 84 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 92 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~int(0, ~#st21nfca_hci_i2c_driver~0.base, 100 + ~#st21nfca_hci_i2c_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 101 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 109 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 117 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 125 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 133 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 141 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 149 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 157 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 165 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 173 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset, ~#st21nfca_hci_i2c_driver~0.base, 181 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 189 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 197 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 205 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 213 + ~#st21nfca_hci_i2c_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_spin~0 := 0; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret333#1.base, main_#t~ret333#1.offset, main_#t~ret334#1.base, main_#t~ret334#1.offset, main_#t~ret335#1.base, main_#t~ret335#1.offset, main_#t~ret336#1.base, main_#t~ret336#1.offset, main_#t~ret337#1.base, main_#t~ret337#1.offset, main_#t~nondet338#1, main_#t~switch339#1, main_#t~nondet340#1, main_#t~switch341#1, main_#t~ret342#1, main_#t~ret343#1, main_#t~nondet344#1, main_#t~switch345#1, main_#t~ret346#1, main_#t~nondet347#1, main_#t~switch348#1, main_#t~ret349#1, main_#t~ret350#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~26#1.base, main_~tmp~26#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~26#1.base, main_~tmp~26#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,168 INFO L272 TraceCheckUtils]: 2: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} call main_#t~ret333#1.base, main_#t~ret333#1.offset := ldv_zalloc(1); {6277#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:31,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {6277#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {6249#true} is VALID [2022-02-20 22:01:31,168 INFO L290 TraceCheckUtils]: 4: Hoare triple {6249#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {6249#true} is VALID [2022-02-20 22:01:31,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {6249#true} assume true; {6249#true} is VALID [2022-02-20 22:01:31,169 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6249#true} {6251#(= ~ldv_irq_1_0~0 0)} #1284#return; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} main_~tmp~26#1.base, main_~tmp~26#1.offset := main_#t~ret333#1.base, main_#t~ret333#1.offset;havoc main_#t~ret333#1.base, main_#t~ret333#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~26#1.base, main_~tmp~26#1.offset; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,170 INFO L272 TraceCheckUtils]: 8: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} call main_#t~ret334#1.base, main_#t~ret334#1.offset := ldv_zalloc(1); {6277#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:31,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {6277#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {6249#true} is VALID [2022-02-20 22:01:31,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {6249#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {6249#true} is VALID [2022-02-20 22:01:31,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {6249#true} assume true; {6249#true} is VALID [2022-02-20 22:01:31,171 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6249#true} {6251#(= ~ldv_irq_1_0~0 0)} #1286#return; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset := main_#t~ret334#1.base, main_#t~ret334#1.offset;havoc main_#t~ret334#1.base, main_#t~ret334#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,172 INFO L272 TraceCheckUtils]: 14: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} call main_#t~ret335#1.base, main_#t~ret335#1.offset := ldv_zalloc(1); {6277#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:31,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {6277#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {6249#true} is VALID [2022-02-20 22:01:31,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {6249#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {6249#true} is VALID [2022-02-20 22:01:31,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {6249#true} assume true; {6249#true} is VALID [2022-02-20 22:01:31,173 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6249#true} {6251#(= ~ldv_irq_1_0~0 0)} #1288#return; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset := main_#t~ret335#1.base, main_#t~ret335#1.offset;havoc main_#t~ret335#1.base, main_#t~ret335#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,173 INFO L272 TraceCheckUtils]: 20: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} call main_#t~ret336#1.base, main_#t~ret336#1.offset := ldv_zalloc(232); {6277#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:31,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {6277#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {6249#true} is VALID [2022-02-20 22:01:31,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {6249#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {6249#true} is VALID [2022-02-20 22:01:31,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {6249#true} assume true; {6249#true} is VALID [2022-02-20 22:01:31,174 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {6249#true} {6251#(= ~ldv_irq_1_0~0 0)} #1290#return; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset := main_#t~ret336#1.base, main_#t~ret336#1.offset;havoc main_#t~ret336#1.base, main_#t~ret336#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,175 INFO L272 TraceCheckUtils]: 26: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} call main_#t~ret337#1.base, main_#t~ret337#1.offset := ldv_zalloc(32); {6277#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:31,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {6277#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {6249#true} is VALID [2022-02-20 22:01:31,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {6249#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {6249#true} is VALID [2022-02-20 22:01:31,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {6249#true} assume true; {6249#true} is VALID [2022-02-20 22:01:31,176 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6249#true} {6251#(= ~ldv_irq_1_0~0 0)} #1292#return; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,177 INFO L290 TraceCheckUtils]: 31: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset := main_#t~ret337#1.base, main_#t~ret337#1.offset;havoc main_#t~ret337#1.base, main_#t~ret337#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset;assume { :begin_inline_ldv_initialize } true; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,177 INFO L290 TraceCheckUtils]: 32: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_4~0 := 0;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 1; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} assume -2147483648 <= main_#t~nondet338#1 && main_#t~nondet338#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet338#1;havoc main_#t~nondet338#1;main_#t~switch339#1 := 0 == main_~tmp___4~0#1; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} assume !main_#t~switch339#1;main_#t~switch339#1 := main_#t~switch339#1 || 1 == main_~tmp___4~0#1; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} assume main_#t~switch339#1; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,179 INFO L290 TraceCheckUtils]: 36: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} assume 0 != ~ldv_state_variable_1~0;assume { :begin_inline_choose_interrupt_1 } true;havoc choose_interrupt_1_#t~nondet326#1, choose_interrupt_1_#t~switch327#1, choose_interrupt_1_#t~ret328#1, choose_interrupt_1_#t~ret329#1, choose_interrupt_1_#t~ret330#1, choose_interrupt_1_#t~ret331#1, choose_interrupt_1_~tmp~24#1;havoc choose_interrupt_1_~tmp~24#1;assume -2147483648 <= choose_interrupt_1_#t~nondet326#1 && choose_interrupt_1_#t~nondet326#1 <= 2147483647;choose_interrupt_1_~tmp~24#1 := choose_interrupt_1_#t~nondet326#1;havoc choose_interrupt_1_#t~nondet326#1;choose_interrupt_1_#t~switch327#1 := 0 == choose_interrupt_1_~tmp~24#1; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,179 INFO L290 TraceCheckUtils]: 37: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} assume choose_interrupt_1_#t~switch327#1; {6251#(= ~ldv_irq_1_0~0 0)} is VALID [2022-02-20 22:01:31,180 INFO L272 TraceCheckUtils]: 38: Hoare triple {6251#(= ~ldv_irq_1_0~0 0)} call choose_interrupt_1_#t~ret328#1 := ldv_irq_1(~ldv_irq_1_0~0, ~ldv_irq_line_1_0~0, ~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset); {6272#(= |ldv_irq_1_#in~state#1| 0)} is VALID [2022-02-20 22:01:31,180 INFO L290 TraceCheckUtils]: 39: Hoare triple {6272#(= |ldv_irq_1_#in~state#1| 0)} ~state#1 := #in~state#1;~line#1 := #in~line#1;~data#1.base, ~data#1.offset := #in~data#1.base, #in~data#1.offset;havoc ~irq_retval~0#1;havoc ~tmp~22#1;havoc ~tmp___0~11#1; {6273#(= |ldv_irq_1_~state#1| 0)} is VALID [2022-02-20 22:01:31,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {6273#(= |ldv_irq_1_~state#1| 0)} assume 0 != ~state#1;assume -2147483648 <= #t~nondet318#1 && #t~nondet318#1 <= 2147483647;~tmp~22#1 := #t~nondet318#1;havoc #t~nondet318#1;#t~switch319#1 := 0 == ~tmp~22#1; {6250#false} is VALID [2022-02-20 22:01:31,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {6250#false} assume !#t~switch319#1;#t~switch319#1 := #t~switch319#1 || 1 == ~tmp~22#1; {6250#false} is VALID [2022-02-20 22:01:31,181 INFO L290 TraceCheckUtils]: 42: Hoare triple {6250#false} assume #t~switch319#1; {6250#false} is VALID [2022-02-20 22:01:31,181 INFO L290 TraceCheckUtils]: 43: Hoare triple {6250#false} assume 2 == ~state#1; {6250#false} is VALID [2022-02-20 22:01:31,181 INFO L272 TraceCheckUtils]: 44: Hoare triple {6250#false} call #t~ret321#1 := st21nfca_hci_irq_thread_fn(~line#1, ~data#1.base, ~data#1.offset); {6250#false} is VALID [2022-02-20 22:01:31,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {6250#false} ~irq#1 := #in~irq#1;~phy_id#1.base, ~phy_id#1.offset := #in~phy_id#1.base, #in~phy_id#1.offset;havoc ~phy~3#1.base, ~phy~3#1.offset;havoc ~client~2#1.base, ~client~2#1.offset;havoc ~r~4#1;havoc ~__warned~0#1;havoc ~__ret_warn_once~0#1;havoc ~__ret_warn_on~0#1;havoc ~tmp~16#1;havoc ~tmp___0~8#1;havoc ~tmp___1~3#1;call ~#descriptor~1#1.base, ~#descriptor~1#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp___2~2#1;~phy~3#1.base, ~phy~3#1.offset := ~phy_id#1.base, ~phy_id#1.offset;#t~short225#1 := 0 == (~phy~3#1.base + ~phy~3#1.offset) % 18446744073709551616; {6250#false} is VALID [2022-02-20 22:01:31,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {6250#false} assume #t~short225#1; {6250#false} is VALID [2022-02-20 22:01:31,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {6250#false} assume !#t~short225#1;havoc #t~mem223#1.base, #t~mem223#1.offset;havoc #t~mem224#1;havoc #t~short225#1;call #t~mem230#1.base, #t~mem230#1.offset := read~$Pointer$(~phy~3#1.base, ~phy~3#1.offset, 8);~client~2#1.base, ~client~2#1.offset := #t~mem230#1.base, #t~mem230#1.offset;havoc #t~mem230#1.base, #t~mem230#1.offset;call write~$Pointer$(18, 0, ~#descriptor~1#1.base, ~#descriptor~1#1.offset, 8);call write~$Pointer$(19, 0, ~#descriptor~1#1.base, 8 + ~#descriptor~1#1.offset, 8);call write~$Pointer$(20, 0, ~#descriptor~1#1.base, 16 + ~#descriptor~1#1.offset, 8);call write~$Pointer$(21, 0, ~#descriptor~1#1.base, 24 + ~#descriptor~1#1.offset, 8);call write~int(526, ~#descriptor~1#1.base, 32 + ~#descriptor~1#1.offset, 4);call write~int(0, ~#descriptor~1#1.base, 36 + ~#descriptor~1#1.offset, 1);call #t~mem231#1 := read~int(~#descriptor~1#1.base, 36 + ~#descriptor~1#1.offset, 1); {6250#false} is VALID [2022-02-20 22:01:31,182 INFO L272 TraceCheckUtils]: 48: Hoare triple {6250#false} call #t~ret232#1 := ldv__builtin_expect(#t~mem231#1 % 256, 0); {6249#true} is VALID [2022-02-20 22:01:31,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {6249#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {6249#true} is VALID [2022-02-20 22:01:31,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {6249#true} assume true; {6249#true} is VALID [2022-02-20 22:01:31,182 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {6249#true} {6250#false} #1238#return; {6250#false} is VALID [2022-02-20 22:01:31,183 INFO L290 TraceCheckUtils]: 52: Hoare triple {6250#false} assume -9223372036854775808 <= #t~ret232#1 && #t~ret232#1 <= 9223372036854775807;~tmp___2~2#1 := #t~ret232#1;havoc #t~mem231#1;havoc #t~ret232#1; {6250#false} is VALID [2022-02-20 22:01:31,183 INFO L290 TraceCheckUtils]: 53: Hoare triple {6250#false} assume 0 != ~tmp___2~2#1;havoc #t~nondet233#1; {6250#false} is VALID [2022-02-20 22:01:31,183 INFO L290 TraceCheckUtils]: 54: Hoare triple {6250#false} call #t~mem234#1 := read~int(~phy~3#1.base, 52 + ~phy~3#1.offset, 4); {6250#false} is VALID [2022-02-20 22:01:31,183 INFO L290 TraceCheckUtils]: 55: Hoare triple {6250#false} assume !(0 != #t~mem234#1);havoc #t~mem234#1;call #t~mem235#1.base, #t~mem235#1.offset := read~$Pointer$(~phy~3#1.base, 28 + ~phy~3#1.offset, 8);assume { :begin_inline_st21nfca_hci_i2c_read } true;st21nfca_hci_i2c_read_#in~phy#1.base, st21nfca_hci_i2c_read_#in~phy#1.offset, st21nfca_hci_i2c_read_#in~skb#1.base, st21nfca_hci_i2c_read_#in~skb#1.offset := ~phy~3#1.base, ~phy~3#1.offset, #t~mem235#1.base, #t~mem235#1.offset;havoc st21nfca_hci_i2c_read_#res#1;havoc st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset, st21nfca_hci_i2c_read_#t~mem203#1, st21nfca_hci_i2c_read_#t~mem204#1, st21nfca_hci_i2c_read_#t~mem205#1, st21nfca_hci_i2c_read_#t~ret206#1, st21nfca_hci_i2c_read_#t~mem207#1, st21nfca_hci_i2c_read_#t~mem208#1, st21nfca_hci_i2c_read_#t~mem209#1, st21nfca_hci_i2c_read_#t~short210#1, st21nfca_hci_i2c_read_#t~mem211#1, st21nfca_hci_i2c_read_#t~mem212#1, st21nfca_hci_i2c_read_#t~mem213#1, st21nfca_hci_i2c_read_#t~short214#1, st21nfca_hci_i2c_read_#t~short215#1, st21nfca_hci_i2c_read_#t~ret216#1.base, st21nfca_hci_i2c_read_#t~ret216#1.offset, st21nfca_hci_i2c_read_#t~memcpy~res217#1.base, st21nfca_hci_i2c_read_#t~memcpy~res217#1.offset, st21nfca_hci_i2c_read_#t~mem219#1.base, st21nfca_hci_i2c_read_#t~mem219#1.offset, st21nfca_hci_i2c_read_#t~mem218#1, st21nfca_hci_i2c_read_#t~mem220#1, st21nfca_hci_i2c_read_#t~ret221#1, st21nfca_hci_i2c_read_#t~mem222#1, st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset, st21nfca_hci_i2c_read_~skb#1.base, st21nfca_hci_i2c_read_~skb#1.offset, st21nfca_hci_i2c_read_~r~3#1, st21nfca_hci_i2c_read_~i~3#1, st21nfca_hci_i2c_read_~len~1#1, st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset, st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset, st21nfca_hci_i2c_read_~__len~0#1, st21nfca_hci_i2c_read_~__ret~0#1.base, st21nfca_hci_i2c_read_~__ret~0#1.offset, st21nfca_hci_i2c_read_~tmp___0~7#1.base, st21nfca_hci_i2c_read_~tmp___0~7#1.offset, st21nfca_hci_i2c_read_~tmp___1~2#1;st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset := st21nfca_hci_i2c_read_#in~phy#1.base, st21nfca_hci_i2c_read_#in~phy#1.offset;st21nfca_hci_i2c_read_~skb#1.base, st21nfca_hci_i2c_read_~skb#1.offset := st21nfca_hci_i2c_read_#in~skb#1.base, st21nfca_hci_i2c_read_#in~skb#1.offset;havoc st21nfca_hci_i2c_read_~r~3#1;havoc st21nfca_hci_i2c_read_~i~3#1;havoc st21nfca_hci_i2c_read_~len~1#1;call st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset := #Ultimate.allocOnStack(29);havoc st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset;havoc st21nfca_hci_i2c_read_~__len~0#1;havoc st21nfca_hci_i2c_read_~__ret~0#1.base, st21nfca_hci_i2c_read_~__ret~0#1.offset;havoc st21nfca_hci_i2c_read_~tmp___0~7#1.base, st21nfca_hci_i2c_read_~tmp___0~7#1.offset;havoc st21nfca_hci_i2c_read_~tmp___1~2#1;call st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset := read~$Pointer$(st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset, 8);st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset := st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset;havoc st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset;call st21nfca_hci_i2c_read_#t~mem203#1 := read~int(st21nfca_hci_i2c_read_~phy#1.base, 36 + st21nfca_hci_i2c_read_~phy#1.offset, 4); {6250#false} is VALID [2022-02-20 22:01:31,183 INFO L290 TraceCheckUtils]: 56: Hoare triple {6250#false} assume !(st21nfca_hci_i2c_read_#t~mem203#1 % 4294967296 <= 3);havoc st21nfca_hci_i2c_read_#t~mem203#1;st21nfca_hci_i2c_read_#res#1 := -5;call ULTIMATE.dealloc(st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset);havoc st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset; {6250#false} is VALID [2022-02-20 22:01:31,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {6250#false} #t~ret236#1 := st21nfca_hci_i2c_read_#res#1;assume { :end_inline_st21nfca_hci_i2c_read } true;assume -2147483648 <= #t~ret236#1 && #t~ret236#1 <= 2147483647;~r~4#1 := #t~ret236#1;havoc #t~mem235#1.base, #t~mem235#1.offset;havoc #t~ret236#1; {6250#false} is VALID [2022-02-20 22:01:31,184 INFO L290 TraceCheckUtils]: 58: Hoare triple {6250#false} assume !(-121 == ~r~4#1); {6250#false} is VALID [2022-02-20 22:01:31,184 INFO L290 TraceCheckUtils]: 59: Hoare triple {6250#false} assume !(-11 == ~r~4#1 || -5 == ~r~4#1);#t~short239#1 := -74 == ~r~4#1; {6250#false} is VALID [2022-02-20 22:01:31,184 INFO L290 TraceCheckUtils]: 60: Hoare triple {6250#false} assume #t~short239#1;call #t~mem238#1 := read~int(~phy~3#1.base, 40 + ~phy~3#1.offset, 4);#t~short239#1 := #t~mem238#1 % 4294967296 <= 5; {6250#false} is VALID [2022-02-20 22:01:31,184 INFO L290 TraceCheckUtils]: 61: Hoare triple {6250#false} assume !#t~short239#1;havoc #t~mem238#1;havoc #t~short239#1; {6250#false} is VALID [2022-02-20 22:01:31,184 INFO L290 TraceCheckUtils]: 62: Hoare triple {6250#false} assume !(~r~4#1 > 0); {6250#false} is VALID [2022-02-20 22:01:31,184 INFO L272 TraceCheckUtils]: 63: Hoare triple {6250#false} call #t~ret246#1.base, #t~ret246#1.offset := alloc_skb(74, 208); {6250#false} is VALID [2022-02-20 22:01:31,185 INFO L290 TraceCheckUtils]: 64: Hoare triple {6250#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~28#1.base, ~tmp~28#1.offset; {6250#false} is VALID [2022-02-20 22:01:31,185 INFO L272 TraceCheckUtils]: 65: Hoare triple {6250#false} call ldv_check_alloc_flags(~flags#1); {6250#false} is VALID [2022-02-20 22:01:31,185 INFO L290 TraceCheckUtils]: 66: Hoare triple {6250#false} ~flags := #in~flags; {6250#false} is VALID [2022-02-20 22:01:31,185 INFO L290 TraceCheckUtils]: 67: Hoare triple {6250#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {6250#false} is VALID [2022-02-20 22:01:31,185 INFO L272 TraceCheckUtils]: 68: Hoare triple {6250#false} call ldv_error(); {6250#false} is VALID [2022-02-20 22:01:31,185 INFO L290 TraceCheckUtils]: 69: Hoare triple {6250#false} assume !false; {6250#false} is VALID [2022-02-20 22:01:31,186 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 22:01:31,186 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:01:31,186 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436298041] [2022-02-20 22:01:31,186 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436298041] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:01:31,186 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:01:31,186 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:01:31,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875789704] [2022-02-20 22:01:31,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:01:31,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2022-02-20 22:01:31,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:01:31,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:31,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:01:31,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:01:31,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:01:31,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:01:31,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:01:31,233 INFO L87 Difference]: Start difference. First operand 995 states and 1370 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:01:37,804 INFO L93 Difference]: Finished difference Result 3075 states and 4281 transitions. [2022-02-20 22:01:37,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 22:01:37,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2022-02-20 22:01:37,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:01:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:37,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2156 transitions. [2022-02-20 22:01:37,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:37,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2156 transitions. [2022-02-20 22:01:37,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2156 transitions. [2022-02-20 22:01:39,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2156 edges. 2156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:01:39,646 INFO L225 Difference]: With dead ends: 3075 [2022-02-20 22:01:39,646 INFO L226 Difference]: Without dead ends: 2093 [2022-02-20 22:01:39,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 22:01:39,655 INFO L933 BasicCegarLoop]: 762 mSDtfsCounter, 875 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 2755 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 22:01:39,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [945 Valid, 2755 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 22:01:39,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2022-02-20 22:01:39,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1966. [2022-02-20 22:01:39,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:01:39,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2093 states. Second operand has 1966 states, 1505 states have (on average 1.348172757475083) internal successors, (2029), 1527 states have internal predecessors, (2029), 338 states have call successors, (338), 125 states have call predecessors, (338), 122 states have return successors, (337), 319 states have call predecessors, (337), 337 states have call successors, (337) [2022-02-20 22:01:39,724 INFO L74 IsIncluded]: Start isIncluded. First operand 2093 states. Second operand has 1966 states, 1505 states have (on average 1.348172757475083) internal successors, (2029), 1527 states have internal predecessors, (2029), 338 states have call successors, (338), 125 states have call predecessors, (338), 122 states have return successors, (337), 319 states have call predecessors, (337), 337 states have call successors, (337) [2022-02-20 22:01:39,728 INFO L87 Difference]: Start difference. First operand 2093 states. Second operand has 1966 states, 1505 states have (on average 1.348172757475083) internal successors, (2029), 1527 states have internal predecessors, (2029), 338 states have call successors, (338), 125 states have call predecessors, (338), 122 states have return successors, (337), 319 states have call predecessors, (337), 337 states have call successors, (337) [2022-02-20 22:01:39,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:01:39,873 INFO L93 Difference]: Finished difference Result 2093 states and 2921 transitions. [2022-02-20 22:01:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2921 transitions. [2022-02-20 22:01:39,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:01:39,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:01:39,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 1966 states, 1505 states have (on average 1.348172757475083) internal successors, (2029), 1527 states have internal predecessors, (2029), 338 states have call successors, (338), 125 states have call predecessors, (338), 122 states have return successors, (337), 319 states have call predecessors, (337), 337 states have call successors, (337) Second operand 2093 states. [2022-02-20 22:01:39,888 INFO L87 Difference]: Start difference. First operand has 1966 states, 1505 states have (on average 1.348172757475083) internal successors, (2029), 1527 states have internal predecessors, (2029), 338 states have call successors, (338), 125 states have call predecessors, (338), 122 states have return successors, (337), 319 states have call predecessors, (337), 337 states have call successors, (337) Second operand 2093 states. [2022-02-20 22:01:40,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:01:40,034 INFO L93 Difference]: Finished difference Result 2093 states and 2921 transitions. [2022-02-20 22:01:40,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 2921 transitions. [2022-02-20 22:01:40,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:01:40,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:01:40,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:01:40,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:01:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1505 states have (on average 1.348172757475083) internal successors, (2029), 1527 states have internal predecessors, (2029), 338 states have call successors, (338), 125 states have call predecessors, (338), 122 states have return successors, (337), 319 states have call predecessors, (337), 337 states have call successors, (337) [2022-02-20 22:01:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2704 transitions. [2022-02-20 22:01:40,222 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2704 transitions. Word has length 70 [2022-02-20 22:01:40,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:01:40,222 INFO L470 AbstractCegarLoop]: Abstraction has 1966 states and 2704 transitions. [2022-02-20 22:01:40,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2704 transitions. [2022-02-20 22:01:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-20 22:01:40,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:01:40,225 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:40,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 22:01:40,225 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:01:40,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:01:40,226 INFO L85 PathProgramCache]: Analyzing trace with hash -625851643, now seen corresponding path program 1 times [2022-02-20 22:01:40,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:01:40,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591865722] [2022-02-20 22:01:40,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:01:40,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:01:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:40,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:01:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:40,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {17350#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {17322#true} is VALID [2022-02-20 22:01:40,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {17322#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17322#true} is VALID [2022-02-20 22:01:40,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {17322#true} assume true; {17322#true} is VALID [2022-02-20 22:01:40,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17322#true} {17324#(= ~ldv_irq_1_1~0 0)} #1284#return; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:01:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:40,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {17350#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {17322#true} is VALID [2022-02-20 22:01:40,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {17322#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17322#true} is VALID [2022-02-20 22:01:40,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {17322#true} assume true; {17322#true} is VALID [2022-02-20 22:01:40,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17322#true} {17324#(= ~ldv_irq_1_1~0 0)} #1286#return; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:01:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:40,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {17350#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {17322#true} is VALID [2022-02-20 22:01:40,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {17322#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17322#true} is VALID [2022-02-20 22:01:40,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {17322#true} assume true; {17322#true} is VALID [2022-02-20 22:01:40,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17322#true} {17324#(= ~ldv_irq_1_1~0 0)} #1288#return; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 22:01:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:40,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {17350#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {17322#true} is VALID [2022-02-20 22:01:40,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {17322#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17322#true} is VALID [2022-02-20 22:01:40,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {17322#true} assume true; {17322#true} is VALID [2022-02-20 22:01:40,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17322#true} {17324#(= ~ldv_irq_1_1~0 0)} #1290#return; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 22:01:40,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:40,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {17350#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {17322#true} is VALID [2022-02-20 22:01:40,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {17322#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17322#true} is VALID [2022-02-20 22:01:40,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {17322#true} assume true; {17322#true} is VALID [2022-02-20 22:01:40,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17322#true} {17324#(= ~ldv_irq_1_1~0 0)} #1292#return; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-20 22:01:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:40,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {17322#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {17322#true} is VALID [2022-02-20 22:01:40,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {17322#true} assume true; {17322#true} is VALID [2022-02-20 22:01:40,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17322#true} {17323#false} #1238#return; {17323#false} is VALID [2022-02-20 22:01:40,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {17322#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(108, 2);call #Ultimate.allocInit(17, 3);call #Ultimate.allocInit(13, 4);call #Ultimate.allocInit(23, 5);call #Ultimate.allocInit(216, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(115, 7, 1, 1);call write~init~int(58, 7, 2, 1);call write~init~int(10, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(23, 9);call #Ultimate.allocInit(2, 10);call write~init~int(15, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(6, 11);call write~init~int(105, 11, 0, 1);call write~init~int(50, 11, 1, 1);call write~init~int(99, 11, 2, 1);call write~init~int(58, 11, 3, 1);call write~init~int(32, 11, 4, 1);call write~init~int(0, 11, 5, 1);call #Ultimate.allocInit(58, 12);call #Ultimate.allocInit(58, 13);call #Ultimate.allocInit(10, 14);call #Ultimate.allocInit(2, 15);call write~init~int(15, 15, 0, 1);call write~init~int(0, 15, 1, 1);call #Ultimate.allocInit(6, 16);call write~init~int(99, 16, 0, 1);call write~init~int(114, 16, 1, 1);call write~init~int(99, 16, 2, 1);call write~init~int(58, 16, 3, 1);call write~init~int(32, 16, 4, 1);call write~init~int(0, 16, 5, 1);call #Ultimate.allocInit(216, 17);call #Ultimate.allocInit(13, 18);call #Ultimate.allocInit(27, 19);call #Ultimate.allocInit(216, 20);call #Ultimate.allocInit(5, 21);call write~init~int(73, 21, 0, 1);call write~init~int(82, 21, 1, 1);call write~init~int(81, 21, 2, 1);call write~init~int(10, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(5, 22);call write~init~int(73, 22, 0, 1);call write~init~int(82, 22, 1, 1);call write~init~int(81, 22, 2, 1);call write~init~int(10, 22, 3, 1);call write~init~int(0, 22, 4, 1);call #Ultimate.allocInit(23, 23);call #Ultimate.allocInit(8, 24);call #Ultimate.allocInit(41, 25);call #Ultimate.allocInit(216, 26);call #Ultimate.allocInit(49, 27);call #Ultimate.allocInit(216, 28);call #Ultimate.allocInit(11, 29);call #Ultimate.allocInit(45, 30);call #Ultimate.allocInit(216, 31);call #Ultimate.allocInit(54, 32);call #Ultimate.allocInit(216, 33);call #Ultimate.allocInit(52, 34);call #Ultimate.allocInit(13, 35);call #Ultimate.allocInit(23, 36);call #Ultimate.allocInit(216, 37);call #Ultimate.allocInit(4, 38);call write~init~int(37, 38, 0, 1);call write~init~int(115, 38, 1, 1);call write~init~int(10, 38, 2, 1);call write~init~int(0, 38, 3, 1);call #Ultimate.allocInit(4, 39);call write~init~int(37, 39, 0, 1);call write~init~int(115, 39, 1, 1);call write~init~int(10, 39, 2, 1);call write~init~int(0, 39, 3, 1);call #Ultimate.allocInit(23, 40);call #Ultimate.allocInit(13, 41);call #Ultimate.allocInit(23, 42);call #Ultimate.allocInit(216, 43);call #Ultimate.allocInit(9, 44);call #Ultimate.allocInit(9, 45);call #Ultimate.allocInit(24, 46);call #Ultimate.allocInit(51, 47);call #Ultimate.allocInit(15, 48);call #Ultimate.allocInit(23, 49);call #Ultimate.allocInit(36, 50);call #Ultimate.allocInit(48, 51);call #Ultimate.allocInit(32, 52);call #Ultimate.allocInit(13, 53);call #Ultimate.allocInit(37, 54);call #Ultimate.allocInit(6, 55);call write~init~int(115, 55, 0, 1);call write~init~int(104, 55, 1, 1);call write~init~int(100, 55, 2, 1);call write~init~int(108, 55, 3, 1);call write~init~int(99, 55, 4, 1);call write~init~int(0, 55, 5, 1);call #Ultimate.allocInit(13, 56);call #Ultimate.allocInit(24, 57);call #Ultimate.allocInit(216, 58);call #Ultimate.allocInit(4, 59);call write~init~int(37, 59, 0, 1);call write~init~int(115, 59, 1, 1);call write~init~int(10, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(4, 60);call write~init~int(37, 60, 0, 1);call write~init~int(115, 60, 1, 1);call write~init~int(10, 60, 2, 1);call write~init~int(0, 60, 3, 1);call #Ultimate.allocInit(24, 61);call #Ultimate.allocInit(17, 62);~ldv_irq_data_2_1~0.base, ~ldv_irq_data_2_1~0.offset := 0, 0;~ldv_irq_dev_1_1~0.base, ~ldv_irq_dev_1_1~0.offset := 0, 0;~ldv_irq_1_3~0 := 0;~ldv_irq_line_2_2~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_0~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_irq_line_2_1~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_2_0~0 := 0;~ldv_irq_dev_1_3~0.base, ~ldv_irq_dev_1_3~0.offset := 0, 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ldv_irq_dev_1_0~0.base, ~ldv_irq_dev_1_0~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_irq_data_2_0~0.base, ~ldv_irq_data_2_0~0.offset := 0, 0;~ldv_irq_dev_2_3~0.base, ~ldv_irq_dev_2_3~0.offset := 0, 0;~ldv_irq_dev_2_0~0.base, ~ldv_irq_dev_2_0~0.offset := 0, 0;~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_1~0 := 0;~ldv_irq_2_3~0 := 0;~st21nfca_hci_i2c_driver_group0~0.base, ~st21nfca_hci_i2c_driver_group0~0.offset := 0, 0;~ldv_irq_data_2_3~0.base, ~ldv_irq_data_2_3~0.offset := 0, 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_2_2~0 := 0;~ldv_irq_dev_1_2~0.base, ~ldv_irq_dev_1_2~0.offset := 0, 0;~ldv_irq_line_2_0~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_irq_dev_2_1~0.base, ~ldv_irq_dev_2_1~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_data_2_2~0.base, ~ldv_irq_data_2_2~0.offset := 0, 0;~ldv_irq_line_1_1~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~ldv_state_variable_4~0 := 0;~ldv_irq_dev_2_2~0.base, ~ldv_irq_dev_2_2~0.offset := 0, 0;~ldv_irq_line_2_3~0 := 0;~ldv_irq_2_1~0 := 0;~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset := 63, 0;call #Ultimate.allocInit(56, 63);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#st21nfca_hci_i2c_id_table~0.base);call write~unchecked~int(115, ~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(116, ~#st21nfca_hci_i2c_id_table~0.base, 1 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(50, ~#st21nfca_hci_i2c_id_table~0.base, 2 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(49, ~#st21nfca_hci_i2c_id_table~0.base, 3 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(110, ~#st21nfca_hci_i2c_id_table~0.base, 4 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(102, ~#st21nfca_hci_i2c_id_table~0.base, 5 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(99, ~#st21nfca_hci_i2c_id_table~0.base, 6 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(97, ~#st21nfca_hci_i2c_id_table~0.base, 7 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(95, ~#st21nfca_hci_i2c_id_table~0.base, 8 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(104, ~#st21nfca_hci_i2c_id_table~0.base, 9 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(99, ~#st21nfca_hci_i2c_id_table~0.base, 10 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(105, ~#st21nfca_hci_i2c_id_table~0.base, 11 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(0, ~#st21nfca_hci_i2c_id_table~0.base, 12 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(0, ~#st21nfca_hci_i2c_id_table~0.base, 20 + ~#st21nfca_hci_i2c_id_table~0.offset, 8);~__mod_i2c__st21nfca_hci_i2c_id_table_device_table~0.name := ~const~array~~LB~int~RB~int();~__mod_i2c__st21nfca_hci_i2c_id_table_device_table~0.driver_data := 0;~#len_seq~0.base, ~#len_seq~0.offset := 64, 0;call #Ultimate.allocInit(4, 64);call write~init~int(13, ~#len_seq~0.base, ~#len_seq~0.offset, 1);call write~init~int(24, ~#len_seq~0.base, 1 + ~#len_seq~0.offset, 1);call write~init~int(15, ~#len_seq~0.base, 2 + ~#len_seq~0.offset, 1);call write~init~int(29, ~#len_seq~0.base, 3 + ~#len_seq~0.offset, 1);~#wait_tab~0.base, ~#wait_tab~0.offset := 65, 0;call #Ultimate.allocInit(12, 65);call write~init~int(2, ~#wait_tab~0.base, ~#wait_tab~0.offset, 2);call write~init~int(3, ~#wait_tab~0.base, 2 + ~#wait_tab~0.offset, 2);call write~init~int(5, ~#wait_tab~0.base, 4 + ~#wait_tab~0.offset, 2);call write~init~int(15, ~#wait_tab~0.base, 6 + ~#wait_tab~0.offset, 2);call write~init~int(20, ~#wait_tab~0.base, 8 + ~#wait_tab~0.offset, 2);call write~init~int(40, ~#wait_tab~0.base, 10 + ~#wait_tab~0.offset, 2);~#i2c_phy_ops~0.base, ~#i2c_phy_ops~0.offset := 66, 0;call #Ultimate.allocInit(24, 66);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_write.base, #funAddr~st21nfca_hci_i2c_write.offset, ~#i2c_phy_ops~0.base, ~#i2c_phy_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_enable.base, #funAddr~st21nfca_hci_i2c_enable.offset, ~#i2c_phy_ops~0.base, 8 + ~#i2c_phy_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_disable.base, #funAddr~st21nfca_hci_i2c_disable.offset, ~#i2c_phy_ops~0.base, 16 + ~#i2c_phy_ops~0.offset, 8);~#st21nfca_hci_i2c_driver~0.base, ~#st21nfca_hci_i2c_driver~0.offset := 67, 0;call #Ultimate.allocInit(221, 67);call write~init~int(0, ~#st21nfca_hci_i2c_driver~0.base, ~#st21nfca_hci_i2c_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 4 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_probe.base, #funAddr~st21nfca_hci_i2c_probe.offset, ~#st21nfca_hci_i2c_driver~0.base, 12 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_remove.base, #funAddr~st21nfca_hci_i2c_remove.offset, ~#st21nfca_hci_i2c_driver~0.base, 20 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 28 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 36 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 44 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 52 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 60 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(62, 0, ~#st21nfca_hci_i2c_driver~0.base, 68 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 76 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#st21nfca_hci_i2c_driver~0.base, 84 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 92 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~int(0, ~#st21nfca_hci_i2c_driver~0.base, 100 + ~#st21nfca_hci_i2c_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 101 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 109 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 117 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 125 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 133 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 141 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 149 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 157 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 165 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 173 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset, ~#st21nfca_hci_i2c_driver~0.base, 181 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 189 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 197 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 205 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 213 + ~#st21nfca_hci_i2c_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_spin~0 := 0; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret333#1.base, main_#t~ret333#1.offset, main_#t~ret334#1.base, main_#t~ret334#1.offset, main_#t~ret335#1.base, main_#t~ret335#1.offset, main_#t~ret336#1.base, main_#t~ret336#1.offset, main_#t~ret337#1.base, main_#t~ret337#1.offset, main_#t~nondet338#1, main_#t~switch339#1, main_#t~nondet340#1, main_#t~switch341#1, main_#t~ret342#1, main_#t~ret343#1, main_#t~nondet344#1, main_#t~switch345#1, main_#t~ret346#1, main_#t~nondet347#1, main_#t~switch348#1, main_#t~ret349#1, main_#t~ret350#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~26#1.base, main_~tmp~26#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~26#1.base, main_~tmp~26#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,394 INFO L272 TraceCheckUtils]: 2: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} call main_#t~ret333#1.base, main_#t~ret333#1.offset := ldv_zalloc(1); {17350#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:40,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {17350#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {17322#true} is VALID [2022-02-20 22:01:40,395 INFO L290 TraceCheckUtils]: 4: Hoare triple {17322#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17322#true} is VALID [2022-02-20 22:01:40,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {17322#true} assume true; {17322#true} is VALID [2022-02-20 22:01:40,395 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {17322#true} {17324#(= ~ldv_irq_1_1~0 0)} #1284#return; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} main_~tmp~26#1.base, main_~tmp~26#1.offset := main_#t~ret333#1.base, main_#t~ret333#1.offset;havoc main_#t~ret333#1.base, main_#t~ret333#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~26#1.base, main_~tmp~26#1.offset; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,396 INFO L272 TraceCheckUtils]: 8: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} call main_#t~ret334#1.base, main_#t~ret334#1.offset := ldv_zalloc(1); {17350#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:40,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {17350#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {17322#true} is VALID [2022-02-20 22:01:40,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {17322#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17322#true} is VALID [2022-02-20 22:01:40,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {17322#true} assume true; {17322#true} is VALID [2022-02-20 22:01:40,397 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {17322#true} {17324#(= ~ldv_irq_1_1~0 0)} #1286#return; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset := main_#t~ret334#1.base, main_#t~ret334#1.offset;havoc main_#t~ret334#1.base, main_#t~ret334#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,398 INFO L272 TraceCheckUtils]: 14: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} call main_#t~ret335#1.base, main_#t~ret335#1.offset := ldv_zalloc(1); {17350#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:40,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {17350#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {17322#true} is VALID [2022-02-20 22:01:40,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {17322#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17322#true} is VALID [2022-02-20 22:01:40,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {17322#true} assume true; {17322#true} is VALID [2022-02-20 22:01:40,399 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17322#true} {17324#(= ~ldv_irq_1_1~0 0)} #1288#return; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset := main_#t~ret335#1.base, main_#t~ret335#1.offset;havoc main_#t~ret335#1.base, main_#t~ret335#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,400 INFO L272 TraceCheckUtils]: 20: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} call main_#t~ret336#1.base, main_#t~ret336#1.offset := ldv_zalloc(232); {17350#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:40,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {17350#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {17322#true} is VALID [2022-02-20 22:01:40,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {17322#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17322#true} is VALID [2022-02-20 22:01:40,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {17322#true} assume true; {17322#true} is VALID [2022-02-20 22:01:40,401 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {17322#true} {17324#(= ~ldv_irq_1_1~0 0)} #1290#return; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,401 INFO L290 TraceCheckUtils]: 25: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset := main_#t~ret336#1.base, main_#t~ret336#1.offset;havoc main_#t~ret336#1.base, main_#t~ret336#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,402 INFO L272 TraceCheckUtils]: 26: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} call main_#t~ret337#1.base, main_#t~ret337#1.offset := ldv_zalloc(32); {17350#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:40,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {17350#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {17322#true} is VALID [2022-02-20 22:01:40,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {17322#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {17322#true} is VALID [2022-02-20 22:01:40,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {17322#true} assume true; {17322#true} is VALID [2022-02-20 22:01:40,410 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {17322#true} {17324#(= ~ldv_irq_1_1~0 0)} #1292#return; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset := main_#t~ret337#1.base, main_#t~ret337#1.offset;havoc main_#t~ret337#1.base, main_#t~ret337#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset;assume { :begin_inline_ldv_initialize } true; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_4~0 := 0;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 1; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} assume -2147483648 <= main_#t~nondet338#1 && main_#t~nondet338#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet338#1;havoc main_#t~nondet338#1;main_#t~switch339#1 := 0 == main_~tmp___4~0#1; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} assume !main_#t~switch339#1;main_#t~switch339#1 := main_#t~switch339#1 || 1 == main_~tmp___4~0#1; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} assume main_#t~switch339#1; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} assume 0 != ~ldv_state_variable_1~0;assume { :begin_inline_choose_interrupt_1 } true;havoc choose_interrupt_1_#t~nondet326#1, choose_interrupt_1_#t~switch327#1, choose_interrupt_1_#t~ret328#1, choose_interrupt_1_#t~ret329#1, choose_interrupt_1_#t~ret330#1, choose_interrupt_1_#t~ret331#1, choose_interrupt_1_~tmp~24#1;havoc choose_interrupt_1_~tmp~24#1;assume -2147483648 <= choose_interrupt_1_#t~nondet326#1 && choose_interrupt_1_#t~nondet326#1 <= 2147483647;choose_interrupt_1_~tmp~24#1 := choose_interrupt_1_#t~nondet326#1;havoc choose_interrupt_1_#t~nondet326#1;choose_interrupt_1_#t~switch327#1 := 0 == choose_interrupt_1_~tmp~24#1; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} assume !choose_interrupt_1_#t~switch327#1;choose_interrupt_1_#t~switch327#1 := choose_interrupt_1_#t~switch327#1 || 1 == choose_interrupt_1_~tmp~24#1; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} assume choose_interrupt_1_#t~switch327#1; {17324#(= ~ldv_irq_1_1~0 0)} is VALID [2022-02-20 22:01:40,414 INFO L272 TraceCheckUtils]: 39: Hoare triple {17324#(= ~ldv_irq_1_1~0 0)} call choose_interrupt_1_#t~ret329#1 := ldv_irq_1(~ldv_irq_1_1~0, ~ldv_irq_line_1_1~0, ~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset); {17345#(= |ldv_irq_1_#in~state#1| 0)} is VALID [2022-02-20 22:01:40,414 INFO L290 TraceCheckUtils]: 40: Hoare triple {17345#(= |ldv_irq_1_#in~state#1| 0)} ~state#1 := #in~state#1;~line#1 := #in~line#1;~data#1.base, ~data#1.offset := #in~data#1.base, #in~data#1.offset;havoc ~irq_retval~0#1;havoc ~tmp~22#1;havoc ~tmp___0~11#1; {17346#(= |ldv_irq_1_~state#1| 0)} is VALID [2022-02-20 22:01:40,414 INFO L290 TraceCheckUtils]: 41: Hoare triple {17346#(= |ldv_irq_1_~state#1| 0)} assume 0 != ~state#1;assume -2147483648 <= #t~nondet318#1 && #t~nondet318#1 <= 2147483647;~tmp~22#1 := #t~nondet318#1;havoc #t~nondet318#1;#t~switch319#1 := 0 == ~tmp~22#1; {17323#false} is VALID [2022-02-20 22:01:40,414 INFO L290 TraceCheckUtils]: 42: Hoare triple {17323#false} assume !#t~switch319#1;#t~switch319#1 := #t~switch319#1 || 1 == ~tmp~22#1; {17323#false} is VALID [2022-02-20 22:01:40,414 INFO L290 TraceCheckUtils]: 43: Hoare triple {17323#false} assume #t~switch319#1; {17323#false} is VALID [2022-02-20 22:01:40,415 INFO L290 TraceCheckUtils]: 44: Hoare triple {17323#false} assume 2 == ~state#1; {17323#false} is VALID [2022-02-20 22:01:40,415 INFO L272 TraceCheckUtils]: 45: Hoare triple {17323#false} call #t~ret321#1 := st21nfca_hci_irq_thread_fn(~line#1, ~data#1.base, ~data#1.offset); {17323#false} is VALID [2022-02-20 22:01:40,415 INFO L290 TraceCheckUtils]: 46: Hoare triple {17323#false} ~irq#1 := #in~irq#1;~phy_id#1.base, ~phy_id#1.offset := #in~phy_id#1.base, #in~phy_id#1.offset;havoc ~phy~3#1.base, ~phy~3#1.offset;havoc ~client~2#1.base, ~client~2#1.offset;havoc ~r~4#1;havoc ~__warned~0#1;havoc ~__ret_warn_once~0#1;havoc ~__ret_warn_on~0#1;havoc ~tmp~16#1;havoc ~tmp___0~8#1;havoc ~tmp___1~3#1;call ~#descriptor~1#1.base, ~#descriptor~1#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp___2~2#1;~phy~3#1.base, ~phy~3#1.offset := ~phy_id#1.base, ~phy_id#1.offset;#t~short225#1 := 0 == (~phy~3#1.base + ~phy~3#1.offset) % 18446744073709551616; {17323#false} is VALID [2022-02-20 22:01:40,415 INFO L290 TraceCheckUtils]: 47: Hoare triple {17323#false} assume #t~short225#1; {17323#false} is VALID [2022-02-20 22:01:40,415 INFO L290 TraceCheckUtils]: 48: Hoare triple {17323#false} assume !#t~short225#1;havoc #t~mem223#1.base, #t~mem223#1.offset;havoc #t~mem224#1;havoc #t~short225#1;call #t~mem230#1.base, #t~mem230#1.offset := read~$Pointer$(~phy~3#1.base, ~phy~3#1.offset, 8);~client~2#1.base, ~client~2#1.offset := #t~mem230#1.base, #t~mem230#1.offset;havoc #t~mem230#1.base, #t~mem230#1.offset;call write~$Pointer$(18, 0, ~#descriptor~1#1.base, ~#descriptor~1#1.offset, 8);call write~$Pointer$(19, 0, ~#descriptor~1#1.base, 8 + ~#descriptor~1#1.offset, 8);call write~$Pointer$(20, 0, ~#descriptor~1#1.base, 16 + ~#descriptor~1#1.offset, 8);call write~$Pointer$(21, 0, ~#descriptor~1#1.base, 24 + ~#descriptor~1#1.offset, 8);call write~int(526, ~#descriptor~1#1.base, 32 + ~#descriptor~1#1.offset, 4);call write~int(0, ~#descriptor~1#1.base, 36 + ~#descriptor~1#1.offset, 1);call #t~mem231#1 := read~int(~#descriptor~1#1.base, 36 + ~#descriptor~1#1.offset, 1); {17323#false} is VALID [2022-02-20 22:01:40,415 INFO L272 TraceCheckUtils]: 49: Hoare triple {17323#false} call #t~ret232#1 := ldv__builtin_expect(#t~mem231#1 % 256, 0); {17322#true} is VALID [2022-02-20 22:01:40,415 INFO L290 TraceCheckUtils]: 50: Hoare triple {17322#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {17322#true} is VALID [2022-02-20 22:01:40,415 INFO L290 TraceCheckUtils]: 51: Hoare triple {17322#true} assume true; {17322#true} is VALID [2022-02-20 22:01:40,416 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {17322#true} {17323#false} #1238#return; {17323#false} is VALID [2022-02-20 22:01:40,416 INFO L290 TraceCheckUtils]: 53: Hoare triple {17323#false} assume -9223372036854775808 <= #t~ret232#1 && #t~ret232#1 <= 9223372036854775807;~tmp___2~2#1 := #t~ret232#1;havoc #t~mem231#1;havoc #t~ret232#1; {17323#false} is VALID [2022-02-20 22:01:40,416 INFO L290 TraceCheckUtils]: 54: Hoare triple {17323#false} assume 0 != ~tmp___2~2#1;havoc #t~nondet233#1; {17323#false} is VALID [2022-02-20 22:01:40,416 INFO L290 TraceCheckUtils]: 55: Hoare triple {17323#false} call #t~mem234#1 := read~int(~phy~3#1.base, 52 + ~phy~3#1.offset, 4); {17323#false} is VALID [2022-02-20 22:01:40,416 INFO L290 TraceCheckUtils]: 56: Hoare triple {17323#false} assume !(0 != #t~mem234#1);havoc #t~mem234#1;call #t~mem235#1.base, #t~mem235#1.offset := read~$Pointer$(~phy~3#1.base, 28 + ~phy~3#1.offset, 8);assume { :begin_inline_st21nfca_hci_i2c_read } true;st21nfca_hci_i2c_read_#in~phy#1.base, st21nfca_hci_i2c_read_#in~phy#1.offset, st21nfca_hci_i2c_read_#in~skb#1.base, st21nfca_hci_i2c_read_#in~skb#1.offset := ~phy~3#1.base, ~phy~3#1.offset, #t~mem235#1.base, #t~mem235#1.offset;havoc st21nfca_hci_i2c_read_#res#1;havoc st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset, st21nfca_hci_i2c_read_#t~mem203#1, st21nfca_hci_i2c_read_#t~mem204#1, st21nfca_hci_i2c_read_#t~mem205#1, st21nfca_hci_i2c_read_#t~ret206#1, st21nfca_hci_i2c_read_#t~mem207#1, st21nfca_hci_i2c_read_#t~mem208#1, st21nfca_hci_i2c_read_#t~mem209#1, st21nfca_hci_i2c_read_#t~short210#1, st21nfca_hci_i2c_read_#t~mem211#1, st21nfca_hci_i2c_read_#t~mem212#1, st21nfca_hci_i2c_read_#t~mem213#1, st21nfca_hci_i2c_read_#t~short214#1, st21nfca_hci_i2c_read_#t~short215#1, st21nfca_hci_i2c_read_#t~ret216#1.base, st21nfca_hci_i2c_read_#t~ret216#1.offset, st21nfca_hci_i2c_read_#t~memcpy~res217#1.base, st21nfca_hci_i2c_read_#t~memcpy~res217#1.offset, st21nfca_hci_i2c_read_#t~mem219#1.base, st21nfca_hci_i2c_read_#t~mem219#1.offset, st21nfca_hci_i2c_read_#t~mem218#1, st21nfca_hci_i2c_read_#t~mem220#1, st21nfca_hci_i2c_read_#t~ret221#1, st21nfca_hci_i2c_read_#t~mem222#1, st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset, st21nfca_hci_i2c_read_~skb#1.base, st21nfca_hci_i2c_read_~skb#1.offset, st21nfca_hci_i2c_read_~r~3#1, st21nfca_hci_i2c_read_~i~3#1, st21nfca_hci_i2c_read_~len~1#1, st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset, st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset, st21nfca_hci_i2c_read_~__len~0#1, st21nfca_hci_i2c_read_~__ret~0#1.base, st21nfca_hci_i2c_read_~__ret~0#1.offset, st21nfca_hci_i2c_read_~tmp___0~7#1.base, st21nfca_hci_i2c_read_~tmp___0~7#1.offset, st21nfca_hci_i2c_read_~tmp___1~2#1;st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset := st21nfca_hci_i2c_read_#in~phy#1.base, st21nfca_hci_i2c_read_#in~phy#1.offset;st21nfca_hci_i2c_read_~skb#1.base, st21nfca_hci_i2c_read_~skb#1.offset := st21nfca_hci_i2c_read_#in~skb#1.base, st21nfca_hci_i2c_read_#in~skb#1.offset;havoc st21nfca_hci_i2c_read_~r~3#1;havoc st21nfca_hci_i2c_read_~i~3#1;havoc st21nfca_hci_i2c_read_~len~1#1;call st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset := #Ultimate.allocOnStack(29);havoc st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset;havoc st21nfca_hci_i2c_read_~__len~0#1;havoc st21nfca_hci_i2c_read_~__ret~0#1.base, st21nfca_hci_i2c_read_~__ret~0#1.offset;havoc st21nfca_hci_i2c_read_~tmp___0~7#1.base, st21nfca_hci_i2c_read_~tmp___0~7#1.offset;havoc st21nfca_hci_i2c_read_~tmp___1~2#1;call st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset := read~$Pointer$(st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset, 8);st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset := st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset;havoc st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset;call st21nfca_hci_i2c_read_#t~mem203#1 := read~int(st21nfca_hci_i2c_read_~phy#1.base, 36 + st21nfca_hci_i2c_read_~phy#1.offset, 4); {17323#false} is VALID [2022-02-20 22:01:40,416 INFO L290 TraceCheckUtils]: 57: Hoare triple {17323#false} assume !(st21nfca_hci_i2c_read_#t~mem203#1 % 4294967296 <= 3);havoc st21nfca_hci_i2c_read_#t~mem203#1;st21nfca_hci_i2c_read_#res#1 := -5;call ULTIMATE.dealloc(st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset);havoc st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset; {17323#false} is VALID [2022-02-20 22:01:40,417 INFO L290 TraceCheckUtils]: 58: Hoare triple {17323#false} #t~ret236#1 := st21nfca_hci_i2c_read_#res#1;assume { :end_inline_st21nfca_hci_i2c_read } true;assume -2147483648 <= #t~ret236#1 && #t~ret236#1 <= 2147483647;~r~4#1 := #t~ret236#1;havoc #t~mem235#1.base, #t~mem235#1.offset;havoc #t~ret236#1; {17323#false} is VALID [2022-02-20 22:01:40,417 INFO L290 TraceCheckUtils]: 59: Hoare triple {17323#false} assume !(-121 == ~r~4#1); {17323#false} is VALID [2022-02-20 22:01:40,417 INFO L290 TraceCheckUtils]: 60: Hoare triple {17323#false} assume !(-11 == ~r~4#1 || -5 == ~r~4#1);#t~short239#1 := -74 == ~r~4#1; {17323#false} is VALID [2022-02-20 22:01:40,417 INFO L290 TraceCheckUtils]: 61: Hoare triple {17323#false} assume #t~short239#1;call #t~mem238#1 := read~int(~phy~3#1.base, 40 + ~phy~3#1.offset, 4);#t~short239#1 := #t~mem238#1 % 4294967296 <= 5; {17323#false} is VALID [2022-02-20 22:01:40,417 INFO L290 TraceCheckUtils]: 62: Hoare triple {17323#false} assume !#t~short239#1;havoc #t~mem238#1;havoc #t~short239#1; {17323#false} is VALID [2022-02-20 22:01:40,417 INFO L290 TraceCheckUtils]: 63: Hoare triple {17323#false} assume !(~r~4#1 > 0); {17323#false} is VALID [2022-02-20 22:01:40,417 INFO L272 TraceCheckUtils]: 64: Hoare triple {17323#false} call #t~ret246#1.base, #t~ret246#1.offset := alloc_skb(74, 208); {17323#false} is VALID [2022-02-20 22:01:40,417 INFO L290 TraceCheckUtils]: 65: Hoare triple {17323#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~28#1.base, ~tmp~28#1.offset; {17323#false} is VALID [2022-02-20 22:01:40,418 INFO L272 TraceCheckUtils]: 66: Hoare triple {17323#false} call ldv_check_alloc_flags(~flags#1); {17323#false} is VALID [2022-02-20 22:01:40,418 INFO L290 TraceCheckUtils]: 67: Hoare triple {17323#false} ~flags := #in~flags; {17323#false} is VALID [2022-02-20 22:01:40,418 INFO L290 TraceCheckUtils]: 68: Hoare triple {17323#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {17323#false} is VALID [2022-02-20 22:01:40,418 INFO L272 TraceCheckUtils]: 69: Hoare triple {17323#false} call ldv_error(); {17323#false} is VALID [2022-02-20 22:01:40,418 INFO L290 TraceCheckUtils]: 70: Hoare triple {17323#false} assume !false; {17323#false} is VALID [2022-02-20 22:01:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 22:01:40,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:01:40,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591865722] [2022-02-20 22:01:40,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591865722] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:01:40,419 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:01:40,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:01:40,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097905237] [2022-02-20 22:01:40,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:01:40,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71 [2022-02-20 22:01:40,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:01:40,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:40,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:01:40,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:01:40,463 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:01:40,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:01:40,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:01:40,463 INFO L87 Difference]: Start difference. First operand 1966 states and 2704 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:01:47,286 INFO L93 Difference]: Finished difference Result 4486 states and 6214 transitions. [2022-02-20 22:01:47,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 22:01:47,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 71 [2022-02-20 22:01:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:01:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:47,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2160 transitions. [2022-02-20 22:01:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2160 transitions. [2022-02-20 22:01:47,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2160 transitions. [2022-02-20 22:01:48,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2160 edges. 2160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:01:49,330 INFO L225 Difference]: With dead ends: 4486 [2022-02-20 22:01:49,330 INFO L226 Difference]: Without dead ends: 3138 [2022-02-20 22:01:49,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 22:01:49,334 INFO L933 BasicCegarLoop]: 762 mSDtfsCounter, 873 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 22:01:49,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [943 Valid, 2749 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-02-20 22:01:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2022-02-20 22:01:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2949. [2022-02-20 22:01:49,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:01:49,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3138 states. Second operand has 2949 states, 2261 states have (on average 1.346749226006192) internal successors, (3045), 2289 states have internal predecessors, (3045), 502 states have call successors, (502), 188 states have call predecessors, (502), 185 states have return successors, (503), 481 states have call predecessors, (503), 501 states have call successors, (503) [2022-02-20 22:01:49,403 INFO L74 IsIncluded]: Start isIncluded. First operand 3138 states. Second operand has 2949 states, 2261 states have (on average 1.346749226006192) internal successors, (3045), 2289 states have internal predecessors, (3045), 502 states have call successors, (502), 188 states have call predecessors, (502), 185 states have return successors, (503), 481 states have call predecessors, (503), 501 states have call successors, (503) [2022-02-20 22:01:49,408 INFO L87 Difference]: Start difference. First operand 3138 states. Second operand has 2949 states, 2261 states have (on average 1.346749226006192) internal successors, (3045), 2289 states have internal predecessors, (3045), 502 states have call successors, (502), 188 states have call predecessors, (502), 185 states have return successors, (503), 481 states have call predecessors, (503), 501 states have call successors, (503) [2022-02-20 22:01:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:01:49,716 INFO L93 Difference]: Finished difference Result 3138 states and 4366 transitions. [2022-02-20 22:01:49,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 4366 transitions. [2022-02-20 22:01:49,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:01:49,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:01:49,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 2949 states, 2261 states have (on average 1.346749226006192) internal successors, (3045), 2289 states have internal predecessors, (3045), 502 states have call successors, (502), 188 states have call predecessors, (502), 185 states have return successors, (503), 481 states have call predecessors, (503), 501 states have call successors, (503) Second operand 3138 states. [2022-02-20 22:01:49,736 INFO L87 Difference]: Start difference. First operand has 2949 states, 2261 states have (on average 1.346749226006192) internal successors, (3045), 2289 states have internal predecessors, (3045), 502 states have call successors, (502), 188 states have call predecessors, (502), 185 states have return successors, (503), 481 states have call predecessors, (503), 501 states have call successors, (503) Second operand 3138 states. [2022-02-20 22:01:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:01:50,065 INFO L93 Difference]: Finished difference Result 3138 states and 4366 transitions. [2022-02-20 22:01:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 4366 transitions. [2022-02-20 22:01:50,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:01:50,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:01:50,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:01:50,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:01:50,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 2261 states have (on average 1.346749226006192) internal successors, (3045), 2289 states have internal predecessors, (3045), 502 states have call successors, (502), 188 states have call predecessors, (502), 185 states have return successors, (503), 481 states have call predecessors, (503), 501 states have call successors, (503) [2022-02-20 22:01:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4050 transitions. [2022-02-20 22:01:50,459 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4050 transitions. Word has length 71 [2022-02-20 22:01:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:01:50,460 INFO L470 AbstractCegarLoop]: Abstraction has 2949 states and 4050 transitions. [2022-02-20 22:01:50,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:50,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4050 transitions. [2022-02-20 22:01:50,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-02-20 22:01:50,462 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:01:50,462 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:01:50,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 22:01:50,462 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:01:50,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:01:50,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1962778040, now seen corresponding path program 1 times [2022-02-20 22:01:50,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:01:50,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163388834] [2022-02-20 22:01:50,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:01:50,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:01:50,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:50,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:01:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:50,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {33755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {33727#true} is VALID [2022-02-20 22:01:50,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {33727#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {33727#true} is VALID [2022-02-20 22:01:50,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {33727#true} assume true; {33727#true} is VALID [2022-02-20 22:01:50,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33727#true} {33729#(= ~ldv_irq_1_2~0 0)} #1284#return; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:01:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:50,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {33755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {33727#true} is VALID [2022-02-20 22:01:50,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {33727#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {33727#true} is VALID [2022-02-20 22:01:50,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {33727#true} assume true; {33727#true} is VALID [2022-02-20 22:01:50,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33727#true} {33729#(= ~ldv_irq_1_2~0 0)} #1286#return; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:01:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:50,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {33755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {33727#true} is VALID [2022-02-20 22:01:50,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {33727#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {33727#true} is VALID [2022-02-20 22:01:50,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {33727#true} assume true; {33727#true} is VALID [2022-02-20 22:01:50,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33727#true} {33729#(= ~ldv_irq_1_2~0 0)} #1288#return; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 22:01:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:50,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {33755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {33727#true} is VALID [2022-02-20 22:01:50,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {33727#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {33727#true} is VALID [2022-02-20 22:01:50,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {33727#true} assume true; {33727#true} is VALID [2022-02-20 22:01:50,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33727#true} {33729#(= ~ldv_irq_1_2~0 0)} #1290#return; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 22:01:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:50,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {33755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {33727#true} is VALID [2022-02-20 22:01:50,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {33727#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {33727#true} is VALID [2022-02-20 22:01:50,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {33727#true} assume true; {33727#true} is VALID [2022-02-20 22:01:50,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33727#true} {33729#(= ~ldv_irq_1_2~0 0)} #1292#return; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 22:01:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:01:50,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {33727#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {33727#true} is VALID [2022-02-20 22:01:50,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {33727#true} assume true; {33727#true} is VALID [2022-02-20 22:01:50,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33727#true} {33728#false} #1238#return; {33728#false} is VALID [2022-02-20 22:01:50,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {33727#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(108, 2);call #Ultimate.allocInit(17, 3);call #Ultimate.allocInit(13, 4);call #Ultimate.allocInit(23, 5);call #Ultimate.allocInit(216, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(115, 7, 1, 1);call write~init~int(58, 7, 2, 1);call write~init~int(10, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(23, 9);call #Ultimate.allocInit(2, 10);call write~init~int(15, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(6, 11);call write~init~int(105, 11, 0, 1);call write~init~int(50, 11, 1, 1);call write~init~int(99, 11, 2, 1);call write~init~int(58, 11, 3, 1);call write~init~int(32, 11, 4, 1);call write~init~int(0, 11, 5, 1);call #Ultimate.allocInit(58, 12);call #Ultimate.allocInit(58, 13);call #Ultimate.allocInit(10, 14);call #Ultimate.allocInit(2, 15);call write~init~int(15, 15, 0, 1);call write~init~int(0, 15, 1, 1);call #Ultimate.allocInit(6, 16);call write~init~int(99, 16, 0, 1);call write~init~int(114, 16, 1, 1);call write~init~int(99, 16, 2, 1);call write~init~int(58, 16, 3, 1);call write~init~int(32, 16, 4, 1);call write~init~int(0, 16, 5, 1);call #Ultimate.allocInit(216, 17);call #Ultimate.allocInit(13, 18);call #Ultimate.allocInit(27, 19);call #Ultimate.allocInit(216, 20);call #Ultimate.allocInit(5, 21);call write~init~int(73, 21, 0, 1);call write~init~int(82, 21, 1, 1);call write~init~int(81, 21, 2, 1);call write~init~int(10, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(5, 22);call write~init~int(73, 22, 0, 1);call write~init~int(82, 22, 1, 1);call write~init~int(81, 22, 2, 1);call write~init~int(10, 22, 3, 1);call write~init~int(0, 22, 4, 1);call #Ultimate.allocInit(23, 23);call #Ultimate.allocInit(8, 24);call #Ultimate.allocInit(41, 25);call #Ultimate.allocInit(216, 26);call #Ultimate.allocInit(49, 27);call #Ultimate.allocInit(216, 28);call #Ultimate.allocInit(11, 29);call #Ultimate.allocInit(45, 30);call #Ultimate.allocInit(216, 31);call #Ultimate.allocInit(54, 32);call #Ultimate.allocInit(216, 33);call #Ultimate.allocInit(52, 34);call #Ultimate.allocInit(13, 35);call #Ultimate.allocInit(23, 36);call #Ultimate.allocInit(216, 37);call #Ultimate.allocInit(4, 38);call write~init~int(37, 38, 0, 1);call write~init~int(115, 38, 1, 1);call write~init~int(10, 38, 2, 1);call write~init~int(0, 38, 3, 1);call #Ultimate.allocInit(4, 39);call write~init~int(37, 39, 0, 1);call write~init~int(115, 39, 1, 1);call write~init~int(10, 39, 2, 1);call write~init~int(0, 39, 3, 1);call #Ultimate.allocInit(23, 40);call #Ultimate.allocInit(13, 41);call #Ultimate.allocInit(23, 42);call #Ultimate.allocInit(216, 43);call #Ultimate.allocInit(9, 44);call #Ultimate.allocInit(9, 45);call #Ultimate.allocInit(24, 46);call #Ultimate.allocInit(51, 47);call #Ultimate.allocInit(15, 48);call #Ultimate.allocInit(23, 49);call #Ultimate.allocInit(36, 50);call #Ultimate.allocInit(48, 51);call #Ultimate.allocInit(32, 52);call #Ultimate.allocInit(13, 53);call #Ultimate.allocInit(37, 54);call #Ultimate.allocInit(6, 55);call write~init~int(115, 55, 0, 1);call write~init~int(104, 55, 1, 1);call write~init~int(100, 55, 2, 1);call write~init~int(108, 55, 3, 1);call write~init~int(99, 55, 4, 1);call write~init~int(0, 55, 5, 1);call #Ultimate.allocInit(13, 56);call #Ultimate.allocInit(24, 57);call #Ultimate.allocInit(216, 58);call #Ultimate.allocInit(4, 59);call write~init~int(37, 59, 0, 1);call write~init~int(115, 59, 1, 1);call write~init~int(10, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(4, 60);call write~init~int(37, 60, 0, 1);call write~init~int(115, 60, 1, 1);call write~init~int(10, 60, 2, 1);call write~init~int(0, 60, 3, 1);call #Ultimate.allocInit(24, 61);call #Ultimate.allocInit(17, 62);~ldv_irq_data_2_1~0.base, ~ldv_irq_data_2_1~0.offset := 0, 0;~ldv_irq_dev_1_1~0.base, ~ldv_irq_dev_1_1~0.offset := 0, 0;~ldv_irq_1_3~0 := 0;~ldv_irq_line_2_2~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_0~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_irq_line_2_1~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_2_0~0 := 0;~ldv_irq_dev_1_3~0.base, ~ldv_irq_dev_1_3~0.offset := 0, 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ldv_irq_dev_1_0~0.base, ~ldv_irq_dev_1_0~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_irq_data_2_0~0.base, ~ldv_irq_data_2_0~0.offset := 0, 0;~ldv_irq_dev_2_3~0.base, ~ldv_irq_dev_2_3~0.offset := 0, 0;~ldv_irq_dev_2_0~0.base, ~ldv_irq_dev_2_0~0.offset := 0, 0;~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_1~0 := 0;~ldv_irq_2_3~0 := 0;~st21nfca_hci_i2c_driver_group0~0.base, ~st21nfca_hci_i2c_driver_group0~0.offset := 0, 0;~ldv_irq_data_2_3~0.base, ~ldv_irq_data_2_3~0.offset := 0, 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_2_2~0 := 0;~ldv_irq_dev_1_2~0.base, ~ldv_irq_dev_1_2~0.offset := 0, 0;~ldv_irq_line_2_0~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_irq_dev_2_1~0.base, ~ldv_irq_dev_2_1~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_data_2_2~0.base, ~ldv_irq_data_2_2~0.offset := 0, 0;~ldv_irq_line_1_1~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~ldv_state_variable_4~0 := 0;~ldv_irq_dev_2_2~0.base, ~ldv_irq_dev_2_2~0.offset := 0, 0;~ldv_irq_line_2_3~0 := 0;~ldv_irq_2_1~0 := 0;~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset := 63, 0;call #Ultimate.allocInit(56, 63);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#st21nfca_hci_i2c_id_table~0.base);call write~unchecked~int(115, ~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(116, ~#st21nfca_hci_i2c_id_table~0.base, 1 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(50, ~#st21nfca_hci_i2c_id_table~0.base, 2 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(49, ~#st21nfca_hci_i2c_id_table~0.base, 3 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(110, ~#st21nfca_hci_i2c_id_table~0.base, 4 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(102, ~#st21nfca_hci_i2c_id_table~0.base, 5 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(99, ~#st21nfca_hci_i2c_id_table~0.base, 6 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(97, ~#st21nfca_hci_i2c_id_table~0.base, 7 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(95, ~#st21nfca_hci_i2c_id_table~0.base, 8 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(104, ~#st21nfca_hci_i2c_id_table~0.base, 9 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(99, ~#st21nfca_hci_i2c_id_table~0.base, 10 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(105, ~#st21nfca_hci_i2c_id_table~0.base, 11 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(0, ~#st21nfca_hci_i2c_id_table~0.base, 12 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(0, ~#st21nfca_hci_i2c_id_table~0.base, 20 + ~#st21nfca_hci_i2c_id_table~0.offset, 8);~__mod_i2c__st21nfca_hci_i2c_id_table_device_table~0.name := ~const~array~~LB~int~RB~int();~__mod_i2c__st21nfca_hci_i2c_id_table_device_table~0.driver_data := 0;~#len_seq~0.base, ~#len_seq~0.offset := 64, 0;call #Ultimate.allocInit(4, 64);call write~init~int(13, ~#len_seq~0.base, ~#len_seq~0.offset, 1);call write~init~int(24, ~#len_seq~0.base, 1 + ~#len_seq~0.offset, 1);call write~init~int(15, ~#len_seq~0.base, 2 + ~#len_seq~0.offset, 1);call write~init~int(29, ~#len_seq~0.base, 3 + ~#len_seq~0.offset, 1);~#wait_tab~0.base, ~#wait_tab~0.offset := 65, 0;call #Ultimate.allocInit(12, 65);call write~init~int(2, ~#wait_tab~0.base, ~#wait_tab~0.offset, 2);call write~init~int(3, ~#wait_tab~0.base, 2 + ~#wait_tab~0.offset, 2);call write~init~int(5, ~#wait_tab~0.base, 4 + ~#wait_tab~0.offset, 2);call write~init~int(15, ~#wait_tab~0.base, 6 + ~#wait_tab~0.offset, 2);call write~init~int(20, ~#wait_tab~0.base, 8 + ~#wait_tab~0.offset, 2);call write~init~int(40, ~#wait_tab~0.base, 10 + ~#wait_tab~0.offset, 2);~#i2c_phy_ops~0.base, ~#i2c_phy_ops~0.offset := 66, 0;call #Ultimate.allocInit(24, 66);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_write.base, #funAddr~st21nfca_hci_i2c_write.offset, ~#i2c_phy_ops~0.base, ~#i2c_phy_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_enable.base, #funAddr~st21nfca_hci_i2c_enable.offset, ~#i2c_phy_ops~0.base, 8 + ~#i2c_phy_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_disable.base, #funAddr~st21nfca_hci_i2c_disable.offset, ~#i2c_phy_ops~0.base, 16 + ~#i2c_phy_ops~0.offset, 8);~#st21nfca_hci_i2c_driver~0.base, ~#st21nfca_hci_i2c_driver~0.offset := 67, 0;call #Ultimate.allocInit(221, 67);call write~init~int(0, ~#st21nfca_hci_i2c_driver~0.base, ~#st21nfca_hci_i2c_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 4 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_probe.base, #funAddr~st21nfca_hci_i2c_probe.offset, ~#st21nfca_hci_i2c_driver~0.base, 12 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_remove.base, #funAddr~st21nfca_hci_i2c_remove.offset, ~#st21nfca_hci_i2c_driver~0.base, 20 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 28 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 36 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 44 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 52 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 60 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(62, 0, ~#st21nfca_hci_i2c_driver~0.base, 68 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 76 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#st21nfca_hci_i2c_driver~0.base, 84 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 92 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~int(0, ~#st21nfca_hci_i2c_driver~0.base, 100 + ~#st21nfca_hci_i2c_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 101 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 109 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 117 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 125 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 133 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 141 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 149 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 157 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 165 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 173 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset, ~#st21nfca_hci_i2c_driver~0.base, 181 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 189 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 197 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 205 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 213 + ~#st21nfca_hci_i2c_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_spin~0 := 0; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret333#1.base, main_#t~ret333#1.offset, main_#t~ret334#1.base, main_#t~ret334#1.offset, main_#t~ret335#1.base, main_#t~ret335#1.offset, main_#t~ret336#1.base, main_#t~ret336#1.offset, main_#t~ret337#1.base, main_#t~ret337#1.offset, main_#t~nondet338#1, main_#t~switch339#1, main_#t~nondet340#1, main_#t~switch341#1, main_#t~ret342#1, main_#t~ret343#1, main_#t~nondet344#1, main_#t~switch345#1, main_#t~ret346#1, main_#t~nondet347#1, main_#t~switch348#1, main_#t~ret349#1, main_#t~ret350#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~26#1.base, main_~tmp~26#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~26#1.base, main_~tmp~26#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,597 INFO L272 TraceCheckUtils]: 2: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} call main_#t~ret333#1.base, main_#t~ret333#1.offset := ldv_zalloc(1); {33755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:50,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {33755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {33727#true} is VALID [2022-02-20 22:01:50,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {33727#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {33727#true} is VALID [2022-02-20 22:01:50,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {33727#true} assume true; {33727#true} is VALID [2022-02-20 22:01:50,598 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {33727#true} {33729#(= ~ldv_irq_1_2~0 0)} #1284#return; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} main_~tmp~26#1.base, main_~tmp~26#1.offset := main_#t~ret333#1.base, main_#t~ret333#1.offset;havoc main_#t~ret333#1.base, main_#t~ret333#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~26#1.base, main_~tmp~26#1.offset; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,598 INFO L272 TraceCheckUtils]: 8: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} call main_#t~ret334#1.base, main_#t~ret334#1.offset := ldv_zalloc(1); {33755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:50,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {33755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {33727#true} is VALID [2022-02-20 22:01:50,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {33727#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {33727#true} is VALID [2022-02-20 22:01:50,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {33727#true} assume true; {33727#true} is VALID [2022-02-20 22:01:50,599 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {33727#true} {33729#(= ~ldv_irq_1_2~0 0)} #1286#return; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset := main_#t~ret334#1.base, main_#t~ret334#1.offset;havoc main_#t~ret334#1.base, main_#t~ret334#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,600 INFO L272 TraceCheckUtils]: 14: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} call main_#t~ret335#1.base, main_#t~ret335#1.offset := ldv_zalloc(1); {33755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:50,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {33755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {33727#true} is VALID [2022-02-20 22:01:50,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {33727#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {33727#true} is VALID [2022-02-20 22:01:50,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {33727#true} assume true; {33727#true} is VALID [2022-02-20 22:01:50,607 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {33727#true} {33729#(= ~ldv_irq_1_2~0 0)} #1288#return; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset := main_#t~ret335#1.base, main_#t~ret335#1.offset;havoc main_#t~ret335#1.base, main_#t~ret335#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,610 INFO L272 TraceCheckUtils]: 20: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} call main_#t~ret336#1.base, main_#t~ret336#1.offset := ldv_zalloc(232); {33755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:50,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {33755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {33727#true} is VALID [2022-02-20 22:01:50,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {33727#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {33727#true} is VALID [2022-02-20 22:01:50,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {33727#true} assume true; {33727#true} is VALID [2022-02-20 22:01:50,611 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {33727#true} {33729#(= ~ldv_irq_1_2~0 0)} #1290#return; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset := main_#t~ret336#1.base, main_#t~ret336#1.offset;havoc main_#t~ret336#1.base, main_#t~ret336#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,612 INFO L272 TraceCheckUtils]: 26: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} call main_#t~ret337#1.base, main_#t~ret337#1.offset := ldv_zalloc(32); {33755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:01:50,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {33755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {33727#true} is VALID [2022-02-20 22:01:50,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {33727#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {33727#true} is VALID [2022-02-20 22:01:50,613 INFO L290 TraceCheckUtils]: 29: Hoare triple {33727#true} assume true; {33727#true} is VALID [2022-02-20 22:01:50,613 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {33727#true} {33729#(= ~ldv_irq_1_2~0 0)} #1292#return; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset := main_#t~ret337#1.base, main_#t~ret337#1.offset;havoc main_#t~ret337#1.base, main_#t~ret337#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset;assume { :begin_inline_ldv_initialize } true; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,614 INFO L290 TraceCheckUtils]: 32: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_4~0 := 0;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 1; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} assume -2147483648 <= main_#t~nondet338#1 && main_#t~nondet338#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet338#1;havoc main_#t~nondet338#1;main_#t~switch339#1 := 0 == main_~tmp___4~0#1; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,615 INFO L290 TraceCheckUtils]: 34: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} assume !main_#t~switch339#1;main_#t~switch339#1 := main_#t~switch339#1 || 1 == main_~tmp___4~0#1; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,615 INFO L290 TraceCheckUtils]: 35: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} assume main_#t~switch339#1; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} assume 0 != ~ldv_state_variable_1~0;assume { :begin_inline_choose_interrupt_1 } true;havoc choose_interrupt_1_#t~nondet326#1, choose_interrupt_1_#t~switch327#1, choose_interrupt_1_#t~ret328#1, choose_interrupt_1_#t~ret329#1, choose_interrupt_1_#t~ret330#1, choose_interrupt_1_#t~ret331#1, choose_interrupt_1_~tmp~24#1;havoc choose_interrupt_1_~tmp~24#1;assume -2147483648 <= choose_interrupt_1_#t~nondet326#1 && choose_interrupt_1_#t~nondet326#1 <= 2147483647;choose_interrupt_1_~tmp~24#1 := choose_interrupt_1_#t~nondet326#1;havoc choose_interrupt_1_#t~nondet326#1;choose_interrupt_1_#t~switch327#1 := 0 == choose_interrupt_1_~tmp~24#1; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} assume !choose_interrupt_1_#t~switch327#1;choose_interrupt_1_#t~switch327#1 := choose_interrupt_1_#t~switch327#1 || 1 == choose_interrupt_1_~tmp~24#1; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} assume !choose_interrupt_1_#t~switch327#1;choose_interrupt_1_#t~switch327#1 := choose_interrupt_1_#t~switch327#1 || 2 == choose_interrupt_1_~tmp~24#1; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,616 INFO L290 TraceCheckUtils]: 39: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} assume choose_interrupt_1_#t~switch327#1; {33729#(= ~ldv_irq_1_2~0 0)} is VALID [2022-02-20 22:01:50,617 INFO L272 TraceCheckUtils]: 40: Hoare triple {33729#(= ~ldv_irq_1_2~0 0)} call choose_interrupt_1_#t~ret330#1 := ldv_irq_1(~ldv_irq_1_2~0, ~ldv_irq_line_1_2~0, ~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset); {33750#(= |ldv_irq_1_#in~state#1| 0)} is VALID [2022-02-20 22:01:50,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {33750#(= |ldv_irq_1_#in~state#1| 0)} ~state#1 := #in~state#1;~line#1 := #in~line#1;~data#1.base, ~data#1.offset := #in~data#1.base, #in~data#1.offset;havoc ~irq_retval~0#1;havoc ~tmp~22#1;havoc ~tmp___0~11#1; {33751#(= |ldv_irq_1_~state#1| 0)} is VALID [2022-02-20 22:01:50,617 INFO L290 TraceCheckUtils]: 42: Hoare triple {33751#(= |ldv_irq_1_~state#1| 0)} assume 0 != ~state#1;assume -2147483648 <= #t~nondet318#1 && #t~nondet318#1 <= 2147483647;~tmp~22#1 := #t~nondet318#1;havoc #t~nondet318#1;#t~switch319#1 := 0 == ~tmp~22#1; {33728#false} is VALID [2022-02-20 22:01:50,618 INFO L290 TraceCheckUtils]: 43: Hoare triple {33728#false} assume !#t~switch319#1;#t~switch319#1 := #t~switch319#1 || 1 == ~tmp~22#1; {33728#false} is VALID [2022-02-20 22:01:50,618 INFO L290 TraceCheckUtils]: 44: Hoare triple {33728#false} assume #t~switch319#1; {33728#false} is VALID [2022-02-20 22:01:50,618 INFO L290 TraceCheckUtils]: 45: Hoare triple {33728#false} assume 2 == ~state#1; {33728#false} is VALID [2022-02-20 22:01:50,618 INFO L272 TraceCheckUtils]: 46: Hoare triple {33728#false} call #t~ret321#1 := st21nfca_hci_irq_thread_fn(~line#1, ~data#1.base, ~data#1.offset); {33728#false} is VALID [2022-02-20 22:01:50,618 INFO L290 TraceCheckUtils]: 47: Hoare triple {33728#false} ~irq#1 := #in~irq#1;~phy_id#1.base, ~phy_id#1.offset := #in~phy_id#1.base, #in~phy_id#1.offset;havoc ~phy~3#1.base, ~phy~3#1.offset;havoc ~client~2#1.base, ~client~2#1.offset;havoc ~r~4#1;havoc ~__warned~0#1;havoc ~__ret_warn_once~0#1;havoc ~__ret_warn_on~0#1;havoc ~tmp~16#1;havoc ~tmp___0~8#1;havoc ~tmp___1~3#1;call ~#descriptor~1#1.base, ~#descriptor~1#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp___2~2#1;~phy~3#1.base, ~phy~3#1.offset := ~phy_id#1.base, ~phy_id#1.offset;#t~short225#1 := 0 == (~phy~3#1.base + ~phy~3#1.offset) % 18446744073709551616; {33728#false} is VALID [2022-02-20 22:01:50,618 INFO L290 TraceCheckUtils]: 48: Hoare triple {33728#false} assume #t~short225#1; {33728#false} is VALID [2022-02-20 22:01:50,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {33728#false} assume !#t~short225#1;havoc #t~mem223#1.base, #t~mem223#1.offset;havoc #t~mem224#1;havoc #t~short225#1;call #t~mem230#1.base, #t~mem230#1.offset := read~$Pointer$(~phy~3#1.base, ~phy~3#1.offset, 8);~client~2#1.base, ~client~2#1.offset := #t~mem230#1.base, #t~mem230#1.offset;havoc #t~mem230#1.base, #t~mem230#1.offset;call write~$Pointer$(18, 0, ~#descriptor~1#1.base, ~#descriptor~1#1.offset, 8);call write~$Pointer$(19, 0, ~#descriptor~1#1.base, 8 + ~#descriptor~1#1.offset, 8);call write~$Pointer$(20, 0, ~#descriptor~1#1.base, 16 + ~#descriptor~1#1.offset, 8);call write~$Pointer$(21, 0, ~#descriptor~1#1.base, 24 + ~#descriptor~1#1.offset, 8);call write~int(526, ~#descriptor~1#1.base, 32 + ~#descriptor~1#1.offset, 4);call write~int(0, ~#descriptor~1#1.base, 36 + ~#descriptor~1#1.offset, 1);call #t~mem231#1 := read~int(~#descriptor~1#1.base, 36 + ~#descriptor~1#1.offset, 1); {33728#false} is VALID [2022-02-20 22:01:50,618 INFO L272 TraceCheckUtils]: 50: Hoare triple {33728#false} call #t~ret232#1 := ldv__builtin_expect(#t~mem231#1 % 256, 0); {33727#true} is VALID [2022-02-20 22:01:50,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {33727#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {33727#true} is VALID [2022-02-20 22:01:50,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {33727#true} assume true; {33727#true} is VALID [2022-02-20 22:01:50,619 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {33727#true} {33728#false} #1238#return; {33728#false} is VALID [2022-02-20 22:01:50,619 INFO L290 TraceCheckUtils]: 54: Hoare triple {33728#false} assume -9223372036854775808 <= #t~ret232#1 && #t~ret232#1 <= 9223372036854775807;~tmp___2~2#1 := #t~ret232#1;havoc #t~mem231#1;havoc #t~ret232#1; {33728#false} is VALID [2022-02-20 22:01:50,619 INFO L290 TraceCheckUtils]: 55: Hoare triple {33728#false} assume 0 != ~tmp___2~2#1;havoc #t~nondet233#1; {33728#false} is VALID [2022-02-20 22:01:50,619 INFO L290 TraceCheckUtils]: 56: Hoare triple {33728#false} call #t~mem234#1 := read~int(~phy~3#1.base, 52 + ~phy~3#1.offset, 4); {33728#false} is VALID [2022-02-20 22:01:50,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {33728#false} assume !(0 != #t~mem234#1);havoc #t~mem234#1;call #t~mem235#1.base, #t~mem235#1.offset := read~$Pointer$(~phy~3#1.base, 28 + ~phy~3#1.offset, 8);assume { :begin_inline_st21nfca_hci_i2c_read } true;st21nfca_hci_i2c_read_#in~phy#1.base, st21nfca_hci_i2c_read_#in~phy#1.offset, st21nfca_hci_i2c_read_#in~skb#1.base, st21nfca_hci_i2c_read_#in~skb#1.offset := ~phy~3#1.base, ~phy~3#1.offset, #t~mem235#1.base, #t~mem235#1.offset;havoc st21nfca_hci_i2c_read_#res#1;havoc st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset, st21nfca_hci_i2c_read_#t~mem203#1, st21nfca_hci_i2c_read_#t~mem204#1, st21nfca_hci_i2c_read_#t~mem205#1, st21nfca_hci_i2c_read_#t~ret206#1, st21nfca_hci_i2c_read_#t~mem207#1, st21nfca_hci_i2c_read_#t~mem208#1, st21nfca_hci_i2c_read_#t~mem209#1, st21nfca_hci_i2c_read_#t~short210#1, st21nfca_hci_i2c_read_#t~mem211#1, st21nfca_hci_i2c_read_#t~mem212#1, st21nfca_hci_i2c_read_#t~mem213#1, st21nfca_hci_i2c_read_#t~short214#1, st21nfca_hci_i2c_read_#t~short215#1, st21nfca_hci_i2c_read_#t~ret216#1.base, st21nfca_hci_i2c_read_#t~ret216#1.offset, st21nfca_hci_i2c_read_#t~memcpy~res217#1.base, st21nfca_hci_i2c_read_#t~memcpy~res217#1.offset, st21nfca_hci_i2c_read_#t~mem219#1.base, st21nfca_hci_i2c_read_#t~mem219#1.offset, st21nfca_hci_i2c_read_#t~mem218#1, st21nfca_hci_i2c_read_#t~mem220#1, st21nfca_hci_i2c_read_#t~ret221#1, st21nfca_hci_i2c_read_#t~mem222#1, st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset, st21nfca_hci_i2c_read_~skb#1.base, st21nfca_hci_i2c_read_~skb#1.offset, st21nfca_hci_i2c_read_~r~3#1, st21nfca_hci_i2c_read_~i~3#1, st21nfca_hci_i2c_read_~len~1#1, st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset, st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset, st21nfca_hci_i2c_read_~__len~0#1, st21nfca_hci_i2c_read_~__ret~0#1.base, st21nfca_hci_i2c_read_~__ret~0#1.offset, st21nfca_hci_i2c_read_~tmp___0~7#1.base, st21nfca_hci_i2c_read_~tmp___0~7#1.offset, st21nfca_hci_i2c_read_~tmp___1~2#1;st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset := st21nfca_hci_i2c_read_#in~phy#1.base, st21nfca_hci_i2c_read_#in~phy#1.offset;st21nfca_hci_i2c_read_~skb#1.base, st21nfca_hci_i2c_read_~skb#1.offset := st21nfca_hci_i2c_read_#in~skb#1.base, st21nfca_hci_i2c_read_#in~skb#1.offset;havoc st21nfca_hci_i2c_read_~r~3#1;havoc st21nfca_hci_i2c_read_~i~3#1;havoc st21nfca_hci_i2c_read_~len~1#1;call st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset := #Ultimate.allocOnStack(29);havoc st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset;havoc st21nfca_hci_i2c_read_~__len~0#1;havoc st21nfca_hci_i2c_read_~__ret~0#1.base, st21nfca_hci_i2c_read_~__ret~0#1.offset;havoc st21nfca_hci_i2c_read_~tmp___0~7#1.base, st21nfca_hci_i2c_read_~tmp___0~7#1.offset;havoc st21nfca_hci_i2c_read_~tmp___1~2#1;call st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset := read~$Pointer$(st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset, 8);st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset := st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset;havoc st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset;call st21nfca_hci_i2c_read_#t~mem203#1 := read~int(st21nfca_hci_i2c_read_~phy#1.base, 36 + st21nfca_hci_i2c_read_~phy#1.offset, 4); {33728#false} is VALID [2022-02-20 22:01:50,620 INFO L290 TraceCheckUtils]: 58: Hoare triple {33728#false} assume !(st21nfca_hci_i2c_read_#t~mem203#1 % 4294967296 <= 3);havoc st21nfca_hci_i2c_read_#t~mem203#1;st21nfca_hci_i2c_read_#res#1 := -5;call ULTIMATE.dealloc(st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset);havoc st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset; {33728#false} is VALID [2022-02-20 22:01:50,620 INFO L290 TraceCheckUtils]: 59: Hoare triple {33728#false} #t~ret236#1 := st21nfca_hci_i2c_read_#res#1;assume { :end_inline_st21nfca_hci_i2c_read } true;assume -2147483648 <= #t~ret236#1 && #t~ret236#1 <= 2147483647;~r~4#1 := #t~ret236#1;havoc #t~mem235#1.base, #t~mem235#1.offset;havoc #t~ret236#1; {33728#false} is VALID [2022-02-20 22:01:50,620 INFO L290 TraceCheckUtils]: 60: Hoare triple {33728#false} assume !(-121 == ~r~4#1); {33728#false} is VALID [2022-02-20 22:01:50,620 INFO L290 TraceCheckUtils]: 61: Hoare triple {33728#false} assume !(-11 == ~r~4#1 || -5 == ~r~4#1);#t~short239#1 := -74 == ~r~4#1; {33728#false} is VALID [2022-02-20 22:01:50,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {33728#false} assume #t~short239#1;call #t~mem238#1 := read~int(~phy~3#1.base, 40 + ~phy~3#1.offset, 4);#t~short239#1 := #t~mem238#1 % 4294967296 <= 5; {33728#false} is VALID [2022-02-20 22:01:50,621 INFO L290 TraceCheckUtils]: 63: Hoare triple {33728#false} assume !#t~short239#1;havoc #t~mem238#1;havoc #t~short239#1; {33728#false} is VALID [2022-02-20 22:01:50,621 INFO L290 TraceCheckUtils]: 64: Hoare triple {33728#false} assume !(~r~4#1 > 0); {33728#false} is VALID [2022-02-20 22:01:50,623 INFO L272 TraceCheckUtils]: 65: Hoare triple {33728#false} call #t~ret246#1.base, #t~ret246#1.offset := alloc_skb(74, 208); {33728#false} is VALID [2022-02-20 22:01:50,625 INFO L290 TraceCheckUtils]: 66: Hoare triple {33728#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~28#1.base, ~tmp~28#1.offset; {33728#false} is VALID [2022-02-20 22:01:50,625 INFO L272 TraceCheckUtils]: 67: Hoare triple {33728#false} call ldv_check_alloc_flags(~flags#1); {33728#false} is VALID [2022-02-20 22:01:50,626 INFO L290 TraceCheckUtils]: 68: Hoare triple {33728#false} ~flags := #in~flags; {33728#false} is VALID [2022-02-20 22:01:50,628 INFO L290 TraceCheckUtils]: 69: Hoare triple {33728#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {33728#false} is VALID [2022-02-20 22:01:50,628 INFO L272 TraceCheckUtils]: 70: Hoare triple {33728#false} call ldv_error(); {33728#false} is VALID [2022-02-20 22:01:50,628 INFO L290 TraceCheckUtils]: 71: Hoare triple {33728#false} assume !false; {33728#false} is VALID [2022-02-20 22:01:50,629 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 22:01:50,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:01:50,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163388834] [2022-02-20 22:01:50,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163388834] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:01:50,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:01:50,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:01:50,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173547071] [2022-02-20 22:01:50,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:01:50,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 72 [2022-02-20 22:01:50,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:01:50,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:50,680 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 22:01:50,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:01:50,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:01:50,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:01:50,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:01:50,682 INFO L87 Difference]: Start difference. First operand 2949 states and 4050 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:01:58,799 INFO L93 Difference]: Finished difference Result 6524 states and 9017 transitions. [2022-02-20 22:01:58,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 22:01:58,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 72 [2022-02-20 22:01:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:01:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:58,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2162 transitions. [2022-02-20 22:01:58,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:01:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2162 transitions. [2022-02-20 22:01:58,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2162 transitions. [2022-02-20 22:02:00,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2162 edges. 2162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:02:01,116 INFO L225 Difference]: With dead ends: 6524 [2022-02-20 22:02:01,116 INFO L226 Difference]: Without dead ends: 4191 [2022-02-20 22:02:01,121 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 22:02:01,122 INFO L933 BasicCegarLoop]: 761 mSDtfsCounter, 876 mSDsluCounter, 1983 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 22:02:01,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [946 Valid, 2744 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 22:02:01,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4191 states. [2022-02-20 22:02:01,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 3944. [2022-02-20 22:02:01,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:02:01,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4191 states. Second operand has 3944 states, 3027 states have (on average 1.345556656755864) internal successors, (4073), 3061 states have internal predecessors, (4073), 666 states have call successors, (666), 253 states have call predecessors, (666), 250 states have return successors, (669), 643 states have call predecessors, (669), 665 states have call successors, (669) [2022-02-20 22:02:01,220 INFO L74 IsIncluded]: Start isIncluded. First operand 4191 states. Second operand has 3944 states, 3027 states have (on average 1.345556656755864) internal successors, (4073), 3061 states have internal predecessors, (4073), 666 states have call successors, (666), 253 states have call predecessors, (666), 250 states have return successors, (669), 643 states have call predecessors, (669), 665 states have call successors, (669) [2022-02-20 22:02:01,226 INFO L87 Difference]: Start difference. First operand 4191 states. Second operand has 3944 states, 3027 states have (on average 1.345556656755864) internal successors, (4073), 3061 states have internal predecessors, (4073), 666 states have call successors, (666), 253 states have call predecessors, (666), 250 states have return successors, (669), 643 states have call predecessors, (669), 665 states have call successors, (669) [2022-02-20 22:02:01,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:01,754 INFO L93 Difference]: Finished difference Result 4191 states and 5815 transitions. [2022-02-20 22:02:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 5815 transitions. [2022-02-20 22:02:01,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:02:01,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:02:01,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 3944 states, 3027 states have (on average 1.345556656755864) internal successors, (4073), 3061 states have internal predecessors, (4073), 666 states have call successors, (666), 253 states have call predecessors, (666), 250 states have return successors, (669), 643 states have call predecessors, (669), 665 states have call successors, (669) Second operand 4191 states. [2022-02-20 22:02:01,778 INFO L87 Difference]: Start difference. First operand has 3944 states, 3027 states have (on average 1.345556656755864) internal successors, (4073), 3061 states have internal predecessors, (4073), 666 states have call successors, (666), 253 states have call predecessors, (666), 250 states have return successors, (669), 643 states have call predecessors, (669), 665 states have call successors, (669) Second operand 4191 states. [2022-02-20 22:02:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:02,318 INFO L93 Difference]: Finished difference Result 4191 states and 5815 transitions. [2022-02-20 22:02:02,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 5815 transitions. [2022-02-20 22:02:02,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:02:02,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:02:02,326 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:02:02,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:02:02,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3944 states, 3027 states have (on average 1.345556656755864) internal successors, (4073), 3061 states have internal predecessors, (4073), 666 states have call successors, (666), 253 states have call predecessors, (666), 250 states have return successors, (669), 643 states have call predecessors, (669), 665 states have call successors, (669) [2022-02-20 22:02:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 5408 transitions. [2022-02-20 22:02:02,981 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 5408 transitions. Word has length 72 [2022-02-20 22:02:02,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:02:02,981 INFO L470 AbstractCegarLoop]: Abstraction has 3944 states and 5408 transitions. [2022-02-20 22:02:02,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:02:02,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 5408 transitions. [2022-02-20 22:02:02,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-02-20 22:02:02,984 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:02:02,984 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:02:02,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 22:02:02,984 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:02:02,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:02:02,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1790702570, now seen corresponding path program 1 times [2022-02-20 22:02:02,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:02:02,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810758782] [2022-02-20 22:02:02,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:02:02,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:02:03,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:03,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:02:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:03,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {56379#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {56351#true} is VALID [2022-02-20 22:02:03,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {56351#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56351#true} is VALID [2022-02-20 22:02:03,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {56351#true} assume true; {56351#true} is VALID [2022-02-20 22:02:03,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56351#true} {56353#(= ~ldv_irq_2_1~0 0)} #1284#return; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:02:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:03,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {56379#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {56351#true} is VALID [2022-02-20 22:02:03,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {56351#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56351#true} is VALID [2022-02-20 22:02:03,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {56351#true} assume true; {56351#true} is VALID [2022-02-20 22:02:03,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56351#true} {56353#(= ~ldv_irq_2_1~0 0)} #1286#return; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:02:03,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:03,129 INFO L290 TraceCheckUtils]: 0: Hoare triple {56379#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {56351#true} is VALID [2022-02-20 22:02:03,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {56351#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56351#true} is VALID [2022-02-20 22:02:03,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {56351#true} assume true; {56351#true} is VALID [2022-02-20 22:02:03,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56351#true} {56353#(= ~ldv_irq_2_1~0 0)} #1288#return; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 22:02:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:03,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {56379#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {56351#true} is VALID [2022-02-20 22:02:03,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {56351#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56351#true} is VALID [2022-02-20 22:02:03,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {56351#true} assume true; {56351#true} is VALID [2022-02-20 22:02:03,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56351#true} {56353#(= ~ldv_irq_2_1~0 0)} #1290#return; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 22:02:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:03,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {56379#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {56351#true} is VALID [2022-02-20 22:02:03,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {56351#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56351#true} is VALID [2022-02-20 22:02:03,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {56351#true} assume true; {56351#true} is VALID [2022-02-20 22:02:03,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56351#true} {56353#(= ~ldv_irq_2_1~0 0)} #1292#return; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 22:02:03,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:03,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {56351#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {56351#true} is VALID [2022-02-20 22:02:03,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {56351#true} assume true; {56351#true} is VALID [2022-02-20 22:02:03,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56351#true} {56352#false} #1238#return; {56352#false} is VALID [2022-02-20 22:02:03,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {56351#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(108, 2);call #Ultimate.allocInit(17, 3);call #Ultimate.allocInit(13, 4);call #Ultimate.allocInit(23, 5);call #Ultimate.allocInit(216, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(115, 7, 1, 1);call write~init~int(58, 7, 2, 1);call write~init~int(10, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(23, 9);call #Ultimate.allocInit(2, 10);call write~init~int(15, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(6, 11);call write~init~int(105, 11, 0, 1);call write~init~int(50, 11, 1, 1);call write~init~int(99, 11, 2, 1);call write~init~int(58, 11, 3, 1);call write~init~int(32, 11, 4, 1);call write~init~int(0, 11, 5, 1);call #Ultimate.allocInit(58, 12);call #Ultimate.allocInit(58, 13);call #Ultimate.allocInit(10, 14);call #Ultimate.allocInit(2, 15);call write~init~int(15, 15, 0, 1);call write~init~int(0, 15, 1, 1);call #Ultimate.allocInit(6, 16);call write~init~int(99, 16, 0, 1);call write~init~int(114, 16, 1, 1);call write~init~int(99, 16, 2, 1);call write~init~int(58, 16, 3, 1);call write~init~int(32, 16, 4, 1);call write~init~int(0, 16, 5, 1);call #Ultimate.allocInit(216, 17);call #Ultimate.allocInit(13, 18);call #Ultimate.allocInit(27, 19);call #Ultimate.allocInit(216, 20);call #Ultimate.allocInit(5, 21);call write~init~int(73, 21, 0, 1);call write~init~int(82, 21, 1, 1);call write~init~int(81, 21, 2, 1);call write~init~int(10, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(5, 22);call write~init~int(73, 22, 0, 1);call write~init~int(82, 22, 1, 1);call write~init~int(81, 22, 2, 1);call write~init~int(10, 22, 3, 1);call write~init~int(0, 22, 4, 1);call #Ultimate.allocInit(23, 23);call #Ultimate.allocInit(8, 24);call #Ultimate.allocInit(41, 25);call #Ultimate.allocInit(216, 26);call #Ultimate.allocInit(49, 27);call #Ultimate.allocInit(216, 28);call #Ultimate.allocInit(11, 29);call #Ultimate.allocInit(45, 30);call #Ultimate.allocInit(216, 31);call #Ultimate.allocInit(54, 32);call #Ultimate.allocInit(216, 33);call #Ultimate.allocInit(52, 34);call #Ultimate.allocInit(13, 35);call #Ultimate.allocInit(23, 36);call #Ultimate.allocInit(216, 37);call #Ultimate.allocInit(4, 38);call write~init~int(37, 38, 0, 1);call write~init~int(115, 38, 1, 1);call write~init~int(10, 38, 2, 1);call write~init~int(0, 38, 3, 1);call #Ultimate.allocInit(4, 39);call write~init~int(37, 39, 0, 1);call write~init~int(115, 39, 1, 1);call write~init~int(10, 39, 2, 1);call write~init~int(0, 39, 3, 1);call #Ultimate.allocInit(23, 40);call #Ultimate.allocInit(13, 41);call #Ultimate.allocInit(23, 42);call #Ultimate.allocInit(216, 43);call #Ultimate.allocInit(9, 44);call #Ultimate.allocInit(9, 45);call #Ultimate.allocInit(24, 46);call #Ultimate.allocInit(51, 47);call #Ultimate.allocInit(15, 48);call #Ultimate.allocInit(23, 49);call #Ultimate.allocInit(36, 50);call #Ultimate.allocInit(48, 51);call #Ultimate.allocInit(32, 52);call #Ultimate.allocInit(13, 53);call #Ultimate.allocInit(37, 54);call #Ultimate.allocInit(6, 55);call write~init~int(115, 55, 0, 1);call write~init~int(104, 55, 1, 1);call write~init~int(100, 55, 2, 1);call write~init~int(108, 55, 3, 1);call write~init~int(99, 55, 4, 1);call write~init~int(0, 55, 5, 1);call #Ultimate.allocInit(13, 56);call #Ultimate.allocInit(24, 57);call #Ultimate.allocInit(216, 58);call #Ultimate.allocInit(4, 59);call write~init~int(37, 59, 0, 1);call write~init~int(115, 59, 1, 1);call write~init~int(10, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(4, 60);call write~init~int(37, 60, 0, 1);call write~init~int(115, 60, 1, 1);call write~init~int(10, 60, 2, 1);call write~init~int(0, 60, 3, 1);call #Ultimate.allocInit(24, 61);call #Ultimate.allocInit(17, 62);~ldv_irq_data_2_1~0.base, ~ldv_irq_data_2_1~0.offset := 0, 0;~ldv_irq_dev_1_1~0.base, ~ldv_irq_dev_1_1~0.offset := 0, 0;~ldv_irq_1_3~0 := 0;~ldv_irq_line_2_2~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_0~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_irq_line_2_1~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_2_0~0 := 0;~ldv_irq_dev_1_3~0.base, ~ldv_irq_dev_1_3~0.offset := 0, 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ldv_irq_dev_1_0~0.base, ~ldv_irq_dev_1_0~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_irq_data_2_0~0.base, ~ldv_irq_data_2_0~0.offset := 0, 0;~ldv_irq_dev_2_3~0.base, ~ldv_irq_dev_2_3~0.offset := 0, 0;~ldv_irq_dev_2_0~0.base, ~ldv_irq_dev_2_0~0.offset := 0, 0;~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_1~0 := 0;~ldv_irq_2_3~0 := 0;~st21nfca_hci_i2c_driver_group0~0.base, ~st21nfca_hci_i2c_driver_group0~0.offset := 0, 0;~ldv_irq_data_2_3~0.base, ~ldv_irq_data_2_3~0.offset := 0, 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_2_2~0 := 0;~ldv_irq_dev_1_2~0.base, ~ldv_irq_dev_1_2~0.offset := 0, 0;~ldv_irq_line_2_0~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_irq_dev_2_1~0.base, ~ldv_irq_dev_2_1~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_data_2_2~0.base, ~ldv_irq_data_2_2~0.offset := 0, 0;~ldv_irq_line_1_1~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~ldv_state_variable_4~0 := 0;~ldv_irq_dev_2_2~0.base, ~ldv_irq_dev_2_2~0.offset := 0, 0;~ldv_irq_line_2_3~0 := 0;~ldv_irq_2_1~0 := 0;~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset := 63, 0;call #Ultimate.allocInit(56, 63);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#st21nfca_hci_i2c_id_table~0.base);call write~unchecked~int(115, ~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(116, ~#st21nfca_hci_i2c_id_table~0.base, 1 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(50, ~#st21nfca_hci_i2c_id_table~0.base, 2 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(49, ~#st21nfca_hci_i2c_id_table~0.base, 3 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(110, ~#st21nfca_hci_i2c_id_table~0.base, 4 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(102, ~#st21nfca_hci_i2c_id_table~0.base, 5 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(99, ~#st21nfca_hci_i2c_id_table~0.base, 6 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(97, ~#st21nfca_hci_i2c_id_table~0.base, 7 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(95, ~#st21nfca_hci_i2c_id_table~0.base, 8 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(104, ~#st21nfca_hci_i2c_id_table~0.base, 9 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(99, ~#st21nfca_hci_i2c_id_table~0.base, 10 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(105, ~#st21nfca_hci_i2c_id_table~0.base, 11 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(0, ~#st21nfca_hci_i2c_id_table~0.base, 12 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(0, ~#st21nfca_hci_i2c_id_table~0.base, 20 + ~#st21nfca_hci_i2c_id_table~0.offset, 8);~__mod_i2c__st21nfca_hci_i2c_id_table_device_table~0.name := ~const~array~~LB~int~RB~int();~__mod_i2c__st21nfca_hci_i2c_id_table_device_table~0.driver_data := 0;~#len_seq~0.base, ~#len_seq~0.offset := 64, 0;call #Ultimate.allocInit(4, 64);call write~init~int(13, ~#len_seq~0.base, ~#len_seq~0.offset, 1);call write~init~int(24, ~#len_seq~0.base, 1 + ~#len_seq~0.offset, 1);call write~init~int(15, ~#len_seq~0.base, 2 + ~#len_seq~0.offset, 1);call write~init~int(29, ~#len_seq~0.base, 3 + ~#len_seq~0.offset, 1);~#wait_tab~0.base, ~#wait_tab~0.offset := 65, 0;call #Ultimate.allocInit(12, 65);call write~init~int(2, ~#wait_tab~0.base, ~#wait_tab~0.offset, 2);call write~init~int(3, ~#wait_tab~0.base, 2 + ~#wait_tab~0.offset, 2);call write~init~int(5, ~#wait_tab~0.base, 4 + ~#wait_tab~0.offset, 2);call write~init~int(15, ~#wait_tab~0.base, 6 + ~#wait_tab~0.offset, 2);call write~init~int(20, ~#wait_tab~0.base, 8 + ~#wait_tab~0.offset, 2);call write~init~int(40, ~#wait_tab~0.base, 10 + ~#wait_tab~0.offset, 2);~#i2c_phy_ops~0.base, ~#i2c_phy_ops~0.offset := 66, 0;call #Ultimate.allocInit(24, 66);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_write.base, #funAddr~st21nfca_hci_i2c_write.offset, ~#i2c_phy_ops~0.base, ~#i2c_phy_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_enable.base, #funAddr~st21nfca_hci_i2c_enable.offset, ~#i2c_phy_ops~0.base, 8 + ~#i2c_phy_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_disable.base, #funAddr~st21nfca_hci_i2c_disable.offset, ~#i2c_phy_ops~0.base, 16 + ~#i2c_phy_ops~0.offset, 8);~#st21nfca_hci_i2c_driver~0.base, ~#st21nfca_hci_i2c_driver~0.offset := 67, 0;call #Ultimate.allocInit(221, 67);call write~init~int(0, ~#st21nfca_hci_i2c_driver~0.base, ~#st21nfca_hci_i2c_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 4 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_probe.base, #funAddr~st21nfca_hci_i2c_probe.offset, ~#st21nfca_hci_i2c_driver~0.base, 12 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_remove.base, #funAddr~st21nfca_hci_i2c_remove.offset, ~#st21nfca_hci_i2c_driver~0.base, 20 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 28 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 36 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 44 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 52 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 60 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(62, 0, ~#st21nfca_hci_i2c_driver~0.base, 68 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 76 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#st21nfca_hci_i2c_driver~0.base, 84 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 92 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~int(0, ~#st21nfca_hci_i2c_driver~0.base, 100 + ~#st21nfca_hci_i2c_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 101 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 109 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 117 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 125 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 133 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 141 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 149 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 157 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 165 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 173 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset, ~#st21nfca_hci_i2c_driver~0.base, 181 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 189 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 197 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 205 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 213 + ~#st21nfca_hci_i2c_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_spin~0 := 0; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret333#1.base, main_#t~ret333#1.offset, main_#t~ret334#1.base, main_#t~ret334#1.offset, main_#t~ret335#1.base, main_#t~ret335#1.offset, main_#t~ret336#1.base, main_#t~ret336#1.offset, main_#t~ret337#1.base, main_#t~ret337#1.offset, main_#t~nondet338#1, main_#t~switch339#1, main_#t~nondet340#1, main_#t~switch341#1, main_#t~ret342#1, main_#t~ret343#1, main_#t~nondet344#1, main_#t~switch345#1, main_#t~ret346#1, main_#t~nondet347#1, main_#t~switch348#1, main_#t~ret349#1, main_#t~ret350#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~26#1.base, main_~tmp~26#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~26#1.base, main_~tmp~26#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,161 INFO L272 TraceCheckUtils]: 2: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} call main_#t~ret333#1.base, main_#t~ret333#1.offset := ldv_zalloc(1); {56379#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:03,161 INFO L290 TraceCheckUtils]: 3: Hoare triple {56379#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {56351#true} is VALID [2022-02-20 22:02:03,161 INFO L290 TraceCheckUtils]: 4: Hoare triple {56351#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56351#true} is VALID [2022-02-20 22:02:03,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {56351#true} assume true; {56351#true} is VALID [2022-02-20 22:02:03,161 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {56351#true} {56353#(= ~ldv_irq_2_1~0 0)} #1284#return; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} main_~tmp~26#1.base, main_~tmp~26#1.offset := main_#t~ret333#1.base, main_#t~ret333#1.offset;havoc main_#t~ret333#1.base, main_#t~ret333#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~26#1.base, main_~tmp~26#1.offset; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,162 INFO L272 TraceCheckUtils]: 8: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} call main_#t~ret334#1.base, main_#t~ret334#1.offset := ldv_zalloc(1); {56379#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:03,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {56379#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {56351#true} is VALID [2022-02-20 22:02:03,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {56351#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56351#true} is VALID [2022-02-20 22:02:03,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {56351#true} assume true; {56351#true} is VALID [2022-02-20 22:02:03,163 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {56351#true} {56353#(= ~ldv_irq_2_1~0 0)} #1286#return; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset := main_#t~ret334#1.base, main_#t~ret334#1.offset;havoc main_#t~ret334#1.base, main_#t~ret334#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,164 INFO L272 TraceCheckUtils]: 14: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} call main_#t~ret335#1.base, main_#t~ret335#1.offset := ldv_zalloc(1); {56379#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:03,164 INFO L290 TraceCheckUtils]: 15: Hoare triple {56379#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {56351#true} is VALID [2022-02-20 22:02:03,164 INFO L290 TraceCheckUtils]: 16: Hoare triple {56351#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56351#true} is VALID [2022-02-20 22:02:03,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {56351#true} assume true; {56351#true} is VALID [2022-02-20 22:02:03,165 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {56351#true} {56353#(= ~ldv_irq_2_1~0 0)} #1288#return; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset := main_#t~ret335#1.base, main_#t~ret335#1.offset;havoc main_#t~ret335#1.base, main_#t~ret335#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,165 INFO L272 TraceCheckUtils]: 20: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} call main_#t~ret336#1.base, main_#t~ret336#1.offset := ldv_zalloc(232); {56379#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:03,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {56379#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {56351#true} is VALID [2022-02-20 22:02:03,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {56351#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56351#true} is VALID [2022-02-20 22:02:03,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {56351#true} assume true; {56351#true} is VALID [2022-02-20 22:02:03,166 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {56351#true} {56353#(= ~ldv_irq_2_1~0 0)} #1290#return; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset := main_#t~ret336#1.base, main_#t~ret336#1.offset;havoc main_#t~ret336#1.base, main_#t~ret336#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,167 INFO L272 TraceCheckUtils]: 26: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} call main_#t~ret337#1.base, main_#t~ret337#1.offset := ldv_zalloc(32); {56379#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:03,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {56379#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {56351#true} is VALID [2022-02-20 22:02:03,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {56351#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {56351#true} is VALID [2022-02-20 22:02:03,167 INFO L290 TraceCheckUtils]: 29: Hoare triple {56351#true} assume true; {56351#true} is VALID [2022-02-20 22:02:03,168 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {56351#true} {56353#(= ~ldv_irq_2_1~0 0)} #1292#return; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset := main_#t~ret337#1.base, main_#t~ret337#1.offset;havoc main_#t~ret337#1.base, main_#t~ret337#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset;assume { :begin_inline_ldv_initialize } true; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_4~0 := 0;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 1; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} assume -2147483648 <= main_#t~nondet338#1 && main_#t~nondet338#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet338#1;havoc main_#t~nondet338#1;main_#t~switch339#1 := 0 == main_~tmp___4~0#1; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} assume !main_#t~switch339#1;main_#t~switch339#1 := main_#t~switch339#1 || 1 == main_~tmp___4~0#1; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,169 INFO L290 TraceCheckUtils]: 35: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} assume !main_#t~switch339#1;main_#t~switch339#1 := main_#t~switch339#1 || 2 == main_~tmp___4~0#1; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} assume !main_#t~switch339#1;main_#t~switch339#1 := main_#t~switch339#1 || 3 == main_~tmp___4~0#1; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} assume !main_#t~switch339#1;main_#t~switch339#1 := main_#t~switch339#1 || 4 == main_~tmp___4~0#1; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} assume main_#t~switch339#1; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,170 INFO L290 TraceCheckUtils]: 39: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} assume 0 != ~ldv_state_variable_2~0;assume { :begin_inline_choose_interrupt_2 } true;havoc choose_interrupt_2_#t~nondet312#1, choose_interrupt_2_#t~switch313#1, choose_interrupt_2_#t~ret314#1, choose_interrupt_2_#t~ret315#1, choose_interrupt_2_#t~ret316#1, choose_interrupt_2_#t~ret317#1, choose_interrupt_2_~tmp~21#1;havoc choose_interrupt_2_~tmp~21#1;assume -2147483648 <= choose_interrupt_2_#t~nondet312#1 && choose_interrupt_2_#t~nondet312#1 <= 2147483647;choose_interrupt_2_~tmp~21#1 := choose_interrupt_2_#t~nondet312#1;havoc choose_interrupt_2_#t~nondet312#1;choose_interrupt_2_#t~switch313#1 := 0 == choose_interrupt_2_~tmp~21#1; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} assume !choose_interrupt_2_#t~switch313#1;choose_interrupt_2_#t~switch313#1 := choose_interrupt_2_#t~switch313#1 || 1 == choose_interrupt_2_~tmp~21#1; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,171 INFO L290 TraceCheckUtils]: 41: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} assume choose_interrupt_2_#t~switch313#1; {56353#(= ~ldv_irq_2_1~0 0)} is VALID [2022-02-20 22:02:03,171 INFO L272 TraceCheckUtils]: 42: Hoare triple {56353#(= ~ldv_irq_2_1~0 0)} call choose_interrupt_2_#t~ret315#1 := ldv_irq_2(~ldv_irq_2_1~0, ~ldv_irq_line_2_1~0, ~ldv_irq_data_2_1~0.base, ~ldv_irq_data_2_1~0.offset); {56374#(= |ldv_irq_2_#in~state#1| 0)} is VALID [2022-02-20 22:02:03,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {56374#(= |ldv_irq_2_#in~state#1| 0)} ~state#1 := #in~state#1;~line#1 := #in~line#1;~data#1.base, ~data#1.offset := #in~data#1.base, #in~data#1.offset;havoc ~irq_retval~1#1;havoc ~tmp~23#1;havoc ~tmp___0~12#1; {56375#(= |ldv_irq_2_~state#1| 0)} is VALID [2022-02-20 22:02:03,172 INFO L290 TraceCheckUtils]: 44: Hoare triple {56375#(= |ldv_irq_2_~state#1| 0)} assume 0 != ~state#1;assume -2147483648 <= #t~nondet322#1 && #t~nondet322#1 <= 2147483647;~tmp~23#1 := #t~nondet322#1;havoc #t~nondet322#1;#t~switch323#1 := 0 == ~tmp~23#1; {56352#false} is VALID [2022-02-20 22:02:03,172 INFO L290 TraceCheckUtils]: 45: Hoare triple {56352#false} assume !#t~switch323#1;#t~switch323#1 := #t~switch323#1 || 1 == ~tmp~23#1; {56352#false} is VALID [2022-02-20 22:02:03,172 INFO L290 TraceCheckUtils]: 46: Hoare triple {56352#false} assume #t~switch323#1; {56352#false} is VALID [2022-02-20 22:02:03,172 INFO L290 TraceCheckUtils]: 47: Hoare triple {56352#false} assume 2 == ~state#1; {56352#false} is VALID [2022-02-20 22:02:03,173 INFO L272 TraceCheckUtils]: 48: Hoare triple {56352#false} call #t~ret325#1 := st21nfca_hci_irq_thread_fn(~line#1, ~data#1.base, ~data#1.offset); {56352#false} is VALID [2022-02-20 22:02:03,173 INFO L290 TraceCheckUtils]: 49: Hoare triple {56352#false} ~irq#1 := #in~irq#1;~phy_id#1.base, ~phy_id#1.offset := #in~phy_id#1.base, #in~phy_id#1.offset;havoc ~phy~3#1.base, ~phy~3#1.offset;havoc ~client~2#1.base, ~client~2#1.offset;havoc ~r~4#1;havoc ~__warned~0#1;havoc ~__ret_warn_once~0#1;havoc ~__ret_warn_on~0#1;havoc ~tmp~16#1;havoc ~tmp___0~8#1;havoc ~tmp___1~3#1;call ~#descriptor~1#1.base, ~#descriptor~1#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp___2~2#1;~phy~3#1.base, ~phy~3#1.offset := ~phy_id#1.base, ~phy_id#1.offset;#t~short225#1 := 0 == (~phy~3#1.base + ~phy~3#1.offset) % 18446744073709551616; {56352#false} is VALID [2022-02-20 22:02:03,173 INFO L290 TraceCheckUtils]: 50: Hoare triple {56352#false} assume #t~short225#1; {56352#false} is VALID [2022-02-20 22:02:03,173 INFO L290 TraceCheckUtils]: 51: Hoare triple {56352#false} assume !#t~short225#1;havoc #t~mem223#1.base, #t~mem223#1.offset;havoc #t~mem224#1;havoc #t~short225#1;call #t~mem230#1.base, #t~mem230#1.offset := read~$Pointer$(~phy~3#1.base, ~phy~3#1.offset, 8);~client~2#1.base, ~client~2#1.offset := #t~mem230#1.base, #t~mem230#1.offset;havoc #t~mem230#1.base, #t~mem230#1.offset;call write~$Pointer$(18, 0, ~#descriptor~1#1.base, ~#descriptor~1#1.offset, 8);call write~$Pointer$(19, 0, ~#descriptor~1#1.base, 8 + ~#descriptor~1#1.offset, 8);call write~$Pointer$(20, 0, ~#descriptor~1#1.base, 16 + ~#descriptor~1#1.offset, 8);call write~$Pointer$(21, 0, ~#descriptor~1#1.base, 24 + ~#descriptor~1#1.offset, 8);call write~int(526, ~#descriptor~1#1.base, 32 + ~#descriptor~1#1.offset, 4);call write~int(0, ~#descriptor~1#1.base, 36 + ~#descriptor~1#1.offset, 1);call #t~mem231#1 := read~int(~#descriptor~1#1.base, 36 + ~#descriptor~1#1.offset, 1); {56352#false} is VALID [2022-02-20 22:02:03,173 INFO L272 TraceCheckUtils]: 52: Hoare triple {56352#false} call #t~ret232#1 := ldv__builtin_expect(#t~mem231#1 % 256, 0); {56351#true} is VALID [2022-02-20 22:02:03,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {56351#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {56351#true} is VALID [2022-02-20 22:02:03,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {56351#true} assume true; {56351#true} is VALID [2022-02-20 22:02:03,173 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {56351#true} {56352#false} #1238#return; {56352#false} is VALID [2022-02-20 22:02:03,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {56352#false} assume -9223372036854775808 <= #t~ret232#1 && #t~ret232#1 <= 9223372036854775807;~tmp___2~2#1 := #t~ret232#1;havoc #t~mem231#1;havoc #t~ret232#1; {56352#false} is VALID [2022-02-20 22:02:03,174 INFO L290 TraceCheckUtils]: 57: Hoare triple {56352#false} assume 0 != ~tmp___2~2#1;havoc #t~nondet233#1; {56352#false} is VALID [2022-02-20 22:02:03,174 INFO L290 TraceCheckUtils]: 58: Hoare triple {56352#false} call #t~mem234#1 := read~int(~phy~3#1.base, 52 + ~phy~3#1.offset, 4); {56352#false} is VALID [2022-02-20 22:02:03,174 INFO L290 TraceCheckUtils]: 59: Hoare triple {56352#false} assume !(0 != #t~mem234#1);havoc #t~mem234#1;call #t~mem235#1.base, #t~mem235#1.offset := read~$Pointer$(~phy~3#1.base, 28 + ~phy~3#1.offset, 8);assume { :begin_inline_st21nfca_hci_i2c_read } true;st21nfca_hci_i2c_read_#in~phy#1.base, st21nfca_hci_i2c_read_#in~phy#1.offset, st21nfca_hci_i2c_read_#in~skb#1.base, st21nfca_hci_i2c_read_#in~skb#1.offset := ~phy~3#1.base, ~phy~3#1.offset, #t~mem235#1.base, #t~mem235#1.offset;havoc st21nfca_hci_i2c_read_#res#1;havoc st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset, st21nfca_hci_i2c_read_#t~mem203#1, st21nfca_hci_i2c_read_#t~mem204#1, st21nfca_hci_i2c_read_#t~mem205#1, st21nfca_hci_i2c_read_#t~ret206#1, st21nfca_hci_i2c_read_#t~mem207#1, st21nfca_hci_i2c_read_#t~mem208#1, st21nfca_hci_i2c_read_#t~mem209#1, st21nfca_hci_i2c_read_#t~short210#1, st21nfca_hci_i2c_read_#t~mem211#1, st21nfca_hci_i2c_read_#t~mem212#1, st21nfca_hci_i2c_read_#t~mem213#1, st21nfca_hci_i2c_read_#t~short214#1, st21nfca_hci_i2c_read_#t~short215#1, st21nfca_hci_i2c_read_#t~ret216#1.base, st21nfca_hci_i2c_read_#t~ret216#1.offset, st21nfca_hci_i2c_read_#t~memcpy~res217#1.base, st21nfca_hci_i2c_read_#t~memcpy~res217#1.offset, st21nfca_hci_i2c_read_#t~mem219#1.base, st21nfca_hci_i2c_read_#t~mem219#1.offset, st21nfca_hci_i2c_read_#t~mem218#1, st21nfca_hci_i2c_read_#t~mem220#1, st21nfca_hci_i2c_read_#t~ret221#1, st21nfca_hci_i2c_read_#t~mem222#1, st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset, st21nfca_hci_i2c_read_~skb#1.base, st21nfca_hci_i2c_read_~skb#1.offset, st21nfca_hci_i2c_read_~r~3#1, st21nfca_hci_i2c_read_~i~3#1, st21nfca_hci_i2c_read_~len~1#1, st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset, st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset, st21nfca_hci_i2c_read_~__len~0#1, st21nfca_hci_i2c_read_~__ret~0#1.base, st21nfca_hci_i2c_read_~__ret~0#1.offset, st21nfca_hci_i2c_read_~tmp___0~7#1.base, st21nfca_hci_i2c_read_~tmp___0~7#1.offset, st21nfca_hci_i2c_read_~tmp___1~2#1;st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset := st21nfca_hci_i2c_read_#in~phy#1.base, st21nfca_hci_i2c_read_#in~phy#1.offset;st21nfca_hci_i2c_read_~skb#1.base, st21nfca_hci_i2c_read_~skb#1.offset := st21nfca_hci_i2c_read_#in~skb#1.base, st21nfca_hci_i2c_read_#in~skb#1.offset;havoc st21nfca_hci_i2c_read_~r~3#1;havoc st21nfca_hci_i2c_read_~i~3#1;havoc st21nfca_hci_i2c_read_~len~1#1;call st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset := #Ultimate.allocOnStack(29);havoc st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset;havoc st21nfca_hci_i2c_read_~__len~0#1;havoc st21nfca_hci_i2c_read_~__ret~0#1.base, st21nfca_hci_i2c_read_~__ret~0#1.offset;havoc st21nfca_hci_i2c_read_~tmp___0~7#1.base, st21nfca_hci_i2c_read_~tmp___0~7#1.offset;havoc st21nfca_hci_i2c_read_~tmp___1~2#1;call st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset := read~$Pointer$(st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset, 8);st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset := st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset;havoc st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset;call st21nfca_hci_i2c_read_#t~mem203#1 := read~int(st21nfca_hci_i2c_read_~phy#1.base, 36 + st21nfca_hci_i2c_read_~phy#1.offset, 4); {56352#false} is VALID [2022-02-20 22:02:03,174 INFO L290 TraceCheckUtils]: 60: Hoare triple {56352#false} assume !(st21nfca_hci_i2c_read_#t~mem203#1 % 4294967296 <= 3);havoc st21nfca_hci_i2c_read_#t~mem203#1;st21nfca_hci_i2c_read_#res#1 := -5;call ULTIMATE.dealloc(st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset);havoc st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset; {56352#false} is VALID [2022-02-20 22:02:03,174 INFO L290 TraceCheckUtils]: 61: Hoare triple {56352#false} #t~ret236#1 := st21nfca_hci_i2c_read_#res#1;assume { :end_inline_st21nfca_hci_i2c_read } true;assume -2147483648 <= #t~ret236#1 && #t~ret236#1 <= 2147483647;~r~4#1 := #t~ret236#1;havoc #t~mem235#1.base, #t~mem235#1.offset;havoc #t~ret236#1; {56352#false} is VALID [2022-02-20 22:02:03,174 INFO L290 TraceCheckUtils]: 62: Hoare triple {56352#false} assume !(-121 == ~r~4#1); {56352#false} is VALID [2022-02-20 22:02:03,174 INFO L290 TraceCheckUtils]: 63: Hoare triple {56352#false} assume !(-11 == ~r~4#1 || -5 == ~r~4#1);#t~short239#1 := -74 == ~r~4#1; {56352#false} is VALID [2022-02-20 22:02:03,174 INFO L290 TraceCheckUtils]: 64: Hoare triple {56352#false} assume #t~short239#1;call #t~mem238#1 := read~int(~phy~3#1.base, 40 + ~phy~3#1.offset, 4);#t~short239#1 := #t~mem238#1 % 4294967296 <= 5; {56352#false} is VALID [2022-02-20 22:02:03,175 INFO L290 TraceCheckUtils]: 65: Hoare triple {56352#false} assume !#t~short239#1;havoc #t~mem238#1;havoc #t~short239#1; {56352#false} is VALID [2022-02-20 22:02:03,175 INFO L290 TraceCheckUtils]: 66: Hoare triple {56352#false} assume !(~r~4#1 > 0); {56352#false} is VALID [2022-02-20 22:02:03,175 INFO L272 TraceCheckUtils]: 67: Hoare triple {56352#false} call #t~ret246#1.base, #t~ret246#1.offset := alloc_skb(74, 208); {56352#false} is VALID [2022-02-20 22:02:03,175 INFO L290 TraceCheckUtils]: 68: Hoare triple {56352#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~28#1.base, ~tmp~28#1.offset; {56352#false} is VALID [2022-02-20 22:02:03,175 INFO L272 TraceCheckUtils]: 69: Hoare triple {56352#false} call ldv_check_alloc_flags(~flags#1); {56352#false} is VALID [2022-02-20 22:02:03,175 INFO L290 TraceCheckUtils]: 70: Hoare triple {56352#false} ~flags := #in~flags; {56352#false} is VALID [2022-02-20 22:02:03,175 INFO L290 TraceCheckUtils]: 71: Hoare triple {56352#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {56352#false} is VALID [2022-02-20 22:02:03,175 INFO L272 TraceCheckUtils]: 72: Hoare triple {56352#false} call ldv_error(); {56352#false} is VALID [2022-02-20 22:02:03,176 INFO L290 TraceCheckUtils]: 73: Hoare triple {56352#false} assume !false; {56352#false} is VALID [2022-02-20 22:02:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 22:02:03,177 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:02:03,177 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810758782] [2022-02-20 22:02:03,178 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810758782] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:02:03,178 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:02:03,178 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:02:03,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661218110] [2022-02-20 22:02:03,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:02:03,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 74 [2022-02-20 22:02:03,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:02:03,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:02:03,224 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 22:02:03,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:02:03,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:02:03,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:02:03,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:02:03,225 INFO L87 Difference]: Start difference. First operand 3944 states and 5408 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:02:09,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:09,744 INFO L93 Difference]: Finished difference Result 6913 states and 9505 transitions. [2022-02-20 22:02:09,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 22:02:09,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 74 [2022-02-20 22:02:09,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:02:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:02:09,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1433 transitions. [2022-02-20 22:02:09,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:02:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1433 transitions. [2022-02-20 22:02:09,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1433 transitions. [2022-02-20 22:02:10,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1433 edges. 1433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:02:11,464 INFO L225 Difference]: With dead ends: 6913 [2022-02-20 22:02:11,465 INFO L226 Difference]: Without dead ends: 4216 [2022-02-20 22:02:11,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-02-20 22:02:11,471 INFO L933 BasicCegarLoop]: 684 mSDtfsCounter, 757 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 2083 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:02:11,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [824 Valid, 2083 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 22:02:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4216 states. [2022-02-20 22:02:11,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4216 to 3960. [2022-02-20 22:02:11,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:02:11,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4216 states. Second operand has 3960 states, 3043 states have (on average 1.3437397305290832) internal successors, (4089), 3073 states have internal predecessors, (4089), 662 states have call successors, (662), 257 states have call predecessors, (662), 254 states have return successors, (665), 643 states have call predecessors, (665), 661 states have call successors, (665) [2022-02-20 22:02:11,589 INFO L74 IsIncluded]: Start isIncluded. First operand 4216 states. Second operand has 3960 states, 3043 states have (on average 1.3437397305290832) internal successors, (4089), 3073 states have internal predecessors, (4089), 662 states have call successors, (662), 257 states have call predecessors, (662), 254 states have return successors, (665), 643 states have call predecessors, (665), 661 states have call successors, (665) [2022-02-20 22:02:11,595 INFO L87 Difference]: Start difference. First operand 4216 states. Second operand has 3960 states, 3043 states have (on average 1.3437397305290832) internal successors, (4089), 3073 states have internal predecessors, (4089), 662 states have call successors, (662), 257 states have call predecessors, (662), 254 states have return successors, (665), 643 states have call predecessors, (665), 661 states have call successors, (665) [2022-02-20 22:02:12,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:12,130 INFO L93 Difference]: Finished difference Result 4216 states and 5825 transitions. [2022-02-20 22:02:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 4216 states and 5825 transitions. [2022-02-20 22:02:12,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:02:12,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:02:12,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 3960 states, 3043 states have (on average 1.3437397305290832) internal successors, (4089), 3073 states have internal predecessors, (4089), 662 states have call successors, (662), 257 states have call predecessors, (662), 254 states have return successors, (665), 643 states have call predecessors, (665), 661 states have call successors, (665) Second operand 4216 states. [2022-02-20 22:02:12,158 INFO L87 Difference]: Start difference. First operand has 3960 states, 3043 states have (on average 1.3437397305290832) internal successors, (4089), 3073 states have internal predecessors, (4089), 662 states have call successors, (662), 257 states have call predecessors, (662), 254 states have return successors, (665), 643 states have call predecessors, (665), 661 states have call successors, (665) Second operand 4216 states. [2022-02-20 22:02:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:02:12,694 INFO L93 Difference]: Finished difference Result 4216 states and 5825 transitions. [2022-02-20 22:02:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4216 states and 5825 transitions. [2022-02-20 22:02:12,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:02:12,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:02:12,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:02:12,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:02:12,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3960 states, 3043 states have (on average 1.3437397305290832) internal successors, (4089), 3073 states have internal predecessors, (4089), 662 states have call successors, (662), 257 states have call predecessors, (662), 254 states have return successors, (665), 643 states have call predecessors, (665), 661 states have call successors, (665) [2022-02-20 22:02:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 5416 transitions. [2022-02-20 22:02:13,385 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 5416 transitions. Word has length 74 [2022-02-20 22:02:13,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:02:13,386 INFO L470 AbstractCegarLoop]: Abstraction has 3960 states and 5416 transitions. [2022-02-20 22:02:13,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:02:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 5416 transitions. [2022-02-20 22:02:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-02-20 22:02:13,388 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:02:13,388 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:02:13,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 22:02:13,389 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:02:13,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:02:13,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1447770840, now seen corresponding path program 1 times [2022-02-20 22:02:13,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:02:13,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100699518] [2022-02-20 22:02:13,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:02:13,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:02:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:13,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:02:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:13,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {79592#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {79564#true} is VALID [2022-02-20 22:02:13,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {79564#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {79564#true} is VALID [2022-02-20 22:02:13,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {79564#true} assume true; {79564#true} is VALID [2022-02-20 22:02:13,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79564#true} {79566#(= ~ldv_irq_1_3~0 0)} #1284#return; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 22:02:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:13,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {79592#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {79564#true} is VALID [2022-02-20 22:02:13,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {79564#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {79564#true} is VALID [2022-02-20 22:02:13,515 INFO L290 TraceCheckUtils]: 2: Hoare triple {79564#true} assume true; {79564#true} is VALID [2022-02-20 22:02:13,515 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79564#true} {79566#(= ~ldv_irq_1_3~0 0)} #1286#return; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 22:02:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:13,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {79592#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {79564#true} is VALID [2022-02-20 22:02:13,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {79564#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {79564#true} is VALID [2022-02-20 22:02:13,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {79564#true} assume true; {79564#true} is VALID [2022-02-20 22:02:13,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79564#true} {79566#(= ~ldv_irq_1_3~0 0)} #1288#return; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 22:02:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:13,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {79592#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {79564#true} is VALID [2022-02-20 22:02:13,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {79564#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {79564#true} is VALID [2022-02-20 22:02:13,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {79564#true} assume true; {79564#true} is VALID [2022-02-20 22:02:13,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79564#true} {79566#(= ~ldv_irq_1_3~0 0)} #1290#return; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 22:02:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:13,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {79592#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {79564#true} is VALID [2022-02-20 22:02:13,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {79564#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {79564#true} is VALID [2022-02-20 22:02:13,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {79564#true} assume true; {79564#true} is VALID [2022-02-20 22:02:13,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79564#true} {79566#(= ~ldv_irq_1_3~0 0)} #1292#return; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:02:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:02:13,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {79564#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {79564#true} is VALID [2022-02-20 22:02:13,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {79564#true} assume true; {79564#true} is VALID [2022-02-20 22:02:13,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79564#true} {79565#false} #1238#return; {79565#false} is VALID [2022-02-20 22:02:13,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {79564#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(108, 2);call #Ultimate.allocInit(17, 3);call #Ultimate.allocInit(13, 4);call #Ultimate.allocInit(23, 5);call #Ultimate.allocInit(216, 6);call #Ultimate.allocInit(5, 7);call write~init~int(37, 7, 0, 1);call write~init~int(115, 7, 1, 1);call write~init~int(58, 7, 2, 1);call write~init~int(10, 7, 3, 1);call write~init~int(0, 7, 4, 1);call #Ultimate.allocInit(19, 8);call #Ultimate.allocInit(23, 9);call #Ultimate.allocInit(2, 10);call write~init~int(15, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(6, 11);call write~init~int(105, 11, 0, 1);call write~init~int(50, 11, 1, 1);call write~init~int(99, 11, 2, 1);call write~init~int(58, 11, 3, 1);call write~init~int(32, 11, 4, 1);call write~init~int(0, 11, 5, 1);call #Ultimate.allocInit(58, 12);call #Ultimate.allocInit(58, 13);call #Ultimate.allocInit(10, 14);call #Ultimate.allocInit(2, 15);call write~init~int(15, 15, 0, 1);call write~init~int(0, 15, 1, 1);call #Ultimate.allocInit(6, 16);call write~init~int(99, 16, 0, 1);call write~init~int(114, 16, 1, 1);call write~init~int(99, 16, 2, 1);call write~init~int(58, 16, 3, 1);call write~init~int(32, 16, 4, 1);call write~init~int(0, 16, 5, 1);call #Ultimate.allocInit(216, 17);call #Ultimate.allocInit(13, 18);call #Ultimate.allocInit(27, 19);call #Ultimate.allocInit(216, 20);call #Ultimate.allocInit(5, 21);call write~init~int(73, 21, 0, 1);call write~init~int(82, 21, 1, 1);call write~init~int(81, 21, 2, 1);call write~init~int(10, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(5, 22);call write~init~int(73, 22, 0, 1);call write~init~int(82, 22, 1, 1);call write~init~int(81, 22, 2, 1);call write~init~int(10, 22, 3, 1);call write~init~int(0, 22, 4, 1);call #Ultimate.allocInit(23, 23);call #Ultimate.allocInit(8, 24);call #Ultimate.allocInit(41, 25);call #Ultimate.allocInit(216, 26);call #Ultimate.allocInit(49, 27);call #Ultimate.allocInit(216, 28);call #Ultimate.allocInit(11, 29);call #Ultimate.allocInit(45, 30);call #Ultimate.allocInit(216, 31);call #Ultimate.allocInit(54, 32);call #Ultimate.allocInit(216, 33);call #Ultimate.allocInit(52, 34);call #Ultimate.allocInit(13, 35);call #Ultimate.allocInit(23, 36);call #Ultimate.allocInit(216, 37);call #Ultimate.allocInit(4, 38);call write~init~int(37, 38, 0, 1);call write~init~int(115, 38, 1, 1);call write~init~int(10, 38, 2, 1);call write~init~int(0, 38, 3, 1);call #Ultimate.allocInit(4, 39);call write~init~int(37, 39, 0, 1);call write~init~int(115, 39, 1, 1);call write~init~int(10, 39, 2, 1);call write~init~int(0, 39, 3, 1);call #Ultimate.allocInit(23, 40);call #Ultimate.allocInit(13, 41);call #Ultimate.allocInit(23, 42);call #Ultimate.allocInit(216, 43);call #Ultimate.allocInit(9, 44);call #Ultimate.allocInit(9, 45);call #Ultimate.allocInit(24, 46);call #Ultimate.allocInit(51, 47);call #Ultimate.allocInit(15, 48);call #Ultimate.allocInit(23, 49);call #Ultimate.allocInit(36, 50);call #Ultimate.allocInit(48, 51);call #Ultimate.allocInit(32, 52);call #Ultimate.allocInit(13, 53);call #Ultimate.allocInit(37, 54);call #Ultimate.allocInit(6, 55);call write~init~int(115, 55, 0, 1);call write~init~int(104, 55, 1, 1);call write~init~int(100, 55, 2, 1);call write~init~int(108, 55, 3, 1);call write~init~int(99, 55, 4, 1);call write~init~int(0, 55, 5, 1);call #Ultimate.allocInit(13, 56);call #Ultimate.allocInit(24, 57);call #Ultimate.allocInit(216, 58);call #Ultimate.allocInit(4, 59);call write~init~int(37, 59, 0, 1);call write~init~int(115, 59, 1, 1);call write~init~int(10, 59, 2, 1);call write~init~int(0, 59, 3, 1);call #Ultimate.allocInit(4, 60);call write~init~int(37, 60, 0, 1);call write~init~int(115, 60, 1, 1);call write~init~int(10, 60, 2, 1);call write~init~int(0, 60, 3, 1);call #Ultimate.allocInit(24, 61);call #Ultimate.allocInit(17, 62);~ldv_irq_data_2_1~0.base, ~ldv_irq_data_2_1~0.offset := 0, 0;~ldv_irq_dev_1_1~0.base, ~ldv_irq_dev_1_1~0.offset := 0, 0;~ldv_irq_1_3~0 := 0;~ldv_irq_line_2_2~0 := 0;~ldv_irq_data_1_1~0.base, ~ldv_irq_data_1_1~0.offset := 0, 0;~ldv_irq_1_0~0 := 0;~ldv_irq_data_1_0~0.base, ~ldv_irq_data_1_0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_irq_line_2_1~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_irq_2_0~0 := 0;~ldv_irq_dev_1_3~0.base, ~ldv_irq_dev_1_3~0.offset := 0, 0;~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset := 0, 0;~ldv_irq_dev_1_0~0.base, ~ldv_irq_dev_1_0~0.offset := 0, 0;~ldv_irq_data_1_2~0.base, ~ldv_irq_data_1_2~0.offset := 0, 0;~ldv_irq_data_2_0~0.base, ~ldv_irq_data_2_0~0.offset := 0, 0;~ldv_irq_dev_2_3~0.base, ~ldv_irq_dev_2_3~0.offset := 0, 0;~ldv_irq_dev_2_0~0.base, ~ldv_irq_dev_2_0~0.offset := 0, 0;~ldv_irq_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_irq_1_1~0 := 0;~ldv_irq_2_3~0 := 0;~st21nfca_hci_i2c_driver_group0~0.base, ~st21nfca_hci_i2c_driver_group0~0.offset := 0, 0;~ldv_irq_data_2_3~0.base, ~ldv_irq_data_2_3~0.offset := 0, 0;~ldv_irq_line_1_3~0 := 0;~ldv_irq_2_2~0 := 0;~ldv_irq_dev_1_2~0.base, ~ldv_irq_dev_1_2~0.offset := 0, 0;~ldv_irq_line_2_0~0 := 0;~ldv_state_variable_3~0 := 0;~ldv_irq_line_1_0~0 := 0;~ldv_irq_dev_2_1~0.base, ~ldv_irq_dev_2_1~0.offset := 0, 0;~ref_cnt~0 := 0;~ldv_irq_data_2_2~0.base, ~ldv_irq_data_2_2~0.offset := 0, 0;~ldv_irq_line_1_1~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_irq_line_1_2~0 := 0;~ldv_state_variable_4~0 := 0;~ldv_irq_dev_2_2~0.base, ~ldv_irq_dev_2_2~0.offset := 0, 0;~ldv_irq_line_2_3~0 := 0;~ldv_irq_2_1~0 := 0;~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset := 63, 0;call #Ultimate.allocInit(56, 63);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#st21nfca_hci_i2c_id_table~0.base);call write~unchecked~int(115, ~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(116, ~#st21nfca_hci_i2c_id_table~0.base, 1 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(50, ~#st21nfca_hci_i2c_id_table~0.base, 2 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(49, ~#st21nfca_hci_i2c_id_table~0.base, 3 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(110, ~#st21nfca_hci_i2c_id_table~0.base, 4 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(102, ~#st21nfca_hci_i2c_id_table~0.base, 5 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(99, ~#st21nfca_hci_i2c_id_table~0.base, 6 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(97, ~#st21nfca_hci_i2c_id_table~0.base, 7 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(95, ~#st21nfca_hci_i2c_id_table~0.base, 8 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(104, ~#st21nfca_hci_i2c_id_table~0.base, 9 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(99, ~#st21nfca_hci_i2c_id_table~0.base, 10 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(105, ~#st21nfca_hci_i2c_id_table~0.base, 11 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(0, ~#st21nfca_hci_i2c_id_table~0.base, 12 + ~#st21nfca_hci_i2c_id_table~0.offset, 1);call write~unchecked~int(0, ~#st21nfca_hci_i2c_id_table~0.base, 20 + ~#st21nfca_hci_i2c_id_table~0.offset, 8);~__mod_i2c__st21nfca_hci_i2c_id_table_device_table~0.name := ~const~array~~LB~int~RB~int();~__mod_i2c__st21nfca_hci_i2c_id_table_device_table~0.driver_data := 0;~#len_seq~0.base, ~#len_seq~0.offset := 64, 0;call #Ultimate.allocInit(4, 64);call write~init~int(13, ~#len_seq~0.base, ~#len_seq~0.offset, 1);call write~init~int(24, ~#len_seq~0.base, 1 + ~#len_seq~0.offset, 1);call write~init~int(15, ~#len_seq~0.base, 2 + ~#len_seq~0.offset, 1);call write~init~int(29, ~#len_seq~0.base, 3 + ~#len_seq~0.offset, 1);~#wait_tab~0.base, ~#wait_tab~0.offset := 65, 0;call #Ultimate.allocInit(12, 65);call write~init~int(2, ~#wait_tab~0.base, ~#wait_tab~0.offset, 2);call write~init~int(3, ~#wait_tab~0.base, 2 + ~#wait_tab~0.offset, 2);call write~init~int(5, ~#wait_tab~0.base, 4 + ~#wait_tab~0.offset, 2);call write~init~int(15, ~#wait_tab~0.base, 6 + ~#wait_tab~0.offset, 2);call write~init~int(20, ~#wait_tab~0.base, 8 + ~#wait_tab~0.offset, 2);call write~init~int(40, ~#wait_tab~0.base, 10 + ~#wait_tab~0.offset, 2);~#i2c_phy_ops~0.base, ~#i2c_phy_ops~0.offset := 66, 0;call #Ultimate.allocInit(24, 66);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_write.base, #funAddr~st21nfca_hci_i2c_write.offset, ~#i2c_phy_ops~0.base, ~#i2c_phy_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_enable.base, #funAddr~st21nfca_hci_i2c_enable.offset, ~#i2c_phy_ops~0.base, 8 + ~#i2c_phy_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_disable.base, #funAddr~st21nfca_hci_i2c_disable.offset, ~#i2c_phy_ops~0.base, 16 + ~#i2c_phy_ops~0.offset, 8);~#st21nfca_hci_i2c_driver~0.base, ~#st21nfca_hci_i2c_driver~0.offset := 67, 0;call #Ultimate.allocInit(221, 67);call write~init~int(0, ~#st21nfca_hci_i2c_driver~0.base, ~#st21nfca_hci_i2c_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 4 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_probe.base, #funAddr~st21nfca_hci_i2c_probe.offset, ~#st21nfca_hci_i2c_driver~0.base, 12 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~st21nfca_hci_i2c_remove.base, #funAddr~st21nfca_hci_i2c_remove.offset, ~#st21nfca_hci_i2c_driver~0.base, 20 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 28 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 36 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 44 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 52 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 60 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(62, 0, ~#st21nfca_hci_i2c_driver~0.base, 68 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 76 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#st21nfca_hci_i2c_driver~0.base, 84 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 92 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~int(0, ~#st21nfca_hci_i2c_driver~0.base, 100 + ~#st21nfca_hci_i2c_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 101 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 109 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 117 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 125 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 133 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 141 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 149 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 157 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 165 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 173 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(~#st21nfca_hci_i2c_id_table~0.base, ~#st21nfca_hci_i2c_id_table~0.offset, ~#st21nfca_hci_i2c_driver~0.base, 181 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 189 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 197 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 205 + ~#st21nfca_hci_i2c_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#st21nfca_hci_i2c_driver~0.base, 213 + ~#st21nfca_hci_i2c_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_spin~0 := 0; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret333#1.base, main_#t~ret333#1.offset, main_#t~ret334#1.base, main_#t~ret334#1.offset, main_#t~ret335#1.base, main_#t~ret335#1.offset, main_#t~ret336#1.base, main_#t~ret336#1.offset, main_#t~ret337#1.base, main_#t~ret337#1.offset, main_#t~nondet338#1, main_#t~switch339#1, main_#t~nondet340#1, main_#t~switch341#1, main_#t~ret342#1, main_#t~ret343#1, main_#t~nondet344#1, main_#t~switch345#1, main_#t~ret346#1, main_#t~nondet347#1, main_#t~switch348#1, main_#t~ret349#1, main_#t~ret350#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~26#1.base, main_~tmp~26#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~26#1.base, main_~tmp~26#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset;havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,545 INFO L272 TraceCheckUtils]: 2: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} call main_#t~ret333#1.base, main_#t~ret333#1.offset := ldv_zalloc(1); {79592#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:13,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {79592#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {79564#true} is VALID [2022-02-20 22:02:13,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {79564#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {79564#true} is VALID [2022-02-20 22:02:13,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {79564#true} assume true; {79564#true} is VALID [2022-02-20 22:02:13,546 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {79564#true} {79566#(= ~ldv_irq_1_3~0 0)} #1284#return; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} main_~tmp~26#1.base, main_~tmp~26#1.offset := main_#t~ret333#1.base, main_#t~ret333#1.offset;havoc main_#t~ret333#1.base, main_#t~ret333#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~26#1.base, main_~tmp~26#1.offset; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,547 INFO L272 TraceCheckUtils]: 8: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} call main_#t~ret334#1.base, main_#t~ret334#1.offset := ldv_zalloc(1); {79592#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:13,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {79592#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {79564#true} is VALID [2022-02-20 22:02:13,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {79564#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {79564#true} is VALID [2022-02-20 22:02:13,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {79564#true} assume true; {79564#true} is VALID [2022-02-20 22:02:13,547 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {79564#true} {79566#(= ~ldv_irq_1_3~0 0)} #1286#return; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset := main_#t~ret334#1.base, main_#t~ret334#1.offset;havoc main_#t~ret334#1.base, main_#t~ret334#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,548 INFO L272 TraceCheckUtils]: 14: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} call main_#t~ret335#1.base, main_#t~ret335#1.offset := ldv_zalloc(1); {79592#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:13,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {79592#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {79564#true} is VALID [2022-02-20 22:02:13,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {79564#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {79564#true} is VALID [2022-02-20 22:02:13,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {79564#true} assume true; {79564#true} is VALID [2022-02-20 22:02:13,549 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {79564#true} {79566#(= ~ldv_irq_1_3~0 0)} #1288#return; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset := main_#t~ret335#1.base, main_#t~ret335#1.offset;havoc main_#t~ret335#1.base, main_#t~ret335#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___1~5#1.base, main_~tmp___1~5#1.offset; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,550 INFO L272 TraceCheckUtils]: 20: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} call main_#t~ret336#1.base, main_#t~ret336#1.offset := ldv_zalloc(232); {79592#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:13,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {79592#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {79564#true} is VALID [2022-02-20 22:02:13,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {79564#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {79564#true} is VALID [2022-02-20 22:02:13,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {79564#true} assume true; {79564#true} is VALID [2022-02-20 22:02:13,550 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {79564#true} {79566#(= ~ldv_irq_1_3~0 0)} #1290#return; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset := main_#t~ret336#1.base, main_#t~ret336#1.offset;havoc main_#t~ret336#1.base, main_#t~ret336#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,551 INFO L272 TraceCheckUtils]: 26: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} call main_#t~ret337#1.base, main_#t~ret337#1.offset := ldv_zalloc(32); {79592#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:02:13,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {79592#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet27#1 && #t~nondet27#1 <= 2147483647;~tmp___0~1#1 := #t~nondet27#1;havoc #t~nondet27#1; {79564#true} is VALID [2022-02-20 22:02:13,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {79564#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {79564#true} is VALID [2022-02-20 22:02:13,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {79564#true} assume true; {79564#true} is VALID [2022-02-20 22:02:13,552 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {79564#true} {79566#(= ~ldv_irq_1_3~0 0)} #1292#return; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset := main_#t~ret337#1.base, main_#t~ret337#1.offset;havoc main_#t~ret337#1.base, main_#t~ret337#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___3~1#1.base, main_~tmp___3~1#1.offset;assume { :begin_inline_ldv_initialize } true; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_4~0 := 0;~ldv_state_variable_1~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_3~0 := 0;~ldv_state_variable_2~0 := 1; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} assume -2147483648 <= main_#t~nondet338#1 && main_#t~nondet338#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet338#1;havoc main_#t~nondet338#1;main_#t~switch339#1 := 0 == main_~tmp___4~0#1; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} assume !main_#t~switch339#1;main_#t~switch339#1 := main_#t~switch339#1 || 1 == main_~tmp___4~0#1; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} assume main_#t~switch339#1; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} assume 0 != ~ldv_state_variable_1~0;assume { :begin_inline_choose_interrupt_1 } true;havoc choose_interrupt_1_#t~nondet326#1, choose_interrupt_1_#t~switch327#1, choose_interrupt_1_#t~ret328#1, choose_interrupt_1_#t~ret329#1, choose_interrupt_1_#t~ret330#1, choose_interrupt_1_#t~ret331#1, choose_interrupt_1_~tmp~24#1;havoc choose_interrupt_1_~tmp~24#1;assume -2147483648 <= choose_interrupt_1_#t~nondet326#1 && choose_interrupt_1_#t~nondet326#1 <= 2147483647;choose_interrupt_1_~tmp~24#1 := choose_interrupt_1_#t~nondet326#1;havoc choose_interrupt_1_#t~nondet326#1;choose_interrupt_1_#t~switch327#1 := 0 == choose_interrupt_1_~tmp~24#1; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,554 INFO L290 TraceCheckUtils]: 37: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} assume !choose_interrupt_1_#t~switch327#1;choose_interrupt_1_#t~switch327#1 := choose_interrupt_1_#t~switch327#1 || 1 == choose_interrupt_1_~tmp~24#1; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,554 INFO L290 TraceCheckUtils]: 38: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} assume !choose_interrupt_1_#t~switch327#1;choose_interrupt_1_#t~switch327#1 := choose_interrupt_1_#t~switch327#1 || 2 == choose_interrupt_1_~tmp~24#1; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,555 INFO L290 TraceCheckUtils]: 39: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} assume !choose_interrupt_1_#t~switch327#1;choose_interrupt_1_#t~switch327#1 := choose_interrupt_1_#t~switch327#1 || 3 == choose_interrupt_1_~tmp~24#1; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} assume choose_interrupt_1_#t~switch327#1; {79566#(= ~ldv_irq_1_3~0 0)} is VALID [2022-02-20 22:02:13,555 INFO L272 TraceCheckUtils]: 41: Hoare triple {79566#(= ~ldv_irq_1_3~0 0)} call choose_interrupt_1_#t~ret331#1 := ldv_irq_1(~ldv_irq_1_3~0, ~ldv_irq_line_1_3~0, ~ldv_irq_data_1_3~0.base, ~ldv_irq_data_1_3~0.offset); {79587#(= |ldv_irq_1_#in~state#1| 0)} is VALID [2022-02-20 22:02:13,556 INFO L290 TraceCheckUtils]: 42: Hoare triple {79587#(= |ldv_irq_1_#in~state#1| 0)} ~state#1 := #in~state#1;~line#1 := #in~line#1;~data#1.base, ~data#1.offset := #in~data#1.base, #in~data#1.offset;havoc ~irq_retval~0#1;havoc ~tmp~22#1;havoc ~tmp___0~11#1; {79588#(= |ldv_irq_1_~state#1| 0)} is VALID [2022-02-20 22:02:13,556 INFO L290 TraceCheckUtils]: 43: Hoare triple {79588#(= |ldv_irq_1_~state#1| 0)} assume 0 != ~state#1;assume -2147483648 <= #t~nondet318#1 && #t~nondet318#1 <= 2147483647;~tmp~22#1 := #t~nondet318#1;havoc #t~nondet318#1;#t~switch319#1 := 0 == ~tmp~22#1; {79565#false} is VALID [2022-02-20 22:02:13,556 INFO L290 TraceCheckUtils]: 44: Hoare triple {79565#false} assume !#t~switch319#1;#t~switch319#1 := #t~switch319#1 || 1 == ~tmp~22#1; {79565#false} is VALID [2022-02-20 22:02:13,556 INFO L290 TraceCheckUtils]: 45: Hoare triple {79565#false} assume #t~switch319#1; {79565#false} is VALID [2022-02-20 22:02:13,556 INFO L290 TraceCheckUtils]: 46: Hoare triple {79565#false} assume 2 == ~state#1; {79565#false} is VALID [2022-02-20 22:02:13,557 INFO L272 TraceCheckUtils]: 47: Hoare triple {79565#false} call #t~ret321#1 := st21nfca_hci_irq_thread_fn(~line#1, ~data#1.base, ~data#1.offset); {79565#false} is VALID [2022-02-20 22:02:13,557 INFO L290 TraceCheckUtils]: 48: Hoare triple {79565#false} ~irq#1 := #in~irq#1;~phy_id#1.base, ~phy_id#1.offset := #in~phy_id#1.base, #in~phy_id#1.offset;havoc ~phy~3#1.base, ~phy~3#1.offset;havoc ~client~2#1.base, ~client~2#1.offset;havoc ~r~4#1;havoc ~__warned~0#1;havoc ~__ret_warn_once~0#1;havoc ~__ret_warn_on~0#1;havoc ~tmp~16#1;havoc ~tmp___0~8#1;havoc ~tmp___1~3#1;call ~#descriptor~1#1.base, ~#descriptor~1#1.offset := #Ultimate.allocOnStack(37);havoc ~tmp___2~2#1;~phy~3#1.base, ~phy~3#1.offset := ~phy_id#1.base, ~phy_id#1.offset;#t~short225#1 := 0 == (~phy~3#1.base + ~phy~3#1.offset) % 18446744073709551616; {79565#false} is VALID [2022-02-20 22:02:13,557 INFO L290 TraceCheckUtils]: 49: Hoare triple {79565#false} assume #t~short225#1; {79565#false} is VALID [2022-02-20 22:02:13,557 INFO L290 TraceCheckUtils]: 50: Hoare triple {79565#false} assume !#t~short225#1;havoc #t~mem223#1.base, #t~mem223#1.offset;havoc #t~mem224#1;havoc #t~short225#1;call #t~mem230#1.base, #t~mem230#1.offset := read~$Pointer$(~phy~3#1.base, ~phy~3#1.offset, 8);~client~2#1.base, ~client~2#1.offset := #t~mem230#1.base, #t~mem230#1.offset;havoc #t~mem230#1.base, #t~mem230#1.offset;call write~$Pointer$(18, 0, ~#descriptor~1#1.base, ~#descriptor~1#1.offset, 8);call write~$Pointer$(19, 0, ~#descriptor~1#1.base, 8 + ~#descriptor~1#1.offset, 8);call write~$Pointer$(20, 0, ~#descriptor~1#1.base, 16 + ~#descriptor~1#1.offset, 8);call write~$Pointer$(21, 0, ~#descriptor~1#1.base, 24 + ~#descriptor~1#1.offset, 8);call write~int(526, ~#descriptor~1#1.base, 32 + ~#descriptor~1#1.offset, 4);call write~int(0, ~#descriptor~1#1.base, 36 + ~#descriptor~1#1.offset, 1);call #t~mem231#1 := read~int(~#descriptor~1#1.base, 36 + ~#descriptor~1#1.offset, 1); {79565#false} is VALID [2022-02-20 22:02:13,557 INFO L272 TraceCheckUtils]: 51: Hoare triple {79565#false} call #t~ret232#1 := ldv__builtin_expect(#t~mem231#1 % 256, 0); {79564#true} is VALID [2022-02-20 22:02:13,557 INFO L290 TraceCheckUtils]: 52: Hoare triple {79564#true} ~exp := #in~exp;~c := #in~c;#res := ~exp; {79564#true} is VALID [2022-02-20 22:02:13,557 INFO L290 TraceCheckUtils]: 53: Hoare triple {79564#true} assume true; {79564#true} is VALID [2022-02-20 22:02:13,557 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {79564#true} {79565#false} #1238#return; {79565#false} is VALID [2022-02-20 22:02:13,558 INFO L290 TraceCheckUtils]: 55: Hoare triple {79565#false} assume -9223372036854775808 <= #t~ret232#1 && #t~ret232#1 <= 9223372036854775807;~tmp___2~2#1 := #t~ret232#1;havoc #t~mem231#1;havoc #t~ret232#1; {79565#false} is VALID [2022-02-20 22:02:13,558 INFO L290 TraceCheckUtils]: 56: Hoare triple {79565#false} assume 0 != ~tmp___2~2#1;havoc #t~nondet233#1; {79565#false} is VALID [2022-02-20 22:02:13,558 INFO L290 TraceCheckUtils]: 57: Hoare triple {79565#false} call #t~mem234#1 := read~int(~phy~3#1.base, 52 + ~phy~3#1.offset, 4); {79565#false} is VALID [2022-02-20 22:02:13,558 INFO L290 TraceCheckUtils]: 58: Hoare triple {79565#false} assume !(0 != #t~mem234#1);havoc #t~mem234#1;call #t~mem235#1.base, #t~mem235#1.offset := read~$Pointer$(~phy~3#1.base, 28 + ~phy~3#1.offset, 8);assume { :begin_inline_st21nfca_hci_i2c_read } true;st21nfca_hci_i2c_read_#in~phy#1.base, st21nfca_hci_i2c_read_#in~phy#1.offset, st21nfca_hci_i2c_read_#in~skb#1.base, st21nfca_hci_i2c_read_#in~skb#1.offset := ~phy~3#1.base, ~phy~3#1.offset, #t~mem235#1.base, #t~mem235#1.offset;havoc st21nfca_hci_i2c_read_#res#1;havoc st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset, st21nfca_hci_i2c_read_#t~mem203#1, st21nfca_hci_i2c_read_#t~mem204#1, st21nfca_hci_i2c_read_#t~mem205#1, st21nfca_hci_i2c_read_#t~ret206#1, st21nfca_hci_i2c_read_#t~mem207#1, st21nfca_hci_i2c_read_#t~mem208#1, st21nfca_hci_i2c_read_#t~mem209#1, st21nfca_hci_i2c_read_#t~short210#1, st21nfca_hci_i2c_read_#t~mem211#1, st21nfca_hci_i2c_read_#t~mem212#1, st21nfca_hci_i2c_read_#t~mem213#1, st21nfca_hci_i2c_read_#t~short214#1, st21nfca_hci_i2c_read_#t~short215#1, st21nfca_hci_i2c_read_#t~ret216#1.base, st21nfca_hci_i2c_read_#t~ret216#1.offset, st21nfca_hci_i2c_read_#t~memcpy~res217#1.base, st21nfca_hci_i2c_read_#t~memcpy~res217#1.offset, st21nfca_hci_i2c_read_#t~mem219#1.base, st21nfca_hci_i2c_read_#t~mem219#1.offset, st21nfca_hci_i2c_read_#t~mem218#1, st21nfca_hci_i2c_read_#t~mem220#1, st21nfca_hci_i2c_read_#t~ret221#1, st21nfca_hci_i2c_read_#t~mem222#1, st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset, st21nfca_hci_i2c_read_~skb#1.base, st21nfca_hci_i2c_read_~skb#1.offset, st21nfca_hci_i2c_read_~r~3#1, st21nfca_hci_i2c_read_~i~3#1, st21nfca_hci_i2c_read_~len~1#1, st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset, st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset, st21nfca_hci_i2c_read_~__len~0#1, st21nfca_hci_i2c_read_~__ret~0#1.base, st21nfca_hci_i2c_read_~__ret~0#1.offset, st21nfca_hci_i2c_read_~tmp___0~7#1.base, st21nfca_hci_i2c_read_~tmp___0~7#1.offset, st21nfca_hci_i2c_read_~tmp___1~2#1;st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset := st21nfca_hci_i2c_read_#in~phy#1.base, st21nfca_hci_i2c_read_#in~phy#1.offset;st21nfca_hci_i2c_read_~skb#1.base, st21nfca_hci_i2c_read_~skb#1.offset := st21nfca_hci_i2c_read_#in~skb#1.base, st21nfca_hci_i2c_read_#in~skb#1.offset;havoc st21nfca_hci_i2c_read_~r~3#1;havoc st21nfca_hci_i2c_read_~i~3#1;havoc st21nfca_hci_i2c_read_~len~1#1;call st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset := #Ultimate.allocOnStack(29);havoc st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset;havoc st21nfca_hci_i2c_read_~__len~0#1;havoc st21nfca_hci_i2c_read_~__ret~0#1.base, st21nfca_hci_i2c_read_~__ret~0#1.offset;havoc st21nfca_hci_i2c_read_~tmp___0~7#1.base, st21nfca_hci_i2c_read_~tmp___0~7#1.offset;havoc st21nfca_hci_i2c_read_~tmp___1~2#1;call st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset := read~$Pointer$(st21nfca_hci_i2c_read_~phy#1.base, st21nfca_hci_i2c_read_~phy#1.offset, 8);st21nfca_hci_i2c_read_~client~1#1.base, st21nfca_hci_i2c_read_~client~1#1.offset := st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset;havoc st21nfca_hci_i2c_read_#t~mem202#1.base, st21nfca_hci_i2c_read_#t~mem202#1.offset;call st21nfca_hci_i2c_read_#t~mem203#1 := read~int(st21nfca_hci_i2c_read_~phy#1.base, 36 + st21nfca_hci_i2c_read_~phy#1.offset, 4); {79565#false} is VALID [2022-02-20 22:02:13,558 INFO L290 TraceCheckUtils]: 59: Hoare triple {79565#false} assume !(st21nfca_hci_i2c_read_#t~mem203#1 % 4294967296 <= 3);havoc st21nfca_hci_i2c_read_#t~mem203#1;st21nfca_hci_i2c_read_#res#1 := -5;call ULTIMATE.dealloc(st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset);havoc st21nfca_hci_i2c_read_~#buf~0#1.base, st21nfca_hci_i2c_read_~#buf~0#1.offset; {79565#false} is VALID [2022-02-20 22:02:13,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {79565#false} #t~ret236#1 := st21nfca_hci_i2c_read_#res#1;assume { :end_inline_st21nfca_hci_i2c_read } true;assume -2147483648 <= #t~ret236#1 && #t~ret236#1 <= 2147483647;~r~4#1 := #t~ret236#1;havoc #t~mem235#1.base, #t~mem235#1.offset;havoc #t~ret236#1; {79565#false} is VALID [2022-02-20 22:02:13,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {79565#false} assume !(-121 == ~r~4#1); {79565#false} is VALID [2022-02-20 22:02:13,558 INFO L290 TraceCheckUtils]: 62: Hoare triple {79565#false} assume !(-11 == ~r~4#1 || -5 == ~r~4#1);#t~short239#1 := -74 == ~r~4#1; {79565#false} is VALID [2022-02-20 22:02:13,559 INFO L290 TraceCheckUtils]: 63: Hoare triple {79565#false} assume #t~short239#1;call #t~mem238#1 := read~int(~phy~3#1.base, 40 + ~phy~3#1.offset, 4);#t~short239#1 := #t~mem238#1 % 4294967296 <= 5; {79565#false} is VALID [2022-02-20 22:02:13,559 INFO L290 TraceCheckUtils]: 64: Hoare triple {79565#false} assume !#t~short239#1;havoc #t~mem238#1;havoc #t~short239#1; {79565#false} is VALID [2022-02-20 22:02:13,559 INFO L290 TraceCheckUtils]: 65: Hoare triple {79565#false} assume !(~r~4#1 > 0); {79565#false} is VALID [2022-02-20 22:02:13,559 INFO L272 TraceCheckUtils]: 66: Hoare triple {79565#false} call #t~ret246#1.base, #t~ret246#1.offset := alloc_skb(74, 208); {79565#false} is VALID [2022-02-20 22:02:13,559 INFO L290 TraceCheckUtils]: 67: Hoare triple {79565#false} ~size#1 := #in~size#1;~flags#1 := #in~flags#1;havoc ~tmp~28#1.base, ~tmp~28#1.offset; {79565#false} is VALID [2022-02-20 22:02:13,559 INFO L272 TraceCheckUtils]: 68: Hoare triple {79565#false} call ldv_check_alloc_flags(~flags#1); {79565#false} is VALID [2022-02-20 22:02:13,559 INFO L290 TraceCheckUtils]: 69: Hoare triple {79565#false} ~flags := #in~flags; {79565#false} is VALID [2022-02-20 22:02:13,559 INFO L290 TraceCheckUtils]: 70: Hoare triple {79565#false} assume !(0 == ~ldv_spin~0 || 0 == (if 0 == ~flags then 0 else (if 1 == ~flags then 0 else ~bitwiseAnd(~flags, 16))) % 4294967296); {79565#false} is VALID [2022-02-20 22:02:13,559 INFO L272 TraceCheckUtils]: 71: Hoare triple {79565#false} call ldv_error(); {79565#false} is VALID [2022-02-20 22:02:13,560 INFO L290 TraceCheckUtils]: 72: Hoare triple {79565#false} assume !false; {79565#false} is VALID [2022-02-20 22:02:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 22:02:13,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:02:13,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100699518] [2022-02-20 22:02:13,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100699518] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:02:13,561 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:02:13,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:02:13,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804779209] [2022-02-20 22:02:13,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:02:13,562 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 73 [2022-02-20 22:02:13,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:02:13,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:02:13,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:02:13,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:02:13,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:02:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:02:13,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:02:13,617 INFO L87 Difference]: Start difference. First operand 3960 states and 5416 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6)