./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--ti--wlcore--wlcore_spi.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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--ti--wlcore--wlcore_spi.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 1657481d5228681bef1950f6f1ab81a8ec46d121315dee697958f1e243133bbf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:51:56,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:51:56,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:51:56,111 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:51:56,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:51:56,115 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:51:56,116 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:51:56,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:51:56,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:51:56,126 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:51:56,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:51:56,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:51:56,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:51:56,131 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:51:56,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:51:56,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:51:56,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:51:56,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:51:56,140 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:51:56,144 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:51:56,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:51:56,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:51:56,148 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:51:56,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:51:56,151 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:51:56,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:51:56,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:51:56,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:51:56,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:51:56,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:51:56,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:51:56,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:51:56,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:51:56,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:51:56,158 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:51:56,158 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:51:56,159 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:51:56,159 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:51:56,159 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:51:56,160 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:51:56,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:51:56,161 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 21:51:56,192 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:51:56,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:51:56,193 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:51:56,193 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:51:56,194 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:51:56,194 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:51:56,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:51:56,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:51:56,195 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:51:56,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:51:56,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:51:56,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:51:56,197 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:51:56,197 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:51:56,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:51:56,197 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:51:56,198 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:51:56,198 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:51:56,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:51:56,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:51:56,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:51:56,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:51:56,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:51:56,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:51:56,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:51:56,199 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:51:56,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:51:56,200 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:51:56,200 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:51:56,200 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:51:56,201 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 -> 1657481d5228681bef1950f6f1ab81a8ec46d121315dee697958f1e243133bbf [2022-02-20 21:51:56,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:51:56,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:51:56,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:51:56,435 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:51:56,436 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:51:56,437 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--ti--wlcore--wlcore_spi.ko-entry_point.cil.out.i [2022-02-20 21:51:56,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0accba1b2/93529208e817406c9c72a823e80b85eb/FLAG097b480e2 [2022-02-20 21:51:57,134 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:51:57,135 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--ti--wlcore--wlcore_spi.ko-entry_point.cil.out.i [2022-02-20 21:51:57,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0accba1b2/93529208e817406c9c72a823e80b85eb/FLAG097b480e2 [2022-02-20 21:51:57,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0accba1b2/93529208e817406c9c72a823e80b85eb [2022-02-20 21:51:57,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:51:57,470 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:51:57,471 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:51:57,471 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:51:57,473 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:51:57,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:51:57" (1/1) ... [2022-02-20 21:51:57,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49f6fcbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:57, skipping insertion in model container [2022-02-20 21:51:57,475 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:51:57" (1/1) ... [2022-02-20 21:51:57,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:51:57,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:51:58,186 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--ti--wlcore--wlcore_spi.ko-entry_point.cil.out.i[182110,182123] [2022-02-20 21:51:58,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:51:58,593 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:51:58,715 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.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--ti--wlcore--wlcore_spi.ko-entry_point.cil.out.i[182110,182123] [2022-02-20 21:51:58,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:51:58,855 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:51:58,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:58 WrapperNode [2022-02-20 21:51:58,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:51:58,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:51:58,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:51:58,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:51:58,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:58" (1/1) ... [2022-02-20 21:51:58,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:58" (1/1) ... [2022-02-20 21:51:58,987 INFO L137 Inliner]: procedures = 95, calls = 357, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 1002 [2022-02-20 21:51:58,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:51:58,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:51:58,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:51:58,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:51:58,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:58" (1/1) ... [2022-02-20 21:51:58,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:58" (1/1) ... [2022-02-20 21:51:59,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:58" (1/1) ... [2022-02-20 21:51:59,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:58" (1/1) ... [2022-02-20 21:51:59,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:58" (1/1) ... [2022-02-20 21:51:59,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:58" (1/1) ... [2022-02-20 21:51:59,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:58" (1/1) ... [2022-02-20 21:51:59,113 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:51:59,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:51:59,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:51:59,114 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:51:59,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:58" (1/1) ... [2022-02-20 21:51:59,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:51:59,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:51:59,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 21:51:59,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 21:51:59,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:51:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-02-20 21:51:59,193 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-02-20 21:51:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:51:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:51:59,193 INFO L130 BoogieDeclarations]: Found specification of procedure spi_message_init [2022-02-20 21:51:59,193 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_message_init [2022-02-20 21:51:59,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:51:59,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:51:59,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:51:59,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:51:59,194 INFO L130 BoogieDeclarations]: Found specification of procedure spi_sync [2022-02-20 21:51:59,194 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_sync [2022-02-20 21:51:59,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:51:59,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:51:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:51:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:51:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:51:59,195 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:51:59,195 INFO L130 BoogieDeclarations]: Found specification of procedure spi_message_add_tail [2022-02-20 21:51:59,195 INFO L138 BoogieDeclarations]: Found implementation of procedure spi_message_add_tail [2022-02-20 21:51:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:51:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:51:59,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:51:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-02-20 21:51:59,196 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-02-20 21:51:59,196 INFO L130 BoogieDeclarations]: Found specification of procedure wl12xx_spi_reset [2022-02-20 21:51:59,196 INFO L138 BoogieDeclarations]: Found implementation of procedure wl12xx_spi_reset [2022-02-20 21:51:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_release_2 [2022-02-20 21:51:59,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_release_2 [2022-02-20 21:51:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:51:59,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:51:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 21:51:59,197 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 21:51:59,197 INFO L130 BoogieDeclarations]: Found specification of procedure to_spi_device [2022-02-20 21:51:59,197 INFO L138 BoogieDeclarations]: Found implementation of procedure to_spi_device [2022-02-20 21:51:59,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:51:59,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:51:59,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:51:59,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:51:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:51:59,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:51:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:51:59,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:51:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure wl12xx_spi_init [2022-02-20 21:51:59,199 INFO L138 BoogieDeclarations]: Found implementation of procedure wl12xx_spi_init [2022-02-20 21:51:59,519 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:51:59,521 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:51:59,707 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:52:00,740 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:52:00,758 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:52:00,763 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 21:52:00,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:52:00 BoogieIcfgContainer [2022-02-20 21:52:00,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:52:00,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:52:00,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:52:00,771 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:52:00,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:51:57" (1/3) ... [2022-02-20 21:52:00,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305ab4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:52:00, skipping insertion in model container [2022-02-20 21:52:00,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:51:58" (2/3) ... [2022-02-20 21:52:00,773 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@305ab4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:52:00, skipping insertion in model container [2022-02-20 21:52:00,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:52:00" (3/3) ... [2022-02-20 21:52:00,774 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--ti--wlcore--wlcore_spi.ko-entry_point.cil.out.i [2022-02-20 21:52:00,779 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:52:00,779 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:52:00,820 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:52:00,826 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 21:52:00,827 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:52:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand has 322 states, 222 states have (on average 1.3198198198198199) internal successors, (293), 234 states have internal predecessors, (293), 82 states have call successors, (82), 17 states have call predecessors, (82), 16 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2022-02-20 21:52:00,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 21:52:00,874 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:52:00,874 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:52:00,875 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:52:00,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:52:00,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1739679285, now seen corresponding path program 1 times [2022-02-20 21:52:00,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:52:00,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744166078] [2022-02-20 21:52:00,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:00,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:52:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:01,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:52:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:01,316 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {325#true} is VALID [2022-02-20 21:52:01,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {325#true} is VALID [2022-02-20 21:52:01,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} assume true; {325#true} is VALID [2022-02-20 21:52:01,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} #701#return; {325#true} is VALID [2022-02-20 21:52:01,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:52:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:01,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {344#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {325#true} is VALID [2022-02-20 21:52:01,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {325#true} is VALID [2022-02-20 21:52:01,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} assume true; {325#true} is VALID [2022-02-20 21:52:01,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} #703#return; {325#true} is VALID [2022-02-20 21:52:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 21:52:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:01,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {345#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {325#true} is VALID [2022-02-20 21:52:01,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {325#true} is VALID [2022-02-20 21:52:01,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {325#true} is VALID [2022-02-20 21:52:01,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} #705#return; {325#true} is VALID [2022-02-20 21:52:01,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 21:52:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:01,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {345#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {325#true} is VALID [2022-02-20 21:52:01,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {325#true} is VALID [2022-02-20 21:52:01,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {325#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {325#true} is VALID [2022-02-20 21:52:01,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {325#true} {325#true} #707#return; {325#true} is VALID [2022-02-20 21:52:01,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {325#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(101, 2);call #Ultimate.allocInit(38, 3);call #Ultimate.allocInit(37, 4);call #Ultimate.allocInit(29, 5);call #Ultimate.allocInit(229, 6);call #Ultimate.allocInit(18, 7);call #Ultimate.allocInit(21, 8);call #Ultimate.allocInit(18, 9);call #Ultimate.allocInit(7, 10);call write~init~int(119, 10, 0, 1);call write~init~int(108, 10, 1, 1);call write~init~int(49, 10, 2, 1);call write~init~int(50, 10, 3, 1);call write~init~int(120, 10, 4, 1);call write~init~int(120, 10, 5, 1);call write~init~int(0, 10, 6, 1);call #Ultimate.allocInit(32, 11);call #Ultimate.allocInit(4, 12);call write~init~int(105, 12, 0, 1);call write~init~int(114, 12, 1, 1);call write~init~int(113, 12, 2, 1);call write~init~int(0, 12, 3, 1);call #Ultimate.allocInit(21, 13);call #Ultimate.allocInit(25, 14);call #Ultimate.allocInit(32, 15);call #Ultimate.allocInit(11, 16);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~wl1271_spi_driver_group0~0.base, ~wl1271_spi_driver_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~spi_ops_group0~0.base, ~spi_ops_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#spi_ops~0.base, ~#spi_ops~0.offset := 17, 0;call #Ultimate.allocInit(48, 17);call write~init~$Pointer$(#funAddr~wl12xx_spi_raw_read.base, #funAddr~wl12xx_spi_raw_read.offset, ~#spi_ops~0.base, ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_raw_write.base, #funAddr~wl12xx_spi_raw_write.offset, ~#spi_ops~0.base, 8 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_reset.base, #funAddr~wl12xx_spi_reset.offset, ~#spi_ops~0.base, 16 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_init.base, #funAddr~wl12xx_spi_init.offset, ~#spi_ops~0.base, 24 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#spi_ops~0.base, 32 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#spi_ops~0.base, 40 + ~#spi_ops~0.offset, 8);~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset := 18, 0;call #Ultimate.allocInit(161, 18);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~wl1271_probe.base, #funAddr~wl1271_probe.offset, ~#wl1271_spi_driver~0.base, 8 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~wl1271_remove.base, #funAddr~wl1271_remove.offset, ~#wl1271_spi_driver~0.base, 16 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 24 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 32 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 40 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(16, 0, ~#wl1271_spi_driver~0.base, 48 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 56 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#wl1271_spi_driver~0.base, 64 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 72 + ~#wl1271_spi_driver~0.offset, 8);call write~init~int(0, ~#wl1271_spi_driver~0.base, 80 + ~#wl1271_spi_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 81 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 89 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 97 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 105 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 113 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 121 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 129 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 137 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 145 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 153 + ~#wl1271_spi_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~usb_urb~0.base, ~usb_urb~0.offset := 0, 0;~usb_dev~0.base, ~usb_dev~0.offset := 0, 0;~dev_counter~0 := 0;~completeFnIntCounter~0 := 0;~completeFnBulkCounter~0 := 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {325#true} is VALID [2022-02-20 21:52:01,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {325#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet156#1, main_#t~ret157#1.base, main_#t~ret157#1.offset, main_#t~nondet158#1, main_#t~ret159#1.base, main_#t~ret159#1.offset, main_#t~nondet160#1, main_#t~nondet161#1, main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset, main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset, main_#t~nondet164#1, main_#t~switch165#1, main_#t~nondet166#1, main_#t~switch167#1, main_#t~ret168#1, main_#t~ret169#1, main_#t~nondet170#1, main_#t~switch171#1, main_#t~ret172#1, main_#t~nondet173#1, main_#t~switch174#1, main_#t~mem175#1, main_#t~ret176#1, main_#t~mem177#1, main_#t~ret178#1, main_#t~ret179#1, main_#t~ret180#1, main_#t~ret181#1, main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~ldvarg0~0#1, main_~tmp~17#1, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset, main_~ldvarg6~0#1, main_~tmp___1~5#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset, main_~ldvarg4~0#1, main_~tmp___3~2#1, main_~ldvarg2~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;call main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~ldvarg0~0#1;havoc main_~tmp~17#1;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset;havoc main_~ldvarg6~0#1;havoc main_~tmp___1~5#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;havoc main_~ldvarg4~0#1;havoc main_~tmp___3~2#1;havoc main_~ldvarg2~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet156#1 && main_#t~nondet156#1 <= 2147483647;main_~tmp~17#1 := main_#t~nondet156#1;havoc main_#t~nondet156#1;main_~ldvarg0~0#1 := main_~tmp~17#1; {325#true} is VALID [2022-02-20 21:52:01,410 INFO L272 TraceCheckUtils]: 2: Hoare triple {325#true} call main_#t~ret157#1.base, main_#t~ret157#1.offset := ldv_zalloc(1); {344#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:01,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {344#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {325#true} is VALID [2022-02-20 21:52:01,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {325#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {325#true} is VALID [2022-02-20 21:52:01,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {325#true} assume true; {325#true} is VALID [2022-02-20 21:52:01,411 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {325#true} {325#true} #701#return; {325#true} is VALID [2022-02-20 21:52:01,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {325#true} main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset := main_#t~ret157#1.base, main_#t~ret157#1.offset;havoc main_#t~ret157#1.base, main_#t~ret157#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset;assume -2147483648 <= main_#t~nondet158#1 && main_#t~nondet158#1 <= 2147483647;main_~tmp___1~5#1 := main_#t~nondet158#1;havoc main_#t~nondet158#1;main_~ldvarg6~0#1 := main_~tmp___1~5#1; {325#true} is VALID [2022-02-20 21:52:01,412 INFO L272 TraceCheckUtils]: 8: Hoare triple {325#true} call main_#t~ret159#1.base, main_#t~ret159#1.offset := ldv_zalloc(1); {344#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:01,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {344#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {325#true} is VALID [2022-02-20 21:52:01,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {325#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {325#true} is VALID [2022-02-20 21:52:01,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {325#true} assume true; {325#true} is VALID [2022-02-20 21:52:01,413 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {325#true} {325#true} #703#return; {325#true} is VALID [2022-02-20 21:52:01,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {325#true} main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset := main_#t~ret159#1.base, main_#t~ret159#1.offset;havoc main_#t~ret159#1.base, main_#t~ret159#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;assume -2147483648 <= main_#t~nondet160#1 && main_#t~nondet160#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet160#1;havoc main_#t~nondet160#1;main_~ldvarg4~0#1 := main_~tmp___3~2#1;assume -2147483648 <= main_#t~nondet161#1 && main_#t~nondet161#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet161#1;havoc main_#t~nondet161#1;main_~ldvarg2~0#1 := main_~tmp___4~0#1;assume { :begin_inline_ldv_initialize } true; {325#true} is VALID [2022-02-20 21:52:01,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {325#true} assume { :end_inline_ldv_initialize } true; {325#true} is VALID [2022-02-20 21:52:01,415 INFO L272 TraceCheckUtils]: 15: Hoare triple {325#true} call main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset := #Ultimate.C_memset(main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, 0, 1); {345#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:52:01,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {345#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {325#true} is VALID [2022-02-20 21:52:01,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {325#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {325#true} is VALID [2022-02-20 21:52:01,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {325#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {325#true} is VALID [2022-02-20 21:52:01,416 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {325#true} {325#true} #705#return; {325#true} is VALID [2022-02-20 21:52:01,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {325#true} havoc main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset; {325#true} is VALID [2022-02-20 21:52:01,417 INFO L272 TraceCheckUtils]: 21: Hoare triple {325#true} call main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset := #Ultimate.C_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 1); {345#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:52:01,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {345#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {325#true} is VALID [2022-02-20 21:52:01,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {325#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {325#true} is VALID [2022-02-20 21:52:01,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {325#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {325#true} is VALID [2022-02-20 21:52:01,418 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {325#true} {325#true} #707#return; {325#true} is VALID [2022-02-20 21:52:01,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {325#true} havoc main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {343#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:01,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {343#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___5~0#1; {343#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:01,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {343#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___5~0#1; {343#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:01,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {343#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch165#1; {343#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:01,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {343#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet170#1 && main_#t~nondet170#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet170#1;havoc main_#t~nondet170#1;main_#t~switch171#1 := 0 == main_~tmp___7~0#1; {343#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:01,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {343#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch171#1; {343#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:52:01,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {343#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_wl1271_spi_driver_exit } true;assume { :begin_inline_spi_unregister_driver } true;spi_unregister_driver_#in~sdrv#1.base, spi_unregister_driver_#in~sdrv#1.offset := ~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset;havoc spi_unregister_driver_~sdrv#1.base, spi_unregister_driver_~sdrv#1.offset;spi_unregister_driver_~sdrv#1.base, spi_unregister_driver_~sdrv#1.offset := spi_unregister_driver_#in~sdrv#1.base, spi_unregister_driver_#in~sdrv#1.offset; {326#false} is VALID [2022-02-20 21:52:01,422 INFO L290 TraceCheckUtils]: 33: Hoare triple {326#false} assume !(0 != (spi_unregister_driver_~sdrv#1.base + spi_unregister_driver_~sdrv#1.offset) % 18446744073709551616); {326#false} is VALID [2022-02-20 21:52:01,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {326#false} assume { :end_inline_spi_unregister_driver } true; {326#false} is VALID [2022-02-20 21:52:01,423 INFO L290 TraceCheckUtils]: 35: Hoare triple {326#false} assume { :end_inline_wl1271_spi_driver_exit } true;~ldv_state_variable_0~0 := 2; {326#false} is VALID [2022-02-20 21:52:01,423 INFO L290 TraceCheckUtils]: 36: Hoare triple {326#false} assume { :begin_inline_ldv_check_final_state } true; {326#false} is VALID [2022-02-20 21:52:01,423 INFO L290 TraceCheckUtils]: 37: Hoare triple {326#false} assume !(0 == (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616); {326#false} is VALID [2022-02-20 21:52:01,424 INFO L272 TraceCheckUtils]: 38: Hoare triple {326#false} call ldv_error(); {326#false} is VALID [2022-02-20 21:52:01,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {326#false} assume !false; {326#false} is VALID [2022-02-20 21:52:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 21:52:01,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:52:01,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744166078] [2022-02-20 21:52:01,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744166078] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:52:01,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:52:01,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:52:01,428 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629201903] [2022-02-20 21:52:01,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:52:01,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2022-02-20 21:52:01,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:52:01,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:01,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:01,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:52:01,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:52:01,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:52:01,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:52:01,528 INFO L87 Difference]: Start difference. First operand has 322 states, 222 states have (on average 1.3198198198198199) internal successors, (293), 234 states have internal predecessors, (293), 82 states have call successors, (82), 17 states have call predecessors, (82), 16 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:09,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:09,402 INFO L93 Difference]: Finished difference Result 961 states and 1445 transitions. [2022-02-20 21:52:09,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:52:09,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2022-02-20 21:52:09,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:52:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1445 transitions. [2022-02-20 21:52:09,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1445 transitions. [2022-02-20 21:52:09,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1445 transitions. [2022-02-20 21:52:10,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1445 edges. 1445 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:10,843 INFO L225 Difference]: With dead ends: 961 [2022-02-20 21:52:10,843 INFO L226 Difference]: Without dead ends: 628 [2022-02-20 21:52:10,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:52:10,860 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 513 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:52:10,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 1319 Invalid, 928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 21:52:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-02-20 21:52:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 578. [2022-02-20 21:52:10,979 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:52:10,983 INFO L82 GeneralOperation]: Start isEquivalent. First operand 628 states. Second operand has 578 states, 404 states have (on average 1.2920792079207921) internal successors, (522), 412 states have internal predecessors, (522), 144 states have call successors, (144), 30 states have call predecessors, (144), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:10,991 INFO L74 IsIncluded]: Start isIncluded. First operand 628 states. Second operand has 578 states, 404 states have (on average 1.2920792079207921) internal successors, (522), 412 states have internal predecessors, (522), 144 states have call successors, (144), 30 states have call predecessors, (144), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:10,997 INFO L87 Difference]: Start difference. First operand 628 states. Second operand has 578 states, 404 states have (on average 1.2920792079207921) internal successors, (522), 412 states have internal predecessors, (522), 144 states have call successors, (144), 30 states have call predecessors, (144), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:11,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:11,042 INFO L93 Difference]: Finished difference Result 628 states and 918 transitions. [2022-02-20 21:52:11,042 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 918 transitions. [2022-02-20 21:52:11,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:11,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:11,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 578 states, 404 states have (on average 1.2920792079207921) internal successors, (522), 412 states have internal predecessors, (522), 144 states have call successors, (144), 30 states have call predecessors, (144), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) Second operand 628 states. [2022-02-20 21:52:11,061 INFO L87 Difference]: Start difference. First operand has 578 states, 404 states have (on average 1.2920792079207921) internal successors, (522), 412 states have internal predecessors, (522), 144 states have call successors, (144), 30 states have call predecessors, (144), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) Second operand 628 states. [2022-02-20 21:52:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:11,104 INFO L93 Difference]: Finished difference Result 628 states and 918 transitions. [2022-02-20 21:52:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 918 transitions. [2022-02-20 21:52:11,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:11,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:11,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:52:11,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:52:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 404 states have (on average 1.2920792079207921) internal successors, (522), 412 states have internal predecessors, (522), 144 states have call successors, (144), 30 states have call predecessors, (144), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:11,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 805 transitions. [2022-02-20 21:52:11,163 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 805 transitions. Word has length 40 [2022-02-20 21:52:11,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:52:11,164 INFO L470 AbstractCegarLoop]: Abstraction has 578 states and 805 transitions. [2022-02-20 21:52:11,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 805 transitions. [2022-02-20 21:52:11,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 21:52:11,166 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:52:11,166 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:52:11,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:52:11,167 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:52:11,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:52:11,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1704383672, now seen corresponding path program 1 times [2022-02-20 21:52:11,174 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:52:11,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987371532] [2022-02-20 21:52:11,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:11,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:52:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:11,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:52:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:11,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {3834#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {3815#true} is VALID [2022-02-20 21:52:11,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {3815#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {3815#true} is VALID [2022-02-20 21:52:11,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-02-20 21:52:11,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3815#true} {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #701#return; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:52:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:11,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {3834#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {3815#true} is VALID [2022-02-20 21:52:11,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {3815#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {3815#true} is VALID [2022-02-20 21:52:11,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-02-20 21:52:11,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3815#true} {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #703#return; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 21:52:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:11,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {3835#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {3815#true} is VALID [2022-02-20 21:52:11,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {3815#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {3815#true} is VALID [2022-02-20 21:52:11,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {3815#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3815#true} is VALID [2022-02-20 21:52:11,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3815#true} {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #705#return; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 21:52:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:11,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {3835#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {3815#true} is VALID [2022-02-20 21:52:11,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {3815#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {3815#true} is VALID [2022-02-20 21:52:11,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {3815#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3815#true} is VALID [2022-02-20 21:52:11,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3815#true} {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #707#return; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {3815#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(101, 2);call #Ultimate.allocInit(38, 3);call #Ultimate.allocInit(37, 4);call #Ultimate.allocInit(29, 5);call #Ultimate.allocInit(229, 6);call #Ultimate.allocInit(18, 7);call #Ultimate.allocInit(21, 8);call #Ultimate.allocInit(18, 9);call #Ultimate.allocInit(7, 10);call write~init~int(119, 10, 0, 1);call write~init~int(108, 10, 1, 1);call write~init~int(49, 10, 2, 1);call write~init~int(50, 10, 3, 1);call write~init~int(120, 10, 4, 1);call write~init~int(120, 10, 5, 1);call write~init~int(0, 10, 6, 1);call #Ultimate.allocInit(32, 11);call #Ultimate.allocInit(4, 12);call write~init~int(105, 12, 0, 1);call write~init~int(114, 12, 1, 1);call write~init~int(113, 12, 2, 1);call write~init~int(0, 12, 3, 1);call #Ultimate.allocInit(21, 13);call #Ultimate.allocInit(25, 14);call #Ultimate.allocInit(32, 15);call #Ultimate.allocInit(11, 16);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~wl1271_spi_driver_group0~0.base, ~wl1271_spi_driver_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~spi_ops_group0~0.base, ~spi_ops_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#spi_ops~0.base, ~#spi_ops~0.offset := 17, 0;call #Ultimate.allocInit(48, 17);call write~init~$Pointer$(#funAddr~wl12xx_spi_raw_read.base, #funAddr~wl12xx_spi_raw_read.offset, ~#spi_ops~0.base, ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_raw_write.base, #funAddr~wl12xx_spi_raw_write.offset, ~#spi_ops~0.base, 8 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_reset.base, #funAddr~wl12xx_spi_reset.offset, ~#spi_ops~0.base, 16 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_init.base, #funAddr~wl12xx_spi_init.offset, ~#spi_ops~0.base, 24 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#spi_ops~0.base, 32 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#spi_ops~0.base, 40 + ~#spi_ops~0.offset, 8);~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset := 18, 0;call #Ultimate.allocInit(161, 18);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~wl1271_probe.base, #funAddr~wl1271_probe.offset, ~#wl1271_spi_driver~0.base, 8 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~wl1271_remove.base, #funAddr~wl1271_remove.offset, ~#wl1271_spi_driver~0.base, 16 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 24 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 32 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 40 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(16, 0, ~#wl1271_spi_driver~0.base, 48 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 56 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#wl1271_spi_driver~0.base, 64 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 72 + ~#wl1271_spi_driver~0.offset, 8);call write~init~int(0, ~#wl1271_spi_driver~0.base, 80 + ~#wl1271_spi_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 81 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 89 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 97 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 105 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 113 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 121 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 129 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 137 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 145 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 153 + ~#wl1271_spi_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~usb_urb~0.base, ~usb_urb~0.offset := 0, 0;~usb_dev~0.base, ~usb_dev~0.offset := 0, 0;~dev_counter~0 := 0;~completeFnIntCounter~0 := 0;~completeFnBulkCounter~0 := 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet156#1, main_#t~ret157#1.base, main_#t~ret157#1.offset, main_#t~nondet158#1, main_#t~ret159#1.base, main_#t~ret159#1.offset, main_#t~nondet160#1, main_#t~nondet161#1, main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset, main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset, main_#t~nondet164#1, main_#t~switch165#1, main_#t~nondet166#1, main_#t~switch167#1, main_#t~ret168#1, main_#t~ret169#1, main_#t~nondet170#1, main_#t~switch171#1, main_#t~ret172#1, main_#t~nondet173#1, main_#t~switch174#1, main_#t~mem175#1, main_#t~ret176#1, main_#t~mem177#1, main_#t~ret178#1, main_#t~ret179#1, main_#t~ret180#1, main_#t~ret181#1, main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~ldvarg0~0#1, main_~tmp~17#1, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset, main_~ldvarg6~0#1, main_~tmp___1~5#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset, main_~ldvarg4~0#1, main_~tmp___3~2#1, main_~ldvarg2~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;call main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~ldvarg0~0#1;havoc main_~tmp~17#1;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset;havoc main_~ldvarg6~0#1;havoc main_~tmp___1~5#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;havoc main_~ldvarg4~0#1;havoc main_~tmp___3~2#1;havoc main_~ldvarg2~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet156#1 && main_#t~nondet156#1 <= 2147483647;main_~tmp~17#1 := main_#t~nondet156#1;havoc main_#t~nondet156#1;main_~ldvarg0~0#1 := main_~tmp~17#1; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,391 INFO L272 TraceCheckUtils]: 2: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret157#1.base, main_#t~ret157#1.offset := ldv_zalloc(1); {3834#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:11,391 INFO L290 TraceCheckUtils]: 3: Hoare triple {3834#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {3815#true} is VALID [2022-02-20 21:52:11,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {3815#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {3815#true} is VALID [2022-02-20 21:52:11,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-02-20 21:52:11,392 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3815#true} {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #701#return; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset := main_#t~ret157#1.base, main_#t~ret157#1.offset;havoc main_#t~ret157#1.base, main_#t~ret157#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset;assume -2147483648 <= main_#t~nondet158#1 && main_#t~nondet158#1 <= 2147483647;main_~tmp___1~5#1 := main_#t~nondet158#1;havoc main_#t~nondet158#1;main_~ldvarg6~0#1 := main_~tmp___1~5#1; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,397 INFO L272 TraceCheckUtils]: 8: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret159#1.base, main_#t~ret159#1.offset := ldv_zalloc(1); {3834#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:11,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {3834#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {3815#true} is VALID [2022-02-20 21:52:11,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {3815#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {3815#true} is VALID [2022-02-20 21:52:11,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {3815#true} assume true; {3815#true} is VALID [2022-02-20 21:52:11,398 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3815#true} {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #703#return; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset := main_#t~ret159#1.base, main_#t~ret159#1.offset;havoc main_#t~ret159#1.base, main_#t~ret159#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;assume -2147483648 <= main_#t~nondet160#1 && main_#t~nondet160#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet160#1;havoc main_#t~nondet160#1;main_~ldvarg4~0#1 := main_~tmp___3~2#1;assume -2147483648 <= main_#t~nondet161#1 && main_#t~nondet161#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet161#1;havoc main_#t~nondet161#1;main_~ldvarg2~0#1 := main_~tmp___4~0#1;assume { :begin_inline_ldv_initialize } true; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :end_inline_ldv_initialize } true; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,401 INFO L272 TraceCheckUtils]: 15: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset := #Ultimate.C_memset(main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, 0, 1); {3835#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:52:11,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {3835#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {3815#true} is VALID [2022-02-20 21:52:11,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {3815#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {3815#true} is VALID [2022-02-20 21:52:11,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {3815#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3815#true} is VALID [2022-02-20 21:52:11,406 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {3815#true} {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #705#return; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,407 INFO L290 TraceCheckUtils]: 20: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} havoc main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,408 INFO L272 TraceCheckUtils]: 21: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset := #Ultimate.C_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 1); {3835#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:52:11,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {3835#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {3815#true} is VALID [2022-02-20 21:52:11,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {3815#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {3815#true} is VALID [2022-02-20 21:52:11,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {3815#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3815#true} is VALID [2022-02-20 21:52:11,409 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {3815#true} {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #707#return; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,410 INFO L290 TraceCheckUtils]: 26: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} havoc main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___5~0#1; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___5~0#1; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume main_#t~switch165#1; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet170#1 && main_#t~nondet170#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet170#1;havoc main_#t~nondet170#1;main_#t~switch171#1 := 0 == main_~tmp___7~0#1; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch171#1;main_#t~switch171#1 := main_#t~switch171#1 || 1 == main_~tmp___7~0#1; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume main_#t~switch171#1; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_wl1271_spi_driver_init } true;havoc wl1271_spi_driver_init_#res#1;havoc wl1271_spi_driver_init_#t~ret153#1, wl1271_spi_driver_init_~tmp~14#1;havoc wl1271_spi_driver_init_~tmp~14#1;assume { :begin_inline_spi_register_driver } true;spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset := ~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset;havoc spi_register_driver_#res#1;havoc spi_register_driver_#t~nondet198#1, spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset;spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset := spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset;assume -2147483648 <= spi_register_driver_#t~nondet198#1 && spi_register_driver_#t~nondet198#1 <= 2147483647;spi_register_driver_#res#1 := spi_register_driver_#t~nondet198#1;havoc spi_register_driver_#t~nondet198#1; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} wl1271_spi_driver_init_#t~ret153#1 := spi_register_driver_#res#1;assume { :end_inline_spi_register_driver } true;assume -2147483648 <= wl1271_spi_driver_init_#t~ret153#1 && wl1271_spi_driver_init_#t~ret153#1 <= 2147483647;wl1271_spi_driver_init_~tmp~14#1 := wl1271_spi_driver_init_#t~ret153#1;havoc wl1271_spi_driver_init_#t~ret153#1;wl1271_spi_driver_init_#res#1 := wl1271_spi_driver_init_~tmp~14#1; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_#t~ret172#1 := wl1271_spi_driver_init_#res#1;assume { :end_inline_wl1271_spi_driver_init } true;assume -2147483648 <= main_#t~ret172#1 && main_#t~ret172#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret172#1;havoc main_#t~ret172#1; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !(0 == ~ldv_retval_1~0); {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,419 INFO L290 TraceCheckUtils]: 37: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,419 INFO L290 TraceCheckUtils]: 38: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :begin_inline_ldv_check_final_state } true; {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 21:52:11,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {3817#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !(0 == (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616); {3816#false} is VALID [2022-02-20 21:52:11,427 INFO L272 TraceCheckUtils]: 40: Hoare triple {3816#false} call ldv_error(); {3816#false} is VALID [2022-02-20 21:52:11,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {3816#false} assume !false; {3816#false} is VALID [2022-02-20 21:52:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 21:52:11,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:52:11,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987371532] [2022-02-20 21:52:11,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987371532] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:52:11,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:52:11,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:52:11,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658010213] [2022-02-20 21:52:11,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:52:11,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2022-02-20 21:52:11,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:52:11,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:11,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:11,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:52:11,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:52:11,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:52:11,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:52:11,470 INFO L87 Difference]: Start difference. First operand 578 states and 805 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:17,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 21:52:17,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:17,884 INFO L93 Difference]: Finished difference Result 630 states and 919 transitions. [2022-02-20 21:52:17,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:52:17,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2022-02-20 21:52:17,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:52:17,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2022-02-20 21:52:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2022-02-20 21:52:17,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 493 transitions. [2022-02-20 21:52:18,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:18,441 INFO L225 Difference]: With dead ends: 630 [2022-02-20 21:52:18,441 INFO L226 Difference]: Without dead ends: 627 [2022-02-20 21:52:18,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:52:18,448 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 459 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-20 21:52:18,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [521 Valid, 808 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-02-20 21:52:18,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2022-02-20 21:52:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 577. [2022-02-20 21:52:18,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:52:18,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 627 states. Second operand has 577 states, 404 states have (on average 1.2896039603960396) internal successors, (521), 411 states have internal predecessors, (521), 143 states have call successors, (143), 30 states have call predecessors, (143), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:18,502 INFO L74 IsIncluded]: Start isIncluded. First operand 627 states. Second operand has 577 states, 404 states have (on average 1.2896039603960396) internal successors, (521), 411 states have internal predecessors, (521), 143 states have call successors, (143), 30 states have call predecessors, (143), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:18,504 INFO L87 Difference]: Start difference. First operand 627 states. Second operand has 577 states, 404 states have (on average 1.2896039603960396) internal successors, (521), 411 states have internal predecessors, (521), 143 states have call successors, (143), 30 states have call predecessors, (143), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:18,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:18,539 INFO L93 Difference]: Finished difference Result 627 states and 916 transitions. [2022-02-20 21:52:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 916 transitions. [2022-02-20 21:52:18,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:18,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:18,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 577 states, 404 states have (on average 1.2896039603960396) internal successors, (521), 411 states have internal predecessors, (521), 143 states have call successors, (143), 30 states have call predecessors, (143), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) Second operand 627 states. [2022-02-20 21:52:18,548 INFO L87 Difference]: Start difference. First operand has 577 states, 404 states have (on average 1.2896039603960396) internal successors, (521), 411 states have internal predecessors, (521), 143 states have call successors, (143), 30 states have call predecessors, (143), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) Second operand 627 states. [2022-02-20 21:52:18,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:18,583 INFO L93 Difference]: Finished difference Result 627 states and 916 transitions. [2022-02-20 21:52:18,583 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 916 transitions. [2022-02-20 21:52:18,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:18,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:18,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:52:18,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:52:18,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 404 states have (on average 1.2896039603960396) internal successors, (521), 411 states have internal predecessors, (521), 143 states have call successors, (143), 30 states have call predecessors, (143), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 803 transitions. [2022-02-20 21:52:18,620 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 803 transitions. Word has length 42 [2022-02-20 21:52:18,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:52:18,620 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 803 transitions. [2022-02-20 21:52:18,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:18,621 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 803 transitions. [2022-02-20 21:52:18,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 21:52:18,624 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:52:18,625 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:52:18,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:52:18,625 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:52:18,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:52:18,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1296504663, now seen corresponding path program 1 times [2022-02-20 21:52:18,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:52:18,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705550338] [2022-02-20 21:52:18,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:18,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:52:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:18,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:52:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:18,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {6833#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {6814#true} is VALID [2022-02-20 21:52:18,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {6814#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {6814#true} is VALID [2022-02-20 21:52:18,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {6814#true} assume true; {6814#true} is VALID [2022-02-20 21:52:18,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6814#true} {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #701#return; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:52:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:18,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {6833#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {6814#true} is VALID [2022-02-20 21:52:18,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {6814#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {6814#true} is VALID [2022-02-20 21:52:18,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {6814#true} assume true; {6814#true} is VALID [2022-02-20 21:52:18,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6814#true} {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #703#return; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 21:52:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:18,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {6834#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {6814#true} is VALID [2022-02-20 21:52:18,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {6814#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {6814#true} is VALID [2022-02-20 21:52:18,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {6814#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {6814#true} is VALID [2022-02-20 21:52:18,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6814#true} {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #705#return; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 21:52:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:18,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {6834#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {6814#true} is VALID [2022-02-20 21:52:18,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {6814#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {6814#true} is VALID [2022-02-20 21:52:18,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {6814#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {6814#true} is VALID [2022-02-20 21:52:18,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6814#true} {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #707#return; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {6814#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(101, 2);call #Ultimate.allocInit(38, 3);call #Ultimate.allocInit(37, 4);call #Ultimate.allocInit(29, 5);call #Ultimate.allocInit(229, 6);call #Ultimate.allocInit(18, 7);call #Ultimate.allocInit(21, 8);call #Ultimate.allocInit(18, 9);call #Ultimate.allocInit(7, 10);call write~init~int(119, 10, 0, 1);call write~init~int(108, 10, 1, 1);call write~init~int(49, 10, 2, 1);call write~init~int(50, 10, 3, 1);call write~init~int(120, 10, 4, 1);call write~init~int(120, 10, 5, 1);call write~init~int(0, 10, 6, 1);call #Ultimate.allocInit(32, 11);call #Ultimate.allocInit(4, 12);call write~init~int(105, 12, 0, 1);call write~init~int(114, 12, 1, 1);call write~init~int(113, 12, 2, 1);call write~init~int(0, 12, 3, 1);call #Ultimate.allocInit(21, 13);call #Ultimate.allocInit(25, 14);call #Ultimate.allocInit(32, 15);call #Ultimate.allocInit(11, 16);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~wl1271_spi_driver_group0~0.base, ~wl1271_spi_driver_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~spi_ops_group0~0.base, ~spi_ops_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#spi_ops~0.base, ~#spi_ops~0.offset := 17, 0;call #Ultimate.allocInit(48, 17);call write~init~$Pointer$(#funAddr~wl12xx_spi_raw_read.base, #funAddr~wl12xx_spi_raw_read.offset, ~#spi_ops~0.base, ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_raw_write.base, #funAddr~wl12xx_spi_raw_write.offset, ~#spi_ops~0.base, 8 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_reset.base, #funAddr~wl12xx_spi_reset.offset, ~#spi_ops~0.base, 16 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_init.base, #funAddr~wl12xx_spi_init.offset, ~#spi_ops~0.base, 24 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#spi_ops~0.base, 32 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#spi_ops~0.base, 40 + ~#spi_ops~0.offset, 8);~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset := 18, 0;call #Ultimate.allocInit(161, 18);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~wl1271_probe.base, #funAddr~wl1271_probe.offset, ~#wl1271_spi_driver~0.base, 8 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~wl1271_remove.base, #funAddr~wl1271_remove.offset, ~#wl1271_spi_driver~0.base, 16 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 24 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 32 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 40 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(16, 0, ~#wl1271_spi_driver~0.base, 48 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 56 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#wl1271_spi_driver~0.base, 64 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 72 + ~#wl1271_spi_driver~0.offset, 8);call write~init~int(0, ~#wl1271_spi_driver~0.base, 80 + ~#wl1271_spi_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 81 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 89 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 97 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 105 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 113 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 121 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 129 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 137 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 145 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 153 + ~#wl1271_spi_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~usb_urb~0.base, ~usb_urb~0.offset := 0, 0;~usb_dev~0.base, ~usb_dev~0.offset := 0, 0;~dev_counter~0 := 0;~completeFnIntCounter~0 := 0;~completeFnBulkCounter~0 := 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet156#1, main_#t~ret157#1.base, main_#t~ret157#1.offset, main_#t~nondet158#1, main_#t~ret159#1.base, main_#t~ret159#1.offset, main_#t~nondet160#1, main_#t~nondet161#1, main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset, main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset, main_#t~nondet164#1, main_#t~switch165#1, main_#t~nondet166#1, main_#t~switch167#1, main_#t~ret168#1, main_#t~ret169#1, main_#t~nondet170#1, main_#t~switch171#1, main_#t~ret172#1, main_#t~nondet173#1, main_#t~switch174#1, main_#t~mem175#1, main_#t~ret176#1, main_#t~mem177#1, main_#t~ret178#1, main_#t~ret179#1, main_#t~ret180#1, main_#t~ret181#1, main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~ldvarg0~0#1, main_~tmp~17#1, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset, main_~ldvarg6~0#1, main_~tmp___1~5#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset, main_~ldvarg4~0#1, main_~tmp___3~2#1, main_~ldvarg2~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;call main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~ldvarg0~0#1;havoc main_~tmp~17#1;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset;havoc main_~ldvarg6~0#1;havoc main_~tmp___1~5#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;havoc main_~ldvarg4~0#1;havoc main_~tmp___3~2#1;havoc main_~ldvarg2~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet156#1 && main_#t~nondet156#1 <= 2147483647;main_~tmp~17#1 := main_#t~nondet156#1;havoc main_#t~nondet156#1;main_~ldvarg0~0#1 := main_~tmp~17#1; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,866 INFO L272 TraceCheckUtils]: 2: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~ret157#1.base, main_#t~ret157#1.offset := ldv_zalloc(1); {6833#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:18,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {6833#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {6814#true} is VALID [2022-02-20 21:52:18,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {6814#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {6814#true} is VALID [2022-02-20 21:52:18,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {6814#true} assume true; {6814#true} is VALID [2022-02-20 21:52:18,869 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6814#true} {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #701#return; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset := main_#t~ret157#1.base, main_#t~ret157#1.offset;havoc main_#t~ret157#1.base, main_#t~ret157#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset;assume -2147483648 <= main_#t~nondet158#1 && main_#t~nondet158#1 <= 2147483647;main_~tmp___1~5#1 := main_#t~nondet158#1;havoc main_#t~nondet158#1;main_~ldvarg6~0#1 := main_~tmp___1~5#1; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,871 INFO L272 TraceCheckUtils]: 8: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~ret159#1.base, main_#t~ret159#1.offset := ldv_zalloc(1); {6833#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:18,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {6833#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {6814#true} is VALID [2022-02-20 21:52:18,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {6814#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {6814#true} is VALID [2022-02-20 21:52:18,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {6814#true} assume true; {6814#true} is VALID [2022-02-20 21:52:18,873 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6814#true} {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #703#return; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset := main_#t~ret159#1.base, main_#t~ret159#1.offset;havoc main_#t~ret159#1.base, main_#t~ret159#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;assume -2147483648 <= main_#t~nondet160#1 && main_#t~nondet160#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet160#1;havoc main_#t~nondet160#1;main_~ldvarg4~0#1 := main_~tmp___3~2#1;assume -2147483648 <= main_#t~nondet161#1 && main_#t~nondet161#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet161#1;havoc main_#t~nondet161#1;main_~ldvarg2~0#1 := main_~tmp___4~0#1;assume { :begin_inline_ldv_initialize } true; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume { :end_inline_ldv_initialize } true; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,875 INFO L272 TraceCheckUtils]: 15: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset := #Ultimate.C_memset(main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, 0, 1); {6834#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:52:18,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {6834#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {6814#true} is VALID [2022-02-20 21:52:18,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {6814#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {6814#true} is VALID [2022-02-20 21:52:18,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {6814#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {6814#true} is VALID [2022-02-20 21:52:18,877 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {6814#true} {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #705#return; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} havoc main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,878 INFO L272 TraceCheckUtils]: 21: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset := #Ultimate.C_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 1); {6834#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:52:18,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {6834#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {6814#true} is VALID [2022-02-20 21:52:18,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {6814#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {6814#true} is VALID [2022-02-20 21:52:18,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {6814#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {6814#true} is VALID [2022-02-20 21:52:18,880 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6814#true} {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #707#return; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} havoc main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___5~0#1; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___5~0#1; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume main_#t~switch165#1; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet170#1 && main_#t~nondet170#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet170#1;havoc main_#t~nondet170#1;main_#t~switch171#1 := 0 == main_~tmp___7~0#1; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !main_#t~switch171#1;main_#t~switch171#1 := main_#t~switch171#1 || 1 == main_~tmp___7~0#1; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume main_#t~switch171#1; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_wl1271_spi_driver_init } true;havoc wl1271_spi_driver_init_#res#1;havoc wl1271_spi_driver_init_#t~ret153#1, wl1271_spi_driver_init_~tmp~14#1;havoc wl1271_spi_driver_init_~tmp~14#1;assume { :begin_inline_spi_register_driver } true;spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset := ~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset;havoc spi_register_driver_#res#1;havoc spi_register_driver_#t~nondet198#1, spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset;spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset := spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset;assume -2147483648 <= spi_register_driver_#t~nondet198#1 && spi_register_driver_#t~nondet198#1 <= 2147483647;spi_register_driver_#res#1 := spi_register_driver_#t~nondet198#1;havoc spi_register_driver_#t~nondet198#1; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} wl1271_spi_driver_init_#t~ret153#1 := spi_register_driver_#res#1;assume { :end_inline_spi_register_driver } true;assume -2147483648 <= wl1271_spi_driver_init_#t~ret153#1 && wl1271_spi_driver_init_#t~ret153#1 <= 2147483647;wl1271_spi_driver_init_~tmp~14#1 := wl1271_spi_driver_init_#t~ret153#1;havoc wl1271_spi_driver_init_#t~ret153#1;wl1271_spi_driver_init_#res#1 := wl1271_spi_driver_init_~tmp~14#1; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_#t~ret172#1 := wl1271_spi_driver_init_#res#1;assume { :end_inline_wl1271_spi_driver_init } true;assume -2147483648 <= main_#t~ret172#1 && main_#t~ret172#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret172#1;havoc main_#t~ret172#1; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !(0 == ~ldv_retval_1~0); {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume { :begin_inline_ldv_check_final_state } true; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 0 == (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616; {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 21:52:18,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {6816#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !(0 == (~usb_dev~0.base + ~usb_dev~0.offset) % 18446744073709551616); {6815#false} is VALID [2022-02-20 21:52:18,889 INFO L272 TraceCheckUtils]: 41: Hoare triple {6815#false} call ldv_error(); {6815#false} is VALID [2022-02-20 21:52:18,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {6815#false} assume !false; {6815#false} is VALID [2022-02-20 21:52:18,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 21:52:18,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:52:18,890 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705550338] [2022-02-20 21:52:18,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705550338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:52:18,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:52:18,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:52:18,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191282814] [2022-02-20 21:52:18,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:52:18,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-02-20 21:52:18,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:52:18,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:18,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:18,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:52:18,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:52:18,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:52:18,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:52:18,930 INFO L87 Difference]: Start difference. First operand 577 states and 803 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:25,223 INFO L93 Difference]: Finished difference Result 629 states and 917 transitions. [2022-02-20 21:52:25,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:52:25,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-02-20 21:52:25,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:52:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:25,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2022-02-20 21:52:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:25,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2022-02-20 21:52:25,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 491 transitions. [2022-02-20 21:52:25,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 491 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:25,759 INFO L225 Difference]: With dead ends: 629 [2022-02-20 21:52:25,759 INFO L226 Difference]: Without dead ends: 626 [2022-02-20 21:52:25,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:52:25,761 INFO L933 BasicCegarLoop]: 413 mSDtfsCounter, 456 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 21:52:25,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [516 Valid, 806 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 21:52:25,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-02-20 21:52:25,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 576. [2022-02-20 21:52:25,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:52:25,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 626 states. Second operand has 576 states, 404 states have (on average 1.2871287128712872) internal successors, (520), 410 states have internal predecessors, (520), 142 states have call successors, (142), 30 states have call predecessors, (142), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:25,790 INFO L74 IsIncluded]: Start isIncluded. First operand 626 states. Second operand has 576 states, 404 states have (on average 1.2871287128712872) internal successors, (520), 410 states have internal predecessors, (520), 142 states have call successors, (142), 30 states have call predecessors, (142), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:25,792 INFO L87 Difference]: Start difference. First operand 626 states. Second operand has 576 states, 404 states have (on average 1.2871287128712872) internal successors, (520), 410 states have internal predecessors, (520), 142 states have call successors, (142), 30 states have call predecessors, (142), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:25,823 INFO L93 Difference]: Finished difference Result 626 states and 914 transitions. [2022-02-20 21:52:25,823 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 914 transitions. [2022-02-20 21:52:25,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:25,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:25,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 576 states, 404 states have (on average 1.2871287128712872) internal successors, (520), 410 states have internal predecessors, (520), 142 states have call successors, (142), 30 states have call predecessors, (142), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) Second operand 626 states. [2022-02-20 21:52:25,830 INFO L87 Difference]: Start difference. First operand has 576 states, 404 states have (on average 1.2871287128712872) internal successors, (520), 410 states have internal predecessors, (520), 142 states have call successors, (142), 30 states have call predecessors, (142), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) Second operand 626 states. [2022-02-20 21:52:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:25,859 INFO L93 Difference]: Finished difference Result 626 states and 914 transitions. [2022-02-20 21:52:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 914 transitions. [2022-02-20 21:52:25,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:25,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:25,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:52:25,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:52:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 404 states have (on average 1.2871287128712872) internal successors, (520), 410 states have internal predecessors, (520), 142 states have call successors, (142), 30 states have call predecessors, (142), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 801 transitions. [2022-02-20 21:52:25,890 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 801 transitions. Word has length 43 [2022-02-20 21:52:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:52:25,891 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 801 transitions. [2022-02-20 21:52:25,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 801 transitions. [2022-02-20 21:52:25,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 21:52:25,892 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:52:25,893 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:52:25,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:52:25,893 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:52:25,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:52:25,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1537152405, now seen corresponding path program 1 times [2022-02-20 21:52:25,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:52:25,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166783848] [2022-02-20 21:52:25,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:25,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:52:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:26,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:52:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:26,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {9826#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {9807#true} is VALID [2022-02-20 21:52:26,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {9807#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {9807#true} is VALID [2022-02-20 21:52:26,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {9807#true} assume true; {9807#true} is VALID [2022-02-20 21:52:26,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9807#true} {9809#(= ~dev_counter~0 0)} #701#return; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:52:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:26,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {9826#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {9807#true} is VALID [2022-02-20 21:52:26,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {9807#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {9807#true} is VALID [2022-02-20 21:52:26,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {9807#true} assume true; {9807#true} is VALID [2022-02-20 21:52:26,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9807#true} {9809#(= ~dev_counter~0 0)} #703#return; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 21:52:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:26,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {9827#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {9807#true} is VALID [2022-02-20 21:52:26,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {9807#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {9807#true} is VALID [2022-02-20 21:52:26,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {9807#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9807#true} is VALID [2022-02-20 21:52:26,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9807#true} {9809#(= ~dev_counter~0 0)} #705#return; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 21:52:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:26,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {9827#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {9807#true} is VALID [2022-02-20 21:52:26,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {9807#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {9807#true} is VALID [2022-02-20 21:52:26,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {9807#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9807#true} is VALID [2022-02-20 21:52:26,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9807#true} {9809#(= ~dev_counter~0 0)} #707#return; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {9807#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(101, 2);call #Ultimate.allocInit(38, 3);call #Ultimate.allocInit(37, 4);call #Ultimate.allocInit(29, 5);call #Ultimate.allocInit(229, 6);call #Ultimate.allocInit(18, 7);call #Ultimate.allocInit(21, 8);call #Ultimate.allocInit(18, 9);call #Ultimate.allocInit(7, 10);call write~init~int(119, 10, 0, 1);call write~init~int(108, 10, 1, 1);call write~init~int(49, 10, 2, 1);call write~init~int(50, 10, 3, 1);call write~init~int(120, 10, 4, 1);call write~init~int(120, 10, 5, 1);call write~init~int(0, 10, 6, 1);call #Ultimate.allocInit(32, 11);call #Ultimate.allocInit(4, 12);call write~init~int(105, 12, 0, 1);call write~init~int(114, 12, 1, 1);call write~init~int(113, 12, 2, 1);call write~init~int(0, 12, 3, 1);call #Ultimate.allocInit(21, 13);call #Ultimate.allocInit(25, 14);call #Ultimate.allocInit(32, 15);call #Ultimate.allocInit(11, 16);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~wl1271_spi_driver_group0~0.base, ~wl1271_spi_driver_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~spi_ops_group0~0.base, ~spi_ops_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#spi_ops~0.base, ~#spi_ops~0.offset := 17, 0;call #Ultimate.allocInit(48, 17);call write~init~$Pointer$(#funAddr~wl12xx_spi_raw_read.base, #funAddr~wl12xx_spi_raw_read.offset, ~#spi_ops~0.base, ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_raw_write.base, #funAddr~wl12xx_spi_raw_write.offset, ~#spi_ops~0.base, 8 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_reset.base, #funAddr~wl12xx_spi_reset.offset, ~#spi_ops~0.base, 16 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_init.base, #funAddr~wl12xx_spi_init.offset, ~#spi_ops~0.base, 24 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#spi_ops~0.base, 32 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#spi_ops~0.base, 40 + ~#spi_ops~0.offset, 8);~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset := 18, 0;call #Ultimate.allocInit(161, 18);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~wl1271_probe.base, #funAddr~wl1271_probe.offset, ~#wl1271_spi_driver~0.base, 8 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~wl1271_remove.base, #funAddr~wl1271_remove.offset, ~#wl1271_spi_driver~0.base, 16 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 24 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 32 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 40 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(16, 0, ~#wl1271_spi_driver~0.base, 48 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 56 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#wl1271_spi_driver~0.base, 64 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 72 + ~#wl1271_spi_driver~0.offset, 8);call write~init~int(0, ~#wl1271_spi_driver~0.base, 80 + ~#wl1271_spi_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 81 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 89 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 97 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 105 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 113 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 121 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 129 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 137 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 145 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 153 + ~#wl1271_spi_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~usb_urb~0.base, ~usb_urb~0.offset := 0, 0;~usb_dev~0.base, ~usb_dev~0.offset := 0, 0;~dev_counter~0 := 0;~completeFnIntCounter~0 := 0;~completeFnBulkCounter~0 := 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {9809#(= ~dev_counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet156#1, main_#t~ret157#1.base, main_#t~ret157#1.offset, main_#t~nondet158#1, main_#t~ret159#1.base, main_#t~ret159#1.offset, main_#t~nondet160#1, main_#t~nondet161#1, main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset, main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset, main_#t~nondet164#1, main_#t~switch165#1, main_#t~nondet166#1, main_#t~switch167#1, main_#t~ret168#1, main_#t~ret169#1, main_#t~nondet170#1, main_#t~switch171#1, main_#t~ret172#1, main_#t~nondet173#1, main_#t~switch174#1, main_#t~mem175#1, main_#t~ret176#1, main_#t~mem177#1, main_#t~ret178#1, main_#t~ret179#1, main_#t~ret180#1, main_#t~ret181#1, main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~ldvarg0~0#1, main_~tmp~17#1, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset, main_~ldvarg6~0#1, main_~tmp___1~5#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset, main_~ldvarg4~0#1, main_~tmp___3~2#1, main_~ldvarg2~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;call main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~ldvarg0~0#1;havoc main_~tmp~17#1;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset;havoc main_~ldvarg6~0#1;havoc main_~tmp___1~5#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;havoc main_~ldvarg4~0#1;havoc main_~tmp___3~2#1;havoc main_~ldvarg2~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet156#1 && main_#t~nondet156#1 <= 2147483647;main_~tmp~17#1 := main_#t~nondet156#1;havoc main_#t~nondet156#1;main_~ldvarg0~0#1 := main_~tmp~17#1; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,078 INFO L272 TraceCheckUtils]: 2: Hoare triple {9809#(= ~dev_counter~0 0)} call main_#t~ret157#1.base, main_#t~ret157#1.offset := ldv_zalloc(1); {9826#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:26,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {9826#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {9807#true} is VALID [2022-02-20 21:52:26,078 INFO L290 TraceCheckUtils]: 4: Hoare triple {9807#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {9807#true} is VALID [2022-02-20 21:52:26,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {9807#true} assume true; {9807#true} is VALID [2022-02-20 21:52:26,079 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {9807#true} {9809#(= ~dev_counter~0 0)} #701#return; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {9809#(= ~dev_counter~0 0)} main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset := main_#t~ret157#1.base, main_#t~ret157#1.offset;havoc main_#t~ret157#1.base, main_#t~ret157#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset;assume -2147483648 <= main_#t~nondet158#1 && main_#t~nondet158#1 <= 2147483647;main_~tmp___1~5#1 := main_#t~nondet158#1;havoc main_#t~nondet158#1;main_~ldvarg6~0#1 := main_~tmp___1~5#1; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,084 INFO L272 TraceCheckUtils]: 8: Hoare triple {9809#(= ~dev_counter~0 0)} call main_#t~ret159#1.base, main_#t~ret159#1.offset := ldv_zalloc(1); {9826#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:26,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {9826#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {9807#true} is VALID [2022-02-20 21:52:26,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {9807#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {9807#true} is VALID [2022-02-20 21:52:26,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {9807#true} assume true; {9807#true} is VALID [2022-02-20 21:52:26,087 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9807#true} {9809#(= ~dev_counter~0 0)} #703#return; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {9809#(= ~dev_counter~0 0)} main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset := main_#t~ret159#1.base, main_#t~ret159#1.offset;havoc main_#t~ret159#1.base, main_#t~ret159#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;assume -2147483648 <= main_#t~nondet160#1 && main_#t~nondet160#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet160#1;havoc main_#t~nondet160#1;main_~ldvarg4~0#1 := main_~tmp___3~2#1;assume -2147483648 <= main_#t~nondet161#1 && main_#t~nondet161#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet161#1;havoc main_#t~nondet161#1;main_~ldvarg2~0#1 := main_~tmp___4~0#1;assume { :begin_inline_ldv_initialize } true; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {9809#(= ~dev_counter~0 0)} assume { :end_inline_ldv_initialize } true; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,088 INFO L272 TraceCheckUtils]: 15: Hoare triple {9809#(= ~dev_counter~0 0)} call main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset := #Ultimate.C_memset(main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, 0, 1); {9827#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:52:26,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {9827#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {9807#true} is VALID [2022-02-20 21:52:26,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {9807#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {9807#true} is VALID [2022-02-20 21:52:26,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {9807#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9807#true} is VALID [2022-02-20 21:52:26,090 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {9807#true} {9809#(= ~dev_counter~0 0)} #705#return; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {9809#(= ~dev_counter~0 0)} havoc main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,091 INFO L272 TraceCheckUtils]: 21: Hoare triple {9809#(= ~dev_counter~0 0)} call main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset := #Ultimate.C_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 1); {9827#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:52:26,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {9827#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {9807#true} is VALID [2022-02-20 21:52:26,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {9807#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {9807#true} is VALID [2022-02-20 21:52:26,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {9807#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {9807#true} is VALID [2022-02-20 21:52:26,093 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {9807#true} {9809#(= ~dev_counter~0 0)} #707#return; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {9809#(= ~dev_counter~0 0)} havoc main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {9809#(= ~dev_counter~0 0)} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___5~0#1; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {9809#(= ~dev_counter~0 0)} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___5~0#1; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {9809#(= ~dev_counter~0 0)} assume main_#t~switch165#1; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {9809#(= ~dev_counter~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet170#1 && main_#t~nondet170#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet170#1;havoc main_#t~nondet170#1;main_#t~switch171#1 := 0 == main_~tmp___7~0#1; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {9809#(= ~dev_counter~0 0)} assume !main_#t~switch171#1;main_#t~switch171#1 := main_#t~switch171#1 || 1 == main_~tmp___7~0#1; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {9809#(= ~dev_counter~0 0)} assume main_#t~switch171#1; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,096 INFO L290 TraceCheckUtils]: 33: Hoare triple {9809#(= ~dev_counter~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_wl1271_spi_driver_init } true;havoc wl1271_spi_driver_init_#res#1;havoc wl1271_spi_driver_init_#t~ret153#1, wl1271_spi_driver_init_~tmp~14#1;havoc wl1271_spi_driver_init_~tmp~14#1;assume { :begin_inline_spi_register_driver } true;spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset := ~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset;havoc spi_register_driver_#res#1;havoc spi_register_driver_#t~nondet198#1, spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset;spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset := spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset;assume -2147483648 <= spi_register_driver_#t~nondet198#1 && spi_register_driver_#t~nondet198#1 <= 2147483647;spi_register_driver_#res#1 := spi_register_driver_#t~nondet198#1;havoc spi_register_driver_#t~nondet198#1; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {9809#(= ~dev_counter~0 0)} wl1271_spi_driver_init_#t~ret153#1 := spi_register_driver_#res#1;assume { :end_inline_spi_register_driver } true;assume -2147483648 <= wl1271_spi_driver_init_#t~ret153#1 && wl1271_spi_driver_init_#t~ret153#1 <= 2147483647;wl1271_spi_driver_init_~tmp~14#1 := wl1271_spi_driver_init_#t~ret153#1;havoc wl1271_spi_driver_init_#t~ret153#1;wl1271_spi_driver_init_#res#1 := wl1271_spi_driver_init_~tmp~14#1; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {9809#(= ~dev_counter~0 0)} main_#t~ret172#1 := wl1271_spi_driver_init_#res#1;assume { :end_inline_wl1271_spi_driver_init } true;assume -2147483648 <= main_#t~ret172#1 && main_#t~ret172#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret172#1;havoc main_#t~ret172#1; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {9809#(= ~dev_counter~0 0)} assume !(0 == ~ldv_retval_1~0); {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,097 INFO L290 TraceCheckUtils]: 37: Hoare triple {9809#(= ~dev_counter~0 0)} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,098 INFO L290 TraceCheckUtils]: 38: Hoare triple {9809#(= ~dev_counter~0 0)} assume { :begin_inline_ldv_check_final_state } true; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,098 INFO L290 TraceCheckUtils]: 39: Hoare triple {9809#(= ~dev_counter~0 0)} assume 0 == (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {9809#(= ~dev_counter~0 0)} assume 0 == (~usb_dev~0.base + ~usb_dev~0.offset) % 18446744073709551616; {9809#(= ~dev_counter~0 0)} is VALID [2022-02-20 21:52:26,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {9809#(= ~dev_counter~0 0)} assume !(0 == ~dev_counter~0); {9808#false} is VALID [2022-02-20 21:52:26,100 INFO L272 TraceCheckUtils]: 42: Hoare triple {9808#false} call ldv_error(); {9808#false} is VALID [2022-02-20 21:52:26,100 INFO L290 TraceCheckUtils]: 43: Hoare triple {9808#false} assume !false; {9808#false} is VALID [2022-02-20 21:52:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 21:52:26,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:52:26,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166783848] [2022-02-20 21:52:26,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166783848] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:52:26,101 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:52:26,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:52:26,102 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066382287] [2022-02-20 21:52:26,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:52:26,102 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-02-20 21:52:26,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:52:26,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:26,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:26,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:52:26,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:52:26,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:52:26,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:52:26,142 INFO L87 Difference]: Start difference. First operand 576 states and 801 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:31,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 21:52:32,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:32,480 INFO L93 Difference]: Finished difference Result 628 states and 915 transitions. [2022-02-20 21:52:32,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:52:32,481 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-02-20 21:52:32,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:52:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2022-02-20 21:52:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 489 transitions. [2022-02-20 21:52:32,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 489 transitions. [2022-02-20 21:52:33,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 489 edges. 489 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:33,059 INFO L225 Difference]: With dead ends: 628 [2022-02-20 21:52:33,060 INFO L226 Difference]: Without dead ends: 625 [2022-02-20 21:52:33,060 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:52:33,061 INFO L933 BasicCegarLoop]: 412 mSDtfsCounter, 453 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 202 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-02-20 21:52:33,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 803 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 271 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-02-20 21:52:33,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-02-20 21:52:33,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 575. [2022-02-20 21:52:33,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:52:33,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 625 states. Second operand has 575 states, 404 states have (on average 1.2846534653465347) internal successors, (519), 409 states have internal predecessors, (519), 141 states have call successors, (141), 30 states have call predecessors, (141), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:33,088 INFO L74 IsIncluded]: Start isIncluded. First operand 625 states. Second operand has 575 states, 404 states have (on average 1.2846534653465347) internal successors, (519), 409 states have internal predecessors, (519), 141 states have call successors, (141), 30 states have call predecessors, (141), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:33,089 INFO L87 Difference]: Start difference. First operand 625 states. Second operand has 575 states, 404 states have (on average 1.2846534653465347) internal successors, (519), 409 states have internal predecessors, (519), 141 states have call successors, (141), 30 states have call predecessors, (141), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:33,116 INFO L93 Difference]: Finished difference Result 625 states and 912 transitions. [2022-02-20 21:52:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 912 transitions. [2022-02-20 21:52:33,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:33,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:33,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 575 states, 404 states have (on average 1.2846534653465347) internal successors, (519), 409 states have internal predecessors, (519), 141 states have call successors, (141), 30 states have call predecessors, (141), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) Second operand 625 states. [2022-02-20 21:52:33,123 INFO L87 Difference]: Start difference. First operand has 575 states, 404 states have (on average 1.2846534653465347) internal successors, (519), 409 states have internal predecessors, (519), 141 states have call successors, (141), 30 states have call predecessors, (141), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) Second operand 625 states. [2022-02-20 21:52:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:33,151 INFO L93 Difference]: Finished difference Result 625 states and 912 transitions. [2022-02-20 21:52:33,151 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 912 transitions. [2022-02-20 21:52:33,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:33,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:33,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:52:33,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:52:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 404 states have (on average 1.2846534653465347) internal successors, (519), 409 states have internal predecessors, (519), 141 states have call successors, (141), 30 states have call predecessors, (141), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 799 transitions. [2022-02-20 21:52:33,185 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 799 transitions. Word has length 44 [2022-02-20 21:52:33,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:52:33,185 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 799 transitions. [2022-02-20 21:52:33,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:33,185 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 799 transitions. [2022-02-20 21:52:33,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 21:52:33,186 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:52:33,186 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:52:33,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:52:33,187 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:52:33,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:52:33,187 INFO L85 PathProgramCache]: Analyzing trace with hash -407292948, now seen corresponding path program 1 times [2022-02-20 21:52:33,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:52:33,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770200917] [2022-02-20 21:52:33,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:33,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:52:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:33,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:52:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:33,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {12813#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {12794#true} is VALID [2022-02-20 21:52:33,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {12794#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {12794#true} is VALID [2022-02-20 21:52:33,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {12794#true} assume true; {12794#true} is VALID [2022-02-20 21:52:33,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12794#true} {12796#(= ~INTERF_STATE~0 0)} #701#return; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:52:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:33,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {12813#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {12794#true} is VALID [2022-02-20 21:52:33,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {12794#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {12794#true} is VALID [2022-02-20 21:52:33,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {12794#true} assume true; {12794#true} is VALID [2022-02-20 21:52:33,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12794#true} {12796#(= ~INTERF_STATE~0 0)} #703#return; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 21:52:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:33,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {12814#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {12794#true} is VALID [2022-02-20 21:52:33,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {12794#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {12794#true} is VALID [2022-02-20 21:52:33,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {12794#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12794#true} is VALID [2022-02-20 21:52:33,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12794#true} {12796#(= ~INTERF_STATE~0 0)} #705#return; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 21:52:33,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:33,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {12814#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {12794#true} is VALID [2022-02-20 21:52:33,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {12794#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {12794#true} is VALID [2022-02-20 21:52:33,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {12794#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12794#true} is VALID [2022-02-20 21:52:33,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12794#true} {12796#(= ~INTERF_STATE~0 0)} #707#return; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {12794#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(101, 2);call #Ultimate.allocInit(38, 3);call #Ultimate.allocInit(37, 4);call #Ultimate.allocInit(29, 5);call #Ultimate.allocInit(229, 6);call #Ultimate.allocInit(18, 7);call #Ultimate.allocInit(21, 8);call #Ultimate.allocInit(18, 9);call #Ultimate.allocInit(7, 10);call write~init~int(119, 10, 0, 1);call write~init~int(108, 10, 1, 1);call write~init~int(49, 10, 2, 1);call write~init~int(50, 10, 3, 1);call write~init~int(120, 10, 4, 1);call write~init~int(120, 10, 5, 1);call write~init~int(0, 10, 6, 1);call #Ultimate.allocInit(32, 11);call #Ultimate.allocInit(4, 12);call write~init~int(105, 12, 0, 1);call write~init~int(114, 12, 1, 1);call write~init~int(113, 12, 2, 1);call write~init~int(0, 12, 3, 1);call #Ultimate.allocInit(21, 13);call #Ultimate.allocInit(25, 14);call #Ultimate.allocInit(32, 15);call #Ultimate.allocInit(11, 16);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~wl1271_spi_driver_group0~0.base, ~wl1271_spi_driver_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~spi_ops_group0~0.base, ~spi_ops_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#spi_ops~0.base, ~#spi_ops~0.offset := 17, 0;call #Ultimate.allocInit(48, 17);call write~init~$Pointer$(#funAddr~wl12xx_spi_raw_read.base, #funAddr~wl12xx_spi_raw_read.offset, ~#spi_ops~0.base, ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_raw_write.base, #funAddr~wl12xx_spi_raw_write.offset, ~#spi_ops~0.base, 8 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_reset.base, #funAddr~wl12xx_spi_reset.offset, ~#spi_ops~0.base, 16 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_init.base, #funAddr~wl12xx_spi_init.offset, ~#spi_ops~0.base, 24 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#spi_ops~0.base, 32 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#spi_ops~0.base, 40 + ~#spi_ops~0.offset, 8);~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset := 18, 0;call #Ultimate.allocInit(161, 18);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~wl1271_probe.base, #funAddr~wl1271_probe.offset, ~#wl1271_spi_driver~0.base, 8 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~wl1271_remove.base, #funAddr~wl1271_remove.offset, ~#wl1271_spi_driver~0.base, 16 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 24 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 32 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 40 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(16, 0, ~#wl1271_spi_driver~0.base, 48 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 56 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#wl1271_spi_driver~0.base, 64 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 72 + ~#wl1271_spi_driver~0.offset, 8);call write~init~int(0, ~#wl1271_spi_driver~0.base, 80 + ~#wl1271_spi_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 81 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 89 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 97 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 105 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 113 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 121 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 129 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 137 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 145 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 153 + ~#wl1271_spi_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~usb_urb~0.base, ~usb_urb~0.offset := 0, 0;~usb_dev~0.base, ~usb_dev~0.offset := 0, 0;~dev_counter~0 := 0;~completeFnIntCounter~0 := 0;~completeFnBulkCounter~0 := 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet156#1, main_#t~ret157#1.base, main_#t~ret157#1.offset, main_#t~nondet158#1, main_#t~ret159#1.base, main_#t~ret159#1.offset, main_#t~nondet160#1, main_#t~nondet161#1, main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset, main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset, main_#t~nondet164#1, main_#t~switch165#1, main_#t~nondet166#1, main_#t~switch167#1, main_#t~ret168#1, main_#t~ret169#1, main_#t~nondet170#1, main_#t~switch171#1, main_#t~ret172#1, main_#t~nondet173#1, main_#t~switch174#1, main_#t~mem175#1, main_#t~ret176#1, main_#t~mem177#1, main_#t~ret178#1, main_#t~ret179#1, main_#t~ret180#1, main_#t~ret181#1, main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~ldvarg0~0#1, main_~tmp~17#1, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset, main_~ldvarg6~0#1, main_~tmp___1~5#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset, main_~ldvarg4~0#1, main_~tmp___3~2#1, main_~ldvarg2~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;call main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~ldvarg0~0#1;havoc main_~tmp~17#1;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset;havoc main_~ldvarg6~0#1;havoc main_~tmp___1~5#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;havoc main_~ldvarg4~0#1;havoc main_~tmp___3~2#1;havoc main_~ldvarg2~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet156#1 && main_#t~nondet156#1 <= 2147483647;main_~tmp~17#1 := main_#t~nondet156#1;havoc main_#t~nondet156#1;main_~ldvarg0~0#1 := main_~tmp~17#1; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,349 INFO L272 TraceCheckUtils]: 2: Hoare triple {12796#(= ~INTERF_STATE~0 0)} call main_#t~ret157#1.base, main_#t~ret157#1.offset := ldv_zalloc(1); {12813#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:33,349 INFO L290 TraceCheckUtils]: 3: Hoare triple {12813#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {12794#true} is VALID [2022-02-20 21:52:33,349 INFO L290 TraceCheckUtils]: 4: Hoare triple {12794#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {12794#true} is VALID [2022-02-20 21:52:33,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {12794#true} assume true; {12794#true} is VALID [2022-02-20 21:52:33,353 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {12794#true} {12796#(= ~INTERF_STATE~0 0)} #701#return; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {12796#(= ~INTERF_STATE~0 0)} main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset := main_#t~ret157#1.base, main_#t~ret157#1.offset;havoc main_#t~ret157#1.base, main_#t~ret157#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset;assume -2147483648 <= main_#t~nondet158#1 && main_#t~nondet158#1 <= 2147483647;main_~tmp___1~5#1 := main_#t~nondet158#1;havoc main_#t~nondet158#1;main_~ldvarg6~0#1 := main_~tmp___1~5#1; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,354 INFO L272 TraceCheckUtils]: 8: Hoare triple {12796#(= ~INTERF_STATE~0 0)} call main_#t~ret159#1.base, main_#t~ret159#1.offset := ldv_zalloc(1); {12813#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:33,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {12813#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {12794#true} is VALID [2022-02-20 21:52:33,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {12794#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {12794#true} is VALID [2022-02-20 21:52:33,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {12794#true} assume true; {12794#true} is VALID [2022-02-20 21:52:33,356 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12794#true} {12796#(= ~INTERF_STATE~0 0)} #703#return; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {12796#(= ~INTERF_STATE~0 0)} main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset := main_#t~ret159#1.base, main_#t~ret159#1.offset;havoc main_#t~ret159#1.base, main_#t~ret159#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;assume -2147483648 <= main_#t~nondet160#1 && main_#t~nondet160#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet160#1;havoc main_#t~nondet160#1;main_~ldvarg4~0#1 := main_~tmp___3~2#1;assume -2147483648 <= main_#t~nondet161#1 && main_#t~nondet161#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet161#1;havoc main_#t~nondet161#1;main_~ldvarg2~0#1 := main_~tmp___4~0#1;assume { :begin_inline_ldv_initialize } true; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume { :end_inline_ldv_initialize } true; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,357 INFO L272 TraceCheckUtils]: 15: Hoare triple {12796#(= ~INTERF_STATE~0 0)} call main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset := #Ultimate.C_memset(main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, 0, 1); {12814#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:52:33,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {12814#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {12794#true} is VALID [2022-02-20 21:52:33,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {12794#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {12794#true} is VALID [2022-02-20 21:52:33,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {12794#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12794#true} is VALID [2022-02-20 21:52:33,359 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {12794#true} {12796#(= ~INTERF_STATE~0 0)} #705#return; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {12796#(= ~INTERF_STATE~0 0)} havoc main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,360 INFO L272 TraceCheckUtils]: 21: Hoare triple {12796#(= ~INTERF_STATE~0 0)} call main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset := #Ultimate.C_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 1); {12814#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:52:33,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {12814#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {12794#true} is VALID [2022-02-20 21:52:33,360 INFO L290 TraceCheckUtils]: 23: Hoare triple {12794#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {12794#true} is VALID [2022-02-20 21:52:33,360 INFO L290 TraceCheckUtils]: 24: Hoare triple {12794#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12794#true} is VALID [2022-02-20 21:52:33,361 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12794#true} {12796#(= ~INTERF_STATE~0 0)} #707#return; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {12796#(= ~INTERF_STATE~0 0)} havoc main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___5~0#1; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___5~0#1; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume main_#t~switch165#1; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet170#1 && main_#t~nondet170#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet170#1;havoc main_#t~nondet170#1;main_#t~switch171#1 := 0 == main_~tmp___7~0#1; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume !main_#t~switch171#1;main_#t~switch171#1 := main_#t~switch171#1 || 1 == main_~tmp___7~0#1; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,364 INFO L290 TraceCheckUtils]: 32: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume main_#t~switch171#1; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_wl1271_spi_driver_init } true;havoc wl1271_spi_driver_init_#res#1;havoc wl1271_spi_driver_init_#t~ret153#1, wl1271_spi_driver_init_~tmp~14#1;havoc wl1271_spi_driver_init_~tmp~14#1;assume { :begin_inline_spi_register_driver } true;spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset := ~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset;havoc spi_register_driver_#res#1;havoc spi_register_driver_#t~nondet198#1, spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset;spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset := spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset;assume -2147483648 <= spi_register_driver_#t~nondet198#1 && spi_register_driver_#t~nondet198#1 <= 2147483647;spi_register_driver_#res#1 := spi_register_driver_#t~nondet198#1;havoc spi_register_driver_#t~nondet198#1; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,365 INFO L290 TraceCheckUtils]: 34: Hoare triple {12796#(= ~INTERF_STATE~0 0)} wl1271_spi_driver_init_#t~ret153#1 := spi_register_driver_#res#1;assume { :end_inline_spi_register_driver } true;assume -2147483648 <= wl1271_spi_driver_init_#t~ret153#1 && wl1271_spi_driver_init_#t~ret153#1 <= 2147483647;wl1271_spi_driver_init_~tmp~14#1 := wl1271_spi_driver_init_#t~ret153#1;havoc wl1271_spi_driver_init_#t~ret153#1;wl1271_spi_driver_init_#res#1 := wl1271_spi_driver_init_~tmp~14#1; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {12796#(= ~INTERF_STATE~0 0)} main_#t~ret172#1 := wl1271_spi_driver_init_#res#1;assume { :end_inline_wl1271_spi_driver_init } true;assume -2147483648 <= main_#t~ret172#1 && main_#t~ret172#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret172#1;havoc main_#t~ret172#1; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,366 INFO L290 TraceCheckUtils]: 36: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume !(0 == ~ldv_retval_1~0); {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume { :begin_inline_ldv_check_final_state } true; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume 0 == (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,368 INFO L290 TraceCheckUtils]: 40: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume 0 == (~usb_dev~0.base + ~usb_dev~0.offset) % 18446744073709551616; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,368 INFO L290 TraceCheckUtils]: 41: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume 0 == ~dev_counter~0; {12796#(= ~INTERF_STATE~0 0)} is VALID [2022-02-20 21:52:33,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {12796#(= ~INTERF_STATE~0 0)} assume !(0 == ~INTERF_STATE~0); {12795#false} is VALID [2022-02-20 21:52:33,369 INFO L272 TraceCheckUtils]: 43: Hoare triple {12795#false} call ldv_error(); {12795#false} is VALID [2022-02-20 21:52:33,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {12795#false} assume !false; {12795#false} is VALID [2022-02-20 21:52:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 21:52:33,371 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:52:33,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770200917] [2022-02-20 21:52:33,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770200917] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:52:33,371 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:52:33,371 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:52:33,371 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9927092] [2022-02-20 21:52:33,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:52:33,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2022-02-20 21:52:33,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:52:33,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:33,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:33,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:52:33,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:52:33,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:52:33,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:52:33,411 INFO L87 Difference]: Start difference. First operand 575 states and 799 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:39,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:39,288 INFO L93 Difference]: Finished difference Result 627 states and 913 transitions. [2022-02-20 21:52:39,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:52:39,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2022-02-20 21:52:39,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:52:39,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:39,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2022-02-20 21:52:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2022-02-20 21:52:39,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 487 transitions. [2022-02-20 21:52:39,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:39,845 INFO L225 Difference]: With dead ends: 627 [2022-02-20 21:52:39,845 INFO L226 Difference]: Without dead ends: 624 [2022-02-20 21:52:39,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:52:39,846 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 451 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-02-20 21:52:39,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [510 Valid, 796 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-02-20 21:52:39,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-02-20 21:52:39,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 574. [2022-02-20 21:52:39,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:52:39,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 624 states. Second operand has 574 states, 404 states have (on average 1.2821782178217822) internal successors, (518), 408 states have internal predecessors, (518), 140 states have call successors, (140), 30 states have call predecessors, (140), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:39,873 INFO L74 IsIncluded]: Start isIncluded. First operand 624 states. Second operand has 574 states, 404 states have (on average 1.2821782178217822) internal successors, (518), 408 states have internal predecessors, (518), 140 states have call successors, (140), 30 states have call predecessors, (140), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:39,874 INFO L87 Difference]: Start difference. First operand 624 states. Second operand has 574 states, 404 states have (on average 1.2821782178217822) internal successors, (518), 408 states have internal predecessors, (518), 140 states have call successors, (140), 30 states have call predecessors, (140), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:39,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:39,901 INFO L93 Difference]: Finished difference Result 624 states and 910 transitions. [2022-02-20 21:52:39,901 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 910 transitions. [2022-02-20 21:52:39,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:39,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:39,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 574 states, 404 states have (on average 1.2821782178217822) internal successors, (518), 408 states have internal predecessors, (518), 140 states have call successors, (140), 30 states have call predecessors, (140), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) Second operand 624 states. [2022-02-20 21:52:39,907 INFO L87 Difference]: Start difference. First operand has 574 states, 404 states have (on average 1.2821782178217822) internal successors, (518), 408 states have internal predecessors, (518), 140 states have call successors, (140), 30 states have call predecessors, (140), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) Second operand 624 states. [2022-02-20 21:52:39,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:39,934 INFO L93 Difference]: Finished difference Result 624 states and 910 transitions. [2022-02-20 21:52:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 910 transitions. [2022-02-20 21:52:39,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:39,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:39,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:52:39,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:52:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 404 states have (on average 1.2821782178217822) internal successors, (518), 408 states have internal predecessors, (518), 140 states have call successors, (140), 30 states have call predecessors, (140), 29 states have return successors, (139), 139 states have call predecessors, (139), 139 states have call successors, (139) [2022-02-20 21:52:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 797 transitions. [2022-02-20 21:52:39,966 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 797 transitions. Word has length 45 [2022-02-20 21:52:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:52:39,967 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 797 transitions. [2022-02-20 21:52:39,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 797 transitions. [2022-02-20 21:52:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 21:52:39,968 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:52:39,968 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:52:39,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 21:52:39,968 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:52:39,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:52:39,969 INFO L85 PathProgramCache]: Analyzing trace with hash 258616718, now seen corresponding path program 1 times [2022-02-20 21:52:39,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:52:39,969 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668876762] [2022-02-20 21:52:39,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:52:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:52:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:40,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:52:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:40,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {15794#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {15775#true} is VALID [2022-02-20 21:52:40,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {15775#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {15775#true} is VALID [2022-02-20 21:52:40,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {15775#true} assume true; {15775#true} is VALID [2022-02-20 21:52:40,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15775#true} {15777#(= ~SERIAL_STATE~0 0)} #701#return; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:52:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:40,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {15794#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {15775#true} is VALID [2022-02-20 21:52:40,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {15775#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {15775#true} is VALID [2022-02-20 21:52:40,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {15775#true} assume true; {15775#true} is VALID [2022-02-20 21:52:40,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15775#true} {15777#(= ~SERIAL_STATE~0 0)} #703#return; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-20 21:52:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:40,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {15795#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {15775#true} is VALID [2022-02-20 21:52:40,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {15775#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {15775#true} is VALID [2022-02-20 21:52:40,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {15775#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {15775#true} is VALID [2022-02-20 21:52:40,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15775#true} {15777#(= ~SERIAL_STATE~0 0)} #705#return; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-20 21:52:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:52:40,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {15795#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {15775#true} is VALID [2022-02-20 21:52:40,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {15775#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {15775#true} is VALID [2022-02-20 21:52:40,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {15775#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {15775#true} is VALID [2022-02-20 21:52:40,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15775#true} {15777#(= ~SERIAL_STATE~0 0)} #707#return; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {15775#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(101, 2);call #Ultimate.allocInit(38, 3);call #Ultimate.allocInit(37, 4);call #Ultimate.allocInit(29, 5);call #Ultimate.allocInit(229, 6);call #Ultimate.allocInit(18, 7);call #Ultimate.allocInit(21, 8);call #Ultimate.allocInit(18, 9);call #Ultimate.allocInit(7, 10);call write~init~int(119, 10, 0, 1);call write~init~int(108, 10, 1, 1);call write~init~int(49, 10, 2, 1);call write~init~int(50, 10, 3, 1);call write~init~int(120, 10, 4, 1);call write~init~int(120, 10, 5, 1);call write~init~int(0, 10, 6, 1);call #Ultimate.allocInit(32, 11);call #Ultimate.allocInit(4, 12);call write~init~int(105, 12, 0, 1);call write~init~int(114, 12, 1, 1);call write~init~int(113, 12, 2, 1);call write~init~int(0, 12, 3, 1);call #Ultimate.allocInit(21, 13);call #Ultimate.allocInit(25, 14);call #Ultimate.allocInit(32, 15);call #Ultimate.allocInit(11, 16);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~wl1271_spi_driver_group0~0.base, ~wl1271_spi_driver_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~spi_ops_group0~0.base, ~spi_ops_group0~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#spi_ops~0.base, ~#spi_ops~0.offset := 17, 0;call #Ultimate.allocInit(48, 17);call write~init~$Pointer$(#funAddr~wl12xx_spi_raw_read.base, #funAddr~wl12xx_spi_raw_read.offset, ~#spi_ops~0.base, ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_raw_write.base, #funAddr~wl12xx_spi_raw_write.offset, ~#spi_ops~0.base, 8 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_reset.base, #funAddr~wl12xx_spi_reset.offset, ~#spi_ops~0.base, 16 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~wl12xx_spi_init.base, #funAddr~wl12xx_spi_init.offset, ~#spi_ops~0.base, 24 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#spi_ops~0.base, 32 + ~#spi_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#spi_ops~0.base, 40 + ~#spi_ops~0.offset, 8);~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset := 18, 0;call #Ultimate.allocInit(161, 18);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~wl1271_probe.base, #funAddr~wl1271_probe.offset, ~#wl1271_spi_driver~0.base, 8 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~wl1271_remove.base, #funAddr~wl1271_remove.offset, ~#wl1271_spi_driver~0.base, 16 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 24 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 32 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 40 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(16, 0, ~#wl1271_spi_driver~0.base, 48 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 56 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#wl1271_spi_driver~0.base, 64 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 72 + ~#wl1271_spi_driver~0.offset, 8);call write~init~int(0, ~#wl1271_spi_driver~0.base, 80 + ~#wl1271_spi_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 81 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 89 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 97 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 105 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 113 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 121 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 129 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 137 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 145 + ~#wl1271_spi_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#wl1271_spi_driver~0.base, 153 + ~#wl1271_spi_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~INTERF_STATE~0 := 0;~SERIAL_STATE~0 := 0;~usb_intfdata~0.base, ~usb_intfdata~0.offset := 0, 0;~usb_urb~0.base, ~usb_urb~0.offset := 0, 0;~usb_dev~0.base, ~usb_dev~0.offset := 0, 0;~dev_counter~0 := 0;~completeFnIntCounter~0 := 0;~completeFnBulkCounter~0 := 0;~completeFnInt~0.base, ~completeFnInt~0.offset := 0, 0;~completeFnBulk~0.base, ~completeFnBulk~0.offset := 0, 0; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet156#1, main_#t~ret157#1.base, main_#t~ret157#1.offset, main_#t~nondet158#1, main_#t~ret159#1.base, main_#t~ret159#1.offset, main_#t~nondet160#1, main_#t~nondet161#1, main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset, main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset, main_#t~nondet164#1, main_#t~switch165#1, main_#t~nondet166#1, main_#t~switch167#1, main_#t~ret168#1, main_#t~ret169#1, main_#t~nondet170#1, main_#t~switch171#1, main_#t~ret172#1, main_#t~nondet173#1, main_#t~switch174#1, main_#t~mem175#1, main_#t~ret176#1, main_#t~mem177#1, main_#t~ret178#1, main_#t~ret179#1, main_#t~ret180#1, main_#t~ret181#1, main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~ldvarg0~0#1, main_~tmp~17#1, main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset, main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset, main_~ldvarg6~0#1, main_~tmp___1~5#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset, main_~ldvarg4~0#1, main_~tmp___3~2#1, main_~ldvarg2~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1;call main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset := #Ultimate.allocOnStack(1);call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(1);havoc main_~ldvarg0~0#1;havoc main_~tmp~17#1;havoc main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset;havoc main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset;havoc main_~ldvarg6~0#1;havoc main_~tmp___1~5#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;havoc main_~ldvarg4~0#1;havoc main_~tmp___3~2#1;havoc main_~ldvarg2~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;assume -2147483648 <= main_#t~nondet156#1 && main_#t~nondet156#1 <= 2147483647;main_~tmp~17#1 := main_#t~nondet156#1;havoc main_#t~nondet156#1;main_~ldvarg0~0#1 := main_~tmp~17#1; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,101 INFO L272 TraceCheckUtils]: 2: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} call main_#t~ret157#1.base, main_#t~ret157#1.offset := ldv_zalloc(1); {15794#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:40,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {15794#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {15775#true} is VALID [2022-02-20 21:52:40,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {15775#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {15775#true} is VALID [2022-02-20 21:52:40,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {15775#true} assume true; {15775#true} is VALID [2022-02-20 21:52:40,103 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {15775#true} {15777#(= ~SERIAL_STATE~0 0)} #701#return; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset := main_#t~ret157#1.base, main_#t~ret157#1.offset;havoc main_#t~ret157#1.base, main_#t~ret157#1.offset;main_~ldvarg5~0#1.base, main_~ldvarg5~0#1.offset := main_~tmp___0~8#1.base, main_~tmp___0~8#1.offset;assume -2147483648 <= main_#t~nondet158#1 && main_#t~nondet158#1 <= 2147483647;main_~tmp___1~5#1 := main_#t~nondet158#1;havoc main_#t~nondet158#1;main_~ldvarg6~0#1 := main_~tmp___1~5#1; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,104 INFO L272 TraceCheckUtils]: 8: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} call main_#t~ret159#1.base, main_#t~ret159#1.offset := ldv_zalloc(1); {15794#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:52:40,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {15794#(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~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet23#1 && #t~nondet23#1 <= 2147483647;~tmp___0~1#1 := #t~nondet23#1;havoc #t~nondet23#1; {15775#true} is VALID [2022-02-20 21:52:40,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {15775#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {15775#true} is VALID [2022-02-20 21:52:40,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {15775#true} assume true; {15775#true} is VALID [2022-02-20 21:52:40,105 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15775#true} {15777#(= ~SERIAL_STATE~0 0)} #703#return; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset := main_#t~ret159#1.base, main_#t~ret159#1.offset;havoc main_#t~ret159#1.base, main_#t~ret159#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___2~4#1.base, main_~tmp___2~4#1.offset;assume -2147483648 <= main_#t~nondet160#1 && main_#t~nondet160#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet160#1;havoc main_#t~nondet160#1;main_~ldvarg4~0#1 := main_~tmp___3~2#1;assume -2147483648 <= main_#t~nondet161#1 && main_#t~nondet161#1 <= 2147483647;main_~tmp___4~0#1 := main_#t~nondet161#1;havoc main_#t~nondet161#1;main_~ldvarg2~0#1 := main_~tmp___4~0#1;assume { :begin_inline_ldv_initialize } true; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,105 INFO L290 TraceCheckUtils]: 14: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume { :end_inline_ldv_initialize } true; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,106 INFO L272 TraceCheckUtils]: 15: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} call main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset := #Ultimate.C_memset(main_~#ldvarg7~0#1.base, main_~#ldvarg7~0#1.offset, 0, 1); {15795#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:52:40,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {15795#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {15775#true} is VALID [2022-02-20 21:52:40,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {15775#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {15775#true} is VALID [2022-02-20 21:52:40,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {15775#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {15775#true} is VALID [2022-02-20 21:52:40,113 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {15775#true} {15777#(= ~SERIAL_STATE~0 0)} #705#return; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} havoc main_#t~memset~res162#1.base, main_#t~memset~res162#1.offset; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,114 INFO L272 TraceCheckUtils]: 21: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} call main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset := #Ultimate.C_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 1); {15795#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:52:40,114 INFO L290 TraceCheckUtils]: 22: Hoare triple {15795#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr203 := 0; {15775#true} is VALID [2022-02-20 21:52:40,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {15775#true} assume !(#t~loopctr203 % 18446744073709551616 < #amount % 18446744073709551616); {15775#true} is VALID [2022-02-20 21:52:40,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {15775#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {15775#true} is VALID [2022-02-20 21:52:40,116 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {15775#true} {15777#(= ~SERIAL_STATE~0 0)} #707#return; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} havoc main_#t~memset~res163#1.base, main_#t~memset~res163#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume -2147483648 <= main_#t~nondet164#1 && main_#t~nondet164#1 <= 2147483647;main_~tmp___5~0#1 := main_#t~nondet164#1;havoc main_#t~nondet164#1;main_#t~switch165#1 := 0 == main_~tmp___5~0#1; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,117 INFO L290 TraceCheckUtils]: 28: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume !main_#t~switch165#1;main_#t~switch165#1 := main_#t~switch165#1 || 1 == main_~tmp___5~0#1; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,117 INFO L290 TraceCheckUtils]: 29: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume main_#t~switch165#1; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet170#1 && main_#t~nondet170#1 <= 2147483647;main_~tmp___7~0#1 := main_#t~nondet170#1;havoc main_#t~nondet170#1;main_#t~switch171#1 := 0 == main_~tmp___7~0#1; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume !main_#t~switch171#1;main_#t~switch171#1 := main_#t~switch171#1 || 1 == main_~tmp___7~0#1; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume main_#t~switch171#1; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_wl1271_spi_driver_init } true;havoc wl1271_spi_driver_init_#res#1;havoc wl1271_spi_driver_init_#t~ret153#1, wl1271_spi_driver_init_~tmp~14#1;havoc wl1271_spi_driver_init_~tmp~14#1;assume { :begin_inline_spi_register_driver } true;spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset := ~#wl1271_spi_driver~0.base, ~#wl1271_spi_driver~0.offset;havoc spi_register_driver_#res#1;havoc spi_register_driver_#t~nondet198#1, spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset;spi_register_driver_~arg0#1.base, spi_register_driver_~arg0#1.offset := spi_register_driver_#in~arg0#1.base, spi_register_driver_#in~arg0#1.offset;assume -2147483648 <= spi_register_driver_#t~nondet198#1 && spi_register_driver_#t~nondet198#1 <= 2147483647;spi_register_driver_#res#1 := spi_register_driver_#t~nondet198#1;havoc spi_register_driver_#t~nondet198#1; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} wl1271_spi_driver_init_#t~ret153#1 := spi_register_driver_#res#1;assume { :end_inline_spi_register_driver } true;assume -2147483648 <= wl1271_spi_driver_init_#t~ret153#1 && wl1271_spi_driver_init_#t~ret153#1 <= 2147483647;wl1271_spi_driver_init_~tmp~14#1 := wl1271_spi_driver_init_#t~ret153#1;havoc wl1271_spi_driver_init_#t~ret153#1;wl1271_spi_driver_init_#res#1 := wl1271_spi_driver_init_~tmp~14#1; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} main_#t~ret172#1 := wl1271_spi_driver_init_#res#1;assume { :end_inline_wl1271_spi_driver_init } true;assume -2147483648 <= main_#t~ret172#1 && main_#t~ret172#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret172#1;havoc main_#t~ret172#1; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,119 INFO L290 TraceCheckUtils]: 36: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume !(0 == ~ldv_retval_1~0); {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,120 INFO L290 TraceCheckUtils]: 37: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,120 INFO L290 TraceCheckUtils]: 38: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume { :begin_inline_ldv_check_final_state } true; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume 0 == (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume 0 == (~usb_dev~0.base + ~usb_dev~0.offset) % 18446744073709551616; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume 0 == ~dev_counter~0; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume 0 == ~INTERF_STATE~0; {15777#(= ~SERIAL_STATE~0 0)} is VALID [2022-02-20 21:52:40,122 INFO L290 TraceCheckUtils]: 43: Hoare triple {15777#(= ~SERIAL_STATE~0 0)} assume !(0 == ~SERIAL_STATE~0); {15776#false} is VALID [2022-02-20 21:52:40,122 INFO L272 TraceCheckUtils]: 44: Hoare triple {15776#false} call ldv_error(); {15776#false} is VALID [2022-02-20 21:52:40,122 INFO L290 TraceCheckUtils]: 45: Hoare triple {15776#false} assume !false; {15776#false} is VALID [2022-02-20 21:52:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 21:52:40,123 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:52:40,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668876762] [2022-02-20 21:52:40,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668876762] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:52:40,123 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:52:40,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:52:40,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002015982] [2022-02-20 21:52:40,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:52:40,125 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-02-20 21:52:40,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:52:40,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:40,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:40,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:52:40,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:52:40,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:52:40,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:52:40,161 INFO L87 Difference]: Start difference. First operand 574 states and 797 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:43,753 INFO L93 Difference]: Finished difference Result 624 states and 910 transitions. [2022-02-20 21:52:43,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:52:43,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 46 [2022-02-20 21:52:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:52:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-02-20 21:52:43,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 484 transitions. [2022-02-20 21:52:43,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 484 transitions. [2022-02-20 21:52:44,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 484 edges. 484 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:52:44,306 INFO L225 Difference]: With dead ends: 624 [2022-02-20 21:52:44,306 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 21:52:44,308 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:52:44,308 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 444 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:52:44,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [502 Valid, 798 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 21:52:44,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 21:52:44,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 21:52:44,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:52:44,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:52:44,309 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:52:44,310 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:52:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:44,310 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 21:52:44,310 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 21:52:44,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:44,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:44,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 21:52:44,311 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 21:52:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:52:44,311 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 21:52:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 21:52:44,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:44,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:52:44,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:52:44,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:52:44,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:52:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 21:52:44,312 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2022-02-20 21:52:44,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:52:44,313 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 21:52:44,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-20 21:52:44,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 21:52:44,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:52:44,316 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 21:52:44,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 21:52:44,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 21:52:49,046 INFO L858 garLoopResultBuilder]: For program point dev_get_drvdataFINAL(lines 7351 7353) no Hoare annotation was computed. [2022-02-20 21:52:49,046 INFO L858 garLoopResultBuilder]: For program point L7352-1(line 7352) no Hoare annotation was computed. [2022-02-20 21:52:49,047 INFO L854 garLoopResultBuilder]: At program point dev_get_drvdataENTRY(lines 7351 7353) the Hoare annotation is: (or (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~usb_urb~0.offset 0))) [2022-02-20 21:52:49,047 INFO L854 garLoopResultBuilder]: At program point L7352(line 7352) the Hoare annotation is: (or (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~usb_urb~0.offset 0))) [2022-02-20 21:52:49,047 INFO L858 garLoopResultBuilder]: For program point dev_get_drvdataEXIT(lines 7351 7353) no Hoare annotation was computed. [2022-02-20 21:52:49,047 INFO L858 garLoopResultBuilder]: For program point kfreeEXIT(lines 7409 7411) no Hoare annotation was computed. [2022-02-20 21:52:49,047 INFO L854 garLoopResultBuilder]: At program point kfreeENTRY(lines 7409 7411) the Hoare annotation is: (or (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (not (= ~usb_urb~0.offset 0)) (= |old(#valid)| |#valid|)) [2022-02-20 21:52:49,047 INFO L858 garLoopResultBuilder]: For program point kfreeFINAL(lines 7409 7411) no Hoare annotation was computed. [2022-02-20 21:52:49,047 INFO L858 garLoopResultBuilder]: For program point spi_message_add_tailEXIT(lines 6499 6505) no Hoare annotation was computed. [2022-02-20 21:52:49,048 INFO L861 garLoopResultBuilder]: At program point L7341(lines 7340 7342) the Hoare annotation is: true [2022-02-20 21:52:49,048 INFO L861 garLoopResultBuilder]: At program point spi_message_add_tailENTRY(lines 6499 6505) the Hoare annotation is: true [2022-02-20 21:52:49,048 INFO L858 garLoopResultBuilder]: For program point spi_message_add_tailFINAL(lines 6499 6505) no Hoare annotation was computed. [2022-02-20 21:52:49,048 INFO L861 garLoopResultBuilder]: At program point L6324(lines 6320 6326) the Hoare annotation is: true [2022-02-20 21:52:49,048 INFO L858 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 6414 6420) no Hoare annotation was computed. [2022-02-20 21:52:49,048 INFO L861 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 6414 6420) the Hoare annotation is: true [2022-02-20 21:52:49,049 INFO L858 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6418) no Hoare annotation was computed. [2022-02-20 21:52:49,049 INFO L858 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 6414 6420) no Hoare annotation was computed. [2022-02-20 21:52:49,049 INFO L854 garLoopResultBuilder]: At program point L6494(line 6494) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (not (= ~usb_urb~0.offset 0))) [2022-02-20 21:52:49,049 INFO L854 garLoopResultBuilder]: At program point spi_message_initENTRY(lines 6491 6498) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (not (= ~usb_urb~0.offset 0))) [2022-02-20 21:52:49,049 INFO L861 garLoopResultBuilder]: At program point L6316(lines 6311 6318) the Hoare annotation is: true [2022-02-20 21:52:49,049 INFO L858 garLoopResultBuilder]: For program point L6494-1(line 6494) no Hoare annotation was computed. [2022-02-20 21:52:49,049 INFO L858 garLoopResultBuilder]: For program point spi_message_initFINAL(lines 6491 6498) no Hoare annotation was computed. [2022-02-20 21:52:49,049 INFO L858 garLoopResultBuilder]: For program point spi_message_initEXIT(lines 6491 6498) no Hoare annotation was computed. [2022-02-20 21:52:49,049 INFO L858 garLoopResultBuilder]: For program point L6335-1(line 6335) no Hoare annotation was computed. [2022-02-20 21:52:49,049 INFO L854 garLoopResultBuilder]: At program point L6335(line 6335) the Hoare annotation is: (or (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~usb_urb~0.offset 0))) [2022-02-20 21:52:49,050 INFO L861 garLoopResultBuilder]: At program point L6335-2(lines 6333 6336) the Hoare annotation is: true [2022-02-20 21:52:49,050 INFO L858 garLoopResultBuilder]: For program point kzallocEXIT(lines 6347 6354) no Hoare annotation was computed. [2022-02-20 21:52:49,050 INFO L861 garLoopResultBuilder]: At program point L6343(lines 6338 6345) the Hoare annotation is: true [2022-02-20 21:52:49,050 INFO L854 garLoopResultBuilder]: At program point kzallocENTRY(lines 6347 6354) the Hoare annotation is: (or (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~usb_urb~0.offset 0))) [2022-02-20 21:52:49,050 INFO L858 garLoopResultBuilder]: For program point kzallocFINAL(lines 6347 6354) no Hoare annotation was computed. [2022-02-20 21:52:49,050 INFO L858 garLoopResultBuilder]: For program point L6527-1(line 6527) no Hoare annotation was computed. [2022-02-20 21:52:49,050 INFO L854 garLoopResultBuilder]: At program point L6527(line 6527) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (not (= ~usb_urb~0.offset 0))) [2022-02-20 21:52:49,051 INFO L858 garLoopResultBuilder]: For program point L6529(lines 6529 6533) no Hoare annotation was computed. [2022-02-20 21:52:49,051 INFO L858 garLoopResultBuilder]: For program point L6525-1(line 6525) no Hoare annotation was computed. [2022-02-20 21:52:49,051 INFO L854 garLoopResultBuilder]: At program point L6525(line 6525) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (not (= ~usb_urb~0.offset 0))) [2022-02-20 21:52:49,051 INFO L858 garLoopResultBuilder]: For program point wl12xx_spi_resetFINAL(lines 6515 6545) no Hoare annotation was computed. [2022-02-20 21:52:49,051 INFO L858 garLoopResultBuilder]: For program point wl12xx_spi_resetEXIT(lines 6515 6545) no Hoare annotation was computed. [2022-02-20 21:52:49,051 INFO L861 garLoopResultBuilder]: At program point L6542(line 6542) the Hoare annotation is: true [2022-02-20 21:52:49,051 INFO L858 garLoopResultBuilder]: For program point L6539-1(line 6539) no Hoare annotation was computed. [2022-02-20 21:52:49,052 INFO L861 garLoopResultBuilder]: At program point L6539(line 6539) the Hoare annotation is: true [2022-02-20 21:52:49,052 INFO L858 garLoopResultBuilder]: For program point L6540-1(line 6540) no Hoare annotation was computed. [2022-02-20 21:52:49,052 INFO L861 garLoopResultBuilder]: At program point L6540(line 6540) the Hoare annotation is: true [2022-02-20 21:52:49,052 INFO L858 garLoopResultBuilder]: For program point L6541-1(line 6541) no Hoare annotation was computed. [2022-02-20 21:52:49,052 INFO L854 garLoopResultBuilder]: At program point wl12xx_spi_resetENTRY(lines 6515 6545) the Hoare annotation is: (or (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (not (= ~usb_urb~0.offset 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-02-20 21:52:49,052 INFO L861 garLoopResultBuilder]: At program point L6541(line 6541) the Hoare annotation is: true [2022-02-20 21:52:49,052 INFO L858 garLoopResultBuilder]: For program point L6542-1(line 6542) no Hoare annotation was computed. [2022-02-20 21:52:49,053 INFO L854 garLoopResultBuilder]: At program point L6534(line 6534) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (not (= ~usb_urb~0.offset 0))) [2022-02-20 21:52:49,053 INFO L861 garLoopResultBuilder]: At program point L6535-1(line 6535) the Hoare annotation is: true [2022-02-20 21:52:49,053 INFO L861 garLoopResultBuilder]: At program point L6535(line 6535) the Hoare annotation is: true [2022-02-20 21:52:49,053 INFO L858 garLoopResultBuilder]: For program point L6536(line 6536) no Hoare annotation was computed. [2022-02-20 21:52:49,053 INFO L858 garLoopResultBuilder]: For program point L6534-1(line 6534) no Hoare annotation was computed. [2022-02-20 21:52:49,053 INFO L858 garLoopResultBuilder]: For program point ldv_release_2FINAL(lines 7365 7367) no Hoare annotation was computed. [2022-02-20 21:52:49,053 INFO L858 garLoopResultBuilder]: For program point ldv_release_2EXIT(lines 7365 7367) no Hoare annotation was computed. [2022-02-20 21:52:49,054 INFO L861 garLoopResultBuilder]: At program point ldv_release_2ENTRY(lines 7365 7367) the Hoare annotation is: true [2022-02-20 21:52:49,054 INFO L858 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 6421 6427) no Hoare annotation was computed. [2022-02-20 21:52:49,054 INFO L861 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 6421 6427) the Hoare annotation is: true [2022-02-20 21:52:49,054 INFO L858 garLoopResultBuilder]: For program point ldv__builtin_expectFINAL(lines 6428 6433) no Hoare annotation was computed. [2022-02-20 21:52:49,054 INFO L861 garLoopResultBuilder]: At program point ldv__builtin_expectENTRY(lines 6428 6433) the Hoare annotation is: true [2022-02-20 21:52:49,054 INFO L858 garLoopResultBuilder]: For program point ldv__builtin_expectEXIT(lines 6428 6433) no Hoare annotation was computed. [2022-02-20 21:52:49,054 INFO L858 garLoopResultBuilder]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2022-02-20 21:52:49,054 INFO L861 garLoopResultBuilder]: At program point L-1-1(line -1) the Hoare annotation is: true [2022-02-20 21:52:49,055 INFO L854 garLoopResultBuilder]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (not (= ~usb_urb~0.offset 0))) [2022-02-20 21:52:49,055 INFO L858 garLoopResultBuilder]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2022-02-20 21:52:49,055 INFO L858 garLoopResultBuilder]: For program point to_spi_deviceEXIT(lines 6451 6464) no Hoare annotation was computed. [2022-02-20 21:52:49,055 INFO L861 garLoopResultBuilder]: At program point to_spi_deviceENTRY(lines 6451 6464) the Hoare annotation is: true [2022-02-20 21:52:49,055 INFO L858 garLoopResultBuilder]: For program point to_spi_deviceFINAL(lines 6451 6464) no Hoare annotation was computed. [2022-02-20 21:52:49,055 INFO L858 garLoopResultBuilder]: For program point L6456-2(lines 6456 6461) no Hoare annotation was computed. [2022-02-20 21:52:49,055 INFO L858 garLoopResultBuilder]: For program point L6456(lines 6456 6461) no Hoare annotation was computed. [2022-02-20 21:52:49,056 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 6361 6363) the Hoare annotation is: true [2022-02-20 21:52:49,056 INFO L858 garLoopResultBuilder]: For program point L6362(line 6362) no Hoare annotation was computed. [2022-02-20 21:52:49,056 INFO L858 garLoopResultBuilder]: For program point L6362-2(lines 6361 6363) no Hoare annotation was computed. [2022-02-20 21:52:49,056 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6361 6363) no Hoare annotation was computed. [2022-02-20 21:52:49,056 INFO L858 garLoopResultBuilder]: For program point spi_syncEXIT(lines 7402 7404) no Hoare annotation was computed. [2022-02-20 21:52:49,056 INFO L861 garLoopResultBuilder]: At program point spi_syncENTRY(lines 7402 7404) the Hoare annotation is: true [2022-02-20 21:52:49,056 INFO L858 garLoopResultBuilder]: For program point spi_syncFINAL(lines 7402 7404) no Hoare annotation was computed. [2022-02-20 21:52:49,057 INFO L854 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 6364 6380) the Hoare annotation is: (or (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~usb_urb~0.offset 0))) [2022-02-20 21:52:49,057 INFO L858 garLoopResultBuilder]: For program point L6376-1(line 6376) no Hoare annotation was computed. [2022-02-20 21:52:49,057 INFO L861 garLoopResultBuilder]: At program point L6376(line 6376) the Hoare annotation is: true [2022-02-20 21:52:49,057 INFO L858 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 6364 6380) no Hoare annotation was computed. [2022-02-20 21:52:49,057 INFO L858 garLoopResultBuilder]: For program point L6371(lines 6371 6378) no Hoare annotation was computed. [2022-02-20 21:52:49,057 INFO L858 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 6364 6380) no Hoare annotation was computed. [2022-02-20 21:52:49,057 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 21:52:49,058 INFO L858 garLoopResultBuilder]: For program point ldv_zallocEXIT(lines 6381 6397) no Hoare annotation was computed. [2022-02-20 21:52:49,058 INFO L858 garLoopResultBuilder]: For program point L6393-1(line 6393) no Hoare annotation was computed. [2022-02-20 21:52:49,058 INFO L861 garLoopResultBuilder]: At program point L6393(line 6393) the Hoare annotation is: true [2022-02-20 21:52:49,058 INFO L854 garLoopResultBuilder]: At program point ldv_zallocENTRY(lines 6381 6397) the Hoare annotation is: (or (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (not (= ~usb_urb~0.offset 0))) [2022-02-20 21:52:49,058 INFO L858 garLoopResultBuilder]: For program point ldv_zallocFINAL(lines 6381 6397) no Hoare annotation was computed. [2022-02-20 21:52:49,058 INFO L858 garLoopResultBuilder]: For program point L6388(lines 6388 6395) no Hoare annotation was computed. [2022-02-20 21:52:49,058 INFO L858 garLoopResultBuilder]: For program point L6972(lines 6972 7114) no Hoare annotation was computed. [2022-02-20 21:52:49,059 INFO L854 garLoopResultBuilder]: At program point L6774(line 6774) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,059 INFO L854 garLoopResultBuilder]: At program point L6873(lines 6794 6875) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,059 INFO L858 garLoopResultBuilder]: For program point L6741-1(line 6741) no Hoare annotation was computed. [2022-02-20 21:52:49,059 INFO L854 garLoopResultBuilder]: At program point L6741(line 6741) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,059 INFO L858 garLoopResultBuilder]: For program point L6774-1(lines 6737 6790) no Hoare annotation was computed. [2022-02-20 21:52:49,059 INFO L854 garLoopResultBuilder]: At program point L6477(lines 6472 6479) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,059 INFO L858 garLoopResultBuilder]: For program point L7006(lines 7006 7036) no Hoare annotation was computed. [2022-02-20 21:52:49,060 INFO L858 garLoopResultBuilder]: For program point L7072-1(lines 7044 7107) no Hoare annotation was computed. [2022-02-20 21:52:49,060 INFO L858 garLoopResultBuilder]: For program point L7105(line 7105) no Hoare annotation was computed. [2022-02-20 21:52:49,060 INFO L858 garLoopResultBuilder]: For program point L6973(line 6973) no Hoare annotation was computed. [2022-02-20 21:52:49,060 INFO L858 garLoopResultBuilder]: For program point L6742(lines 6742 6746) no Hoare annotation was computed. [2022-02-20 21:52:49,060 INFO L858 garLoopResultBuilder]: For program point L6775-1(lines 6775 6778) no Hoare annotation was computed. [2022-02-20 21:52:49,060 INFO L854 garLoopResultBuilder]: At program point L6610(line 6610) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,060 INFO L854 garLoopResultBuilder]: At program point L6742-2(lines 6742 6746) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,061 INFO L854 garLoopResultBuilder]: At program point L6676(line 6676) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,061 INFO L858 garLoopResultBuilder]: For program point L6610-1(line 6610) no Hoare annotation was computed. [2022-02-20 21:52:49,061 INFO L854 garLoopResultBuilder]: At program point L7370(lines 7369 7371) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,061 INFO L861 garLoopResultBuilder]: At program point L7106(line 7106) the Hoare annotation is: true [2022-02-20 21:52:49,061 INFO L858 garLoopResultBuilder]: For program point L6974(lines 6974 7001) no Hoare annotation was computed. [2022-02-20 21:52:49,061 INFO L858 garLoopResultBuilder]: For program point L7007(line 7007) no Hoare annotation was computed. [2022-02-20 21:52:49,061 INFO L858 garLoopResultBuilder]: For program point L7073-1(line 7073) no Hoare annotation was computed. [2022-02-20 21:52:49,062 INFO L854 garLoopResultBuilder]: At program point L7073(line 7073) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,062 INFO L854 garLoopResultBuilder]: At program point L6842(line 6842) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,062 INFO L858 garLoopResultBuilder]: For program point L6842-1(line 6842) no Hoare annotation was computed. [2022-02-20 21:52:49,062 INFO L858 garLoopResultBuilder]: For program point L6677(line 6677) no Hoare annotation was computed. [2022-02-20 21:52:49,062 INFO L858 garLoopResultBuilder]: For program point L7008(lines 7008 7013) no Hoare annotation was computed. [2022-02-20 21:52:49,062 INFO L858 garLoopResultBuilder]: For program point L7041(line 7041) no Hoare annotation was computed. [2022-02-20 21:52:49,062 INFO L854 garLoopResultBuilder]: At program point L6711(lines 6656 6717) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,063 INFO L858 garLoopResultBuilder]: For program point L7042(lines 7042 7110) no Hoare annotation was computed. [2022-02-20 21:52:49,063 INFO L858 garLoopResultBuilder]: For program point L6976(lines 6976 6998) no Hoare annotation was computed. [2022-02-20 21:52:49,063 INFO L858 garLoopResultBuilder]: For program point L6811(lines 6811 6816) no Hoare annotation was computed. [2022-02-20 21:52:49,063 INFO L854 garLoopResultBuilder]: At program point L7406(lines 7405 7407) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,063 INFO L858 garLoopResultBuilder]: For program point L6977(line 6977) no Hoare annotation was computed. [2022-02-20 21:52:49,063 INFO L854 garLoopResultBuilder]: At program point L6713(lines 6656 6717) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,063 INFO L854 garLoopResultBuilder]: At program point L7374(lines 7373 7375) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,064 INFO L858 garLoopResultBuilder]: For program point L6978(lines 6978 6986) no Hoare annotation was computed. [2022-02-20 21:52:49,064 INFO L858 garLoopResultBuilder]: For program point L7044(lines 7044 7107) no Hoare annotation was computed. [2022-02-20 21:52:49,064 INFO L858 garLoopResultBuilder]: For program point L6747(line 6747) no Hoare annotation was computed. [2022-02-20 21:52:49,064 INFO L858 garLoopResultBuilder]: For program point L6681-1(line 6681) no Hoare annotation was computed. [2022-02-20 21:52:49,064 INFO L854 garLoopResultBuilder]: At program point L6681(line 6681) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,064 INFO L854 garLoopResultBuilder]: At program point L7078(line 7078) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,064 INFO L858 garLoopResultBuilder]: For program point L7045(line 7045) no Hoare annotation was computed. [2022-02-20 21:52:49,065 INFO L858 garLoopResultBuilder]: For program point L7078-1(line 7078) no Hoare annotation was computed. [2022-02-20 21:52:49,065 INFO L854 garLoopResultBuilder]: At program point L6748-1(line 6748) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,065 INFO L854 garLoopResultBuilder]: At program point L6748(line 6748) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,065 INFO L854 garLoopResultBuilder]: At program point L6484-2(lines 6481 6490) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,065 INFO L858 garLoopResultBuilder]: For program point L6484(lines 6484 6487) no Hoare annotation was computed. [2022-02-20 21:52:49,065 INFO L858 garLoopResultBuilder]: For program point L7046(lines 7046 7050) no Hoare annotation was computed. [2022-02-20 21:52:49,065 INFO L858 garLoopResultBuilder]: For program point L7112(line 7112) no Hoare annotation was computed. [2022-02-20 21:52:49,066 INFO L858 garLoopResultBuilder]: For program point L6980(lines 6980 6984) no Hoare annotation was computed. [2022-02-20 21:52:49,066 INFO L854 garLoopResultBuilder]: At program point L6782(lines 6737 6790) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,066 INFO L858 garLoopResultBuilder]: For program point L6848(lines 6848 6852) no Hoare annotation was computed. [2022-02-20 21:52:49,066 INFO L854 garLoopResultBuilder]: At program point L6716(lines 6639 6718) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,066 INFO L858 garLoopResultBuilder]: For program point L6749(line 6749) no Hoare annotation was computed. [2022-02-20 21:52:49,066 INFO L858 garLoopResultBuilder]: For program point L7047-1(line 7047) no Hoare annotation was computed. [2022-02-20 21:52:49,066 INFO L854 garLoopResultBuilder]: At program point L7047(line 7047) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,067 INFO L861 garLoopResultBuilder]: At program point L7113(line 7113) the Hoare annotation is: true [2022-02-20 21:52:49,067 INFO L854 garLoopResultBuilder]: At program point L6618(line 6618) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,067 INFO L854 garLoopResultBuilder]: At program point L6618-1(line 6618) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,067 INFO L854 garLoopResultBuilder]: At program point L7378(lines 7377 7379) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,067 INFO L858 garLoopResultBuilder]: For program point L7015(line 7015) no Hoare annotation was computed. [2022-02-20 21:52:49,067 INFO L858 garLoopResultBuilder]: For program point L6916-1(line 6916) no Hoare annotation was computed. [2022-02-20 21:52:49,067 INFO L854 garLoopResultBuilder]: At program point L6916(line 6916) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,068 INFO L854 garLoopResultBuilder]: At program point L6784(lines 6737 6790) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,068 INFO L858 garLoopResultBuilder]: For program point L6619(line 6619) no Hoare annotation was computed. [2022-02-20 21:52:49,068 INFO L858 garLoopResultBuilder]: For program point L6685-1(line 6685) no Hoare annotation was computed. [2022-02-20 21:52:49,068 INFO L854 garLoopResultBuilder]: At program point L6685(line 6685) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,068 INFO L854 garLoopResultBuilder]: At program point L7115(lines 6950 7120) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,068 INFO L858 garLoopResultBuilder]: For program point L7016(lines 7016 7032) no Hoare annotation was computed. [2022-02-20 21:52:49,068 INFO L854 garLoopResultBuilder]: At program point L6818(line 6818) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,069 INFO L858 garLoopResultBuilder]: For program point L6884-1(line 6884) no Hoare annotation was computed. [2022-02-20 21:52:49,069 INFO L854 garLoopResultBuilder]: At program point L6884(line 6884) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,069 INFO L854 garLoopResultBuilder]: At program point L6686(line 6686) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,069 INFO L858 garLoopResultBuilder]: For program point L6818-1(line 6818) no Hoare annotation was computed. [2022-02-20 21:52:49,069 INFO L858 garLoopResultBuilder]: For program point L6686-1(line 6686) no Hoare annotation was computed. [2022-02-20 21:52:49,069 INFO L858 garLoopResultBuilder]: For program point L7083(line 7083) no Hoare annotation was computed. [2022-02-20 21:52:49,069 INFO L854 garLoopResultBuilder]: At program point L6918(lines 6912 6920) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,070 INFO L854 garLoopResultBuilder]: At program point L6885(lines 6876 6887) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,070 INFO L858 garLoopResultBuilder]: For program point L6687-1(line 6687) no Hoare annotation was computed. [2022-02-20 21:52:49,070 INFO L854 garLoopResultBuilder]: At program point L6687(line 6687) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,070 INFO L858 garLoopResultBuilder]: For program point L7018(lines 7018 7025) no Hoare annotation was computed. [2022-02-20 21:52:49,070 INFO L858 garLoopResultBuilder]: For program point L7084(lines 7084 7089) no Hoare annotation was computed. [2022-02-20 21:52:49,070 INFO L858 garLoopResultBuilder]: For program point L7018-2(lines 7016 7031) no Hoare annotation was computed. [2022-02-20 21:52:49,070 INFO L858 garLoopResultBuilder]: For program point L6787-1(line 6787) no Hoare annotation was computed. [2022-02-20 21:52:49,071 INFO L854 garLoopResultBuilder]: At program point L6787(line 6787) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,071 INFO L858 garLoopResultBuilder]: For program point L6820(lines 6820 6824) no Hoare annotation was computed. [2022-02-20 21:52:49,071 INFO L854 garLoopResultBuilder]: At program point L6688-2(lines 6688 6696) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,071 INFO L858 garLoopResultBuilder]: For program point L6688(lines 6688 6696) no Hoare annotation was computed. [2022-02-20 21:52:49,071 INFO L854 garLoopResultBuilder]: At program point L7382(lines 7381 7383) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,071 INFO L858 garLoopResultBuilder]: For program point L7052(line 7052) no Hoare annotation was computed. [2022-02-20 21:52:49,071 INFO L858 garLoopResultBuilder]: For program point L6854(lines 6854 6858) no Hoare annotation was computed. [2022-02-20 21:52:49,072 INFO L858 garLoopResultBuilder]: For program point L6953-1(line 6953) no Hoare annotation was computed. [2022-02-20 21:52:49,072 INFO L854 garLoopResultBuilder]: At program point L6953(line 6953) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,072 INFO L858 garLoopResultBuilder]: For program point L6788-1(line 6788) no Hoare annotation was computed. [2022-02-20 21:52:49,072 INFO L854 garLoopResultBuilder]: At program point L6788(line 6788) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,072 INFO L858 garLoopResultBuilder]: For program point L6623-1(line 6623) no Hoare annotation was computed. [2022-02-20 21:52:49,072 INFO L854 garLoopResultBuilder]: At program point L6623(line 6623) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,072 INFO L858 garLoopResultBuilder]: For program point L7317(lines 7317 7320) no Hoare annotation was computed. [2022-02-20 21:52:49,073 INFO L861 garLoopResultBuilder]: At program point L7119(lines 6930 7121) the Hoare annotation is: true [2022-02-20 21:52:49,073 INFO L858 garLoopResultBuilder]: For program point L7053(lines 7053 7057) no Hoare annotation was computed. [2022-02-20 21:52:49,073 INFO L858 garLoopResultBuilder]: For program point L6756-2(line 6756) no Hoare annotation was computed. [2022-02-20 21:52:49,073 INFO L858 garLoopResultBuilder]: For program point L6690(lines 6690 6694) no Hoare annotation was computed. [2022-02-20 21:52:49,073 INFO L858 garLoopResultBuilder]: For program point L6756(line 6756) no Hoare annotation was computed. [2022-02-20 21:52:49,073 INFO L854 garLoopResultBuilder]: At program point L6789(lines 6719 6791) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,073 INFO L858 garLoopResultBuilder]: For program point L6624-1(line 6624) no Hoare annotation was computed. [2022-02-20 21:52:49,074 INFO L858 garLoopResultBuilder]: For program point L6657-1(line 6657) no Hoare annotation was computed. [2022-02-20 21:52:49,074 INFO L854 garLoopResultBuilder]: At program point L6624(line 6624) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,074 INFO L854 garLoopResultBuilder]: At program point L6657(line 6657) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,074 INFO L858 garLoopResultBuilder]: For program point L6988(line 6988) no Hoare annotation was computed. [2022-02-20 21:52:49,074 INFO L858 garLoopResultBuilder]: For program point L6691-1(line 6691) no Hoare annotation was computed. [2022-02-20 21:52:49,074 INFO L854 garLoopResultBuilder]: At program point L6691(line 6691) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,074 INFO L858 garLoopResultBuilder]: For program point L6625-1(line 6625) no Hoare annotation was computed. [2022-02-20 21:52:49,075 INFO L854 garLoopResultBuilder]: At program point L6625(line 6625) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,075 INFO L858 garLoopResultBuilder]: For program point L7319-1(lines 7316 7338) no Hoare annotation was computed. [2022-02-20 21:52:49,075 INFO L854 garLoopResultBuilder]: At program point L7385-2(lines 7384 7386) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,075 INFO L854 garLoopResultBuilder]: At program point L7319(line 7319) the Hoare annotation is: false [2022-02-20 21:52:49,075 INFO L858 garLoopResultBuilder]: For program point L7385-1(line 7385) no Hoare annotation was computed. [2022-02-20 21:52:49,075 INFO L854 garLoopResultBuilder]: At program point L7385(line 7385) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,076 INFO L858 garLoopResultBuilder]: For program point L6989(lines 6989 6994) no Hoare annotation was computed. [2022-02-20 21:52:49,076 INFO L858 garLoopResultBuilder]: For program point L6659-1(line 6659) no Hoare annotation was computed. [2022-02-20 21:52:49,076 INFO L858 garLoopResultBuilder]: For program point L6626(lines 6626 6629) no Hoare annotation was computed. [2022-02-20 21:52:49,076 INFO L854 garLoopResultBuilder]: At program point L6659(line 6659) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,076 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 21:52:49,076 INFO L858 garLoopResultBuilder]: For program point L6957-1(line 6957) no Hoare annotation was computed. [2022-02-20 21:52:49,076 INFO L854 garLoopResultBuilder]: At program point L6957(line 6957) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,076 INFO L858 garLoopResultBuilder]: For program point L6925-1(line 6925) no Hoare annotation was computed. [2022-02-20 21:52:49,077 INFO L854 garLoopResultBuilder]: At program point L6925(line 6925) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,077 INFO L854 garLoopResultBuilder]: At program point L7388(lines 7387 7389) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,077 INFO L858 garLoopResultBuilder]: For program point L7091(line 7091) no Hoare annotation was computed. [2022-02-20 21:52:49,077 INFO L858 garLoopResultBuilder]: For program point L6860(lines 6860 6864) no Hoare annotation was computed. [2022-02-20 21:52:49,077 INFO L858 garLoopResultBuilder]: For program point L6761-2(lines 6761 6764) no Hoare annotation was computed. [2022-02-20 21:52:49,077 INFO L858 garLoopResultBuilder]: For program point L6761(lines 6761 6764) no Hoare annotation was computed. [2022-02-20 21:52:49,077 INFO L858 garLoopResultBuilder]: For program point L7323-1(lines 7316 7338) no Hoare annotation was computed. [2022-02-20 21:52:49,078 INFO L854 garLoopResultBuilder]: At program point L7323(line 7323) the Hoare annotation is: false [2022-02-20 21:52:49,084 INFO L854 garLoopResultBuilder]: At program point L7356(lines 7355 7357) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,084 INFO L858 garLoopResultBuilder]: For program point L7092-2(lines 7044 7107) no Hoare annotation was computed. [2022-02-20 21:52:49,084 INFO L858 garLoopResultBuilder]: For program point L7059(line 7059) no Hoare annotation was computed. [2022-02-20 21:52:49,084 INFO L858 garLoopResultBuilder]: For program point L7092(lines 7092 7097) no Hoare annotation was computed. [2022-02-20 21:52:49,084 INFO L854 garLoopResultBuilder]: At program point L6927(lines 6921 6929) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,084 INFO L854 garLoopResultBuilder]: At program point L6630(lines 6607 6637) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,085 INFO L858 garLoopResultBuilder]: For program point L7060(lines 7060 7064) no Hoare annotation was computed. [2022-02-20 21:52:49,085 INFO L858 garLoopResultBuilder]: For program point L7093-1(line 7093) no Hoare annotation was computed. [2022-02-20 21:52:49,085 INFO L854 garLoopResultBuilder]: At program point L7093(line 7093) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,085 INFO L854 garLoopResultBuilder]: At program point L6862(lines 6802 6874) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,085 INFO L858 garLoopResultBuilder]: For program point L6829(lines 6829 6833) no Hoare annotation was computed. [2022-02-20 21:52:49,085 INFO L854 garLoopResultBuilder]: At program point L6697(line 6697) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,085 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 21:52:49,086 INFO L854 garLoopResultBuilder]: At program point L7391(lines 7390 7392) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,086 INFO L854 garLoopResultBuilder]: At program point L7028(lines 6950 7120) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,086 INFO L854 garLoopResultBuilder]: At program point L6896(lines 6891 6898) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,086 INFO L858 garLoopResultBuilder]: For program point L6698(line 6698) no Hoare annotation was computed. [2022-02-20 21:52:49,086 INFO L858 garLoopResultBuilder]: For program point L6665-2(line 6665) no Hoare annotation was computed. [2022-02-20 21:52:49,086 INFO L854 garLoopResultBuilder]: At program point L6632(lines 6607 6637) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,086 INFO L858 garLoopResultBuilder]: For program point L6665(line 6665) no Hoare annotation was computed. [2022-02-20 21:52:49,087 INFO L854 garLoopResultBuilder]: At program point L7359(lines 7358 7360) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,087 INFO L858 garLoopResultBuilder]: For program point L6996(line 6996) no Hoare annotation was computed. [2022-02-20 21:52:49,087 INFO L858 garLoopResultBuilder]: For program point L7327-1(lines 7316 7338) no Hoare annotation was computed. [2022-02-20 21:52:49,087 INFO L854 garLoopResultBuilder]: At program point L7327(line 7327) the Hoare annotation is: false [2022-02-20 21:52:49,087 INFO L858 garLoopResultBuilder]: For program point L6964-1(line 6964) no Hoare annotation was computed. [2022-02-20 21:52:49,087 INFO L854 garLoopResultBuilder]: At program point L6964(line 6964) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,087 INFO L861 garLoopResultBuilder]: At program point L6997(line 6997) the Hoare annotation is: true [2022-02-20 21:52:49,088 INFO L854 garLoopResultBuilder]: At program point L6469(lines 6465 6471) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,088 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 21:52:49,088 INFO L858 garLoopResultBuilder]: For program point L6965-1(line 6965) no Hoare annotation was computed. [2022-02-20 21:52:49,088 INFO L854 garLoopResultBuilder]: At program point L6965(line 6965) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,088 INFO L854 garLoopResultBuilder]: At program point L7362(lines 7361 7363) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,088 INFO L854 garLoopResultBuilder]: At program point L7395(lines 7394 7396) the Hoare annotation is: (and (= ~ldv_state_variable_0~0 1) (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,088 INFO L854 garLoopResultBuilder]: At program point L6702(line 6702) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,089 INFO L854 garLoopResultBuilder]: At program point L6636(lines 6596 6638) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,089 INFO L858 garLoopResultBuilder]: For program point L6702-1(line 6702) no Hoare annotation was computed. [2022-02-20 21:52:49,089 INFO L858 garLoopResultBuilder]: For program point L7066(line 7066) no Hoare annotation was computed. [2022-02-20 21:52:49,089 INFO L858 garLoopResultBuilder]: For program point L7099-1(line 7099) no Hoare annotation was computed. [2022-02-20 21:52:49,089 INFO L854 garLoopResultBuilder]: At program point L7099(line 7099) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,089 INFO L858 garLoopResultBuilder]: For program point L6835(lines 6835 6840) no Hoare annotation was computed. [2022-02-20 21:52:49,089 INFO L854 garLoopResultBuilder]: At program point L6868(lines 6802 6874) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,090 INFO L858 garLoopResultBuilder]: For program point L6703-1(line 6703) no Hoare annotation was computed. [2022-02-20 21:52:49,090 INFO L854 garLoopResultBuilder]: At program point L6703(line 6703) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,090 INFO L858 garLoopResultBuilder]: For program point L6769-1(line 6769) no Hoare annotation was computed. [2022-02-20 21:52:49,090 INFO L854 garLoopResultBuilder]: At program point L6769(line 6769) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,090 INFO L858 garLoopResultBuilder]: For program point L7331-1(lines 7316 7338) no Hoare annotation was computed. [2022-02-20 21:52:49,090 INFO L854 garLoopResultBuilder]: At program point L7331(line 7331) the Hoare annotation is: false [2022-02-20 21:52:49,090 INFO L858 garLoopResultBuilder]: For program point L7034(line 7034) no Hoare annotation was computed. [2022-02-20 21:52:49,091 INFO L858 garLoopResultBuilder]: For program point L7067(lines 7067 7071) no Hoare annotation was computed. [2022-02-20 21:52:49,091 INFO L858 garLoopResultBuilder]: For program point L7067-2(lines 7044 7107) no Hoare annotation was computed. [2022-02-20 21:52:49,091 INFO L854 garLoopResultBuilder]: At program point L6869(lines 6802 6874) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,091 INFO L858 garLoopResultBuilder]: For program point L6704-1(line 6704) no Hoare annotation was computed. [2022-02-20 21:52:49,091 INFO L854 garLoopResultBuilder]: At program point L6704(line 6704) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,091 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 21:52:49,091 INFO L861 garLoopResultBuilder]: At program point L7035(line 7035) the Hoare annotation is: true [2022-02-20 21:52:49,091 INFO L858 garLoopResultBuilder]: For program point L7068-1(line 7068) no Hoare annotation was computed. [2022-02-20 21:52:49,092 INFO L854 garLoopResultBuilder]: At program point L7068(line 7068) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,092 INFO L854 garLoopResultBuilder]: At program point L6903(lines 6899 6905) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,092 INFO L854 garLoopResultBuilder]: At program point L6738(line 6738) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,092 INFO L858 garLoopResultBuilder]: For program point L6804-1(line 6804) no Hoare annotation was computed. [2022-02-20 21:52:49,092 INFO L854 garLoopResultBuilder]: At program point L6804(line 6804) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,092 INFO L854 garLoopResultBuilder]: At program point L6672-2(lines 6672 6675) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,093 INFO L858 garLoopResultBuilder]: For program point L6705-2(lines 6705 6708) no Hoare annotation was computed. [2022-02-20 21:52:49,093 INFO L858 garLoopResultBuilder]: For program point L6672(lines 6672 6675) no Hoare annotation was computed. [2022-02-20 21:52:49,093 INFO L858 garLoopResultBuilder]: For program point L6738-1(line 6738) no Hoare annotation was computed. [2022-02-20 21:52:49,093 INFO L858 garLoopResultBuilder]: For program point L6705(lines 6705 6708) no Hoare annotation was computed. [2022-02-20 21:52:49,093 INFO L854 garLoopResultBuilder]: At program point L7399(lines 7398 7400) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,093 INFO L858 garLoopResultBuilder]: For program point L7003(line 7003) no Hoare annotation was computed. [2022-02-20 21:52:49,093 INFO L854 garLoopResultBuilder]: At program point L6871(lines 6802 6874) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,093 INFO L858 garLoopResultBuilder]: For program point L7004(lines 7004 7039) no Hoare annotation was computed. [2022-02-20 21:52:49,094 INFO L858 garLoopResultBuilder]: For program point L6806(lines 6806 6809) no Hoare annotation was computed. [2022-02-20 21:52:49,094 INFO L858 garLoopResultBuilder]: For program point L6608-1(line 6608) no Hoare annotation was computed. [2022-02-20 21:52:49,094 INFO L854 garLoopResultBuilder]: At program point L6608(line 6608) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,094 INFO L858 garLoopResultBuilder]: For program point L6476-1(line 6476) no Hoare annotation was computed. [2022-02-20 21:52:49,094 INFO L854 garLoopResultBuilder]: At program point L6476(line 6476) the Hoare annotation is: (and (= ~INTERF_STATE~0 0) (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0) (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0) (= ~dev_counter~0 0) (= ~SERIAL_STATE~0 0)) [2022-02-20 21:52:49,094 INFO L861 garLoopResultBuilder]: At program point L7335-1(lines 7314 7339) the Hoare annotation is: true [2022-02-20 21:52:49,094 INFO L854 garLoopResultBuilder]: At program point L7335(line 7335) the Hoare annotation is: false [2022-02-20 21:52:49,095 INFO L861 garLoopResultBuilder]: At program point L6590(line 6590) the Hoare annotation is: true [2022-02-20 21:52:49,095 INFO L858 garLoopResultBuilder]: For program point L6592-1(line 6592) no Hoare annotation was computed. [2022-02-20 21:52:49,095 INFO L861 garLoopResultBuilder]: At program point L6592(line 6592) the Hoare annotation is: true [2022-02-20 21:52:49,095 INFO L858 garLoopResultBuilder]: For program point wl12xx_spi_initFINAL(lines 6546 6595) no Hoare annotation was computed. [2022-02-20 21:52:49,095 INFO L858 garLoopResultBuilder]: For program point L6590-1(line 6590) no Hoare annotation was computed. [2022-02-20 21:52:49,095 INFO L858 garLoopResultBuilder]: For program point L6568-1(line 6568) no Hoare annotation was computed. [2022-02-20 21:52:49,095 INFO L861 garLoopResultBuilder]: At program point L6568(line 6568) the Hoare annotation is: true [2022-02-20 21:52:49,095 INFO L858 garLoopResultBuilder]: For program point L6562(lines 6562 6566) no Hoare annotation was computed. [2022-02-20 21:52:49,096 INFO L854 garLoopResultBuilder]: At program point L6558(line 6558) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (not (= ~usb_urb~0.offset 0))) [2022-02-20 21:52:49,096 INFO L858 garLoopResultBuilder]: For program point L6591-1(line 6591) no Hoare annotation was computed. [2022-02-20 21:52:49,096 INFO L858 garLoopResultBuilder]: For program point L6560-1(line 6560) no Hoare annotation was computed. [2022-02-20 21:52:49,096 INFO L861 garLoopResultBuilder]: At program point L6591(line 6591) the Hoare annotation is: true [2022-02-20 21:52:49,096 INFO L854 garLoopResultBuilder]: At program point L6560(line 6560) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (not (= ~usb_urb~0.offset 0))) [2022-02-20 21:52:49,096 INFO L858 garLoopResultBuilder]: For program point L6589-1(line 6589) no Hoare annotation was computed. [2022-02-20 21:52:49,096 INFO L858 garLoopResultBuilder]: For program point L6558-1(line 6558) no Hoare annotation was computed. [2022-02-20 21:52:49,097 INFO L861 garLoopResultBuilder]: At program point L6589(line 6589) the Hoare annotation is: true [2022-02-20 21:52:49,097 INFO L861 garLoopResultBuilder]: At program point L7345(lines 7344 7346) the Hoare annotation is: true [2022-02-20 21:52:49,097 INFO L858 garLoopResultBuilder]: For program point L6567-1(line 6567) no Hoare annotation was computed. [2022-02-20 21:52:49,097 INFO L854 garLoopResultBuilder]: At program point L6567(line 6567) the Hoare annotation is: (or (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (not (= ~usb_urb~0.offset 0))) [2022-02-20 21:52:49,097 INFO L858 garLoopResultBuilder]: For program point L6569-1(line 6569) no Hoare annotation was computed. [2022-02-20 21:52:49,097 INFO L854 garLoopResultBuilder]: At program point wl12xx_spi_initENTRY(lines 6546 6595) the Hoare annotation is: (or (not (= ~usb_dev~0.offset 0)) (not (= ~INTERF_STATE~0 0)) (not (= ~dev_counter~0 0)) (not (= ~usb_urb~0.base 0)) (not (= ~usb_dev~0.base 0)) (not (= ~SERIAL_STATE~0 0)) (not (= ~usb_urb~0.offset 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))) [2022-02-20 21:52:49,097 INFO L861 garLoopResultBuilder]: At program point L6569(line 6569) the Hoare annotation is: true [2022-02-20 21:52:49,098 INFO L858 garLoopResultBuilder]: For program point wl12xx_spi_initEXIT(lines 6546 6595) no Hoare annotation was computed. [2022-02-20 21:52:49,100 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 21:52:49,102 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 21:52:49,106 WARN L170 areAnnotationChecker]: kfreeFINAL has no Hoare annotation [2022-02-20 21:52:49,106 WARN L170 areAnnotationChecker]: L6456 has no Hoare annotation [2022-02-20 21:52:49,106 WARN L170 areAnnotationChecker]: L6362 has no Hoare annotation [2022-02-20 21:52:49,107 WARN L170 areAnnotationChecker]: spi_syncFINAL has no Hoare annotation [2022-02-20 21:52:49,107 WARN L170 areAnnotationChecker]: L6371 has no Hoare annotation [2022-02-20 21:52:49,107 WARN L170 areAnnotationChecker]: ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-02-20 21:52:49,107 WARN L170 areAnnotationChecker]: ldv_errorFINAL has no Hoare annotation [2022-02-20 21:52:49,110 WARN L170 areAnnotationChecker]: L6388 has no Hoare annotation [2022-02-20 21:52:49,110 WARN L170 areAnnotationChecker]: ldv_release_2FINAL has no Hoare annotation [2022-02-20 21:52:49,110 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 21:52:49,112 WARN L170 areAnnotationChecker]: ldv__builtin_expectFINAL has no Hoare annotation [2022-02-20 21:52:49,112 WARN L170 areAnnotationChecker]: L7352-1 has no Hoare annotation [2022-02-20 21:52:49,113 WARN L170 areAnnotationChecker]: kfreeFINAL has no Hoare annotation [2022-02-20 21:52:49,114 WARN L170 areAnnotationChecker]: #Ultimate.C_memsetFINAL has no Hoare annotation [2022-02-20 21:52:49,114 WARN L170 areAnnotationChecker]: L6456 has no Hoare annotation [2022-02-20 21:52:49,114 WARN L170 areAnnotationChecker]: L6456 has no Hoare annotation [2022-02-20 21:52:49,114 WARN L170 areAnnotationChecker]: L6362 has no Hoare annotation [2022-02-20 21:52:49,114 WARN L170 areAnnotationChecker]: L6362 has no Hoare annotation [2022-02-20 21:52:49,114 WARN L170 areAnnotationChecker]: spi_syncFINAL has no Hoare annotation [2022-02-20 21:52:49,114 WARN L170 areAnnotationChecker]: L6371 has no Hoare annotation [2022-02-20 21:52:49,114 WARN L170 areAnnotationChecker]: L6371 has no Hoare annotation [2022-02-20 21:52:49,115 WARN L170 areAnnotationChecker]: ldv_errorFINAL has no Hoare annotation [2022-02-20 21:52:49,115 WARN L170 areAnnotationChecker]: L6494-1 has no Hoare annotation [2022-02-20 21:52:49,116 WARN L170 areAnnotationChecker]: L6335-1 has no Hoare annotation [2022-02-20 21:52:49,117 WARN L170 areAnnotationChecker]: L6525-1 has no Hoare annotation [2022-02-20 21:52:49,118 WARN L170 areAnnotationChecker]: L6388 has no Hoare annotation [2022-02-20 21:52:49,118 WARN L170 areAnnotationChecker]: L6388 has no Hoare annotation [2022-02-20 21:52:49,119 WARN L170 areAnnotationChecker]: ldv_release_2FINAL has no Hoare annotation [2022-02-20 21:52:49,119 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 21:52:49,119 WARN L170 areAnnotationChecker]: L6558-1 has no Hoare annotation [2022-02-20 21:52:49,120 WARN L170 areAnnotationChecker]: ldv__builtin_expectFINAL has no Hoare annotation [2022-02-20 21:52:49,120 WARN L170 areAnnotationChecker]: L7352-1 has no Hoare annotation [2022-02-20 21:52:49,120 WARN L170 areAnnotationChecker]: kfreeEXIT has no Hoare annotation [2022-02-20 21:52:49,121 WARN L170 areAnnotationChecker]: kfreeEXIT has no Hoare annotation [2022-02-20 21:52:49,121 WARN L170 areAnnotationChecker]: kfreeEXIT has no Hoare annotation [2022-02-20 21:52:49,121 WARN L170 areAnnotationChecker]: kfreeEXIT has no Hoare annotation [2022-02-20 21:52:49,121 WARN L170 areAnnotationChecker]: kfreeEXIT has no Hoare annotation [2022-02-20 21:52:49,121 WARN L170 areAnnotationChecker]: #Ultimate.C_memsetFINAL has no Hoare annotation [2022-02-20 21:52:49,121 WARN L170 areAnnotationChecker]: L6456-2 has no Hoare annotation [2022-02-20 21:52:49,121 WARN L170 areAnnotationChecker]: spi_message_add_tailFINAL has no Hoare annotation [2022-02-20 21:52:49,121 WARN L170 areAnnotationChecker]: L6362-2 has no Hoare annotation [2022-02-20 21:52:49,121 WARN L170 areAnnotationChecker]: spi_syncEXIT has no Hoare annotation [2022-02-20 21:52:49,122 WARN L170 areAnnotationChecker]: spi_syncEXIT has no Hoare annotation [2022-02-20 21:52:49,122 WARN L170 areAnnotationChecker]: spi_syncEXIT has no Hoare annotation [2022-02-20 21:52:49,122 WARN L170 areAnnotationChecker]: spi_syncEXIT has no Hoare annotation [2022-02-20 21:52:49,122 WARN L170 areAnnotationChecker]: spi_syncEXIT has no Hoare annotation [2022-02-20 21:52:49,122 WARN L170 areAnnotationChecker]: spi_syncEXIT has no Hoare annotation [2022-02-20 21:52:49,122 WARN L170 areAnnotationChecker]: ldv_mallocFINAL has no Hoare annotation [2022-02-20 21:52:49,122 WARN L170 areAnnotationChecker]: L6376-1 has no Hoare annotation [2022-02-20 21:52:49,122 WARN L170 areAnnotationChecker]: ldv_errorEXIT has no Hoare annotation [2022-02-20 21:52:49,123 WARN L170 areAnnotationChecker]: ldv_errorEXIT has no Hoare annotation [2022-02-20 21:52:49,123 WARN L170 areAnnotationChecker]: ldv_errorEXIT has no Hoare annotation [2022-02-20 21:52:49,123 WARN L170 areAnnotationChecker]: ldv_errorEXIT has no Hoare annotation [2022-02-20 21:52:49,123 WARN L170 areAnnotationChecker]: ldv_errorEXIT has no Hoare annotation [2022-02-20 21:52:49,123 WARN L170 areAnnotationChecker]: L6494-1 has no Hoare annotation [2022-02-20 21:52:49,123 WARN L170 areAnnotationChecker]: L6335-1 has no Hoare annotation [2022-02-20 21:52:49,123 WARN L170 areAnnotationChecker]: L6525-1 has no Hoare annotation [2022-02-20 21:52:49,123 WARN L170 areAnnotationChecker]: ldv_zallocFINAL has no Hoare annotation [2022-02-20 21:52:49,123 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 21:52:49,124 WARN L170 areAnnotationChecker]: ldv_release_2EXIT has no Hoare annotation [2022-02-20 21:52:49,124 WARN L170 areAnnotationChecker]: ldv_release_2EXIT has no Hoare annotation [2022-02-20 21:52:49,124 WARN L170 areAnnotationChecker]: L6953-1 has no Hoare annotation [2022-02-20 21:52:49,125 WARN L170 areAnnotationChecker]: L6558-1 has no Hoare annotation [2022-02-20 21:52:49,125 WARN L170 areAnnotationChecker]: ldv__builtin_expectEXIT has no Hoare annotation [2022-02-20 21:52:49,125 WARN L170 areAnnotationChecker]: ldv__builtin_expectEXIT has no Hoare annotation [2022-02-20 21:52:49,125 WARN L170 areAnnotationChecker]: dev_get_drvdataFINAL has no Hoare annotation [2022-02-20 21:52:49,125 WARN L170 areAnnotationChecker]: L6542-1 has no Hoare annotation [2022-02-20 21:52:49,129 WARN L170 areAnnotationChecker]: L6884-1 has no Hoare annotation [2022-02-20 21:52:49,129 WARN L170 areAnnotationChecker]: L6592-1 has no Hoare annotation [2022-02-20 21:52:49,129 WARN L170 areAnnotationChecker]: #Ultimate.C_memsetEXIT has no Hoare annotation [2022-02-20 21:52:49,129 WARN L170 areAnnotationChecker]: #Ultimate.C_memsetEXIT has no Hoare annotation [2022-02-20 21:52:49,129 WARN L170 areAnnotationChecker]: #Ultimate.C_memsetEXIT has no Hoare annotation [2022-02-20 21:52:49,129 WARN L170 areAnnotationChecker]: #Ultimate.C_memsetEXIT has no Hoare annotation [2022-02-20 21:52:49,129 WARN L170 areAnnotationChecker]: #Ultimate.C_memsetEXIT has no Hoare annotation [2022-02-20 21:52:49,130 WARN L170 areAnnotationChecker]: #Ultimate.C_memsetEXIT has no Hoare annotation [2022-02-20 21:52:49,130 WARN L170 areAnnotationChecker]: #Ultimate.C_memsetEXIT has no Hoare annotation [2022-02-20 21:52:49,130 WARN L170 areAnnotationChecker]: #Ultimate.C_memsetEXIT has no Hoare annotation [2022-02-20 21:52:49,130 WARN L170 areAnnotationChecker]: #Ultimate.C_memsetEXIT has no Hoare annotation [2022-02-20 21:52:49,130 WARN L170 areAnnotationChecker]: #Ultimate.C_memsetEXIT has no Hoare annotation [2022-02-20 21:52:49,130 WARN L170 areAnnotationChecker]: #Ultimate.C_memsetEXIT has no Hoare annotation [2022-02-20 21:52:49,130 WARN L170 areAnnotationChecker]: #Ultimate.C_memsetEXIT has no Hoare annotation [2022-02-20 21:52:49,130 WARN L170 areAnnotationChecker]: #Ultimate.C_memsetEXIT has no Hoare annotation [2022-02-20 21:52:49,130 WARN L170 areAnnotationChecker]: to_spi_deviceFINAL has no Hoare annotation [2022-02-20 21:52:49,131 WARN L170 areAnnotationChecker]: spi_message_add_tailFINAL has no Hoare annotation [2022-02-20 21:52:49,131 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:52:49,131 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 21:52:49,131 WARN L170 areAnnotationChecker]: L6541-1 has no Hoare annotation [2022-02-20 21:52:49,131 WARN L170 areAnnotationChecker]: L6788-1 has no Hoare annotation [2022-02-20 21:52:49,131 WARN L170 areAnnotationChecker]: L6687-1 has no Hoare annotation [2022-02-20 21:52:49,131 WARN L170 areAnnotationChecker]: L6625-1 has no Hoare annotation [2022-02-20 21:52:49,131 WARN L170 areAnnotationChecker]: L6704-1 has no Hoare annotation [2022-02-20 21:52:49,131 WARN L170 areAnnotationChecker]: L6591-1 has no Hoare annotation [2022-02-20 21:52:49,132 WARN L170 areAnnotationChecker]: ldv_mallocEXIT has no Hoare annotation [2022-02-20 21:52:49,132 WARN L170 areAnnotationChecker]: ldv_mallocEXIT has no Hoare annotation [2022-02-20 21:52:49,132 WARN L170 areAnnotationChecker]: ldv_mallocEXIT has no Hoare annotation [2022-02-20 21:52:49,132 WARN L170 areAnnotationChecker]: L6376-1 has no Hoare annotation [2022-02-20 21:52:49,132 WARN L170 areAnnotationChecker]: L7319-1 has no Hoare annotation [2022-02-20 21:52:49,132 WARN L170 areAnnotationChecker]: L7319-1 has no Hoare annotation [2022-02-20 21:52:49,132 WARN L170 areAnnotationChecker]: L7323-1 has no Hoare annotation [2022-02-20 21:52:49,133 WARN L170 areAnnotationChecker]: L7323-1 has no Hoare annotation [2022-02-20 21:52:49,133 WARN L170 areAnnotationChecker]: L7327-1 has no Hoare annotation [2022-02-20 21:52:49,133 WARN L170 areAnnotationChecker]: L7327-1 has no Hoare annotation [2022-02-20 21:52:49,133 WARN L170 areAnnotationChecker]: L7331-1 has no Hoare annotation [2022-02-20 21:52:49,133 WARN L170 areAnnotationChecker]: L7331-1 has no Hoare annotation [2022-02-20 21:52:49,133 WARN L170 areAnnotationChecker]: spi_message_initFINAL has no Hoare annotation [2022-02-20 21:52:49,133 WARN L170 areAnnotationChecker]: L6527-1 has no Hoare annotation [2022-02-20 21:52:49,135 WARN L170 areAnnotationChecker]: ldv_zallocEXIT has no Hoare annotation [2022-02-20 21:52:49,135 WARN L170 areAnnotationChecker]: ldv_zallocEXIT has no Hoare annotation [2022-02-20 21:52:49,135 WARN L170 areAnnotationChecker]: ldv_zallocEXIT has no Hoare annotation [2022-02-20 21:52:49,135 WARN L170 areAnnotationChecker]: ldv_zallocEXIT has no Hoare annotation [2022-02-20 21:52:49,135 WARN L170 areAnnotationChecker]: L6393-1 has no Hoare annotation [2022-02-20 21:52:49,135 WARN L170 areAnnotationChecker]: L7093-1 has no Hoare annotation [2022-02-20 21:52:49,135 WARN L170 areAnnotationChecker]: L7099-1 has no Hoare annotation [2022-02-20 21:52:49,135 WARN L170 areAnnotationChecker]: L6953-1 has no Hoare annotation [2022-02-20 21:52:49,136 WARN L170 areAnnotationChecker]: L6560-1 has no Hoare annotation [2022-02-20 21:52:49,137 WARN L170 areAnnotationChecker]: L6741-1 has no Hoare annotation [2022-02-20 21:52:49,137 WARN L170 areAnnotationChecker]: L6747 has no Hoare annotation [2022-02-20 21:52:49,137 WARN L170 areAnnotationChecker]: dev_get_drvdataEXIT has no Hoare annotation [2022-02-20 21:52:49,137 WARN L170 areAnnotationChecker]: dev_get_drvdataEXIT has no Hoare annotation [2022-02-20 21:52:49,137 WARN L170 areAnnotationChecker]: dev_get_drvdataEXIT has no Hoare annotation [2022-02-20 21:52:49,138 WARN L170 areAnnotationChecker]: dev_get_drvdataEXIT has no Hoare annotation [2022-02-20 21:52:49,138 WARN L170 areAnnotationChecker]: dev_get_drvdataEXIT has no Hoare annotation [2022-02-20 21:52:49,138 WARN L170 areAnnotationChecker]: dev_get_drvdataEXIT has no Hoare annotation [2022-02-20 21:52:49,138 WARN L170 areAnnotationChecker]: dev_get_drvdataEXIT has no Hoare annotation [2022-02-20 21:52:49,138 WARN L170 areAnnotationChecker]: dev_get_drvdataEXIT has no Hoare annotation [2022-02-20 21:52:49,138 WARN L170 areAnnotationChecker]: wl12xx_spi_resetFINAL has no Hoare annotation [2022-02-20 21:52:49,138 WARN L170 areAnnotationChecker]: L6980 has no Hoare annotation [2022-02-20 21:52:49,139 WARN L170 areAnnotationChecker]: wl12xx_spi_initFINAL has no Hoare annotation [2022-02-20 21:52:49,139 WARN L170 areAnnotationChecker]: L6534-1 has no Hoare annotation [2022-02-20 21:52:49,139 WARN L170 areAnnotationChecker]: L6536 has no Hoare annotation [2022-02-20 21:52:49,139 WARN L170 areAnnotationChecker]: L6964-1 has no Hoare annotation [2022-02-20 21:52:49,139 WARN L170 areAnnotationChecker]: L6965-1 has no Hoare annotation [2022-02-20 21:52:49,139 WARN L170 areAnnotationChecker]: L6842-1 has no Hoare annotation [2022-02-20 21:52:49,140 WARN L170 areAnnotationChecker]: L6749 has no Hoare annotation [2022-02-20 21:52:49,140 WARN L170 areAnnotationChecker]: L6677 has no Hoare annotation [2022-02-20 21:52:49,140 WARN L170 areAnnotationChecker]: L6619 has no Hoare annotation [2022-02-20 21:52:49,140 WARN L170 areAnnotationChecker]: L6691-1 has no Hoare annotation [2022-02-20 21:52:49,140 WARN L170 areAnnotationChecker]: L6698 has no Hoare annotation [2022-02-20 21:52:49,140 WARN L170 areAnnotationChecker]: L6567-1 has no Hoare annotation [2022-02-20 21:52:49,140 WARN L170 areAnnotationChecker]: L6568-1 has no Hoare annotation [2022-02-20 21:52:49,140 WARN L170 areAnnotationChecker]: to_spi_deviceEXIT has no Hoare annotation [2022-02-20 21:52:49,140 WARN L170 areAnnotationChecker]: to_spi_deviceEXIT has no Hoare annotation [2022-02-20 21:52:49,141 WARN L170 areAnnotationChecker]: to_spi_deviceEXIT has no Hoare annotation [2022-02-20 21:52:49,141 WARN L170 areAnnotationChecker]: to_spi_deviceEXIT has no Hoare annotation [2022-02-20 21:52:49,141 WARN L170 areAnnotationChecker]: to_spi_deviceEXIT has no Hoare annotation [2022-02-20 21:52:49,141 WARN L170 areAnnotationChecker]: to_spi_deviceEXIT has no Hoare annotation [2022-02-20 21:52:49,141 WARN L170 areAnnotationChecker]: spi_message_add_tailEXIT has no Hoare annotation [2022-02-20 21:52:49,141 WARN L170 areAnnotationChecker]: spi_message_add_tailEXIT has no Hoare annotation [2022-02-20 21:52:49,141 WARN L170 areAnnotationChecker]: spi_message_add_tailEXIT has no Hoare annotation [2022-02-20 21:52:49,141 WARN L170 areAnnotationChecker]: spi_message_add_tailEXIT has no Hoare annotation [2022-02-20 21:52:49,141 WARN L170 areAnnotationChecker]: spi_message_add_tailEXIT has no Hoare annotation [2022-02-20 21:52:49,141 WARN L170 areAnnotationChecker]: spi_message_add_tailEXIT has no Hoare annotation [2022-02-20 21:52:49,142 WARN L170 areAnnotationChecker]: spi_message_add_tailEXIT has no Hoare annotation [2022-02-20 21:52:49,142 WARN L170 areAnnotationChecker]: spi_message_add_tailEXIT has no Hoare annotation [2022-02-20 21:52:49,142 WARN L170 areAnnotationChecker]: L6393-1 has no Hoare annotation [2022-02-20 21:52:49,142 WARN L170 areAnnotationChecker]: L6542-1 has no Hoare annotation [2022-02-20 21:52:49,143 WARN L170 areAnnotationChecker]: L6688 has no Hoare annotation [2022-02-20 21:52:49,144 WARN L170 areAnnotationChecker]: L6688 has no Hoare annotation [2022-02-20 21:52:49,144 WARN L170 areAnnotationChecker]: L6626 has no Hoare annotation [2022-02-20 21:52:49,144 WARN L170 areAnnotationChecker]: L6626 has no Hoare annotation [2022-02-20 21:52:49,144 WARN L170 areAnnotationChecker]: L6705 has no Hoare annotation [2022-02-20 21:52:49,144 WARN L170 areAnnotationChecker]: L6705 has no Hoare annotation [2022-02-20 21:52:49,144 WARN L170 areAnnotationChecker]: L6592-1 has no Hoare annotation [2022-02-20 21:52:49,145 WARN L170 areAnnotationChecker]: L7385-1 has no Hoare annotation [2022-02-20 21:52:49,145 WARN L170 areAnnotationChecker]: L7323-1 has no Hoare annotation [2022-02-20 21:52:49,145 WARN L170 areAnnotationChecker]: L7327-1 has no Hoare annotation [2022-02-20 21:52:49,146 WARN L170 areAnnotationChecker]: L7331-1 has no Hoare annotation [2022-02-20 21:52:49,146 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 21:52:49,146 WARN L170 areAnnotationChecker]: spi_message_initFINAL has no Hoare annotation [2022-02-20 21:52:49,146 WARN L170 areAnnotationChecker]: kzallocFINAL has no Hoare annotation [2022-02-20 21:52:49,146 WARN L170 areAnnotationChecker]: L6527-1 has no Hoare annotation [2022-02-20 21:52:49,146 WARN L170 areAnnotationChecker]: L6957-1 has no Hoare annotation [2022-02-20 21:52:49,146 WARN L170 areAnnotationChecker]: L6916-1 has no Hoare annotation [2022-02-20 21:52:49,146 WARN L170 areAnnotationChecker]: L6925-1 has no Hoare annotation [2022-02-20 21:52:49,146 WARN L170 areAnnotationChecker]: L7092-2 has no Hoare annotation [2022-02-20 21:52:49,146 WARN L170 areAnnotationChecker]: L7092-2 has no Hoare annotation [2022-02-20 21:52:49,147 WARN L170 areAnnotationChecker]: L6973 has no Hoare annotation [2022-02-20 21:52:49,147 WARN L170 areAnnotationChecker]: L6957-1 has no Hoare annotation [2022-02-20 21:52:49,148 WARN L170 areAnnotationChecker]: L6560-1 has no Hoare annotation [2022-02-20 21:52:49,148 WARN L170 areAnnotationChecker]: L6742 has no Hoare annotation [2022-02-20 21:52:49,148 WARN L170 areAnnotationChecker]: L6742 has no Hoare annotation [2022-02-20 21:52:49,149 WARN L170 areAnnotationChecker]: L6476-1 has no Hoare annotation [2022-02-20 21:52:49,149 WARN L170 areAnnotationChecker]: L6738-1 has no Hoare annotation [2022-02-20 21:52:49,149 WARN L170 areAnnotationChecker]: L6657-1 has no Hoare annotation [2022-02-20 21:52:49,149 WARN L170 areAnnotationChecker]: L6659-1 has no Hoare annotation [2022-02-20 21:52:49,149 WARN L170 areAnnotationChecker]: L6608-1 has no Hoare annotation [2022-02-20 21:52:49,150 WARN L170 areAnnotationChecker]: L6610-1 has no Hoare annotation [2022-02-20 21:52:49,150 WARN L170 areAnnotationChecker]: wl12xx_spi_resetEXIT has no Hoare annotation [2022-02-20 21:52:49,150 WARN L170 areAnnotationChecker]: wl12xx_spi_resetEXIT has no Hoare annotation [2022-02-20 21:52:49,150 WARN L170 areAnnotationChecker]: wl12xx_spi_resetEXIT has no Hoare annotation [2022-02-20 21:52:49,150 WARN L170 areAnnotationChecker]: L6980 has no Hoare annotation [2022-02-20 21:52:49,150 WARN L170 areAnnotationChecker]: L6980 has no Hoare annotation [2022-02-20 21:52:49,150 WARN L170 areAnnotationChecker]: wl12xx_spi_initEXIT has no Hoare annotation [2022-02-20 21:52:49,151 WARN L170 areAnnotationChecker]: L6539-1 has no Hoare annotation [2022-02-20 21:52:49,152 WARN L170 areAnnotationChecker]: L6965-1 has no Hoare annotation [2022-02-20 21:52:49,153 WARN L170 areAnnotationChecker]: L6848 has no Hoare annotation [2022-02-20 21:52:49,154 WARN L170 areAnnotationChecker]: L6681-1 has no Hoare annotation [2022-02-20 21:52:49,154 WARN L170 areAnnotationChecker]: L6623-1 has no Hoare annotation [2022-02-20 21:52:49,154 WARN L170 areAnnotationChecker]: L6702-1 has no Hoare annotation [2022-02-20 21:52:49,154 WARN L170 areAnnotationChecker]: L6568-1 has no Hoare annotation [2022-02-20 21:52:49,156 WARN L170 areAnnotationChecker]: L6569-1 has no Hoare annotation [2022-02-20 21:52:49,157 WARN L170 areAnnotationChecker]: L6540-1 has no Hoare annotation [2022-02-20 21:52:49,157 WARN L170 areAnnotationChecker]: L6787-1 has no Hoare annotation [2022-02-20 21:52:49,157 WARN L170 areAnnotationChecker]: L6686-1 has no Hoare annotation [2022-02-20 21:52:49,157 WARN L170 areAnnotationChecker]: L6624-1 has no Hoare annotation [2022-02-20 21:52:49,157 WARN L170 areAnnotationChecker]: L6703-1 has no Hoare annotation [2022-02-20 21:52:49,157 WARN L170 areAnnotationChecker]: L6590-1 has no Hoare annotation [2022-02-20 21:52:49,157 WARN L170 areAnnotationChecker]: L6539-1 has no Hoare annotation [2022-02-20 21:52:49,157 WARN L170 areAnnotationChecker]: L6769-1 has no Hoare annotation [2022-02-20 21:52:49,158 WARN L170 areAnnotationChecker]: L6774-1 has no Hoare annotation [2022-02-20 21:52:49,158 WARN L170 areAnnotationChecker]: L6774-1 has no Hoare annotation [2022-02-20 21:52:49,158 WARN L170 areAnnotationChecker]: L6681-1 has no Hoare annotation [2022-02-20 21:52:49,158 WARN L170 areAnnotationChecker]: L6685-1 has no Hoare annotation [2022-02-20 21:52:49,158 WARN L170 areAnnotationChecker]: L6623-1 has no Hoare annotation [2022-02-20 21:52:49,158 WARN L170 areAnnotationChecker]: L6702-1 has no Hoare annotation [2022-02-20 21:52:49,158 WARN L170 areAnnotationChecker]: L6589-1 has no Hoare annotation [2022-02-20 21:52:49,158 WARN L170 areAnnotationChecker]: L6608-1 has no Hoare annotation [2022-02-20 21:52:49,161 WARN L170 areAnnotationChecker]: L6690 has no Hoare annotation [2022-02-20 21:52:49,162 WARN L170 areAnnotationChecker]: L6705-2 has no Hoare annotation [2022-02-20 21:52:49,162 WARN L170 areAnnotationChecker]: L6835 has no Hoare annotation [2022-02-20 21:52:49,162 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 21:52:49,162 WARN L170 areAnnotationChecker]: spi_message_initEXIT has no Hoare annotation [2022-02-20 21:52:49,162 WARN L170 areAnnotationChecker]: spi_message_initEXIT has no Hoare annotation [2022-02-20 21:52:49,162 WARN L170 areAnnotationChecker]: spi_message_initEXIT has no Hoare annotation [2022-02-20 21:52:49,162 WARN L170 areAnnotationChecker]: spi_message_initEXIT has no Hoare annotation [2022-02-20 21:52:49,162 WARN L170 areAnnotationChecker]: spi_message_initEXIT has no Hoare annotation [2022-02-20 21:52:49,162 WARN L170 areAnnotationChecker]: spi_message_initEXIT has no Hoare annotation [2022-02-20 21:52:49,163 WARN L170 areAnnotationChecker]: kzallocFINAL has no Hoare annotation [2022-02-20 21:52:49,163 WARN L170 areAnnotationChecker]: L6529 has no Hoare annotation [2022-02-20 21:52:49,163 WARN L170 areAnnotationChecker]: L6529 has no Hoare annotation [2022-02-20 21:52:49,164 WARN L170 areAnnotationChecker]: L7018-2 has no Hoare annotation [2022-02-20 21:52:49,164 WARN L170 areAnnotationChecker]: L7099-1 has no Hoare annotation [2022-02-20 21:52:49,164 WARN L170 areAnnotationChecker]: L6973 has no Hoare annotation [2022-02-20 21:52:49,164 WARN L170 areAnnotationChecker]: L6973 has no Hoare annotation [2022-02-20 21:52:49,164 WARN L170 areAnnotationChecker]: L6562 has no Hoare annotation [2022-02-20 21:52:49,164 WARN L170 areAnnotationChecker]: L6562 has no Hoare annotation [2022-02-20 21:52:49,165 WARN L170 areAnnotationChecker]: L6747 has no Hoare annotation [2022-02-20 21:52:49,165 WARN L170 areAnnotationChecker]: L6749 has no Hoare annotation [2022-02-20 21:52:49,167 WARN L170 areAnnotationChecker]: L6741-1 has no Hoare annotation [2022-02-20 21:52:49,167 WARN L170 areAnnotationChecker]: L6659-1 has no Hoare annotation [2022-02-20 21:52:49,169 WARN L170 areAnnotationChecker]: L6610-1 has no Hoare annotation [2022-02-20 21:52:49,170 WARN L170 areAnnotationChecker]: L7068-1 has no Hoare annotation [2022-02-20 21:52:49,170 WARN L170 areAnnotationChecker]: L7073-1 has no Hoare annotation [2022-02-20 21:52:49,170 WARN L170 areAnnotationChecker]: L7078-1 has no Hoare annotation [2022-02-20 21:52:49,170 WARN L170 areAnnotationChecker]: L7047-1 has no Hoare annotation [2022-02-20 21:52:49,170 WARN L170 areAnnotationChecker]: L6536 has no Hoare annotation [2022-02-20 21:52:49,172 WARN L170 areAnnotationChecker]: L6848 has no Hoare annotation [2022-02-20 21:52:49,172 WARN L170 areAnnotationChecker]: L6848 has no Hoare annotation [2022-02-20 21:52:49,172 WARN L170 areAnnotationChecker]: L6756 has no Hoare annotation [2022-02-20 21:52:49,172 WARN L170 areAnnotationChecker]: L6787-1 has no Hoare annotation [2022-02-20 21:52:49,172 WARN L170 areAnnotationChecker]: L6569-1 has no Hoare annotation [2022-02-20 21:52:49,172 WARN L170 areAnnotationChecker]: L6541-1 has no Hoare annotation [2022-02-20 21:52:49,172 WARN L170 areAnnotationChecker]: L6788-1 has no Hoare annotation [2022-02-20 21:52:49,172 WARN L170 areAnnotationChecker]: L6687-1 has no Hoare annotation [2022-02-20 21:52:49,173 WARN L170 areAnnotationChecker]: L6625-1 has no Hoare annotation [2022-02-20 21:52:49,173 WARN L170 areAnnotationChecker]: L6704-1 has no Hoare annotation [2022-02-20 21:52:49,173 WARN L170 areAnnotationChecker]: L6591-1 has no Hoare annotation [2022-02-20 21:52:49,173 WARN L170 areAnnotationChecker]: L6540-1 has no Hoare annotation [2022-02-20 21:52:49,173 WARN L170 areAnnotationChecker]: L6774-1 has no Hoare annotation [2022-02-20 21:52:49,173 WARN L170 areAnnotationChecker]: L6775-1 has no Hoare annotation [2022-02-20 21:52:49,173 WARN L170 areAnnotationChecker]: L6685-1 has no Hoare annotation [2022-02-20 21:52:49,173 WARN L170 areAnnotationChecker]: L6686-1 has no Hoare annotation [2022-02-20 21:52:49,174 WARN L170 areAnnotationChecker]: L6624-1 has no Hoare annotation [2022-02-20 21:52:49,174 WARN L170 areAnnotationChecker]: L6703-1 has no Hoare annotation [2022-02-20 21:52:49,174 WARN L170 areAnnotationChecker]: L6590-1 has no Hoare annotation [2022-02-20 21:52:49,174 WARN L170 areAnnotationChecker]: L6698 has no Hoare annotation [2022-02-20 21:52:49,175 WARN L170 areAnnotationChecker]: L6690 has no Hoare annotation [2022-02-20 21:52:49,175 WARN L170 areAnnotationChecker]: L6690 has no Hoare annotation [2022-02-20 21:52:49,176 WARN L170 areAnnotationChecker]: L6835 has no Hoare annotation [2022-02-20 21:52:49,176 WARN L170 areAnnotationChecker]: L6835 has no Hoare annotation [2022-02-20 21:52:49,176 WARN L170 areAnnotationChecker]: L6677 has no Hoare annotation [2022-02-20 21:52:49,177 WARN L170 areAnnotationChecker]: L6619 has no Hoare annotation [2022-02-20 21:52:49,179 WARN L170 areAnnotationChecker]: kzallocEXIT has no Hoare annotation [2022-02-20 21:52:49,179 WARN L170 areAnnotationChecker]: kzallocEXIT has no Hoare annotation [2022-02-20 21:52:49,179 WARN L170 areAnnotationChecker]: kzallocEXIT has no Hoare annotation [2022-02-20 21:52:49,179 WARN L170 areAnnotationChecker]: kzallocEXIT has no Hoare annotation [2022-02-20 21:52:49,179 WARN L170 areAnnotationChecker]: L6534-1 has no Hoare annotation [2022-02-20 21:52:49,181 WARN L170 areAnnotationChecker]: L6964-1 has no Hoare annotation [2022-02-20 21:52:49,182 WARN L170 areAnnotationChecker]: L6925-1 has no Hoare annotation [2022-02-20 21:52:49,183 WARN L170 areAnnotationChecker]: L7018-2 has no Hoare annotation [2022-02-20 21:52:49,183 WARN L170 areAnnotationChecker]: L7018-2 has no Hoare annotation [2022-02-20 21:52:49,183 WARN L170 areAnnotationChecker]: L6974 has no Hoare annotation [2022-02-20 21:52:49,183 WARN L170 areAnnotationChecker]: L6974 has no Hoare annotation [2022-02-20 21:52:49,183 WARN L170 areAnnotationChecker]: L7003 has no Hoare annotation [2022-02-20 21:52:49,183 WARN L170 areAnnotationChecker]: L7003 has no Hoare annotation [2022-02-20 21:52:49,183 WARN L170 areAnnotationChecker]: L6567-1 has no Hoare annotation [2022-02-20 21:52:49,185 WARN L170 areAnnotationChecker]: L6665 has no Hoare annotation [2022-02-20 21:52:49,185 WARN L170 areAnnotationChecker]: L7067-2 has no Hoare annotation [2022-02-20 21:52:49,185 WARN L170 areAnnotationChecker]: L7067-2 has no Hoare annotation [2022-02-20 21:52:49,185 WARN L170 areAnnotationChecker]: L7072-1 has no Hoare annotation [2022-02-20 21:52:49,185 WARN L170 areAnnotationChecker]: L7072-1 has no Hoare annotation [2022-02-20 21:52:49,186 WARN L170 areAnnotationChecker]: L6854 has no Hoare annotation [2022-02-20 21:52:49,186 WARN L170 areAnnotationChecker]: L6756 has no Hoare annotation [2022-02-20 21:52:49,186 WARN L170 areAnnotationChecker]: L6756 has no Hoare annotation [2022-02-20 21:52:49,186 WARN L170 areAnnotationChecker]: L6691-1 has no Hoare annotation [2022-02-20 21:52:49,194 WARN L170 areAnnotationChecker]: L6842-1 has no Hoare annotation [2022-02-20 21:52:49,196 WARN L170 areAnnotationChecker]: L6804-1 has no Hoare annotation [2022-02-20 21:52:49,196 WARN L170 areAnnotationChecker]: L6818-1 has no Hoare annotation [2022-02-20 21:52:49,196 WARN L170 areAnnotationChecker]: L7317 has no Hoare annotation [2022-02-20 21:52:49,196 WARN L170 areAnnotationChecker]: L6977 has no Hoare annotation [2022-02-20 21:52:49,196 WARN L170 areAnnotationChecker]: L6977 has no Hoare annotation [2022-02-20 21:52:49,197 WARN L170 areAnnotationChecker]: L7004 has no Hoare annotation [2022-02-20 21:52:49,197 WARN L170 areAnnotationChecker]: L7004 has no Hoare annotation [2022-02-20 21:52:49,197 WARN L170 areAnnotationChecker]: L7041 has no Hoare annotation [2022-02-20 21:52:49,197 WARN L170 areAnnotationChecker]: L7041 has no Hoare annotation [2022-02-20 21:52:49,197 WARN L170 areAnnotationChecker]: L6884-1 has no Hoare annotation [2022-02-20 21:52:49,198 WARN L170 areAnnotationChecker]: L6665 has no Hoare annotation [2022-02-20 21:52:49,198 WARN L170 areAnnotationChecker]: L6665 has no Hoare annotation [2022-02-20 21:52:49,198 WARN L170 areAnnotationChecker]: L7073-1 has no Hoare annotation [2022-02-20 21:52:49,200 WARN L170 areAnnotationChecker]: L7078-1 has no Hoare annotation [2022-02-20 21:52:49,201 WARN L170 areAnnotationChecker]: L6854 has no Hoare annotation [2022-02-20 21:52:49,202 WARN L170 areAnnotationChecker]: L6854 has no Hoare annotation [2022-02-20 21:52:49,202 WARN L170 areAnnotationChecker]: L6756-2 has no Hoare annotation [2022-02-20 21:52:49,202 WARN L170 areAnnotationChecker]: L6589-1 has no Hoare annotation [2022-02-20 21:52:49,202 WARN L170 areAnnotationChecker]: L6806 has no Hoare annotation [2022-02-20 21:52:49,202 WARN L170 areAnnotationChecker]: L6806 has no Hoare annotation [2022-02-20 21:52:49,202 WARN L170 areAnnotationChecker]: L6820 has no Hoare annotation [2022-02-20 21:52:49,202 WARN L170 areAnnotationChecker]: L6820 has no Hoare annotation [2022-02-20 21:52:49,202 WARN L170 areAnnotationChecker]: L7317 has no Hoare annotation [2022-02-20 21:52:49,202 WARN L170 areAnnotationChecker]: L7317 has no Hoare annotation [2022-02-20 21:52:49,203 WARN L170 areAnnotationChecker]: L6978 has no Hoare annotation [2022-02-20 21:52:49,203 WARN L170 areAnnotationChecker]: L6978 has no Hoare annotation [2022-02-20 21:52:49,203 WARN L170 areAnnotationChecker]: L6988 has no Hoare annotation [2022-02-20 21:52:49,203 WARN L170 areAnnotationChecker]: L6988 has no Hoare annotation [2022-02-20 21:52:49,203 WARN L170 areAnnotationChecker]: L7007 has no Hoare annotation [2022-02-20 21:52:49,203 WARN L170 areAnnotationChecker]: L7007 has no Hoare annotation [2022-02-20 21:52:49,203 WARN L170 areAnnotationChecker]: L7042 has no Hoare annotation [2022-02-20 21:52:49,203 WARN L170 areAnnotationChecker]: L7042 has no Hoare annotation [2022-02-20 21:52:49,203 WARN L170 areAnnotationChecker]: L7112 has no Hoare annotation [2022-02-20 21:52:49,204 WARN L170 areAnnotationChecker]: L7112 has no Hoare annotation [2022-02-20 21:52:49,204 WARN L170 areAnnotationChecker]: L6665-2 has no Hoare annotation [2022-02-20 21:52:49,204 WARN L170 areAnnotationChecker]: L6860 has no Hoare annotation [2022-02-20 21:52:49,204 WARN L170 areAnnotationChecker]: L6761 has no Hoare annotation [2022-02-20 21:52:49,204 WARN L170 areAnnotationChecker]: L6761 has no Hoare annotation [2022-02-20 21:52:49,204 WARN L170 areAnnotationChecker]: L6811 has no Hoare annotation [2022-02-20 21:52:49,204 WARN L170 areAnnotationChecker]: L6811 has no Hoare annotation [2022-02-20 21:52:49,205 WARN L170 areAnnotationChecker]: L7319-1 has no Hoare annotation [2022-02-20 21:52:49,205 WARN L170 areAnnotationChecker]: L6804-1 has no Hoare annotation [2022-02-20 21:52:49,206 WARN L170 areAnnotationChecker]: L6989 has no Hoare annotation [2022-02-20 21:52:49,206 WARN L170 areAnnotationChecker]: L6989 has no Hoare annotation [2022-02-20 21:52:49,206 WARN L170 areAnnotationChecker]: L6996 has no Hoare annotation [2022-02-20 21:52:49,206 WARN L170 areAnnotationChecker]: L6996 has no Hoare annotation [2022-02-20 21:52:49,207 WARN L170 areAnnotationChecker]: L7008 has no Hoare annotation [2022-02-20 21:52:49,207 WARN L170 areAnnotationChecker]: L7008 has no Hoare annotation [2022-02-20 21:52:49,207 WARN L170 areAnnotationChecker]: L7015 has no Hoare annotation [2022-02-20 21:52:49,207 WARN L170 areAnnotationChecker]: L7015 has no Hoare annotation [2022-02-20 21:52:49,207 WARN L170 areAnnotationChecker]: L7045 has no Hoare annotation [2022-02-20 21:52:49,207 WARN L170 areAnnotationChecker]: L7045 has no Hoare annotation [2022-02-20 21:52:49,207 WARN L170 areAnnotationChecker]: L6972 has no Hoare annotation [2022-02-20 21:52:49,207 WARN L170 areAnnotationChecker]: L6972 has no Hoare annotation [2022-02-20 21:52:49,207 WARN L170 areAnnotationChecker]: L6672 has no Hoare annotation [2022-02-20 21:52:49,208 WARN L170 areAnnotationChecker]: L6672 has no Hoare annotation [2022-02-20 21:52:49,208 WARN L170 areAnnotationChecker]: L6860 has no Hoare annotation [2022-02-20 21:52:49,208 WARN L170 areAnnotationChecker]: L6860 has no Hoare annotation [2022-02-20 21:52:49,208 WARN L170 areAnnotationChecker]: L6761-2 has no Hoare annotation [2022-02-20 21:52:49,208 WARN L170 areAnnotationChecker]: L6818-1 has no Hoare annotation [2022-02-20 21:52:49,210 WARN L170 areAnnotationChecker]: L6476-1 has no Hoare annotation [2022-02-20 21:52:49,211 WARN L170 areAnnotationChecker]: L6976 has no Hoare annotation [2022-02-20 21:52:49,211 WARN L170 areAnnotationChecker]: L6976 has no Hoare annotation [2022-02-20 21:52:49,211 WARN L170 areAnnotationChecker]: L6484 has no Hoare annotation [2022-02-20 21:52:49,211 WARN L170 areAnnotationChecker]: L6484 has no Hoare annotation [2022-02-20 21:52:49,212 WARN L170 areAnnotationChecker]: L7016 has no Hoare annotation [2022-02-20 21:52:49,212 WARN L170 areAnnotationChecker]: L7016 has no Hoare annotation [2022-02-20 21:52:49,212 WARN L170 areAnnotationChecker]: L7034 has no Hoare annotation [2022-02-20 21:52:49,212 WARN L170 areAnnotationChecker]: L7034 has no Hoare annotation [2022-02-20 21:52:49,212 WARN L170 areAnnotationChecker]: L7046 has no Hoare annotation [2022-02-20 21:52:49,212 WARN L170 areAnnotationChecker]: L7046 has no Hoare annotation [2022-02-20 21:52:49,212 WARN L170 areAnnotationChecker]: L7052 has no Hoare annotation [2022-02-20 21:52:49,212 WARN L170 areAnnotationChecker]: L7052 has no Hoare annotation [2022-02-20 21:52:49,214 WARN L170 areAnnotationChecker]: L6769-1 has no Hoare annotation [2022-02-20 21:52:49,214 WARN L170 areAnnotationChecker]: L6829 has no Hoare annotation [2022-02-20 21:52:49,215 WARN L170 areAnnotationChecker]: L7006 has no Hoare annotation [2022-02-20 21:52:49,215 WARN L170 areAnnotationChecker]: L7006 has no Hoare annotation [2022-02-20 21:52:49,215 WARN L170 areAnnotationChecker]: L7047-1 has no Hoare annotation [2022-02-20 21:52:49,217 WARN L170 areAnnotationChecker]: L7053 has no Hoare annotation [2022-02-20 21:52:49,217 WARN L170 areAnnotationChecker]: L7053 has no Hoare annotation [2022-02-20 21:52:49,217 WARN L170 areAnnotationChecker]: L7059 has no Hoare annotation [2022-02-20 21:52:49,217 WARN L170 areAnnotationChecker]: L7059 has no Hoare annotation [2022-02-20 21:52:49,217 WARN L170 areAnnotationChecker]: L6829 has no Hoare annotation [2022-02-20 21:52:49,217 WARN L170 areAnnotationChecker]: L6829 has no Hoare annotation [2022-02-20 21:52:49,218 WARN L170 areAnnotationChecker]: L7018 has no Hoare annotation [2022-02-20 21:52:49,218 WARN L170 areAnnotationChecker]: L6738-1 has no Hoare annotation [2022-02-20 21:52:49,219 WARN L170 areAnnotationChecker]: L7060 has no Hoare annotation [2022-02-20 21:52:49,219 WARN L170 areAnnotationChecker]: L7060 has no Hoare annotation [2022-02-20 21:52:49,219 WARN L170 areAnnotationChecker]: L7066 has no Hoare annotation [2022-02-20 21:52:49,219 WARN L170 areAnnotationChecker]: L7066 has no Hoare annotation [2022-02-20 21:52:49,219 WARN L170 areAnnotationChecker]: L7385-1 has no Hoare annotation [2022-02-20 21:52:49,220 WARN L170 areAnnotationChecker]: L7018 has no Hoare annotation [2022-02-20 21:52:49,220 WARN L170 areAnnotationChecker]: L7018 has no Hoare annotation [2022-02-20 21:52:49,220 WARN L170 areAnnotationChecker]: L6657-1 has no Hoare annotation [2022-02-20 21:52:49,222 WARN L170 areAnnotationChecker]: L7067 has no Hoare annotation [2022-02-20 21:52:49,222 WARN L170 areAnnotationChecker]: L7067 has no Hoare annotation [2022-02-20 21:52:49,222 WARN L170 areAnnotationChecker]: L7083 has no Hoare annotation [2022-02-20 21:52:49,222 WARN L170 areAnnotationChecker]: L7083 has no Hoare annotation [2022-02-20 21:52:49,222 WARN L170 areAnnotationChecker]: L6916-1 has no Hoare annotation [2022-02-20 21:52:49,223 WARN L170 areAnnotationChecker]: L7068-1 has no Hoare annotation [2022-02-20 21:52:49,224 WARN L170 areAnnotationChecker]: L7084 has no Hoare annotation [2022-02-20 21:52:49,224 WARN L170 areAnnotationChecker]: L7084 has no Hoare annotation [2022-02-20 21:52:49,225 WARN L170 areAnnotationChecker]: L7091 has no Hoare annotation [2022-02-20 21:52:49,225 WARN L170 areAnnotationChecker]: L7091 has no Hoare annotation [2022-02-20 21:52:49,225 WARN L170 areAnnotationChecker]: L7092 has no Hoare annotation [2022-02-20 21:52:49,225 WARN L170 areAnnotationChecker]: L7092 has no Hoare annotation [2022-02-20 21:52:49,226 WARN L170 areAnnotationChecker]: L7105 has no Hoare annotation [2022-02-20 21:52:49,226 WARN L170 areAnnotationChecker]: L7105 has no Hoare annotation [2022-02-20 21:52:49,226 WARN L170 areAnnotationChecker]: L7093-1 has no Hoare annotation [2022-02-20 21:52:49,226 WARN L170 areAnnotationChecker]: L7044 has no Hoare annotation [2022-02-20 21:52:49,226 WARN L170 areAnnotationChecker]: L7044 has no Hoare annotation [2022-02-20 21:52:49,226 INFO L163 areAnnotationChecker]: CFG has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 21:52:49,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 09:52:49 BoogieIcfgContainer [2022-02-20 21:52:49,279 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 21:52:49,281 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 21:52:49,281 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 21:52:49,281 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 21:52:49,282 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:52:00" (3/4) ... [2022-02-20 21:52:49,284 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 21:52:49,289 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2022-02-20 21:52:49,289 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-02-20 21:52:49,290 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2022-02-20 21:52:49,290 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure to_spi_device [2022-02-20 21:52:49,290 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure spi_message_add_tail [2022-02-20 21:52:49,290 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 21:52:49,290 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure spi_sync [2022-02-20 21:52:49,290 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-02-20 21:52:49,290 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-02-20 21:52:49,290 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure spi_message_init [2022-02-20 21:52:49,290 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2022-02-20 21:52:49,291 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure wl12xx_spi_reset [2022-02-20 21:52:49,291 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2022-02-20 21:52:49,291 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_release_2 [2022-02-20 21:52:49,291 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-02-20 21:52:49,291 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure wl12xx_spi_init [2022-02-20 21:52:49,292 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv__builtin_expect [2022-02-20 21:52:49,323 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 120 nodes and edges [2022-02-20 21:52:49,325 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2022-02-20 21:52:49,326 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-20 21:52:49,328 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-20 21:52:49,329 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 21:52:49,331 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 21:52:49,430 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 21:52:49,430 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 21:52:49,432 INFO L158 Benchmark]: Toolchain (without parser) took 51961.68ms. Allocated memory was 104.9MB in the beginning and 320.9MB in the end (delta: 216.0MB). Free memory was 77.9MB in the beginning and 211.4MB in the end (delta: -133.5MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2022-02-20 21:52:49,432 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 104.9MB. Free memory was 82.2MB in the beginning and 82.1MB in the end (delta: 47.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 21:52:49,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1386.99ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 77.6MB in the beginning and 74.5MB in the end (delta: 3.1MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2022-02-20 21:52:49,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.01ms. Allocated memory is still 127.9MB. Free memory was 74.5MB in the beginning and 64.6MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 21:52:49,433 INFO L158 Benchmark]: Boogie Preprocessor took 124.86ms. Allocated memory is still 127.9MB. Free memory was 64.1MB in the beginning and 54.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 21:52:49,433 INFO L158 Benchmark]: RCFGBuilder took 1652.47ms. Allocated memory was 127.9MB in the beginning and 190.8MB in the end (delta: 62.9MB). Free memory was 54.2MB in the beginning and 80.4MB in the end (delta: -26.2MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2022-02-20 21:52:49,433 INFO L158 Benchmark]: TraceAbstraction took 48512.07ms. Allocated memory was 190.8MB in the beginning and 320.9MB in the end (delta: 130.0MB). Free memory was 80.4MB in the beginning and 228.2MB in the end (delta: -147.8MB). Peak memory consumption was 148.0MB. Max. memory is 16.1GB. [2022-02-20 21:52:49,434 INFO L158 Benchmark]: Witness Printer took 149.99ms. Allocated memory is still 320.9MB. Free memory was 228.2MB in the beginning and 211.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 21:52:49,435 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.58ms. Allocated memory is still 104.9MB. Free memory was 82.2MB in the beginning and 82.1MB in the end (delta: 47.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1386.99ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 77.6MB in the beginning and 74.5MB in the end (delta: 3.1MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.01ms. Allocated memory is still 127.9MB. Free memory was 74.5MB in the beginning and 64.6MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 124.86ms. Allocated memory is still 127.9MB. Free memory was 64.1MB in the beginning and 54.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1652.47ms. Allocated memory was 127.9MB in the beginning and 190.8MB in the end (delta: 62.9MB). Free memory was 54.2MB in the beginning and 80.4MB in the end (delta: -26.2MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. * TraceAbstraction took 48512.07ms. Allocated memory was 190.8MB in the beginning and 320.9MB in the end (delta: 130.0MB). Free memory was 80.4MB in the beginning and 228.2MB in the end (delta: -147.8MB). Peak memory consumption was 148.0MB. Max. memory is 16.1GB. * Witness Printer took 149.99ms. Allocated memory is still 320.9MB. Free memory was 228.2MB in the beginning and 211.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6418]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 323 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 40.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 3135 SdHoareTripleChecker+Valid, 11.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2776 mSDsluCounter, 5330 SdHoareTripleChecker+Invalid, 11.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2734 mSDsCounter, 1387 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1904 IncrementalHoareTripleChecker+Invalid, 3292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1387 mSolverCounterUnsat, 2596 mSDtfsCounter, 1904 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=578occurred in iteration=1, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 6 MinimizatonAttempts, 250 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 143 LocationsWithAnnotation, 653 PreInvPairs, 951 NumberOfFragments, 2608 HoareAnnotationTreeSize, 653 FomulaSimplifications, 9920 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 143 FomulaSimplificationsInter, 15268 FormulaSimplificationTreeSizeReductionInter, 3.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 260 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 254 ConstructedInterpolants, 0 QuantifiedInterpolants, 920 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 48/48 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6921]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 7394]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && INTERF_STATE == 0) && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6802]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6465]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6950]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 7340]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7358]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6719]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 7373]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6794]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6333]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6656]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 7361]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 7344]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6311]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6639]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6421]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6876]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6802]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6596]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6320]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6607]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6930]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6891]: Loop Invariant Derived loop invariant: ((((((ldv_state_variable_0 == 1 && INTERF_STATE == 0) && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6656]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 7377]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6802]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 7369]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6472]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6912]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 7381]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 7390]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 7405]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6338]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6899]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 7384]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6481]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 7398]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6737]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6737]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6950]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6802]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 7387]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 6607]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 - InvariantResult [Line: 7314]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7355]: Loop Invariant Derived loop invariant: (((((INTERF_STATE == 0 && usb_urb == 0) && usb_urb == 0) && usb_dev == 0) && usb_dev == 0) && dev_counter == 0) && SERIAL_STATE == 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 21:52:49,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE