./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-5fdb450-1-144_2a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.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-validator-v0.8/linux-stable-5fdb450-1-144_2a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.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 0f420ae29f1d217fd86475befc2729bf689978fed36c08e1357ee5c24faa0f48 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:06:15,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:06:15,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:06:15,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:06:15,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:06:15,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:06:15,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:06:15,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:06:15,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:06:15,197 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:06:15,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:06:15,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:06:15,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:06:15,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:06:15,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:06:15,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:06:15,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:06:15,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:06:15,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:06:15,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:06:15,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:06:15,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:06:15,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:06:15,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:06:15,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:06:15,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:06:15,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:06:15,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:06:15,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:06:15,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:06:15,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:06:15,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:06:15,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:06:15,231 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:06:15,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:06:15,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:06:15,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:06:15,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:06:15,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:06:15,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:06:15,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:06:15,235 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 22:06:15,268 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:06:15,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:06:15,269 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:06:15,269 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:06:15,270 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:06:15,270 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:06:15,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:06:15,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:06:15,271 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:06:15,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:06:15,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:06:15,272 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:06:15,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:06:15,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:06:15,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:06:15,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:06:15,273 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:06:15,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:06:15,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:06:15,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:06:15,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:06:15,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:06:15,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:06:15,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:06:15,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:06:15,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:06:15,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:06:15,275 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:06:15,276 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:06:15,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:06:15,276 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 -> 0f420ae29f1d217fd86475befc2729bf689978fed36c08e1357ee5c24faa0f48 [2022-02-20 22:06:15,515 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:06:15,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:06:15,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:06:15,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:06:15,538 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:06:15,539 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-5fdb450-1-144_2a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-02-20 22:06:15,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0983b6b8e/13f8ccf695f04791a8c3702b785263f6/FLAGb7267d38a [2022-02-20 22:06:16,340 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:06:16,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-5fdb450-1-144_2a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-02-20 22:06:16,382 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0983b6b8e/13f8ccf695f04791a8c3702b785263f6/FLAGb7267d38a [2022-02-20 22:06:16,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0983b6b8e/13f8ccf695f04791a8c3702b785263f6 [2022-02-20 22:06:16,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:06:16,592 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:06:16,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:06:16,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:06:16,597 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:06:16,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:06:16" (1/1) ... [2022-02-20 22:06:16,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4221052b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:06:16, skipping insertion in model container [2022-02-20 22:06:16,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:06:16" (1/1) ... [2022-02-20 22:06:16,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:06:16,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:06:18,147 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-validator-v0.8/linux-stable-5fdb450-1-144_2a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i[238753,238766] [2022-02-20 22:06:18,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:06:18,224 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:06:18,535 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-validator-v0.8/linux-stable-5fdb450-1-144_2a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i[238753,238766] [2022-02-20 22:06:18,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:06:18,628 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:06:18,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:06:18 WrapperNode [2022-02-20 22:06:18,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:06:18,631 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:06:18,631 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:06:18,631 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:06:18,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:06:18" (1/1) ... [2022-02-20 22:06:18,723 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:06:18" (1/1) ... [2022-02-20 22:06:19,049 INFO L137 Inliner]: procedures = 257, calls = 1800, calls flagged for inlining = 103, calls inlined = 99, statements flattened = 4658 [2022-02-20 22:06:19,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:06:19,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:06:19,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:06:19,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:06:19,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:06:18" (1/1) ... [2022-02-20 22:06:19,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:06:18" (1/1) ... [2022-02-20 22:06:19,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:06:18" (1/1) ... [2022-02-20 22:06:19,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:06:18" (1/1) ... [2022-02-20 22:06:19,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:06:18" (1/1) ... [2022-02-20 22:06:19,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:06:18" (1/1) ... [2022-02-20 22:06:19,326 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:06:18" (1/1) ... [2022-02-20 22:06:19,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:06:19,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:06:19,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:06:19,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:06:19,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:06:18" (1/1) ... [2022-02-20 22:06:19,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:06:19,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:06:19,392 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 22:06:19,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 22:06:19,427 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2022-02-20 22:06:19,427 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2022-02-20 22:06:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 22:06:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 22:06:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:06:19,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:06:19,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 22:06:19,428 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 22:06:19,429 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_delete [2022-02-20 22:06:19,429 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_delete [2022-02-20 22:06:19,429 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_11 [2022-02-20 22:06:19,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_11 [2022-02-20 22:06:19,429 INFO L130 BoogieDeclarations]: Found specification of procedure usb_sg_wait [2022-02-20 22:06:19,429 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_sg_wait [2022-02-20 22:06:19,429 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_usb_bulk_msg [2022-02-20 22:06:19,429 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_usb_bulk_msg [2022-02-20 22:06:19,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-02-20 22:06:19,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-02-20 22:06:19,430 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2022-02-20 22:06:19,430 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2022-02-20 22:06:19,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:06:19,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:06:19,430 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-02-20 22:06:19,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-02-20 22:06:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_workqueue [2022-02-20 22:06:19,431 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_workqueue [2022-02-20 22:06:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_signal_sdio_irq [2022-02-20 22:06:19,431 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_signal_sdio_irq [2022-02-20 22:06:19,431 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-02-20 22:06:19,431 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-02-20 22:06:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:06:19,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:06:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 22:06:19,432 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 22:06:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_49 [2022-02-20 22:06:19,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_49 [2022-02-20 22:06:19,432 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:06:19,433 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:06:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_detect_change [2022-02-20 22:06:19,433 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_detect_change [2022-02-20 22:06:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-02-20 22:06:19,433 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-02-20 22:06:19,433 INFO L130 BoogieDeclarations]: Found specification of procedure usb_sg_cancel [2022-02-20 22:06:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_sg_cancel [2022-02-20 22:06:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-02-20 22:06:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~VOID [2022-02-20 22:06:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure usb_sg_init [2022-02-20 22:06:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_sg_init [2022-02-20 22:06:19,434 INFO L130 BoogieDeclarations]: Found specification of procedure __command_read_data [2022-02-20 22:06:19,434 INFO L138 BoogieDeclarations]: Found implementation of procedure __command_read_data [2022-02-20 22:06:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_26 [2022-02-20 22:06:19,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_26 [2022-02-20 22:06:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:06:19,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_28 [2022-02-20 22:06:19,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_28 [2022-02-20 22:06:19,436 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-02-20 22:06:19,436 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-02-20 22:06:19,437 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unlink_urb [2022-02-20 22:06:19,437 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unlink_urb [2022-02-20 22:06:19,437 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:06:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_12 [2022-02-20 22:06:19,438 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_12 [2022-02-20 22:06:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-02-20 22:06:19,438 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-02-20 22:06:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure irqpoll_out_completed [2022-02-20 22:06:19,438 INFO L138 BoogieDeclarations]: Found implementation of procedure irqpoll_out_completed [2022-02-20 22:06:19,438 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_disconnect [2022-02-20 22:06:19,439 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_disconnect [2022-02-20 22:06:19,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_14 [2022-02-20 22:06:19,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_14 [2022-02-20 22:06:19,439 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_3 [2022-02-20 22:06:19,439 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_3 [2022-02-20 22:06:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:06:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:06:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-02-20 22:06:19,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-02-20 22:06:19,440 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-02-20 22:06:19,440 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-02-20 22:06:19,441 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_enable_sdio_irq [2022-02-20 22:06:19,441 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_enable_sdio_irq [2022-02-20 22:06:19,441 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-02-20 22:06:19,441 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-02-20 22:06:19,441 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-02-20 22:06:19,441 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-02-20 22:06:19,441 INFO L130 BoogieDeclarations]: Found specification of procedure add_offloaded_reg [2022-02-20 22:06:19,442 INFO L138 BoogieDeclarations]: Found implementation of procedure add_offloaded_reg [2022-02-20 22:06:19,442 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2022-02-20 22:06:19,442 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2022-02-20 22:06:19,442 INFO L130 BoogieDeclarations]: Found specification of procedure command_out_completed [2022-02-20 22:06:19,442 INFO L138 BoogieDeclarations]: Found implementation of procedure command_out_completed [2022-02-20 22:06:19,442 INFO L130 BoogieDeclarations]: Found specification of procedure roundup_to_multiple_of_64 [2022-02-20 22:06:19,443 INFO L138 BoogieDeclarations]: Found implementation of procedure roundup_to_multiple_of_64 [2022-02-20 22:06:19,443 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2022-02-20 22:06:19,443 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2022-02-20 22:06:19,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 22:06:19,443 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_cmndwork_thread [2022-02-20 22:06:19,444 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_cmndwork_thread [2022-02-20 22:06:19,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 22:06:19,444 INFO L130 BoogieDeclarations]: Found specification of procedure send_command [2022-02-20 22:06:19,444 INFO L138 BoogieDeclarations]: Found implementation of procedure send_command [2022-02-20 22:06:19,445 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2022-02-20 22:06:19,445 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2022-02-20 22:06:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:06:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure activate_pending_timer_6 [2022-02-20 22:06:19,446 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_pending_timer_6 [2022-02-20 22:06:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-02-20 22:06:19,446 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-02-20 22:06:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 22:06:19,446 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 22:06:19,446 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-02-20 22:06:19,447 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-02-20 22:06:19,447 INFO L130 BoogieDeclarations]: Found specification of procedure send_irqpoll [2022-02-20 22:06:19,447 INFO L138 BoogieDeclarations]: Found implementation of procedure send_irqpoll [2022-02-20 22:06:19,447 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-02-20 22:06:19,447 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-02-20 22:06:19,447 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 22:06:19,448 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 22:06:19,448 INFO L130 BoogieDeclarations]: Found specification of procedure init_completion [2022-02-20 22:06:19,448 INFO L138 BoogieDeclarations]: Found implementation of procedure init_completion [2022-02-20 22:06:19,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:06:19,451 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_response_error [2022-02-20 22:06:19,451 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_response_error [2022-02-20 22:06:19,451 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_out [2022-02-20 22:06:19,451 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_out [2022-02-20 22:06:19,452 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_free_host [2022-02-20 22:06:19,453 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_free_host [2022-02-20 22:06:19,453 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 22:06:19,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 22:06:19,453 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_31 [2022-02-20 22:06:19,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_31 [2022-02-20 22:06:19,458 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-02-20 22:06:19,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-02-20 22:06:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:06:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_timer_6 [2022-02-20 22:06:19,459 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_timer_6 [2022-02-20 22:06:19,459 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_queue_poll_work [2022-02-20 22:06:19,460 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_queue_poll_work [2022-02-20 22:06:19,460 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-02-20 22:06:19,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-02-20 22:06:19,460 INFO L130 BoogieDeclarations]: Found specification of procedure complete [2022-02-20 22:06:19,460 INFO L138 BoogieDeclarations]: Found implementation of procedure complete [2022-02-20 22:06:19,460 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_bulk_in [2022-02-20 22:06:19,460 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_bulk_in [2022-02-20 22:06:19,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:06:19,461 INFO L130 BoogieDeclarations]: Found specification of procedure sg_copy_to_buffer [2022-02-20 22:06:19,461 INFO L138 BoogieDeclarations]: Found implementation of procedure sg_copy_to_buffer [2022-02-20 22:06:19,461 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_6 [2022-02-20 22:06:19,461 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_6 [2022-02-20 22:06:19,461 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put_8 [2022-02-20 22:06:19,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put_8 [2022-02-20 22:06:19,461 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-02-20 22:06:19,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-02-20 22:06:19,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:06:19,462 INFO L130 BoogieDeclarations]: Found specification of procedure __download_offload_pseudocode [2022-02-20 22:06:19,462 INFO L138 BoogieDeclarations]: Found implementation of procedure __download_offload_pseudocode [2022-02-20 22:06:19,462 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 22:06:19,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 22:06:19,462 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_pollwork_thread [2022-02-20 22:06:19,462 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_pollwork_thread [2022-02-20 22:06:19,462 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_InterfaceNumber [2022-02-20 22:06:19,463 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_InterfaceNumber [2022-02-20 22:06:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-02-20 22:06:19,463 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-02-20 22:06:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-02-20 22:06:19,463 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-02-20 22:06:19,463 INFO L130 BoogieDeclarations]: Found specification of procedure __do_poll [2022-02-20 22:06:19,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __do_poll [2022-02-20 22:06:19,464 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_3 [2022-02-20 22:06:19,464 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_3 [2022-02-20 22:06:19,464 INFO L130 BoogieDeclarations]: Found specification of procedure new_system_port_status [2022-02-20 22:06:19,464 INFO L138 BoogieDeclarations]: Found implementation of procedure new_system_port_status [2022-02-20 22:06:19,464 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_request_done [2022-02-20 22:06:19,464 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_request_done [2022-02-20 22:06:19,464 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2022-02-20 22:06:19,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2022-02-20 22:06:19,465 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-02-20 22:06:19,465 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-02-20 22:06:19,465 INFO L130 BoogieDeclarations]: Found specification of procedure __command_write_data [2022-02-20 22:06:19,465 INFO L138 BoogieDeclarations]: Found implementation of procedure __command_write_data [2022-02-20 22:06:19,465 INFO L130 BoogieDeclarations]: Found specification of procedure request_firmware [2022-02-20 22:06:19,465 INFO L138 BoogieDeclarations]: Found implementation of procedure request_firmware [2022-02-20 22:06:19,465 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~TO~VOID [2022-02-20 22:06:19,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~TO~VOID [2022-02-20 22:06:19,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_46 [2022-02-20 22:06:19,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_46 [2022-02-20 22:06:19,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-02-20 22:06:19,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-02-20 22:06:19,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:06:19,466 INFO L130 BoogieDeclarations]: Found specification of procedure usb_string [2022-02-20 22:06:19,466 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_string [2022-02-20 22:06:19,466 INFO L130 BoogieDeclarations]: Found specification of procedure mmc_priv [2022-02-20 22:06:19,467 INFO L138 BoogieDeclarations]: Found implementation of procedure mmc_priv [2022-02-20 22:06:19,467 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-02-20 22:06:19,467 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-02-20 22:06:19,467 INFO L130 BoogieDeclarations]: Found specification of procedure vub300_deadwork_thread [2022-02-20 22:06:19,467 INFO L138 BoogieDeclarations]: Found implementation of procedure vub300_deadwork_thread [2022-02-20 22:06:19,467 INFO L130 BoogieDeclarations]: Found specification of procedure check_vub300_port_status [2022-02-20 22:06:19,467 INFO L138 BoogieDeclarations]: Found implementation of procedure check_vub300_port_status [2022-02-20 22:06:19,467 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-02-20 22:06:19,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:06:19,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:06:20,175 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:06:20,180 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:06:21,419 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:06:25,544 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:06:25,565 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:06:25,565 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:06:25,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:06:25 BoogieIcfgContainer [2022-02-20 22:06:25,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:06:25,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:06:25,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:06:25,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:06:25,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:06:16" (1/3) ... [2022-02-20 22:06:25,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56111cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:06:25, skipping insertion in model container [2022-02-20 22:06:25,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:06:18" (2/3) ... [2022-02-20 22:06:25,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56111cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:06:25, skipping insertion in model container [2022-02-20 22:06:25,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:06:25" (3/3) ... [2022-02-20 22:06:25,574 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-5fdb450-1-144_2a-drivers--mmc--host--vub300.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-02-20 22:06:25,578 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:06:25,578 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:06:25,637 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:06:25,644 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 22:06:25,644 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:06:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 1659 states, 1189 states have (on average 1.4297729184188395) internal successors, (1700), 1254 states have internal predecessors, (1700), 377 states have call successors, (377), 92 states have call predecessors, (377), 91 states have return successors, (368), 342 states have call predecessors, (368), 368 states have call successors, (368) [2022-02-20 22:06:25,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-20 22:06:25,717 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:06:25,718 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:06:25,718 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:06:25,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:06:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash -764912959, now seen corresponding path program 1 times [2022-02-20 22:06:25,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:06:25,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484486603] [2022-02-20 22:06:25,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:06:25,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:06:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:06:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {1746#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1662#true} is VALID [2022-02-20 22:06:26,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1662#true} {1662#true} #4022#return; {1662#true} is VALID [2022-02-20 22:06:26,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {1662#true} ~cond := #in~cond; {1662#true} is VALID [2022-02-20 22:06:26,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {1662#true} assume 0 == ~cond;assume false; {1663#false} is VALID [2022-02-20 22:06:26,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1663#false} {1662#true} #4024#return; {1663#false} is VALID [2022-02-20 22:06:26,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {1738#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {1662#true} is VALID [2022-02-20 22:06:26,204 INFO L272 TraceCheckUtils]: 1: Hoare triple {1662#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {1746#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:26,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {1746#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1662#true} is VALID [2022-02-20 22:06:26,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,205 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1662#true} {1662#true} #4022#return; {1662#true} is VALID [2022-02-20 22:06:26,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {1662#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1662#true} is VALID [2022-02-20 22:06:26,206 INFO L272 TraceCheckUtils]: 6: Hoare triple {1662#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1662#true} is VALID [2022-02-20 22:06:26,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {1662#true} ~cond := #in~cond; {1662#true} is VALID [2022-02-20 22:06:26,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {1662#true} assume 0 == ~cond;assume false; {1663#false} is VALID [2022-02-20 22:06:26,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,208 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1663#false} {1662#true} #4024#return; {1663#false} is VALID [2022-02-20 22:06:26,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {1663#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1663#false} is VALID [2022-02-20 22:06:26,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,209 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1663#false} {1662#true} #4432#return; {1663#false} is VALID [2022-02-20 22:06:26,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:06:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {1746#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1662#true} is VALID [2022-02-20 22:06:26,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,246 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1662#true} {1662#true} #4022#return; {1662#true} is VALID [2022-02-20 22:06:26,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {1662#true} ~cond := #in~cond; {1662#true} is VALID [2022-02-20 22:06:26,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {1662#true} assume 0 == ~cond;assume false; {1663#false} is VALID [2022-02-20 22:06:26,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1663#false} {1662#true} #4024#return; {1663#false} is VALID [2022-02-20 22:06:26,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {1738#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {1662#true} is VALID [2022-02-20 22:06:26,260 INFO L272 TraceCheckUtils]: 1: Hoare triple {1662#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {1746#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:26,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {1746#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1662#true} is VALID [2022-02-20 22:06:26,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,261 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1662#true} {1662#true} #4022#return; {1662#true} is VALID [2022-02-20 22:06:26,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {1662#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1662#true} is VALID [2022-02-20 22:06:26,262 INFO L272 TraceCheckUtils]: 6: Hoare triple {1662#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1662#true} is VALID [2022-02-20 22:06:26,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {1662#true} ~cond := #in~cond; {1662#true} is VALID [2022-02-20 22:06:26,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {1662#true} assume 0 == ~cond;assume false; {1663#false} is VALID [2022-02-20 22:06:26,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1663#false} {1662#true} #4024#return; {1663#false} is VALID [2022-02-20 22:06:26,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {1663#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1663#false} is VALID [2022-02-20 22:06:26,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,263 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1663#false} {1663#false} #4434#return; {1663#false} is VALID [2022-02-20 22:06:26,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:06:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {1746#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1662#true} is VALID [2022-02-20 22:06:26,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1662#true} {1662#true} #4022#return; {1662#true} is VALID [2022-02-20 22:06:26,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {1662#true} ~cond := #in~cond; {1662#true} is VALID [2022-02-20 22:06:26,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {1662#true} assume 0 == ~cond;assume false; {1663#false} is VALID [2022-02-20 22:06:26,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1663#false} {1662#true} #4024#return; {1663#false} is VALID [2022-02-20 22:06:26,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {1738#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {1662#true} is VALID [2022-02-20 22:06:26,309 INFO L272 TraceCheckUtils]: 1: Hoare triple {1662#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {1746#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:26,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {1746#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1662#true} is VALID [2022-02-20 22:06:26,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,310 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1662#true} {1662#true} #4022#return; {1662#true} is VALID [2022-02-20 22:06:26,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {1662#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1662#true} is VALID [2022-02-20 22:06:26,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {1662#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1662#true} is VALID [2022-02-20 22:06:26,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {1662#true} ~cond := #in~cond; {1662#true} is VALID [2022-02-20 22:06:26,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {1662#true} assume 0 == ~cond;assume false; {1663#false} is VALID [2022-02-20 22:06:26,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1663#false} {1662#true} #4024#return; {1663#false} is VALID [2022-02-20 22:06:26,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {1663#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1663#false} is VALID [2022-02-20 22:06:26,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,312 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1663#false} {1663#false} #4436#return; {1663#false} is VALID [2022-02-20 22:06:26,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 22:06:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {1746#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1662#true} is VALID [2022-02-20 22:06:26,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1662#true} {1662#true} #4022#return; {1662#true} is VALID [2022-02-20 22:06:26,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {1662#true} ~cond := #in~cond; {1662#true} is VALID [2022-02-20 22:06:26,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {1662#true} assume 0 == ~cond;assume false; {1663#false} is VALID [2022-02-20 22:06:26,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1663#false} {1662#true} #4024#return; {1663#false} is VALID [2022-02-20 22:06:26,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {1738#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {1662#true} is VALID [2022-02-20 22:06:26,355 INFO L272 TraceCheckUtils]: 1: Hoare triple {1662#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {1746#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:26,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {1746#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1662#true} is VALID [2022-02-20 22:06:26,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,356 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1662#true} {1662#true} #4022#return; {1662#true} is VALID [2022-02-20 22:06:26,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {1662#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1662#true} is VALID [2022-02-20 22:06:26,356 INFO L272 TraceCheckUtils]: 6: Hoare triple {1662#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1662#true} is VALID [2022-02-20 22:06:26,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {1662#true} ~cond := #in~cond; {1662#true} is VALID [2022-02-20 22:06:26,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {1662#true} assume 0 == ~cond;assume false; {1663#false} is VALID [2022-02-20 22:06:26,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,357 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1663#false} {1662#true} #4024#return; {1663#false} is VALID [2022-02-20 22:06:26,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {1663#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1663#false} is VALID [2022-02-20 22:06:26,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,358 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1663#false} {1663#false} #4438#return; {1663#false} is VALID [2022-02-20 22:06:26,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 22:06:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {1768#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1048 := 0; {1662#true} is VALID [2022-02-20 22:06:26,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {1662#true} assume !(#t~loopctr1048 % 18446744073709551616 < #amount % 18446744073709551616); {1662#true} is VALID [2022-02-20 22:06:26,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {1662#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1662#true} is VALID [2022-02-20 22:06:26,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1662#true} {1662#true} #4032#return; {1662#true} is VALID [2022-02-20 22:06:26,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {1768#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~6.base, ~tmp~6.offset; {1662#true} is VALID [2022-02-20 22:06:26,397 INFO L272 TraceCheckUtils]: 1: Hoare triple {1662#true} call #t~memset~res119.base, #t~memset~res119.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1768#(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 22:06:26,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {1768#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1048 := 0; {1662#true} is VALID [2022-02-20 22:06:26,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {1662#true} assume !(#t~loopctr1048 % 18446744073709551616 < #amount % 18446744073709551616); {1662#true} is VALID [2022-02-20 22:06:26,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {1662#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1662#true} is VALID [2022-02-20 22:06:26,398 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1662#true} {1662#true} #4032#return; {1662#true} is VALID [2022-02-20 22:06:26,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {1662#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res119.base, #t~memset~res119.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {1662#true} is VALID [2022-02-20 22:06:26,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,398 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1662#true} {1663#false} #4440#return; {1663#false} is VALID [2022-02-20 22:06:26,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-20 22:06:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:26,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {1768#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1048 := 0; {1662#true} is VALID [2022-02-20 22:06:26,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {1662#true} assume !(#t~loopctr1048 % 18446744073709551616 < #amount % 18446744073709551616); {1662#true} is VALID [2022-02-20 22:06:26,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {1662#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1662#true} is VALID [2022-02-20 22:06:26,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1662#true} {1662#true} #4032#return; {1662#true} is VALID [2022-02-20 22:06:26,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {1768#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~6.base, ~tmp~6.offset; {1662#true} is VALID [2022-02-20 22:06:26,436 INFO L272 TraceCheckUtils]: 1: Hoare triple {1662#true} call #t~memset~res119.base, #t~memset~res119.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1768#(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 22:06:26,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {1768#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1048 := 0; {1662#true} is VALID [2022-02-20 22:06:26,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {1662#true} assume !(#t~loopctr1048 % 18446744073709551616 < #amount % 18446744073709551616); {1662#true} is VALID [2022-02-20 22:06:26,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {1662#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1662#true} is VALID [2022-02-20 22:06:26,437 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {1662#true} {1662#true} #4032#return; {1662#true} is VALID [2022-02-20 22:06:26,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {1662#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res119.base, #t~memset~res119.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {1662#true} is VALID [2022-02-20 22:06:26,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,440 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1662#true} {1663#false} #4442#return; {1663#false} is VALID [2022-02-20 22:06:26,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {1662#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(95, 2);call #Ultimate.allocInit(9, 3);call #Ultimate.allocInit(21, 4);call #Ultimate.allocInit(20, 5);call #Ultimate.allocInit(26, 6);call #Ultimate.allocInit(19, 7);call #Ultimate.allocInit(31, 8);call #Ultimate.allocInit(38, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(27, 12);call #Ultimate.allocInit(32, 13);call #Ultimate.allocInit(74, 14);call #Ultimate.allocInit(42, 15);call #Ultimate.allocInit(48, 16);call #Ultimate.allocInit(29, 17);call #Ultimate.allocInit(32, 18);call #Ultimate.allocInit(73, 19);call #Ultimate.allocInit(41, 20);call #Ultimate.allocInit(47, 21);call #Ultimate.allocInit(28, 22);call #Ultimate.allocInit(45, 23);call #Ultimate.allocInit(42, 24);call #Ultimate.allocInit(26, 25);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(10, 27);call #Ultimate.allocInit(5, 28);call write~init~int(46, 28, 0, 1);call write~init~int(98, 28, 1, 1);call write~init~int(105, 28, 2, 1);call write~init~int(110, 28, 3, 1);call write~init~int(0, 28, 4, 1);call #Ultimate.allocInit(32, 29);call #Ultimate.allocInit(16, 30);call #Ultimate.allocInit(31, 31);call #Ultimate.allocInit(17, 32);call #Ultimate.allocInit(45, 33);call #Ultimate.allocInit(7, 34);call write~init~int(118, 34, 0, 1);call write~init~int(117, 34, 1, 1);call write~init~int(98, 34, 2, 1);call write~init~int(51, 34, 3, 1);call write~init~int(48, 34, 4, 1);call write~init~int(48, 34, 5, 1);call write~init~int(0, 34, 6, 1);call #Ultimate.allocInit(18, 35);call #Ultimate.allocInit(268, 36);call #Ultimate.allocInit(23, 37);call #Ultimate.allocInit(23, 38);call #Ultimate.allocInit(30, 39);call #Ultimate.allocInit(37, 40);call #Ultimate.allocInit(39, 41);call #Ultimate.allocInit(39, 42);call #Ultimate.allocInit(36, 43);call #Ultimate.allocInit(31, 44);call #Ultimate.allocInit(19, 45);call #Ultimate.allocInit(19, 46);call #Ultimate.allocInit(9, 47);call #Ultimate.allocInit(8, 48);call #Ultimate.allocInit(8, 49);call #Ultimate.allocInit(37, 50);call #Ultimate.allocInit(37, 51);call #Ultimate.allocInit(38, 52);call #Ultimate.allocInit(34, 53);call #Ultimate.allocInit(55, 54);call #Ultimate.allocInit(6, 55);call write~init~int(76, 55, 0, 1);call write~init~int(65, 55, 1, 1);call write~init~int(82, 55, 2, 1);call write~init~int(71, 55, 3, 1);call write~init~int(69, 55, 4, 1);call write~init~int(0, 55, 5, 1);call #Ultimate.allocInit(6, 56);call write~init~int(83, 56, 0, 1);call write~init~int(77, 56, 1, 1);call write~init~int(65, 56, 2, 1);call write~init~int(76, 56, 3, 1);call write~init~int(76, 56, 4, 1);call write~init~int(0, 56, 5, 1);call #Ultimate.allocInit(55, 57);call #Ultimate.allocInit(54, 58);call #Ultimate.allocInit(5, 59);call write~init~int(73, 59, 0, 1);call write~init~int(82, 59, 1, 1);call write~init~int(81, 59, 2, 1);call write~init~int(115, 59, 3, 1);call write~init~int(0, 59, 4, 1);call #Ultimate.allocInit(5, 60);call write~init~int(80, 60, 0, 1);call write~init~int(79, 60, 1, 1);call write~init~int(76, 60, 2, 1);call write~init~int(76, 60, 3, 1);call write~init~int(0, 60, 4, 1);call #Ultimate.allocInit(6, 61);call write~init~int(52, 61, 0, 1);call write~init~int(45, 61, 1, 1);call write~init~int(98, 61, 2, 1);call write~init~int(105, 61, 3, 1);call write~init~int(116, 61, 4, 1);call write~init~int(0, 61, 5, 1);call #Ultimate.allocInit(6, 62);call write~init~int(49, 62, 0, 1);call write~init~int(45, 62, 1, 1);call write~init~int(98, 62, 2, 1);call write~init~int(105, 62, 3, 1);call write~init~int(116, 62, 4, 1);call write~init~int(0, 62, 5, 1);call #Ultimate.allocInit(22, 63);call #Ultimate.allocInit(5, 64);call write~init~int(119, 64, 0, 1);call write~init~int(105, 64, 1, 1);call write~init~int(116, 64, 2, 1);call write~init~int(104, 64, 3, 1);call write~init~int(0, 64, 4, 1);call #Ultimate.allocInit(29, 65);call #Ultimate.allocInit(20, 66);call #Ultimate.allocInit(20, 67);call #Ultimate.allocInit(80, 68);call #Ultimate.allocInit(83, 69);call #Ultimate.allocInit(61, 70);call #Ultimate.allocInit(7, 71);call write~init~int(118, 71, 0, 1);call write~init~int(117, 71, 1, 1);call write~init~int(98, 71, 2, 1);call write~init~int(51, 71, 3, 1);call write~init~int(48, 71, 4, 1);call write~init~int(48, 71, 5, 1);call write~init~int(0, 71, 6, 1);call #Ultimate.allocInit(61, 72);call #Ultimate.allocInit(9, 73);call #Ultimate.allocInit(9, 74);call #Ultimate.allocInit(45, 75);call #Ultimate.allocInit(9, 76);call #Ultimate.allocInit(9, 77);call #Ultimate.allocInit(45, 78);call #Ultimate.allocInit(9, 79);call #Ultimate.allocInit(9, 80);call #Ultimate.allocInit(45, 81);call #Ultimate.allocInit(7, 82);call write~init~int(118, 82, 0, 1);call write~init~int(117, 82, 1, 1);call write~init~int(98, 82, 2, 1);call write~init~int(51, 82, 3, 1);call write~init~int(48, 82, 4, 1);call write~init~int(48, 82, 5, 1);call write~init~int(0, 82, 6, 1);call #Ultimate.allocInit(38, 83);~ldv_timer_state_5~0 := 0;~ldv_state_variable_8~0 := 0;~ldv_timer_list_5~0.base, ~ldv_timer_list_5~0.offset := 0, 0;~ldv_timer_list_4~0.base, ~ldv_timer_list_4~0.offset := 0, 0;~ldv_work_struct_3_1~0.base, ~ldv_work_struct_3_1~0.offset := 0, 0;~vub300_mmc_ops_group0~0.base, ~vub300_mmc_ops_group0~0.offset := 0, 0;~ldv_work_struct_1_3~0.base, ~ldv_work_struct_1_3~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_5~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_3_2~0 := 0;~ldv_work_3_0~0 := 0;~ldv_work_struct_2_3~0.base, ~ldv_work_struct_2_3~0.offset := 0, 0;~ldv_work_struct_2_0~0.base, ~ldv_work_struct_2_0~0.offset := 0, 0;~ldv_timer_state_6~0 := 0;~ldv_work_struct_2_2~0.base, ~ldv_work_struct_2_2~0.offset := 0, 0;~ldv_timer_state_4~0 := 0;~ref_cnt~0 := 0;~ldv_work_3_3~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_state_variable_7~0 := 0;~ldv_work_struct_3_3~0.base, ~ldv_work_struct_3_3~0.offset := 0, 0;~ldv_work_struct_1_0~0.base, ~ldv_work_struct_1_0~0.offset := 0, 0;~ldv_work_struct_1_1~0.base, ~ldv_work_struct_1_1~0.offset := 0, 0;~ldv_work_1_3~0 := 0;~ldv_work_struct_2_1~0.base, ~ldv_work_struct_2_1~0.offset := 0, 0;~ldv_timer_list_6~0.base, ~ldv_timer_list_6~0.offset := 0, 0;~ldv_work_struct_3_2~0.base, ~ldv_work_struct_3_2~0.offset := 0, 0;~ldv_state_variable_6~0 := 0;~ldv_work_3_1~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_work_2_0~0 := 0;~usb_counter~0 := 0;~ldv_work_struct_3_0~0.base, ~ldv_work_struct_3_0~0.offset := 0, 0;~ldv_work_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_work_struct_1_2~0.base, ~ldv_work_struct_1_2~0.offset := 0, 0;~ldv_work_2_2~0 := 0;~ldv_state_variable_3~0 := 0;~vub300_driver_group1~0.base, ~vub300_driver_group1~0.offset := 0, 0;~ldv_work_1_0~0 := 0;~ldv_work_2_3~0 := 0;~ldv_state_variable_4~0 := 0;~ldv_work_2_1~0 := 0;~limit_speed_to_24_MHz~0 := 0;~pad_input_to_usb_pkt~0 := 0;~disable_offload_processing~0 := 0;~force_1_bit_data_xfers~0 := 0;~force_polling_for_irqs~0 := 0;~firmware_irqpoll_timeout~0 := 1024;~force_max_req_size~0 := 128;~firmware_rom_wait_states~0 := 28;~#vub300_table~0.base, ~#vub300_table~0.offset := 84, 0;call #Ultimate.allocInit(75, 84);call write~init~int(3, ~#vub300_table~0.base, ~#vub300_table~0.offset, 2);call write~init~int(8705, ~#vub300_table~0.base, 2 + ~#vub300_table~0.offset, 2);call write~init~int(300, ~#vub300_table~0.base, 4 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 6 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 8 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 10 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 11 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 12 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 13 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 14 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 15 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 16 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 17 + ~#vub300_table~0.offset, 8);call write~init~int(3, ~#vub300_table~0.base, 25 + ~#vub300_table~0.offset, 2);call write~init~int(1060, ~#vub300_table~0.base, 27 + ~#vub300_table~0.offset, 2);call write~init~int(300, ~#vub300_table~0.base, 29 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 31 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 33 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 35 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 36 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 37 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 38 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 39 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 40 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 41 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 42 + ~#vub300_table~0.offset, 8);call write~init~int(0, ~#vub300_table~0.base, 50 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 52 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 54 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 56 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 58 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 60 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 61 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 62 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 63 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 64 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 65 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 66 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 67 + ~#vub300_table~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~cmndworkqueue~0.base, ~cmndworkqueue~0.offset := 0, 0;~pollworkqueue~0.base, ~pollworkqueue~0.offset := 0, 0;~deadworkqueue~0.base, ~deadworkqueue~0.offset := 0, 0;~#vub300_mmc_ops~0.base, ~#vub300_mmc_ops~0.offset := 85, 0;call #Ultimate.allocInit(120, 85);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 8 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 16 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 24 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_mmc_request.base, #funAddr~vub300_mmc_request.offset, ~#vub300_mmc_ops~0.base, 32 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_mmc_set_ios.base, #funAddr~vub300_mmc_set_ios.offset, ~#vub300_mmc_ops~0.base, 40 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_mmc_get_ro.base, #funAddr~vub300_mmc_get_ro.offset, ~#vub300_mmc_ops~0.base, 48 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 56 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_enable_sdio_irq.base, #funAddr~vub300_enable_sdio_irq.offset, ~#vub300_mmc_ops~0.base, 64 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_init_card.base, #funAddr~vub300_init_card.offset, ~#vub300_mmc_ops~0.base, 72 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 80 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 88 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 96 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 104 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 112 + ~#vub300_mmc_ops~0.offset, 8);~#vub300_driver~0.base, ~#vub300_driver~0.offset := 86, 0;call #Ultimate.allocInit(277, 86);call write~init~$Pointer$(71, 0, ~#vub300_driver~0.base, ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_probe.base, #funAddr~vub300_probe.offset, ~#vub300_driver~0.base, 8 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_disconnect.base, #funAddr~vub300_disconnect.offset, ~#vub300_driver~0.base, 16 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 24 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_suspend.base, #funAddr~vub300_suspend.offset, ~#vub300_driver~0.base, 32 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_resume.base, #funAddr~vub300_resume.offset, ~#vub300_driver~0.base, 40 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 48 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_pre_reset.base, #funAddr~vub300_pre_reset.offset, ~#vub300_driver~0.base, 56 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_post_reset.base, #funAddr~vub300_post_reset.offset, ~#vub300_driver~0.base, 64 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(~#vub300_table~0.base, ~#vub300_table~0.offset, ~#vub300_driver~0.base, 72 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 80 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 84 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 88 + ~#vub300_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 92 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 100 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 108 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 116 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 124 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 132 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 136 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 148 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 156 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 164 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 172 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 180 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 188 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 196 + ~#vub300_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 197 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 205 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 213 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 221 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 229 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 237 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 245 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 253 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 261 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 269 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 273 + ~#vub300_driver~0.offset, 1);call write~init~int(1, ~#vub300_driver~0.base, 274 + ~#vub300_driver~0.offset, 1);call write~init~int(0, ~#vub300_driver~0.base, 275 + ~#vub300_driver~0.offset, 1);call write~init~int(0, ~#vub300_driver~0.base, 276 + ~#vub300_driver~0.offset, 1);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_retval_2~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; {1662#true} is VALID [2022-02-20 22:06:26,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {1662#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret964#1.base, main_#t~ret964#1.offset, main_#t~ret965#1.base, main_#t~ret965#1.offset, main_#t~ret966#1.base, main_#t~ret966#1.offset, main_#t~ret967#1.base, main_#t~ret967#1.offset, main_#t~ret968#1.base, main_#t~ret968#1.offset, main_#t~ret969#1.base, main_#t~ret969#1.offset, main_#t~nondet970#1, main_#t~switch971#1, main_#t~nondet972#1, main_#t~switch973#1, main_#t~ret974#1, main_#t~mem975#1, main_#t~ret976#1, main_#t~ret977#1, main_#t~ret978#1, main_#t~nondet979#1, main_#t~switch980#1, main_#t~mem981#1, main_#t~ret982#1, main_#t~nondet983#1, main_#t~switch984#1, main_#t~ret985#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~48#1.base, main_~tmp~48#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset, main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset, main_~tmp___3~2#1, main_~tmp___4~3#1, main_~tmp___5~2#1, main_~tmp___6~2#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~48#1.base, main_~tmp~48#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset;call main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;havoc main_~tmp___3~2#1;havoc main_~tmp___4~3#1;havoc main_~tmp___5~2#1;havoc main_~tmp___6~2#1; {1662#true} is VALID [2022-02-20 22:06:26,448 INFO L272 TraceCheckUtils]: 2: Hoare triple {1662#true} call main_#t~ret964#1.base, main_#t~ret964#1.offset := ldv_init_zalloc(32); {1738#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:26,448 INFO L290 TraceCheckUtils]: 3: Hoare triple {1738#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {1662#true} is VALID [2022-02-20 22:06:26,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {1662#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {1746#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:26,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {1746#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1662#true} is VALID [2022-02-20 22:06:26,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,450 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1662#true} {1662#true} #4022#return; {1662#true} is VALID [2022-02-20 22:06:26,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {1662#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1662#true} is VALID [2022-02-20 22:06:26,450 INFO L272 TraceCheckUtils]: 9: Hoare triple {1662#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1662#true} is VALID [2022-02-20 22:06:26,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {1662#true} ~cond := #in~cond; {1662#true} is VALID [2022-02-20 22:06:26,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {1662#true} assume 0 == ~cond;assume false; {1663#false} is VALID [2022-02-20 22:06:26,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,451 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1663#false} {1662#true} #4024#return; {1663#false} is VALID [2022-02-20 22:06:26,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {1663#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1663#false} is VALID [2022-02-20 22:06:26,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,452 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1663#false} {1662#true} #4432#return; {1663#false} is VALID [2022-02-20 22:06:26,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {1663#false} main_~tmp~48#1.base, main_~tmp~48#1.offset := main_#t~ret964#1.base, main_#t~ret964#1.offset;havoc main_#t~ret964#1.base, main_#t~ret964#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~48#1.base, main_~tmp~48#1.offset; {1663#false} is VALID [2022-02-20 22:06:26,452 INFO L272 TraceCheckUtils]: 18: Hoare triple {1663#false} call main_#t~ret965#1.base, main_#t~ret965#1.offset := ldv_init_zalloc(1816); {1738#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:26,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {1738#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {1662#true} is VALID [2022-02-20 22:06:26,453 INFO L272 TraceCheckUtils]: 20: Hoare triple {1662#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {1746#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:26,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {1746#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1662#true} is VALID [2022-02-20 22:06:26,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,454 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1662#true} {1662#true} #4022#return; {1662#true} is VALID [2022-02-20 22:06:26,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {1662#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1662#true} is VALID [2022-02-20 22:06:26,454 INFO L272 TraceCheckUtils]: 25: Hoare triple {1662#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1662#true} is VALID [2022-02-20 22:06:26,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {1662#true} ~cond := #in~cond; {1662#true} is VALID [2022-02-20 22:06:26,455 INFO L290 TraceCheckUtils]: 27: Hoare triple {1662#true} assume 0 == ~cond;assume false; {1663#false} is VALID [2022-02-20 22:06:26,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,455 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1663#false} {1662#true} #4024#return; {1663#false} is VALID [2022-02-20 22:06:26,456 INFO L290 TraceCheckUtils]: 30: Hoare triple {1663#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1663#false} is VALID [2022-02-20 22:06:26,456 INFO L290 TraceCheckUtils]: 31: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,456 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1663#false} {1663#false} #4434#return; {1663#false} is VALID [2022-02-20 22:06:26,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {1663#false} main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset := main_#t~ret965#1.base, main_#t~ret965#1.offset;havoc main_#t~ret965#1.base, main_#t~ret965#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset; {1663#false} is VALID [2022-02-20 22:06:26,456 INFO L272 TraceCheckUtils]: 34: Hoare triple {1663#false} call main_#t~ret966#1.base, main_#t~ret966#1.offset := ldv_init_zalloc(16); {1738#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:26,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {1738#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {1662#true} is VALID [2022-02-20 22:06:26,458 INFO L272 TraceCheckUtils]: 36: Hoare triple {1662#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {1746#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:26,458 INFO L290 TraceCheckUtils]: 37: Hoare triple {1746#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1662#true} is VALID [2022-02-20 22:06:26,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,458 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1662#true} {1662#true} #4022#return; {1662#true} is VALID [2022-02-20 22:06:26,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {1662#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1662#true} is VALID [2022-02-20 22:06:26,459 INFO L272 TraceCheckUtils]: 41: Hoare triple {1662#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1662#true} is VALID [2022-02-20 22:06:26,459 INFO L290 TraceCheckUtils]: 42: Hoare triple {1662#true} ~cond := #in~cond; {1662#true} is VALID [2022-02-20 22:06:26,459 INFO L290 TraceCheckUtils]: 43: Hoare triple {1662#true} assume 0 == ~cond;assume false; {1663#false} is VALID [2022-02-20 22:06:26,459 INFO L290 TraceCheckUtils]: 44: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,460 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1663#false} {1662#true} #4024#return; {1663#false} is VALID [2022-02-20 22:06:26,460 INFO L290 TraceCheckUtils]: 46: Hoare triple {1663#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1663#false} is VALID [2022-02-20 22:06:26,460 INFO L290 TraceCheckUtils]: 47: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,460 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {1663#false} {1663#false} #4436#return; {1663#false} is VALID [2022-02-20 22:06:26,460 INFO L290 TraceCheckUtils]: 49: Hoare triple {1663#false} main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset := main_#t~ret966#1.base, main_#t~ret966#1.offset;havoc main_#t~ret966#1.base, main_#t~ret966#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset; {1663#false} is VALID [2022-02-20 22:06:26,461 INFO L272 TraceCheckUtils]: 50: Hoare triple {1663#false} call main_#t~ret967#1.base, main_#t~ret967#1.offset := ldv_init_zalloc(136); {1738#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:26,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {1738#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {1662#true} is VALID [2022-02-20 22:06:26,462 INFO L272 TraceCheckUtils]: 52: Hoare triple {1662#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {1746#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:26,462 INFO L290 TraceCheckUtils]: 53: Hoare triple {1746#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1662#true} is VALID [2022-02-20 22:06:26,462 INFO L290 TraceCheckUtils]: 54: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,462 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {1662#true} {1662#true} #4022#return; {1662#true} is VALID [2022-02-20 22:06:26,463 INFO L290 TraceCheckUtils]: 56: Hoare triple {1662#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {1662#true} is VALID [2022-02-20 22:06:26,463 INFO L272 TraceCheckUtils]: 57: Hoare triple {1662#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {1662#true} is VALID [2022-02-20 22:06:26,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {1662#true} ~cond := #in~cond; {1662#true} is VALID [2022-02-20 22:06:26,463 INFO L290 TraceCheckUtils]: 59: Hoare triple {1662#true} assume 0 == ~cond;assume false; {1663#false} is VALID [2022-02-20 22:06:26,464 INFO L290 TraceCheckUtils]: 60: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,464 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {1663#false} {1662#true} #4024#return; {1663#false} is VALID [2022-02-20 22:06:26,464 INFO L290 TraceCheckUtils]: 62: Hoare triple {1663#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {1663#false} is VALID [2022-02-20 22:06:26,464 INFO L290 TraceCheckUtils]: 63: Hoare triple {1663#false} assume true; {1663#false} is VALID [2022-02-20 22:06:26,464 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {1663#false} {1663#false} #4438#return; {1663#false} is VALID [2022-02-20 22:06:26,465 INFO L290 TraceCheckUtils]: 65: Hoare triple {1663#false} main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset := main_#t~ret967#1.base, main_#t~ret967#1.offset;havoc main_#t~ret967#1.base, main_#t~ret967#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;assume { :begin_inline_ldv_initialize } true; {1663#false} is VALID [2022-02-20 22:06:26,465 INFO L290 TraceCheckUtils]: 66: Hoare triple {1663#false} assume { :end_inline_ldv_initialize } true; {1663#false} is VALID [2022-02-20 22:06:26,465 INFO L272 TraceCheckUtils]: 67: Hoare triple {1663#false} call main_#t~ret968#1.base, main_#t~ret968#1.offset := ldv_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {1768#(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 22:06:26,465 INFO L290 TraceCheckUtils]: 68: Hoare triple {1768#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~6.base, ~tmp~6.offset; {1662#true} is VALID [2022-02-20 22:06:26,467 INFO L272 TraceCheckUtils]: 69: Hoare triple {1662#true} call #t~memset~res119.base, #t~memset~res119.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1768#(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 22:06:26,467 INFO L290 TraceCheckUtils]: 70: Hoare triple {1768#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1048 := 0; {1662#true} is VALID [2022-02-20 22:06:26,467 INFO L290 TraceCheckUtils]: 71: Hoare triple {1662#true} assume !(#t~loopctr1048 % 18446744073709551616 < #amount % 18446744073709551616); {1662#true} is VALID [2022-02-20 22:06:26,467 INFO L290 TraceCheckUtils]: 72: Hoare triple {1662#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1662#true} is VALID [2022-02-20 22:06:26,467 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {1662#true} {1662#true} #4032#return; {1662#true} is VALID [2022-02-20 22:06:26,468 INFO L290 TraceCheckUtils]: 74: Hoare triple {1662#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res119.base, #t~memset~res119.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {1662#true} is VALID [2022-02-20 22:06:26,468 INFO L290 TraceCheckUtils]: 75: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,468 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {1662#true} {1663#false} #4440#return; {1663#false} is VALID [2022-02-20 22:06:26,468 INFO L290 TraceCheckUtils]: 77: Hoare triple {1663#false} havoc main_#t~ret968#1.base, main_#t~ret968#1.offset; {1663#false} is VALID [2022-02-20 22:06:26,468 INFO L272 TraceCheckUtils]: 78: Hoare triple {1663#false} call main_#t~ret969#1.base, main_#t~ret969#1.offset := ldv_memset(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, 0, 4); {1768#(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 22:06:26,469 INFO L290 TraceCheckUtils]: 79: Hoare triple {1768#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~6.base, ~tmp~6.offset; {1662#true} is VALID [2022-02-20 22:06:26,470 INFO L272 TraceCheckUtils]: 80: Hoare triple {1662#true} call #t~memset~res119.base, #t~memset~res119.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {1768#(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 22:06:26,470 INFO L290 TraceCheckUtils]: 81: Hoare triple {1768#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1048 := 0; {1662#true} is VALID [2022-02-20 22:06:26,470 INFO L290 TraceCheckUtils]: 82: Hoare triple {1662#true} assume !(#t~loopctr1048 % 18446744073709551616 < #amount % 18446744073709551616); {1662#true} is VALID [2022-02-20 22:06:26,470 INFO L290 TraceCheckUtils]: 83: Hoare triple {1662#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {1662#true} is VALID [2022-02-20 22:06:26,470 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {1662#true} {1662#true} #4032#return; {1662#true} is VALID [2022-02-20 22:06:26,471 INFO L290 TraceCheckUtils]: 85: Hoare triple {1662#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res119.base, #t~memset~res119.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {1662#true} is VALID [2022-02-20 22:06:26,471 INFO L290 TraceCheckUtils]: 86: Hoare triple {1662#true} assume true; {1662#true} is VALID [2022-02-20 22:06:26,471 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {1662#true} {1663#false} #4442#return; {1663#false} is VALID [2022-02-20 22:06:26,471 INFO L290 TraceCheckUtils]: 88: Hoare triple {1663#false} havoc main_#t~ret969#1.base, main_#t~ret969#1.offset;~ldv_state_variable_6~0 := 1;assume { :begin_inline_work_init_3 } true;~ldv_work_3_0~0 := 0;~ldv_work_3_1~0 := 0;~ldv_work_3_2~0 := 0;~ldv_work_3_3~0 := 0; {1663#false} is VALID [2022-02-20 22:06:26,472 INFO L290 TraceCheckUtils]: 89: Hoare triple {1663#false} assume { :end_inline_work_init_3 } true;~ldv_state_variable_3~0 := 1;~ldv_state_variable_7~0 := 0;assume { :begin_inline_work_init_2 } true;~ldv_work_2_0~0 := 0;~ldv_work_2_1~0 := 0;~ldv_work_2_2~0 := 0;~ldv_work_2_3~0 := 0; {1663#false} is VALID [2022-02-20 22:06:26,472 INFO L290 TraceCheckUtils]: 90: Hoare triple {1663#false} assume { :end_inline_work_init_2 } true;~ldv_state_variable_2~0 := 1;~ldv_state_variable_8~0 := 0;assume { :begin_inline_work_init_1 } true;~ldv_work_1_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_1_2~0 := 0;~ldv_work_1_3~0 := 0; {1663#false} is VALID [2022-02-20 22:06:26,472 INFO L290 TraceCheckUtils]: 91: Hoare triple {1663#false} assume { :end_inline_work_init_1 } true;~ldv_state_variable_1~0 := 1;~ldv_state_variable_4~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_5~0 := 1; {1663#false} is VALID [2022-02-20 22:06:26,472 INFO L290 TraceCheckUtils]: 92: Hoare triple {1663#false} assume -2147483648 <= main_#t~nondet970#1 && main_#t~nondet970#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet970#1;havoc main_#t~nondet970#1;main_#t~switch971#1 := 0 == main_~tmp___3~2#1; {1663#false} is VALID [2022-02-20 22:06:26,472 INFO L290 TraceCheckUtils]: 93: Hoare triple {1663#false} assume !main_#t~switch971#1;main_#t~switch971#1 := main_#t~switch971#1 || 1 == main_~tmp___3~2#1; {1663#false} is VALID [2022-02-20 22:06:26,473 INFO L290 TraceCheckUtils]: 94: Hoare triple {1663#false} assume !main_#t~switch971#1;main_#t~switch971#1 := main_#t~switch971#1 || 2 == main_~tmp___3~2#1; {1663#false} is VALID [2022-02-20 22:06:26,473 INFO L290 TraceCheckUtils]: 95: Hoare triple {1663#false} assume !main_#t~switch971#1;main_#t~switch971#1 := main_#t~switch971#1 || 3 == main_~tmp___3~2#1; {1663#false} is VALID [2022-02-20 22:06:26,473 INFO L290 TraceCheckUtils]: 96: Hoare triple {1663#false} assume !main_#t~switch971#1;main_#t~switch971#1 := main_#t~switch971#1 || 4 == main_~tmp___3~2#1; {1663#false} is VALID [2022-02-20 22:06:26,473 INFO L290 TraceCheckUtils]: 97: Hoare triple {1663#false} assume !main_#t~switch971#1;main_#t~switch971#1 := main_#t~switch971#1 || 5 == main_~tmp___3~2#1; {1663#false} is VALID [2022-02-20 22:06:26,473 INFO L290 TraceCheckUtils]: 98: Hoare triple {1663#false} assume !main_#t~switch971#1;main_#t~switch971#1 := main_#t~switch971#1 || 6 == main_~tmp___3~2#1; {1663#false} is VALID [2022-02-20 22:06:26,474 INFO L290 TraceCheckUtils]: 99: Hoare triple {1663#false} assume !main_#t~switch971#1;main_#t~switch971#1 := main_#t~switch971#1 || 7 == main_~tmp___3~2#1; {1663#false} is VALID [2022-02-20 22:06:26,474 INFO L290 TraceCheckUtils]: 100: Hoare triple {1663#false} assume main_#t~switch971#1; {1663#false} is VALID [2022-02-20 22:06:26,474 INFO L290 TraceCheckUtils]: 101: Hoare triple {1663#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet983#1 && main_#t~nondet983#1 <= 2147483647;main_~tmp___6~2#1 := main_#t~nondet983#1;havoc main_#t~nondet983#1;main_#t~switch984#1 := 0 == main_~tmp___6~2#1; {1663#false} is VALID [2022-02-20 22:06:26,474 INFO L290 TraceCheckUtils]: 102: Hoare triple {1663#false} assume !main_#t~switch984#1;main_#t~switch984#1 := main_#t~switch984#1 || 1 == main_~tmp___6~2#1; {1663#false} is VALID [2022-02-20 22:06:26,474 INFO L290 TraceCheckUtils]: 103: Hoare triple {1663#false} assume main_#t~switch984#1; {1663#false} is VALID [2022-02-20 22:06:26,475 INFO L290 TraceCheckUtils]: 104: Hoare triple {1663#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_vub300_init } true;havoc vub300_init_#res#1;havoc vub300_init_#t~nondet932#1, vub300_init_#t~nondet933#1.base, vub300_init_#t~nondet933#1.offset, vub300_init_#t~nondet934#1, vub300_init_#t~nondet935#1.base, vub300_init_#t~nondet935#1.offset, vub300_init_#t~nondet936#1, vub300_init_#t~nondet937#1.base, vub300_init_#t~nondet937#1.offset, vub300_init_#t~nondet938#1, vub300_init_#t~ret939#1, vub300_init_#t~nondet940#1, vub300_init_~result~3#1, vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset, vub300_init_~__lock_name~0#1.base, vub300_init_~__lock_name~0#1.offset, vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset, vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset, vub300_init_~__lock_name___0~0#1.base, vub300_init_~__lock_name___0~0#1.offset, vub300_init_~tmp___0~20#1.base, vub300_init_~tmp___0~20#1.offset, vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset, vub300_init_~__lock_name___1~0#1.base, vub300_init_~__lock_name___1~0#1.offset, vub300_init_~tmp___1~9#1.base, vub300_init_~tmp___1~9#1.offset;havoc vub300_init_~result~3#1;call vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset := #Ultimate.allocOnStack(8);havoc vub300_init_~__lock_name~0#1.base, vub300_init_~__lock_name~0#1.offset;havoc vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset;call vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset := #Ultimate.allocOnStack(8);havoc vub300_init_~__lock_name___0~0#1.base, vub300_init_~__lock_name___0~0#1.offset;havoc vub300_init_~tmp___0~20#1.base, vub300_init_~tmp___0~20#1.offset;call vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset := #Ultimate.allocOnStack(8);havoc vub300_init_~__lock_name___1~0#1.base, vub300_init_~__lock_name___1~0#1.offset;havoc vub300_init_~tmp___1~9#1.base, vub300_init_~tmp___1~9#1.offset;havoc vub300_init_#t~nondet932#1;vub300_init_~__lock_name~0#1.base, vub300_init_~__lock_name~0#1.offset := 73, 0;havoc vub300_init_#t~nondet933#1.base, vub300_init_#t~nondet933#1.offset;vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset := vub300_init_#t~nondet933#1.base, vub300_init_#t~nondet933#1.offset;~cmndworkqueue~0.base, ~cmndworkqueue~0.offset := vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset; {1663#false} is VALID [2022-02-20 22:06:26,475 INFO L290 TraceCheckUtils]: 105: Hoare triple {1663#false} assume 0 == (~cmndworkqueue~0.base + ~cmndworkqueue~0.offset) % 18446744073709551616;havoc vub300_init_#t~nondet934#1;vub300_init_~result~3#1 := -12; {1663#false} is VALID [2022-02-20 22:06:26,475 INFO L290 TraceCheckUtils]: 106: Hoare triple {1663#false} vub300_init_#res#1 := vub300_init_~result~3#1;call ULTIMATE.dealloc(vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset);havoc vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset;call ULTIMATE.dealloc(vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset);havoc vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset;call ULTIMATE.dealloc(vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset);havoc vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset; {1663#false} is VALID [2022-02-20 22:06:26,475 INFO L290 TraceCheckUtils]: 107: Hoare triple {1663#false} main_#t~ret985#1 := vub300_init_#res#1;assume { :end_inline_vub300_init } true;assume -2147483648 <= main_#t~ret985#1 && main_#t~ret985#1 <= 2147483647;~ldv_retval_3~0 := main_#t~ret985#1;havoc main_#t~ret985#1; {1663#false} is VALID [2022-02-20 22:06:26,476 INFO L290 TraceCheckUtils]: 108: Hoare triple {1663#false} assume !(0 == ~ldv_retval_3~0); {1663#false} is VALID [2022-02-20 22:06:26,476 INFO L290 TraceCheckUtils]: 109: Hoare triple {1663#false} assume 0 != ~ldv_retval_3~0;~ldv_state_variable_0~0 := 2; {1663#false} is VALID [2022-02-20 22:06:26,476 INFO L290 TraceCheckUtils]: 110: Hoare triple {1663#false} assume { :begin_inline_ldv_check_final_state } true; {1663#false} is VALID [2022-02-20 22:06:26,476 INFO L290 TraceCheckUtils]: 111: Hoare triple {1663#false} assume 0 != (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616; {1663#false} is VALID [2022-02-20 22:06:26,476 INFO L272 TraceCheckUtils]: 112: Hoare triple {1663#false} call ldv_error(); {1663#false} is VALID [2022-02-20 22:06:26,477 INFO L290 TraceCheckUtils]: 113: Hoare triple {1663#false} assume !false; {1663#false} is VALID [2022-02-20 22:06:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-02-20 22:06:26,478 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:06:26,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484486603] [2022-02-20 22:06:26,479 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484486603] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:06:26,479 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:06:26,479 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 22:06:26,480 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479278460] [2022-02-20 22:06:26,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:06:26,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 114 [2022-02-20 22:06:26,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:06:26,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.6) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:06:26,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:06:26,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 22:06:26,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:06:26,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 22:06:26,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:06:26,619 INFO L87 Difference]: Start difference. First operand has 1659 states, 1189 states have (on average 1.4297729184188395) internal successors, (1700), 1254 states have internal predecessors, (1700), 377 states have call successors, (377), 92 states have call predecessors, (377), 91 states have return successors, (368), 342 states have call predecessors, (368), 368 states have call successors, (368) Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:06:49,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:06:49,448 INFO L93 Difference]: Finished difference Result 3471 states and 5252 transitions. [2022-02-20 22:06:49,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 22:06:49,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 114 [2022-02-20 22:06:49,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:06:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:06:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5252 transitions. [2022-02-20 22:06:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:06:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5252 transitions. [2022-02-20 22:06:49,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5252 transitions. [2022-02-20 22:06:54,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5252 edges. 5252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:06:54,901 INFO L225 Difference]: With dead ends: 3471 [2022-02-20 22:06:54,901 INFO L226 Difference]: Without dead ends: 1801 [2022-02-20 22:06:54,921 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:06:54,925 INFO L933 BasicCegarLoop]: 2227 mSDtfsCounter, 1177 mSDsluCounter, 2463 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 958 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 4690 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 958 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-02-20 22:06:54,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1207 Valid, 4690 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [958 Valid, 2298 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-02-20 22:06:54,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2022-02-20 22:06:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1643. [2022-02-20 22:06:55,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:06:55,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1801 states. Second operand has 1643 states, 1184 states have (on average 1.3876689189189189) internal successors, (1643), 1238 states have internal predecessors, (1643), 368 states have call successors, (368), 91 states have call predecessors, (368), 90 states have return successors, (363), 337 states have call predecessors, (363), 363 states have call successors, (363) [2022-02-20 22:06:55,095 INFO L74 IsIncluded]: Start isIncluded. First operand 1801 states. Second operand has 1643 states, 1184 states have (on average 1.3876689189189189) internal successors, (1643), 1238 states have internal predecessors, (1643), 368 states have call successors, (368), 91 states have call predecessors, (368), 90 states have return successors, (363), 337 states have call predecessors, (363), 363 states have call successors, (363) [2022-02-20 22:06:55,098 INFO L87 Difference]: Start difference. First operand 1801 states. Second operand has 1643 states, 1184 states have (on average 1.3876689189189189) internal successors, (1643), 1238 states have internal predecessors, (1643), 368 states have call successors, (368), 91 states have call predecessors, (368), 90 states have return successors, (363), 337 states have call predecessors, (363), 363 states have call successors, (363) [2022-02-20 22:06:55,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:06:55,277 INFO L93 Difference]: Finished difference Result 1801 states and 2652 transitions. [2022-02-20 22:06:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2652 transitions. [2022-02-20 22:06:55,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:06:55,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:06:55,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 1643 states, 1184 states have (on average 1.3876689189189189) internal successors, (1643), 1238 states have internal predecessors, (1643), 368 states have call successors, (368), 91 states have call predecessors, (368), 90 states have return successors, (363), 337 states have call predecessors, (363), 363 states have call successors, (363) Second operand 1801 states. [2022-02-20 22:06:55,302 INFO L87 Difference]: Start difference. First operand has 1643 states, 1184 states have (on average 1.3876689189189189) internal successors, (1643), 1238 states have internal predecessors, (1643), 368 states have call successors, (368), 91 states have call predecessors, (368), 90 states have return successors, (363), 337 states have call predecessors, (363), 363 states have call successors, (363) Second operand 1801 states. [2022-02-20 22:06:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:06:55,483 INFO L93 Difference]: Finished difference Result 1801 states and 2652 transitions. [2022-02-20 22:06:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2652 transitions. [2022-02-20 22:06:55,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:06:55,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:06:55,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:06:55,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:06:55,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1643 states, 1184 states have (on average 1.3876689189189189) internal successors, (1643), 1238 states have internal predecessors, (1643), 368 states have call successors, (368), 91 states have call predecessors, (368), 90 states have return successors, (363), 337 states have call predecessors, (363), 363 states have call successors, (363) [2022-02-20 22:06:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 2374 transitions. [2022-02-20 22:06:55,692 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 2374 transitions. Word has length 114 [2022-02-20 22:06:55,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:06:55,692 INFO L470 AbstractCegarLoop]: Abstraction has 1643 states and 2374 transitions. [2022-02-20 22:06:55,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:06:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 2374 transitions. [2022-02-20 22:06:55,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-02-20 22:06:55,698 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:06:55,698 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:06:55,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:06:55,699 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:06:55,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:06:55,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1329818825, now seen corresponding path program 1 times [2022-02-20 22:06:55,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:06:55,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155682897] [2022-02-20 22:06:55,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:06:55,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:06:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:55,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:06:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:55,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:55,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:55,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {12461#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12376#true} is VALID [2022-02-20 22:06:55,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:55,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12376#true} {12376#true} #4022#return; {12376#true} is VALID [2022-02-20 22:06:55,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:55,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2022-02-20 22:06:55,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2022-02-20 22:06:55,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:55,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12376#true} {12376#true} #4024#return; {12376#true} is VALID [2022-02-20 22:06:55,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {12453#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {12376#true} is VALID [2022-02-20 22:06:55,998 INFO L272 TraceCheckUtils]: 1: Hoare triple {12376#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {12461#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:55,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {12461#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12376#true} is VALID [2022-02-20 22:06:55,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:55,999 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12376#true} {12376#true} #4022#return; {12376#true} is VALID [2022-02-20 22:06:56,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {12376#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12376#true} is VALID [2022-02-20 22:06:56,004 INFO L272 TraceCheckUtils]: 6: Hoare triple {12376#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12376#true} is VALID [2022-02-20 22:06:56,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2022-02-20 22:06:56,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2022-02-20 22:06:56,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,009 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12376#true} {12376#true} #4024#return; {12376#true} is VALID [2022-02-20 22:06:56,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {12376#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12376#true} is VALID [2022-02-20 22:06:56,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,010 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {12376#true} {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #4432#return; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:06:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:56,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {12461#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12376#true} is VALID [2022-02-20 22:06:56,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12376#true} {12376#true} #4022#return; {12376#true} is VALID [2022-02-20 22:06:56,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:56,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2022-02-20 22:06:56,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2022-02-20 22:06:56,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12376#true} {12376#true} #4024#return; {12376#true} is VALID [2022-02-20 22:06:56,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {12453#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {12376#true} is VALID [2022-02-20 22:06:56,046 INFO L272 TraceCheckUtils]: 1: Hoare triple {12376#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {12461#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:56,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {12461#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12376#true} is VALID [2022-02-20 22:06:56,049 INFO L290 TraceCheckUtils]: 3: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,049 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12376#true} {12376#true} #4022#return; {12376#true} is VALID [2022-02-20 22:06:56,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {12376#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12376#true} is VALID [2022-02-20 22:06:56,050 INFO L272 TraceCheckUtils]: 6: Hoare triple {12376#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12376#true} is VALID [2022-02-20 22:06:56,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2022-02-20 22:06:56,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2022-02-20 22:06:56,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,051 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12376#true} {12376#true} #4024#return; {12376#true} is VALID [2022-02-20 22:06:56,051 INFO L290 TraceCheckUtils]: 11: Hoare triple {12376#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12376#true} is VALID [2022-02-20 22:06:56,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,052 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {12376#true} {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #4434#return; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:06:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:56,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:56,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {12461#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12376#true} is VALID [2022-02-20 22:06:56,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12376#true} {12376#true} #4022#return; {12376#true} is VALID [2022-02-20 22:06:56,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:56,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2022-02-20 22:06:56,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2022-02-20 22:06:56,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12376#true} {12376#true} #4024#return; {12376#true} is VALID [2022-02-20 22:06:56,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {12453#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {12376#true} is VALID [2022-02-20 22:06:56,095 INFO L272 TraceCheckUtils]: 1: Hoare triple {12376#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {12461#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:56,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {12461#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12376#true} is VALID [2022-02-20 22:06:56,095 INFO L290 TraceCheckUtils]: 3: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,095 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12376#true} {12376#true} #4022#return; {12376#true} is VALID [2022-02-20 22:06:56,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {12376#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12376#true} is VALID [2022-02-20 22:06:56,096 INFO L272 TraceCheckUtils]: 6: Hoare triple {12376#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12376#true} is VALID [2022-02-20 22:06:56,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2022-02-20 22:06:56,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2022-02-20 22:06:56,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,097 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12376#true} {12376#true} #4024#return; {12376#true} is VALID [2022-02-20 22:06:56,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {12376#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12376#true} is VALID [2022-02-20 22:06:56,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,098 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {12376#true} {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #4436#return; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-02-20 22:06:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:56,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:56,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {12461#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12376#true} is VALID [2022-02-20 22:06:56,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,121 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12376#true} {12376#true} #4022#return; {12376#true} is VALID [2022-02-20 22:06:56,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:56,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:56,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2022-02-20 22:06:56,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2022-02-20 22:06:56,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12376#true} {12376#true} #4024#return; {12376#true} is VALID [2022-02-20 22:06:56,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {12453#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {12376#true} is VALID [2022-02-20 22:06:56,129 INFO L272 TraceCheckUtils]: 1: Hoare triple {12376#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {12461#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:56,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {12461#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12376#true} is VALID [2022-02-20 22:06:56,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,129 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12376#true} {12376#true} #4022#return; {12376#true} is VALID [2022-02-20 22:06:56,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {12376#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12376#true} is VALID [2022-02-20 22:06:56,130 INFO L272 TraceCheckUtils]: 6: Hoare triple {12376#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12376#true} is VALID [2022-02-20 22:06:56,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2022-02-20 22:06:56,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2022-02-20 22:06:56,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,130 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12376#true} {12376#true} #4024#return; {12376#true} is VALID [2022-02-20 22:06:56,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {12376#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12376#true} is VALID [2022-02-20 22:06:56,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,131 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {12376#true} {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #4438#return; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 22:06:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:56,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:56,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {12483#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1048 := 0; {12376#true} is VALID [2022-02-20 22:06:56,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {12376#true} assume !(#t~loopctr1048 % 18446744073709551616 < #amount % 18446744073709551616); {12376#true} is VALID [2022-02-20 22:06:56,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {12376#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12376#true} is VALID [2022-02-20 22:06:56,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12376#true} {12376#true} #4032#return; {12376#true} is VALID [2022-02-20 22:06:56,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {12483#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~6.base, ~tmp~6.offset; {12376#true} is VALID [2022-02-20 22:06:56,160 INFO L272 TraceCheckUtils]: 1: Hoare triple {12376#true} call #t~memset~res119.base, #t~memset~res119.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {12483#(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 22:06:56,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {12483#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1048 := 0; {12376#true} is VALID [2022-02-20 22:06:56,161 INFO L290 TraceCheckUtils]: 3: Hoare triple {12376#true} assume !(#t~loopctr1048 % 18446744073709551616 < #amount % 18446744073709551616); {12376#true} is VALID [2022-02-20 22:06:56,161 INFO L290 TraceCheckUtils]: 4: Hoare triple {12376#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12376#true} is VALID [2022-02-20 22:06:56,161 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {12376#true} {12376#true} #4032#return; {12376#true} is VALID [2022-02-20 22:06:56,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {12376#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res119.base, #t~memset~res119.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {12376#true} is VALID [2022-02-20 22:06:56,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,162 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12376#true} {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #4440#return; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-02-20 22:06:56,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:56,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:56,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {12483#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1048 := 0; {12376#true} is VALID [2022-02-20 22:06:56,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {12376#true} assume !(#t~loopctr1048 % 18446744073709551616 < #amount % 18446744073709551616); {12376#true} is VALID [2022-02-20 22:06:56,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {12376#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12376#true} is VALID [2022-02-20 22:06:56,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12376#true} {12376#true} #4032#return; {12376#true} is VALID [2022-02-20 22:06:56,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {12483#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~6.base, ~tmp~6.offset; {12376#true} is VALID [2022-02-20 22:06:56,190 INFO L272 TraceCheckUtils]: 1: Hoare triple {12376#true} call #t~memset~res119.base, #t~memset~res119.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {12483#(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 22:06:56,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {12483#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1048 := 0; {12376#true} is VALID [2022-02-20 22:06:56,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {12376#true} assume !(#t~loopctr1048 % 18446744073709551616 < #amount % 18446744073709551616); {12376#true} is VALID [2022-02-20 22:06:56,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {12376#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12376#true} is VALID [2022-02-20 22:06:56,191 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {12376#true} {12376#true} #4032#return; {12376#true} is VALID [2022-02-20 22:06:56,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {12376#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res119.base, #t~memset~res119.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {12376#true} is VALID [2022-02-20 22:06:56,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,192 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12376#true} {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #4442#return; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {12376#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(95, 2);call #Ultimate.allocInit(9, 3);call #Ultimate.allocInit(21, 4);call #Ultimate.allocInit(20, 5);call #Ultimate.allocInit(26, 6);call #Ultimate.allocInit(19, 7);call #Ultimate.allocInit(31, 8);call #Ultimate.allocInit(38, 9);call #Ultimate.allocInit(30, 10);call #Ultimate.allocInit(43, 11);call #Ultimate.allocInit(27, 12);call #Ultimate.allocInit(32, 13);call #Ultimate.allocInit(74, 14);call #Ultimate.allocInit(42, 15);call #Ultimate.allocInit(48, 16);call #Ultimate.allocInit(29, 17);call #Ultimate.allocInit(32, 18);call #Ultimate.allocInit(73, 19);call #Ultimate.allocInit(41, 20);call #Ultimate.allocInit(47, 21);call #Ultimate.allocInit(28, 22);call #Ultimate.allocInit(45, 23);call #Ultimate.allocInit(42, 24);call #Ultimate.allocInit(26, 25);call #Ultimate.allocInit(13, 26);call #Ultimate.allocInit(10, 27);call #Ultimate.allocInit(5, 28);call write~init~int(46, 28, 0, 1);call write~init~int(98, 28, 1, 1);call write~init~int(105, 28, 2, 1);call write~init~int(110, 28, 3, 1);call write~init~int(0, 28, 4, 1);call #Ultimate.allocInit(32, 29);call #Ultimate.allocInit(16, 30);call #Ultimate.allocInit(31, 31);call #Ultimate.allocInit(17, 32);call #Ultimate.allocInit(45, 33);call #Ultimate.allocInit(7, 34);call write~init~int(118, 34, 0, 1);call write~init~int(117, 34, 1, 1);call write~init~int(98, 34, 2, 1);call write~init~int(51, 34, 3, 1);call write~init~int(48, 34, 4, 1);call write~init~int(48, 34, 5, 1);call write~init~int(0, 34, 6, 1);call #Ultimate.allocInit(18, 35);call #Ultimate.allocInit(268, 36);call #Ultimate.allocInit(23, 37);call #Ultimate.allocInit(23, 38);call #Ultimate.allocInit(30, 39);call #Ultimate.allocInit(37, 40);call #Ultimate.allocInit(39, 41);call #Ultimate.allocInit(39, 42);call #Ultimate.allocInit(36, 43);call #Ultimate.allocInit(31, 44);call #Ultimate.allocInit(19, 45);call #Ultimate.allocInit(19, 46);call #Ultimate.allocInit(9, 47);call #Ultimate.allocInit(8, 48);call #Ultimate.allocInit(8, 49);call #Ultimate.allocInit(37, 50);call #Ultimate.allocInit(37, 51);call #Ultimate.allocInit(38, 52);call #Ultimate.allocInit(34, 53);call #Ultimate.allocInit(55, 54);call #Ultimate.allocInit(6, 55);call write~init~int(76, 55, 0, 1);call write~init~int(65, 55, 1, 1);call write~init~int(82, 55, 2, 1);call write~init~int(71, 55, 3, 1);call write~init~int(69, 55, 4, 1);call write~init~int(0, 55, 5, 1);call #Ultimate.allocInit(6, 56);call write~init~int(83, 56, 0, 1);call write~init~int(77, 56, 1, 1);call write~init~int(65, 56, 2, 1);call write~init~int(76, 56, 3, 1);call write~init~int(76, 56, 4, 1);call write~init~int(0, 56, 5, 1);call #Ultimate.allocInit(55, 57);call #Ultimate.allocInit(54, 58);call #Ultimate.allocInit(5, 59);call write~init~int(73, 59, 0, 1);call write~init~int(82, 59, 1, 1);call write~init~int(81, 59, 2, 1);call write~init~int(115, 59, 3, 1);call write~init~int(0, 59, 4, 1);call #Ultimate.allocInit(5, 60);call write~init~int(80, 60, 0, 1);call write~init~int(79, 60, 1, 1);call write~init~int(76, 60, 2, 1);call write~init~int(76, 60, 3, 1);call write~init~int(0, 60, 4, 1);call #Ultimate.allocInit(6, 61);call write~init~int(52, 61, 0, 1);call write~init~int(45, 61, 1, 1);call write~init~int(98, 61, 2, 1);call write~init~int(105, 61, 3, 1);call write~init~int(116, 61, 4, 1);call write~init~int(0, 61, 5, 1);call #Ultimate.allocInit(6, 62);call write~init~int(49, 62, 0, 1);call write~init~int(45, 62, 1, 1);call write~init~int(98, 62, 2, 1);call write~init~int(105, 62, 3, 1);call write~init~int(116, 62, 4, 1);call write~init~int(0, 62, 5, 1);call #Ultimate.allocInit(22, 63);call #Ultimate.allocInit(5, 64);call write~init~int(119, 64, 0, 1);call write~init~int(105, 64, 1, 1);call write~init~int(116, 64, 2, 1);call write~init~int(104, 64, 3, 1);call write~init~int(0, 64, 4, 1);call #Ultimate.allocInit(29, 65);call #Ultimate.allocInit(20, 66);call #Ultimate.allocInit(20, 67);call #Ultimate.allocInit(80, 68);call #Ultimate.allocInit(83, 69);call #Ultimate.allocInit(61, 70);call #Ultimate.allocInit(7, 71);call write~init~int(118, 71, 0, 1);call write~init~int(117, 71, 1, 1);call write~init~int(98, 71, 2, 1);call write~init~int(51, 71, 3, 1);call write~init~int(48, 71, 4, 1);call write~init~int(48, 71, 5, 1);call write~init~int(0, 71, 6, 1);call #Ultimate.allocInit(61, 72);call #Ultimate.allocInit(9, 73);call #Ultimate.allocInit(9, 74);call #Ultimate.allocInit(45, 75);call #Ultimate.allocInit(9, 76);call #Ultimate.allocInit(9, 77);call #Ultimate.allocInit(45, 78);call #Ultimate.allocInit(9, 79);call #Ultimate.allocInit(9, 80);call #Ultimate.allocInit(45, 81);call #Ultimate.allocInit(7, 82);call write~init~int(118, 82, 0, 1);call write~init~int(117, 82, 1, 1);call write~init~int(98, 82, 2, 1);call write~init~int(51, 82, 3, 1);call write~init~int(48, 82, 4, 1);call write~init~int(48, 82, 5, 1);call write~init~int(0, 82, 6, 1);call #Ultimate.allocInit(38, 83);~ldv_timer_state_5~0 := 0;~ldv_state_variable_8~0 := 0;~ldv_timer_list_5~0.base, ~ldv_timer_list_5~0.offset := 0, 0;~ldv_timer_list_4~0.base, ~ldv_timer_list_4~0.offset := 0, 0;~ldv_work_struct_3_1~0.base, ~ldv_work_struct_3_1~0.offset := 0, 0;~vub300_mmc_ops_group0~0.base, ~vub300_mmc_ops_group0~0.offset := 0, 0;~ldv_work_struct_1_3~0.base, ~ldv_work_struct_1_3~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~ldv_state_variable_5~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_3_2~0 := 0;~ldv_work_3_0~0 := 0;~ldv_work_struct_2_3~0.base, ~ldv_work_struct_2_3~0.offset := 0, 0;~ldv_work_struct_2_0~0.base, ~ldv_work_struct_2_0~0.offset := 0, 0;~ldv_timer_state_6~0 := 0;~ldv_work_struct_2_2~0.base, ~ldv_work_struct_2_2~0.offset := 0, 0;~ldv_timer_state_4~0 := 0;~ref_cnt~0 := 0;~ldv_work_3_3~0 := 0;~ldv_state_variable_1~0 := 0;~ldv_state_variable_7~0 := 0;~ldv_work_struct_3_3~0.base, ~ldv_work_struct_3_3~0.offset := 0, 0;~ldv_work_struct_1_0~0.base, ~ldv_work_struct_1_0~0.offset := 0, 0;~ldv_work_struct_1_1~0.base, ~ldv_work_struct_1_1~0.offset := 0, 0;~ldv_work_1_3~0 := 0;~ldv_work_struct_2_1~0.base, ~ldv_work_struct_2_1~0.offset := 0, 0;~ldv_timer_list_6~0.base, ~ldv_timer_list_6~0.offset := 0, 0;~ldv_work_struct_3_2~0.base, ~ldv_work_struct_3_2~0.offset := 0, 0;~ldv_state_variable_6~0 := 0;~ldv_work_3_1~0 := 0;~ldv_state_variable_2~0 := 0;~ldv_work_2_0~0 := 0;~usb_counter~0 := 0;~ldv_work_struct_3_0~0.base, ~ldv_work_struct_3_0~0.offset := 0, 0;~ldv_work_1_2~0 := 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_work_struct_1_2~0.base, ~ldv_work_struct_1_2~0.offset := 0, 0;~ldv_work_2_2~0 := 0;~ldv_state_variable_3~0 := 0;~vub300_driver_group1~0.base, ~vub300_driver_group1~0.offset := 0, 0;~ldv_work_1_0~0 := 0;~ldv_work_2_3~0 := 0;~ldv_state_variable_4~0 := 0;~ldv_work_2_1~0 := 0;~limit_speed_to_24_MHz~0 := 0;~pad_input_to_usb_pkt~0 := 0;~disable_offload_processing~0 := 0;~force_1_bit_data_xfers~0 := 0;~force_polling_for_irqs~0 := 0;~firmware_irqpoll_timeout~0 := 1024;~force_max_req_size~0 := 128;~firmware_rom_wait_states~0 := 28;~#vub300_table~0.base, ~#vub300_table~0.offset := 84, 0;call #Ultimate.allocInit(75, 84);call write~init~int(3, ~#vub300_table~0.base, ~#vub300_table~0.offset, 2);call write~init~int(8705, ~#vub300_table~0.base, 2 + ~#vub300_table~0.offset, 2);call write~init~int(300, ~#vub300_table~0.base, 4 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 6 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 8 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 10 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 11 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 12 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 13 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 14 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 15 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 16 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 17 + ~#vub300_table~0.offset, 8);call write~init~int(3, ~#vub300_table~0.base, 25 + ~#vub300_table~0.offset, 2);call write~init~int(1060, ~#vub300_table~0.base, 27 + ~#vub300_table~0.offset, 2);call write~init~int(300, ~#vub300_table~0.base, 29 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 31 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 33 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 35 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 36 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 37 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 38 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 39 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 40 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 41 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 42 + ~#vub300_table~0.offset, 8);call write~init~int(0, ~#vub300_table~0.base, 50 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 52 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 54 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 56 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 58 + ~#vub300_table~0.offset, 2);call write~init~int(0, ~#vub300_table~0.base, 60 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 61 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 62 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 63 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 64 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 65 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 66 + ~#vub300_table~0.offset, 1);call write~init~int(0, ~#vub300_table~0.base, 67 + ~#vub300_table~0.offset, 8);~__mod_usb_device_table~0.match_flags := 0;~__mod_usb_device_table~0.idVendor := 0;~__mod_usb_device_table~0.idProduct := 0;~__mod_usb_device_table~0.bcdDevice_lo := 0;~__mod_usb_device_table~0.bcdDevice_hi := 0;~__mod_usb_device_table~0.bDeviceClass := 0;~__mod_usb_device_table~0.bDeviceSubClass := 0;~__mod_usb_device_table~0.bDeviceProtocol := 0;~__mod_usb_device_table~0.bInterfaceClass := 0;~__mod_usb_device_table~0.bInterfaceSubClass := 0;~__mod_usb_device_table~0.bInterfaceProtocol := 0;~__mod_usb_device_table~0.bInterfaceNumber := 0;~__mod_usb_device_table~0.driver_info := 0;~cmndworkqueue~0.base, ~cmndworkqueue~0.offset := 0, 0;~pollworkqueue~0.base, ~pollworkqueue~0.offset := 0, 0;~deadworkqueue~0.base, ~deadworkqueue~0.offset := 0, 0;~#vub300_mmc_ops~0.base, ~#vub300_mmc_ops~0.offset := 85, 0;call #Ultimate.allocInit(120, 85);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 8 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 16 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 24 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_mmc_request.base, #funAddr~vub300_mmc_request.offset, ~#vub300_mmc_ops~0.base, 32 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_mmc_set_ios.base, #funAddr~vub300_mmc_set_ios.offset, ~#vub300_mmc_ops~0.base, 40 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_mmc_get_ro.base, #funAddr~vub300_mmc_get_ro.offset, ~#vub300_mmc_ops~0.base, 48 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 56 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_enable_sdio_irq.base, #funAddr~vub300_enable_sdio_irq.offset, ~#vub300_mmc_ops~0.base, 64 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_init_card.base, #funAddr~vub300_init_card.offset, ~#vub300_mmc_ops~0.base, 72 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 80 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 88 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 96 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 104 + ~#vub300_mmc_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_mmc_ops~0.base, 112 + ~#vub300_mmc_ops~0.offset, 8);~#vub300_driver~0.base, ~#vub300_driver~0.offset := 86, 0;call #Ultimate.allocInit(277, 86);call write~init~$Pointer$(71, 0, ~#vub300_driver~0.base, ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_probe.base, #funAddr~vub300_probe.offset, ~#vub300_driver~0.base, 8 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_disconnect.base, #funAddr~vub300_disconnect.offset, ~#vub300_driver~0.base, 16 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 24 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_suspend.base, #funAddr~vub300_suspend.offset, ~#vub300_driver~0.base, 32 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_resume.base, #funAddr~vub300_resume.offset, ~#vub300_driver~0.base, 40 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 48 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_pre_reset.base, #funAddr~vub300_pre_reset.offset, ~#vub300_driver~0.base, 56 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~vub300_post_reset.base, #funAddr~vub300_post_reset.offset, ~#vub300_driver~0.base, 64 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(~#vub300_table~0.base, ~#vub300_table~0.offset, ~#vub300_driver~0.base, 72 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 80 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 84 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 88 + ~#vub300_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 92 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 100 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 108 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 116 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 124 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 132 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 136 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 148 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 156 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 164 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 172 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 180 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 188 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 196 + ~#vub300_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 197 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 205 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 213 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 221 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 229 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 237 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 245 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 253 + ~#vub300_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#vub300_driver~0.base, 261 + ~#vub300_driver~0.offset, 8);call write~init~int(0, ~#vub300_driver~0.base, 269 + ~#vub300_driver~0.offset, 4);call write~init~int(0, ~#vub300_driver~0.base, 273 + ~#vub300_driver~0.offset, 1);call write~init~int(1, ~#vub300_driver~0.base, 274 + ~#vub300_driver~0.offset, 1);call write~init~int(0, ~#vub300_driver~0.base, 275 + ~#vub300_driver~0.offset, 1);call write~init~int(0, ~#vub300_driver~0.base, 276 + ~#vub300_driver~0.offset, 1);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~ldv_retval_2~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; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {12378#(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~ret964#1.base, main_#t~ret964#1.offset, main_#t~ret965#1.base, main_#t~ret965#1.offset, main_#t~ret966#1.base, main_#t~ret966#1.offset, main_#t~ret967#1.base, main_#t~ret967#1.offset, main_#t~ret968#1.base, main_#t~ret968#1.offset, main_#t~ret969#1.base, main_#t~ret969#1.offset, main_#t~nondet970#1, main_#t~switch971#1, main_#t~nondet972#1, main_#t~switch973#1, main_#t~ret974#1, main_#t~mem975#1, main_#t~ret976#1, main_#t~ret977#1, main_#t~ret978#1, main_#t~nondet979#1, main_#t~switch980#1, main_#t~mem981#1, main_#t~ret982#1, main_#t~nondet983#1, main_#t~switch984#1, main_#t~ret985#1, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~48#1.base, main_~tmp~48#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset, main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset, main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset, main_~tmp___3~2#1, main_~tmp___4~3#1, main_~tmp___5~2#1, main_~tmp___6~2#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~48#1.base, main_~tmp~48#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset;call main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset;havoc main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;havoc main_~tmp___3~2#1;havoc main_~tmp___4~3#1;havoc main_~tmp___5~2#1;havoc main_~tmp___6~2#1; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,204 INFO L272 TraceCheckUtils]: 2: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret964#1.base, main_#t~ret964#1.offset := ldv_init_zalloc(32); {12453#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:56,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {12453#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {12376#true} is VALID [2022-02-20 22:06:56,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {12376#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {12461#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:56,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {12461#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12376#true} is VALID [2022-02-20 22:06:56,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,205 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12376#true} {12376#true} #4022#return; {12376#true} is VALID [2022-02-20 22:06:56,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {12376#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12376#true} is VALID [2022-02-20 22:06:56,206 INFO L272 TraceCheckUtils]: 9: Hoare triple {12376#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12376#true} is VALID [2022-02-20 22:06:56,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2022-02-20 22:06:56,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2022-02-20 22:06:56,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,206 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {12376#true} {12376#true} #4024#return; {12376#true} is VALID [2022-02-20 22:06:56,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {12376#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12376#true} is VALID [2022-02-20 22:06:56,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,207 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {12376#true} {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #4432#return; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp~48#1.base, main_~tmp~48#1.offset := main_#t~ret964#1.base, main_#t~ret964#1.offset;havoc main_#t~ret964#1.base, main_#t~ret964#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~48#1.base, main_~tmp~48#1.offset; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,208 INFO L272 TraceCheckUtils]: 18: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret965#1.base, main_#t~ret965#1.offset := ldv_init_zalloc(1816); {12453#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:56,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {12453#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {12376#true} is VALID [2022-02-20 22:06:56,209 INFO L272 TraceCheckUtils]: 20: Hoare triple {12376#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {12461#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:56,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {12461#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12376#true} is VALID [2022-02-20 22:06:56,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,210 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12376#true} {12376#true} #4022#return; {12376#true} is VALID [2022-02-20 22:06:56,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {12376#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12376#true} is VALID [2022-02-20 22:06:56,210 INFO L272 TraceCheckUtils]: 25: Hoare triple {12376#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12376#true} is VALID [2022-02-20 22:06:56,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2022-02-20 22:06:56,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2022-02-20 22:06:56,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,211 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {12376#true} {12376#true} #4024#return; {12376#true} is VALID [2022-02-20 22:06:56,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {12376#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12376#true} is VALID [2022-02-20 22:06:56,211 INFO L290 TraceCheckUtils]: 31: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,213 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12376#true} {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #4434#return; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset := main_#t~ret965#1.base, main_#t~ret965#1.offset;havoc main_#t~ret965#1.base, main_#t~ret965#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___0~21#1.base, main_~tmp___0~21#1.offset; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,215 INFO L272 TraceCheckUtils]: 34: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret966#1.base, main_#t~ret966#1.offset := ldv_init_zalloc(16); {12453#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:56,215 INFO L290 TraceCheckUtils]: 35: Hoare triple {12453#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {12376#true} is VALID [2022-02-20 22:06:56,217 INFO L272 TraceCheckUtils]: 36: Hoare triple {12376#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {12461#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:56,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {12461#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12376#true} is VALID [2022-02-20 22:06:56,217 INFO L290 TraceCheckUtils]: 38: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,217 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12376#true} {12376#true} #4022#return; {12376#true} is VALID [2022-02-20 22:06:56,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {12376#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12376#true} is VALID [2022-02-20 22:06:56,217 INFO L272 TraceCheckUtils]: 41: Hoare triple {12376#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12376#true} is VALID [2022-02-20 22:06:56,218 INFO L290 TraceCheckUtils]: 42: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2022-02-20 22:06:56,218 INFO L290 TraceCheckUtils]: 43: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2022-02-20 22:06:56,218 INFO L290 TraceCheckUtils]: 44: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,218 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12376#true} {12376#true} #4024#return; {12376#true} is VALID [2022-02-20 22:06:56,218 INFO L290 TraceCheckUtils]: 46: Hoare triple {12376#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12376#true} is VALID [2022-02-20 22:06:56,219 INFO L290 TraceCheckUtils]: 47: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,223 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12376#true} {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #4436#return; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset := main_#t~ret966#1.base, main_#t~ret966#1.offset;havoc main_#t~ret966#1.base, main_#t~ret966#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,225 INFO L272 TraceCheckUtils]: 50: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret967#1.base, main_#t~ret967#1.offset := ldv_init_zalloc(136); {12453#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:56,225 INFO L290 TraceCheckUtils]: 51: Hoare triple {12453#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~5.base, ~tmp~5.offset;call #t~malloc118.base, #t~malloc118.offset := #Ultimate.allocOnHeap(~size); {12376#true} is VALID [2022-02-20 22:06:56,226 INFO L272 TraceCheckUtils]: 52: Hoare triple {12376#true} call #Ultimate.meminit(#t~malloc118.base, #t~malloc118.offset, 1, ~size, ~size); {12461#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:56,226 INFO L290 TraceCheckUtils]: 53: Hoare triple {12461#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {12376#true} is VALID [2022-02-20 22:06:56,226 INFO L290 TraceCheckUtils]: 54: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,226 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12376#true} {12376#true} #4022#return; {12376#true} is VALID [2022-02-20 22:06:56,226 INFO L290 TraceCheckUtils]: 56: Hoare triple {12376#true} ~tmp~5.base, ~tmp~5.offset := #t~malloc118.base, #t~malloc118.offset;~p~2.base, ~p~2.offset := ~tmp~5.base, ~tmp~5.offset; {12376#true} is VALID [2022-02-20 22:06:56,226 INFO L272 TraceCheckUtils]: 57: Hoare triple {12376#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {12376#true} is VALID [2022-02-20 22:06:56,226 INFO L290 TraceCheckUtils]: 58: Hoare triple {12376#true} ~cond := #in~cond; {12376#true} is VALID [2022-02-20 22:06:56,227 INFO L290 TraceCheckUtils]: 59: Hoare triple {12376#true} assume !(0 == ~cond); {12376#true} is VALID [2022-02-20 22:06:56,227 INFO L290 TraceCheckUtils]: 60: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,227 INFO L284 TraceCheckUtils]: 61: Hoare quadruple {12376#true} {12376#true} #4024#return; {12376#true} is VALID [2022-02-20 22:06:56,227 INFO L290 TraceCheckUtils]: 62: Hoare triple {12376#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {12376#true} is VALID [2022-02-20 22:06:56,227 INFO L290 TraceCheckUtils]: 63: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,228 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {12376#true} {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #4438#return; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,228 INFO L290 TraceCheckUtils]: 65: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset := main_#t~ret967#1.base, main_#t~ret967#1.offset;havoc main_#t~ret967#1.base, main_#t~ret967#1.offset;main_~ldvarg2~0#1.base, main_~ldvarg2~0#1.offset := main_~tmp___2~6#1.base, main_~tmp___2~6#1.offset;assume { :begin_inline_ldv_initialize } true; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,229 INFO L290 TraceCheckUtils]: 66: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :end_inline_ldv_initialize } true; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,230 INFO L272 TraceCheckUtils]: 67: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret968#1.base, main_#t~ret968#1.offset := ldv_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {12483#(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 22:06:56,230 INFO L290 TraceCheckUtils]: 68: Hoare triple {12483#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~6.base, ~tmp~6.offset; {12376#true} is VALID [2022-02-20 22:06:56,231 INFO L272 TraceCheckUtils]: 69: Hoare triple {12376#true} call #t~memset~res119.base, #t~memset~res119.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {12483#(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 22:06:56,231 INFO L290 TraceCheckUtils]: 70: Hoare triple {12483#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1048 := 0; {12376#true} is VALID [2022-02-20 22:06:56,231 INFO L290 TraceCheckUtils]: 71: Hoare triple {12376#true} assume !(#t~loopctr1048 % 18446744073709551616 < #amount % 18446744073709551616); {12376#true} is VALID [2022-02-20 22:06:56,231 INFO L290 TraceCheckUtils]: 72: Hoare triple {12376#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12376#true} is VALID [2022-02-20 22:06:56,232 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {12376#true} {12376#true} #4032#return; {12376#true} is VALID [2022-02-20 22:06:56,232 INFO L290 TraceCheckUtils]: 74: Hoare triple {12376#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res119.base, #t~memset~res119.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {12376#true} is VALID [2022-02-20 22:06:56,232 INFO L290 TraceCheckUtils]: 75: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,233 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {12376#true} {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #4440#return; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,233 INFO L290 TraceCheckUtils]: 77: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} havoc main_#t~ret968#1.base, main_#t~ret968#1.offset; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,234 INFO L272 TraceCheckUtils]: 78: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret969#1.base, main_#t~ret969#1.offset := ldv_memset(main_~#ldvarg5~0#1.base, main_~#ldvarg5~0#1.offset, 0, 4); {12483#(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 22:06:56,234 INFO L290 TraceCheckUtils]: 79: Hoare triple {12483#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s.base, ~s.offset := #in~s.base, #in~s.offset;~c := #in~c;~n := #in~n;havoc ~tmp~6.base, ~tmp~6.offset; {12376#true} is VALID [2022-02-20 22:06:56,235 INFO L272 TraceCheckUtils]: 80: Hoare triple {12376#true} call #t~memset~res119.base, #t~memset~res119.offset := #Ultimate.C_memset(~s.base, ~s.offset, ~c, ~n); {12483#(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 22:06:56,235 INFO L290 TraceCheckUtils]: 81: Hoare triple {12483#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr1048 := 0; {12376#true} is VALID [2022-02-20 22:06:56,235 INFO L290 TraceCheckUtils]: 82: Hoare triple {12376#true} assume !(#t~loopctr1048 % 18446744073709551616 < #amount % 18446744073709551616); {12376#true} is VALID [2022-02-20 22:06:56,236 INFO L290 TraceCheckUtils]: 83: Hoare triple {12376#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {12376#true} is VALID [2022-02-20 22:06:56,236 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {12376#true} {12376#true} #4032#return; {12376#true} is VALID [2022-02-20 22:06:56,236 INFO L290 TraceCheckUtils]: 85: Hoare triple {12376#true} ~tmp~6.base, ~tmp~6.offset := ~s.base, ~s.offset;havoc #t~memset~res119.base, #t~memset~res119.offset;#res.base, #res.offset := ~tmp~6.base, ~tmp~6.offset; {12376#true} is VALID [2022-02-20 22:06:56,236 INFO L290 TraceCheckUtils]: 86: Hoare triple {12376#true} assume true; {12376#true} is VALID [2022-02-20 22:06:56,237 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {12376#true} {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #4442#return; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,237 INFO L290 TraceCheckUtils]: 88: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} havoc main_#t~ret969#1.base, main_#t~ret969#1.offset;~ldv_state_variable_6~0 := 1;assume { :begin_inline_work_init_3 } true;~ldv_work_3_0~0 := 0;~ldv_work_3_1~0 := 0;~ldv_work_3_2~0 := 0;~ldv_work_3_3~0 := 0; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,238 INFO L290 TraceCheckUtils]: 89: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :end_inline_work_init_3 } true;~ldv_state_variable_3~0 := 1;~ldv_state_variable_7~0 := 0;assume { :begin_inline_work_init_2 } true;~ldv_work_2_0~0 := 0;~ldv_work_2_1~0 := 0;~ldv_work_2_2~0 := 0;~ldv_work_2_3~0 := 0; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,238 INFO L290 TraceCheckUtils]: 90: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :end_inline_work_init_2 } true;~ldv_state_variable_2~0 := 1;~ldv_state_variable_8~0 := 0;assume { :begin_inline_work_init_1 } true;~ldv_work_1_0~0 := 0;~ldv_work_1_1~0 := 0;~ldv_work_1_2~0 := 0;~ldv_work_1_3~0 := 0; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,239 INFO L290 TraceCheckUtils]: 91: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :end_inline_work_init_1 } true;~ldv_state_variable_1~0 := 1;~ldv_state_variable_4~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_5~0 := 1; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,239 INFO L290 TraceCheckUtils]: 92: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume -2147483648 <= main_#t~nondet970#1 && main_#t~nondet970#1 <= 2147483647;main_~tmp___3~2#1 := main_#t~nondet970#1;havoc main_#t~nondet970#1;main_#t~switch971#1 := 0 == main_~tmp___3~2#1; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,240 INFO L290 TraceCheckUtils]: 93: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch971#1;main_#t~switch971#1 := main_#t~switch971#1 || 1 == main_~tmp___3~2#1; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,240 INFO L290 TraceCheckUtils]: 94: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch971#1;main_#t~switch971#1 := main_#t~switch971#1 || 2 == main_~tmp___3~2#1; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,241 INFO L290 TraceCheckUtils]: 95: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch971#1;main_#t~switch971#1 := main_#t~switch971#1 || 3 == main_~tmp___3~2#1; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,241 INFO L290 TraceCheckUtils]: 96: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch971#1;main_#t~switch971#1 := main_#t~switch971#1 || 4 == main_~tmp___3~2#1; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,242 INFO L290 TraceCheckUtils]: 97: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch971#1;main_#t~switch971#1 := main_#t~switch971#1 || 5 == main_~tmp___3~2#1; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,243 INFO L290 TraceCheckUtils]: 98: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch971#1;main_#t~switch971#1 := main_#t~switch971#1 || 6 == main_~tmp___3~2#1; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,243 INFO L290 TraceCheckUtils]: 99: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch971#1;main_#t~switch971#1 := main_#t~switch971#1 || 7 == main_~tmp___3~2#1; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,244 INFO L290 TraceCheckUtils]: 100: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume main_#t~switch971#1; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,244 INFO L290 TraceCheckUtils]: 101: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet983#1 && main_#t~nondet983#1 <= 2147483647;main_~tmp___6~2#1 := main_#t~nondet983#1;havoc main_#t~nondet983#1;main_#t~switch984#1 := 0 == main_~tmp___6~2#1; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,245 INFO L290 TraceCheckUtils]: 102: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch984#1;main_#t~switch984#1 := main_#t~switch984#1 || 1 == main_~tmp___6~2#1; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,245 INFO L290 TraceCheckUtils]: 103: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume main_#t~switch984#1; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,246 INFO L290 TraceCheckUtils]: 104: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_vub300_init } true;havoc vub300_init_#res#1;havoc vub300_init_#t~nondet932#1, vub300_init_#t~nondet933#1.base, vub300_init_#t~nondet933#1.offset, vub300_init_#t~nondet934#1, vub300_init_#t~nondet935#1.base, vub300_init_#t~nondet935#1.offset, vub300_init_#t~nondet936#1, vub300_init_#t~nondet937#1.base, vub300_init_#t~nondet937#1.offset, vub300_init_#t~nondet938#1, vub300_init_#t~ret939#1, vub300_init_#t~nondet940#1, vub300_init_~result~3#1, vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset, vub300_init_~__lock_name~0#1.base, vub300_init_~__lock_name~0#1.offset, vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset, vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset, vub300_init_~__lock_name___0~0#1.base, vub300_init_~__lock_name___0~0#1.offset, vub300_init_~tmp___0~20#1.base, vub300_init_~tmp___0~20#1.offset, vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset, vub300_init_~__lock_name___1~0#1.base, vub300_init_~__lock_name___1~0#1.offset, vub300_init_~tmp___1~9#1.base, vub300_init_~tmp___1~9#1.offset;havoc vub300_init_~result~3#1;call vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset := #Ultimate.allocOnStack(8);havoc vub300_init_~__lock_name~0#1.base, vub300_init_~__lock_name~0#1.offset;havoc vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset;call vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset := #Ultimate.allocOnStack(8);havoc vub300_init_~__lock_name___0~0#1.base, vub300_init_~__lock_name___0~0#1.offset;havoc vub300_init_~tmp___0~20#1.base, vub300_init_~tmp___0~20#1.offset;call vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset := #Ultimate.allocOnStack(8);havoc vub300_init_~__lock_name___1~0#1.base, vub300_init_~__lock_name___1~0#1.offset;havoc vub300_init_~tmp___1~9#1.base, vub300_init_~tmp___1~9#1.offset;havoc vub300_init_#t~nondet932#1;vub300_init_~__lock_name~0#1.base, vub300_init_~__lock_name~0#1.offset := 73, 0;havoc vub300_init_#t~nondet933#1.base, vub300_init_#t~nondet933#1.offset;vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset := vub300_init_#t~nondet933#1.base, vub300_init_#t~nondet933#1.offset;~cmndworkqueue~0.base, ~cmndworkqueue~0.offset := vub300_init_~tmp~42#1.base, vub300_init_~tmp~42#1.offset; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,247 INFO L290 TraceCheckUtils]: 105: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 0 == (~cmndworkqueue~0.base + ~cmndworkqueue~0.offset) % 18446744073709551616;havoc vub300_init_#t~nondet934#1;vub300_init_~result~3#1 := -12; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,247 INFO L290 TraceCheckUtils]: 106: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} vub300_init_#res#1 := vub300_init_~result~3#1;call ULTIMATE.dealloc(vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset);havoc vub300_init_~#__key~2#1.base, vub300_init_~#__key~2#1.offset;call ULTIMATE.dealloc(vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset);havoc vub300_init_~#__key___0~1#1.base, vub300_init_~#__key___0~1#1.offset;call ULTIMATE.dealloc(vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset);havoc vub300_init_~#__key___1~1#1.base, vub300_init_~#__key___1~1#1.offset; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,248 INFO L290 TraceCheckUtils]: 107: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_#t~ret985#1 := vub300_init_#res#1;assume { :end_inline_vub300_init } true;assume -2147483648 <= main_#t~ret985#1 && main_#t~ret985#1 <= 2147483647;~ldv_retval_3~0 := main_#t~ret985#1;havoc main_#t~ret985#1; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,248 INFO L290 TraceCheckUtils]: 108: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !(0 == ~ldv_retval_3~0); {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,248 INFO L290 TraceCheckUtils]: 109: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 0 != ~ldv_retval_3~0;~ldv_state_variable_0~0 := 2; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,249 INFO L290 TraceCheckUtils]: 110: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :begin_inline_ldv_check_final_state } true; {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:56,249 INFO L290 TraceCheckUtils]: 111: Hoare triple {12378#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 0 != (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616; {12377#false} is VALID [2022-02-20 22:06:56,249 INFO L272 TraceCheckUtils]: 112: Hoare triple {12377#false} call ldv_error(); {12377#false} is VALID [2022-02-20 22:06:56,250 INFO L290 TraceCheckUtils]: 113: Hoare triple {12377#false} assume !false; {12377#false} is VALID [2022-02-20 22:06:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2022-02-20 22:06:56,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:06:56,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155682897] [2022-02-20 22:06:56,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155682897] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:06:56,251 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:06:56,251 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:06:56,251 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737700989] [2022-02-20 22:06:56,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:06:56,253 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 114 [2022-02-20 22:06:56,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:06:56,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 22:06:56,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:06:56,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:06:56,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:06:56,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:06:56,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:06:56,331 INFO L87 Difference]: Start difference. First operand 1643 states and 2374 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9)