./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.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-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.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 8f21bcf4203715ff2cf8f1fa847025b0ca29b6eb32fc30a64baf7cbf3cb00ebc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:05:53,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:05:53,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:05:53,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:05:53,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:05:53,040 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:05:53,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:05:53,044 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:05:53,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:05:53,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:05:53,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:05:53,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:05:53,050 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:05:53,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:05:53,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:05:53,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:05:53,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:05:53,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:05:53,058 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:05:53,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:05:53,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:05:53,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:05:53,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:05:53,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:05:53,070 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:05:53,071 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:05:53,071 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:05:53,072 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:05:53,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:05:53,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:05:53,073 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:05:53,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:05:53,075 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:05:53,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:05:53,076 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:05:53,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:05:53,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:05:53,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:05:53,077 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:05:53,078 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:05:53,078 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:05:53,080 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:05:53,103 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:05:53,103 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:05:53,104 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:05:53,104 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:05:53,105 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:05:53,105 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:05:53,105 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:05:53,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:05:53,105 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:05:53,106 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:05:53,106 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:05:53,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:05:53,107 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:05:53,107 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:05:53,107 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:05:53,107 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:05:53,107 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:05:53,108 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:05:53,108 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:05:53,108 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:05:53,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:05:53,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:05:53,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:05:53,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:05:53,109 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:05:53,109 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:05:53,109 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:05:53,110 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:05:53,110 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:05:53,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:05:53,110 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 -> 8f21bcf4203715ff2cf8f1fa847025b0ca29b6eb32fc30a64baf7cbf3cb00ebc [2022-02-20 22:05:53,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:05:53,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:05:53,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:05:53,301 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:05:53,301 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:05:53,302 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-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-02-20 22:05:53,372 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce17022bc/3dea51601fd54fc4943b69168698fda0/FLAGb83b27c0d [2022-02-20 22:05:53,917 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:05:53,918 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-02-20 22:05:53,943 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce17022bc/3dea51601fd54fc4943b69168698fda0/FLAGb83b27c0d [2022-02-20 22:05:54,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce17022bc/3dea51601fd54fc4943b69168698fda0 [2022-02-20 22:05:54,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:05:54,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:05:54,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:05:54,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:05:54,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:05:54,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:05:54" (1/1) ... [2022-02-20 22:05:54,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15565d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:54, skipping insertion in model container [2022-02-20 22:05:54,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:05:54" (1/1) ... [2022-02-20 22:05:54,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:05:54,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:05:55,384 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-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.ko-entry_point_ldv-val-v0.8.cil.out.i[188986,188999] [2022-02-20 22:05:55,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:05:55,448 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:05:55,647 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-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.ko-entry_point_ldv-val-v0.8.cil.out.i[188986,188999] [2022-02-20 22:05:55,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:05:55,712 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:05:55,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:55 WrapperNode [2022-02-20 22:05:55,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:05:55,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:05:55,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:05:55,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:05:55,720 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:05:55" (1/1) ... [2022-02-20 22:05:55,777 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:05:55" (1/1) ... [2022-02-20 22:05:55,908 INFO L137 Inliner]: procedures = 153, calls = 606, calls flagged for inlining = 71, calls inlined = 71, statements flattened = 1853 [2022-02-20 22:05:55,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:05:55,909 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:05:55,909 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:05:55,909 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:05:55,916 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:55" (1/1) ... [2022-02-20 22:05:55,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:55" (1/1) ... [2022-02-20 22:05:55,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:55" (1/1) ... [2022-02-20 22:05:55,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:55" (1/1) ... [2022-02-20 22:05:55,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:55" (1/1) ... [2022-02-20 22:05:56,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:55" (1/1) ... [2022-02-20 22:05:56,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:55" (1/1) ... [2022-02-20 22:05:56,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:05:56,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:05:56,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:05:56,034 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:05:56,035 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:55" (1/1) ... [2022-02-20 22:05:56,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:05:56,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:05:56,059 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:05:56,065 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:05:56,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_11 [2022-02-20 22:05:56,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_11 [2022-02-20 22:05:56,093 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-02-20 22:05:56,093 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-02-20 22:05:56,094 INFO L130 BoogieDeclarations]: Found specification of procedure usbpn_ioctl [2022-02-20 22:05:56,094 INFO L138 BoogieDeclarations]: Found implementation of procedure usbpn_ioctl [2022-02-20 22:05:56,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 22:05:56,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_3 [2022-02-20 22:05:56,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_3 [2022-02-20 22:05:56,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_8 [2022-02-20 22:05:56,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_8 [2022-02-20 22:05:56,094 INFO L130 BoogieDeclarations]: Found specification of procedure usbpn_close [2022-02-20 22:05:56,094 INFO L138 BoogieDeclarations]: Found implementation of procedure usbpn_close [2022-02-20 22:05:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 22:05:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 22:05:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:05:56,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:05:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:05:56,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-02-20 22:05:56,096 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-02-20 22:05:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2022-02-20 22:05:56,096 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2022-02-20 22:05:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-02-20 22:05:56,096 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-02-20 22:05:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-02-20 22:05:56,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-02-20 22:05:56,096 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2022-02-20 22:05:56,096 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2022-02-20 22:05:56,097 INFO L130 BoogieDeclarations]: Found specification of procedure usb_driver_release_interface [2022-02-20 22:05:56,097 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_driver_release_interface [2022-02-20 22:05:56,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 22:05:56,097 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 22:05:56,097 INFO L130 BoogieDeclarations]: Found specification of procedure netif_wake_queue [2022-02-20 22:05:56,097 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_wake_queue [2022-02-20 22:05:56,097 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-02-20 22:05:56,097 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-02-20 22:05:56,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:05:56,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:05:56,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-02-20 22:05:56,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-02-20 22:05:56,098 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2022-02-20 22:05:56,098 INFO L130 BoogieDeclarations]: Found specification of procedure usbpn_disconnect [2022-02-20 22:05:56,098 INFO L138 BoogieDeclarations]: Found implementation of procedure usbpn_disconnect [2022-02-20 22:05:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure usbpn_set_mtu [2022-02-20 22:05:56,099 INFO L138 BoogieDeclarations]: Found implementation of procedure usbpn_set_mtu [2022-02-20 22:05:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure skb_add_rx_frag [2022-02-20 22:05:56,099 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_add_rx_frag [2022-02-20 22:05:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:05:56,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:05:56,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 22:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 22:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure rx_submit [2022-02-20 22:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure rx_submit [2022-02-20 22:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-02-20 22:05:56,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-02-20 22:05:56,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:05:56,101 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:05:56,101 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-02-20 22:05:56,101 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-02-20 22:05:56,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:05:56,102 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-02-20 22:05:56,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-02-20 22:05:56,102 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-02-20 22:05:56,102 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-02-20 22:05:56,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-02-20 22:05:56,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-02-20 22:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:05:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-02-20 22:05:56,127 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 22:05:56,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-02-20 22:05:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:05:56,128 INFO L130 BoogieDeclarations]: Found specification of procedure put_page [2022-02-20 22:05:56,129 INFO L138 BoogieDeclarations]: Found implementation of procedure put_page [2022-02-20 22:05:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2022-02-20 22:05:56,129 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2022-02-20 22:05:56,129 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 22:05:56,129 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 22:05:56,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:05:56,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:05:56,130 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-02-20 22:05:56,130 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-02-20 22:05:56,130 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-02-20 22:05:56,130 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-02-20 22:05:56,130 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-02-20 22:05:56,130 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-02-20 22:05:56,130 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-02-20 22:05:56,131 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-02-20 22:05:56,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-02-20 22:05:56,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-02-20 22:05:56,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:05:56,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 22:05:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:05:56,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:05:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure rx_complete [2022-02-20 22:05:56,132 INFO L138 BoogieDeclarations]: Found implementation of procedure rx_complete [2022-02-20 22:05:56,497 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:05:56,499 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:05:57,091 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:05:58,622 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:05:58,642 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:05:58,642 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:05:58,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:05:58 BoogieIcfgContainer [2022-02-20 22:05:58,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:05:58,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:05:58,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:05:58,648 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:05:58,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:05:54" (1/3) ... [2022-02-20 22:05:58,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66571039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:05:58, skipping insertion in model container [2022-02-20 22:05:58,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:05:55" (2/3) ... [2022-02-20 22:05:58,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66571039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:05:58, skipping insertion in model container [2022-02-20 22:05:58,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:05:58" (3/3) ... [2022-02-20 22:05:58,651 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-47dffc7-1-144_2a-drivers--net--usb--cdc-phonet.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-02-20 22:05:58,657 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:05:58,657 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:05:58,703 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:05:58,708 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:05:58,709 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:05:58,740 INFO L276 IsEmpty]: Start isEmpty. Operand has 606 states, 452 states have (on average 1.3628318584070795) internal successors, (616), 471 states have internal predecessors, (616), 113 states have call successors, (113), 40 states have call predecessors, (113), 39 states have return successors, (107), 105 states have call predecessors, (107), 107 states have call successors, (107) [2022-02-20 22:05:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 22:05:58,747 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:05:58,747 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:05:58,748 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:05:58,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:05:58,751 INFO L85 PathProgramCache]: Analyzing trace with hash -2089212430, now seen corresponding path program 1 times [2022-02-20 22:05:58,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:05:58,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840616737] [2022-02-20 22:05:58,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:05:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:05:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:59,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:05:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:59,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:05:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:59,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {671#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {609#true} is VALID [2022-02-20 22:05:59,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#true} assume true; {609#true} is VALID [2022-02-20 22:05:59,061 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {609#true} {609#true} #1456#return; {609#true} is VALID [2022-02-20 22:05:59,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:05:59,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:59,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {609#true} ~cond := #in~cond; {609#true} is VALID [2022-02-20 22:05:59,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#true} assume 0 == ~cond;assume false; {610#false} is VALID [2022-02-20 22:05:59,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#false} assume true; {610#false} is VALID [2022-02-20 22:05:59,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#false} {609#true} #1458#return; {610#false} is VALID [2022-02-20 22:05:59,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {663#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {609#true} is VALID [2022-02-20 22:05:59,072 INFO L272 TraceCheckUtils]: 1: Hoare triple {609#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {671#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:59,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {671#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {609#true} is VALID [2022-02-20 22:05:59,073 INFO L290 TraceCheckUtils]: 3: Hoare triple {609#true} assume true; {609#true} is VALID [2022-02-20 22:05:59,073 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {609#true} {609#true} #1456#return; {609#true} is VALID [2022-02-20 22:05:59,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {609#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {609#true} is VALID [2022-02-20 22:05:59,073 INFO L272 TraceCheckUtils]: 6: Hoare triple {609#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {609#true} is VALID [2022-02-20 22:05:59,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#true} ~cond := #in~cond; {609#true} is VALID [2022-02-20 22:05:59,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#true} assume 0 == ~cond;assume false; {610#false} is VALID [2022-02-20 22:05:59,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {610#false} assume true; {610#false} is VALID [2022-02-20 22:05:59,074 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {610#false} {609#true} #1458#return; {610#false} is VALID [2022-02-20 22:05:59,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {610#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {610#false} is VALID [2022-02-20 22:05:59,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {610#false} assume true; {610#false} is VALID [2022-02-20 22:05:59,075 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {610#false} {609#true} #1466#return; {610#false} is VALID [2022-02-20 22:05:59,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:05:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:59,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:05:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:59,096 INFO L290 TraceCheckUtils]: 0: Hoare triple {671#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {609#true} is VALID [2022-02-20 22:05:59,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#true} assume true; {609#true} is VALID [2022-02-20 22:05:59,097 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {609#true} {609#true} #1456#return; {609#true} is VALID [2022-02-20 22:05:59,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:05:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:59,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {609#true} ~cond := #in~cond; {609#true} is VALID [2022-02-20 22:05:59,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#true} assume 0 == ~cond;assume false; {610#false} is VALID [2022-02-20 22:05:59,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#false} assume true; {610#false} is VALID [2022-02-20 22:05:59,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#false} {609#true} #1458#return; {610#false} is VALID [2022-02-20 22:05:59,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {663#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {609#true} is VALID [2022-02-20 22:05:59,106 INFO L272 TraceCheckUtils]: 1: Hoare triple {609#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {671#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:59,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {671#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {609#true} is VALID [2022-02-20 22:05:59,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {609#true} assume true; {609#true} is VALID [2022-02-20 22:05:59,107 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {609#true} {609#true} #1456#return; {609#true} is VALID [2022-02-20 22:05:59,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {609#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {609#true} is VALID [2022-02-20 22:05:59,107 INFO L272 TraceCheckUtils]: 6: Hoare triple {609#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {609#true} is VALID [2022-02-20 22:05:59,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#true} ~cond := #in~cond; {609#true} is VALID [2022-02-20 22:05:59,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#true} assume 0 == ~cond;assume false; {610#false} is VALID [2022-02-20 22:05:59,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {610#false} assume true; {610#false} is VALID [2022-02-20 22:05:59,108 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {610#false} {609#true} #1458#return; {610#false} is VALID [2022-02-20 22:05:59,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {610#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {610#false} is VALID [2022-02-20 22:05:59,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {610#false} assume true; {610#false} is VALID [2022-02-20 22:05:59,109 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {610#false} {610#false} #1468#return; {610#false} is VALID [2022-02-20 22:05:59,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:05:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:59,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:05:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:59,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {671#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {609#true} is VALID [2022-02-20 22:05:59,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#true} assume true; {609#true} is VALID [2022-02-20 22:05:59,128 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {609#true} {609#true} #1456#return; {609#true} is VALID [2022-02-20 22:05:59,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:05:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:59,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {609#true} ~cond := #in~cond; {609#true} is VALID [2022-02-20 22:05:59,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#true} assume 0 == ~cond;assume false; {610#false} is VALID [2022-02-20 22:05:59,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#false} assume true; {610#false} is VALID [2022-02-20 22:05:59,136 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#false} {609#true} #1458#return; {610#false} is VALID [2022-02-20 22:05:59,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {663#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {609#true} is VALID [2022-02-20 22:05:59,137 INFO L272 TraceCheckUtils]: 1: Hoare triple {609#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {671#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:59,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {671#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {609#true} is VALID [2022-02-20 22:05:59,138 INFO L290 TraceCheckUtils]: 3: Hoare triple {609#true} assume true; {609#true} is VALID [2022-02-20 22:05:59,138 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {609#true} {609#true} #1456#return; {609#true} is VALID [2022-02-20 22:05:59,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {609#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {609#true} is VALID [2022-02-20 22:05:59,138 INFO L272 TraceCheckUtils]: 6: Hoare triple {609#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {609#true} is VALID [2022-02-20 22:05:59,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#true} ~cond := #in~cond; {609#true} is VALID [2022-02-20 22:05:59,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#true} assume 0 == ~cond;assume false; {610#false} is VALID [2022-02-20 22:05:59,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {610#false} assume true; {610#false} is VALID [2022-02-20 22:05:59,139 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {610#false} {609#true} #1458#return; {610#false} is VALID [2022-02-20 22:05:59,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {610#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {610#false} is VALID [2022-02-20 22:05:59,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {610#false} assume true; {610#false} is VALID [2022-02-20 22:05:59,140 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {610#false} {610#false} #1470#return; {610#false} is VALID [2022-02-20 22:05:59,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:05:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:59,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {686#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {609#true} is VALID [2022-02-20 22:05:59,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {609#true} is VALID [2022-02-20 22:05:59,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {609#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {609#true} is VALID [2022-02-20 22:05:59,156 INFO L290 TraceCheckUtils]: 3: Hoare triple {609#true} assume true; {609#true} is VALID [2022-02-20 22:05:59,157 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {609#true} {610#false} #1472#return; {610#false} is VALID [2022-02-20 22:05:59,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-20 22:05:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:05:59,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {686#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {609#true} is VALID [2022-02-20 22:05:59,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {609#true} is VALID [2022-02-20 22:05:59,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {609#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {609#true} is VALID [2022-02-20 22:05:59,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {609#true} assume true; {609#true} is VALID [2022-02-20 22:05:59,167 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {609#true} {610#false} #1474#return; {610#false} is VALID [2022-02-20 22:05:59,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {609#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(98, 2);call #Ultimate.allocInit(26, 3);call #Ultimate.allocInit(63, 4);call #Ultimate.allocInit(11, 5);call #Ultimate.allocInit(12, 6);call #Ultimate.allocInit(274, 7);call #Ultimate.allocInit(15, 8);call #Ultimate.allocInit(15, 9);call #Ultimate.allocInit(11, 10);call #Ultimate.allocInit(10, 11);call #Ultimate.allocInit(274, 12);call #Ultimate.allocInit(22, 13);call #Ultimate.allocInit(22, 14);call #Ultimate.allocInit(11, 15);call #Ultimate.allocInit(12, 16);call #Ultimate.allocInit(274, 17);call #Ultimate.allocInit(13, 18);call #Ultimate.allocInit(13, 19);call #Ultimate.allocInit(24, 20);call #Ultimate.allocInit(24, 21);call #Ultimate.allocInit(11, 22);call #Ultimate.allocInit(12, 23);call #Ultimate.allocInit(274, 24);call #Ultimate.allocInit(29, 25);call #Ultimate.allocInit(29, 26);call #Ultimate.allocInit(11, 27);call #Ultimate.allocInit(11, 28);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~usbpn_ops_group1~0.base, ~usbpn_ops_group1~0.offset := 0, 0;~usb_counter~0 := 0;~usbpn_driver_group1~0.base, ~usbpn_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~rxq_size~0 := 17;~#usbpn_ops~0.base, ~#usbpn_ops~0.offset := 29, 0;call #Ultimate.allocInit(376, 29);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 8 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_open.base, #funAddr~usbpn_open.offset, ~#usbpn_ops~0.base, 16 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_close.base, #funAddr~usbpn_close.offset, ~#usbpn_ops~0.base, 24 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_xmit.base, #funAddr~usbpn_xmit.offset, ~#usbpn_ops~0.base, 32 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 40 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 48 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 56 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 64 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 72 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_ioctl.base, #funAddr~usbpn_ioctl.offset, ~#usbpn_ops~0.base, 80 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 88 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_set_mtu.base, #funAddr~usbpn_set_mtu.offset, ~#usbpn_ops~0.base, 96 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 104 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 112 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 120 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 128 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 136 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 144 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 152 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 160 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 168 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 176 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 184 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 192 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 200 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 208 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 216 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 224 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 232 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 240 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 248 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 256 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 264 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 272 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 280 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 288 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 296 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 304 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 312 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 320 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 328 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 336 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 344 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 352 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 360 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 368 + ~#usbpn_ops~0.offset, 8);~#usbpn_ids~0.base, ~#usbpn_ids~0.offset := 30, 0;call #Ultimate.allocInit(50, 30);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#usbpn_ids~0.base);call write~unchecked~int(385, ~#usbpn_ids~0.base, ~#usbpn_ids~0.offset, 2);call write~unchecked~int(1057, ~#usbpn_ids~0.base, 2 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 4 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 6 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 8 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 10 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 11 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 12 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(2, ~#usbpn_ids~0.base, 13 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(254, ~#usbpn_ids~0.base, 14 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 15 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 16 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 17 + ~#usbpn_ids~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;~#usbpn_driver~0.base, ~#usbpn_driver~0.offset := 31, 0;call #Ultimate.allocInit(277, 31);call write~init~$Pointer$(27, 0, ~#usbpn_driver~0.base, ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_probe.base, #funAddr~usbpn_probe.offset, ~#usbpn_driver~0.base, 8 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_disconnect.base, #funAddr~usbpn_disconnect.offset, ~#usbpn_driver~0.base, 16 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 24 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 32 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 40 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 48 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 56 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 64 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(~#usbpn_ids~0.base, ~#usbpn_ids~0.offset, ~#usbpn_driver~0.base, 72 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 80 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 84 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 88 + ~#usbpn_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 92 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 100 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 108 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 116 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 124 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 132 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 136 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 148 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 156 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 164 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 172 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 180 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 188 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 196 + ~#usbpn_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 197 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 205 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 213 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 221 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 229 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 237 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 245 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 253 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 261 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 269 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 273 + ~#usbpn_driver~0.offset, 1);call write~init~int(0, ~#usbpn_driver~0.base, 274 + ~#usbpn_driver~0.offset, 1);call write~init~int(1, ~#usbpn_driver~0.base, 275 + ~#usbpn_driver~0.offset, 1);call write~init~int(0, ~#usbpn_driver~0.base, 276 + ~#usbpn_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~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; {609#true} is VALID [2022-02-20 22:05:59,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret270#1.base, main_#t~ret270#1.offset, main_#t~ret271#1.base, main_#t~ret271#1.offset, main_#t~ret272#1.base, main_#t~ret272#1.offset, main_#t~ret273#1.base, main_#t~ret273#1.offset, main_#t~ret274#1.base, main_#t~ret274#1.offset, main_#t~nondet275#1, main_#t~switch276#1, main_#t~nondet277#1, main_#t~switch278#1, main_#t~ret279#1, main_#t~nondet280#1, main_#t~switch281#1, main_#t~ret282#1, main_#t~nondet283#1, main_#t~switch284#1, main_#t~ret285#1, main_#t~mem286#1, main_#t~ret287#1, main_#t~mem288#1, main_#t~ret289#1, main_#t~mem290#1, main_#t~ret291#1, main_#t~mem292#1, main_#t~ret293#1, main_#t~mem294#1, main_#t~ret295#1, main_#t~ret296#1, main_#t~ret297#1, main_#t~ret298#1, main_#t~ret299#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~28#1.base, main_~tmp~28#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___2~2#1, main_~tmp___3~2#1, main_~tmp___4~2#1, main_~tmp___5~2#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~28#1.base, main_~tmp~28#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___2~2#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1;havoc main_~tmp___5~2#1; {609#true} is VALID [2022-02-20 22:05:59,169 INFO L272 TraceCheckUtils]: 2: Hoare triple {609#true} call main_#t~ret270#1.base, main_#t~ret270#1.offset := ldv_init_zalloc(32); {663#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:05:59,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {663#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {609#true} is VALID [2022-02-20 22:05:59,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {609#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {671#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:59,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {671#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {609#true} is VALID [2022-02-20 22:05:59,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {609#true} assume true; {609#true} is VALID [2022-02-20 22:05:59,171 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {609#true} {609#true} #1456#return; {609#true} is VALID [2022-02-20 22:05:59,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {609#true} is VALID [2022-02-20 22:05:59,171 INFO L272 TraceCheckUtils]: 9: Hoare triple {609#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {609#true} is VALID [2022-02-20 22:05:59,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {609#true} ~cond := #in~cond; {609#true} is VALID [2022-02-20 22:05:59,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {609#true} assume 0 == ~cond;assume false; {610#false} is VALID [2022-02-20 22:05:59,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {610#false} assume true; {610#false} is VALID [2022-02-20 22:05:59,172 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {610#false} {609#true} #1458#return; {610#false} is VALID [2022-02-20 22:05:59,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {610#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {610#false} is VALID [2022-02-20 22:05:59,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {610#false} assume true; {610#false} is VALID [2022-02-20 22:05:59,173 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {610#false} {609#true} #1466#return; {610#false} is VALID [2022-02-20 22:05:59,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {610#false} main_~tmp~28#1.base, main_~tmp~28#1.offset := main_#t~ret270#1.base, main_#t~ret270#1.offset;havoc main_#t~ret270#1.base, main_#t~ret270#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~28#1.base, main_~tmp~28#1.offset; {610#false} is VALID [2022-02-20 22:05:59,173 INFO L272 TraceCheckUtils]: 18: Hoare triple {610#false} call main_#t~ret271#1.base, main_#t~ret271#1.offset := ldv_init_zalloc(240); {663#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:05:59,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {663#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {609#true} is VALID [2022-02-20 22:05:59,174 INFO L272 TraceCheckUtils]: 20: Hoare triple {609#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {671#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:59,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {671#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {609#true} is VALID [2022-02-20 22:05:59,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {609#true} assume true; {609#true} is VALID [2022-02-20 22:05:59,175 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {609#true} {609#true} #1456#return; {609#true} is VALID [2022-02-20 22:05:59,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {609#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {609#true} is VALID [2022-02-20 22:05:59,175 INFO L272 TraceCheckUtils]: 25: Hoare triple {609#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {609#true} is VALID [2022-02-20 22:05:59,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {609#true} ~cond := #in~cond; {609#true} is VALID [2022-02-20 22:05:59,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {609#true} assume 0 == ~cond;assume false; {610#false} is VALID [2022-02-20 22:05:59,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {610#false} assume true; {610#false} is VALID [2022-02-20 22:05:59,176 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {610#false} {609#true} #1458#return; {610#false} is VALID [2022-02-20 22:05:59,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {610#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {610#false} is VALID [2022-02-20 22:05:59,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {610#false} assume true; {610#false} is VALID [2022-02-20 22:05:59,176 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {610#false} {610#false} #1468#return; {610#false} is VALID [2022-02-20 22:05:59,177 INFO L290 TraceCheckUtils]: 33: Hoare triple {610#false} main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset := main_#t~ret271#1.base, main_#t~ret271#1.offset;havoc main_#t~ret271#1.base, main_#t~ret271#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset; {610#false} is VALID [2022-02-20 22:05:59,177 INFO L272 TraceCheckUtils]: 34: Hoare triple {610#false} call main_#t~ret272#1.base, main_#t~ret272#1.offset := ldv_init_zalloc(40); {663#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:05:59,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {663#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {609#true} is VALID [2022-02-20 22:05:59,178 INFO L272 TraceCheckUtils]: 36: Hoare triple {609#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {671#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:05:59,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {671#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {609#true} is VALID [2022-02-20 22:05:59,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {609#true} assume true; {609#true} is VALID [2022-02-20 22:05:59,178 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {609#true} {609#true} #1456#return; {609#true} is VALID [2022-02-20 22:05:59,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {609#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {609#true} is VALID [2022-02-20 22:05:59,179 INFO L272 TraceCheckUtils]: 41: Hoare triple {609#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {609#true} is VALID [2022-02-20 22:05:59,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {609#true} ~cond := #in~cond; {609#true} is VALID [2022-02-20 22:05:59,179 INFO L290 TraceCheckUtils]: 43: Hoare triple {609#true} assume 0 == ~cond;assume false; {610#false} is VALID [2022-02-20 22:05:59,180 INFO L290 TraceCheckUtils]: 44: Hoare triple {610#false} assume true; {610#false} is VALID [2022-02-20 22:05:59,180 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {610#false} {609#true} #1458#return; {610#false} is VALID [2022-02-20 22:05:59,180 INFO L290 TraceCheckUtils]: 46: Hoare triple {610#false} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {610#false} is VALID [2022-02-20 22:05:59,180 INFO L290 TraceCheckUtils]: 47: Hoare triple {610#false} assume true; {610#false} is VALID [2022-02-20 22:05:59,180 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {610#false} {610#false} #1470#return; {610#false} is VALID [2022-02-20 22:05:59,180 INFO L290 TraceCheckUtils]: 49: Hoare triple {610#false} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret272#1.base, main_#t~ret272#1.offset;havoc main_#t~ret272#1.base, main_#t~ret272#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;assume { :begin_inline_ldv_initialize } true; {610#false} is VALID [2022-02-20 22:05:59,181 INFO L290 TraceCheckUtils]: 50: Hoare triple {610#false} assume { :end_inline_ldv_initialize } true; {610#false} is VALID [2022-02-20 22:05:59,181 INFO L272 TraceCheckUtils]: 51: Hoare triple {610#false} call main_#t~ret273#1.base, main_#t~ret273#1.offset := ldv_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 4); {686#(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:05:59,181 INFO L290 TraceCheckUtils]: 52: Hoare triple {686#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {609#true} is VALID [2022-02-20 22:05:59,181 INFO L290 TraceCheckUtils]: 53: Hoare triple {609#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {609#true} is VALID [2022-02-20 22:05:59,181 INFO L290 TraceCheckUtils]: 54: Hoare triple {609#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {609#true} is VALID [2022-02-20 22:05:59,182 INFO L290 TraceCheckUtils]: 55: Hoare triple {609#true} assume true; {609#true} is VALID [2022-02-20 22:05:59,182 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {609#true} {610#false} #1472#return; {610#false} is VALID [2022-02-20 22:05:59,182 INFO L290 TraceCheckUtils]: 57: Hoare triple {610#false} havoc main_#t~ret273#1.base, main_#t~ret273#1.offset; {610#false} is VALID [2022-02-20 22:05:59,182 INFO L272 TraceCheckUtils]: 58: Hoare triple {610#false} call main_#t~ret274#1.base, main_#t~ret274#1.offset := ldv_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {686#(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:05:59,182 INFO L290 TraceCheckUtils]: 59: Hoare triple {686#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {609#true} is VALID [2022-02-20 22:05:59,183 INFO L290 TraceCheckUtils]: 60: Hoare triple {609#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {609#true} is VALID [2022-02-20 22:05:59,183 INFO L290 TraceCheckUtils]: 61: Hoare triple {609#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {609#true} is VALID [2022-02-20 22:05:59,183 INFO L290 TraceCheckUtils]: 62: Hoare triple {609#true} assume true; {609#true} is VALID [2022-02-20 22:05:59,183 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {609#true} {610#false} #1474#return; {610#false} is VALID [2022-02-20 22:05:59,183 INFO L290 TraceCheckUtils]: 64: Hoare triple {610#false} havoc main_#t~ret274#1.base, main_#t~ret274#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {610#false} is VALID [2022-02-20 22:05:59,183 INFO L290 TraceCheckUtils]: 65: Hoare triple {610#false} assume -2147483648 <= main_#t~nondet275#1 && main_#t~nondet275#1 <= 2147483647;main_~tmp___2~2#1 := main_#t~nondet275#1;havoc main_#t~nondet275#1;main_#t~switch276#1 := 0 == main_~tmp___2~2#1; {610#false} is VALID [2022-02-20 22:05:59,184 INFO L290 TraceCheckUtils]: 66: Hoare triple {610#false} assume !main_#t~switch276#1;main_#t~switch276#1 := main_#t~switch276#1 || 1 == main_~tmp___2~2#1; {610#false} is VALID [2022-02-20 22:05:59,184 INFO L290 TraceCheckUtils]: 67: Hoare triple {610#false} assume main_#t~switch276#1; {610#false} is VALID [2022-02-20 22:05:59,184 INFO L290 TraceCheckUtils]: 68: Hoare triple {610#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet280#1 && main_#t~nondet280#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet280#1;havoc main_#t~nondet280#1;main_#t~switch281#1 := 0 == main_~tmp___4~2#1; {610#false} is VALID [2022-02-20 22:05:59,184 INFO L290 TraceCheckUtils]: 69: Hoare triple {610#false} assume main_#t~switch281#1; {610#false} is VALID [2022-02-20 22:05:59,184 INFO L290 TraceCheckUtils]: 70: Hoare triple {610#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_usbpn_driver_exit } true;assume { :begin_inline_ldv_usb_deregister_18 } true;ldv_usb_deregister_18_#in~arg#1.base, ldv_usb_deregister_18_#in~arg#1.offset := ~#usbpn_driver~0.base, ~#usbpn_driver~0.offset;havoc ldv_usb_deregister_18_~arg#1.base, ldv_usb_deregister_18_~arg#1.offset;ldv_usb_deregister_18_~arg#1.base, ldv_usb_deregister_18_~arg#1.offset := ldv_usb_deregister_18_#in~arg#1.base, ldv_usb_deregister_18_#in~arg#1.offset;assume { :begin_inline_usb_deregister } true;usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset := ldv_usb_deregister_18_~arg#1.base, ldv_usb_deregister_18_~arg#1.offset;havoc usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset;usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset := usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset; {610#false} is VALID [2022-02-20 22:05:59,185 INFO L290 TraceCheckUtils]: 71: Hoare triple {610#false} assume { :end_inline_usb_deregister } true;~ldv_state_variable_1~0 := 0; {610#false} is VALID [2022-02-20 22:05:59,185 INFO L290 TraceCheckUtils]: 72: Hoare triple {610#false} assume { :end_inline_ldv_usb_deregister_18 } true; {610#false} is VALID [2022-02-20 22:05:59,185 INFO L290 TraceCheckUtils]: 73: Hoare triple {610#false} assume { :end_inline_usbpn_driver_exit } true;~ldv_state_variable_0~0 := 2; {610#false} is VALID [2022-02-20 22:05:59,185 INFO L290 TraceCheckUtils]: 74: Hoare triple {610#false} assume { :begin_inline_ldv_check_final_state } true; {610#false} is VALID [2022-02-20 22:05:59,185 INFO L290 TraceCheckUtils]: 75: Hoare triple {610#false} assume 0 != (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616; {610#false} is VALID [2022-02-20 22:05:59,186 INFO L272 TraceCheckUtils]: 76: Hoare triple {610#false} call ldv_error(); {610#false} is VALID [2022-02-20 22:05:59,186 INFO L290 TraceCheckUtils]: 77: Hoare triple {610#false} assume !false; {610#false} is VALID [2022-02-20 22:05:59,186 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 22:05:59,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:05:59,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840616737] [2022-02-20 22:05:59,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840616737] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:05:59,188 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:05:59,188 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 22:05:59,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262323379] [2022-02-20 22:05:59,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:05:59,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 78 [2022-02-20 22:05:59,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:05:59,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:05:59,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:05:59,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 22:05:59,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:05:59,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 22:05:59,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:05:59,266 INFO L87 Difference]: Start difference. First operand has 606 states, 452 states have (on average 1.3628318584070795) internal successors, (616), 471 states have internal predecessors, (616), 113 states have call successors, (113), 40 states have call predecessors, (113), 39 states have return successors, (107), 105 states have call predecessors, (107), 107 states have call successors, (107) Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:06:07,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:06:07,455 INFO L93 Difference]: Finished difference Result 1296 states and 1833 transitions. [2022-02-20 22:06:07,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 22:06:07,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 78 [2022-02-20 22:06:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:06:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:06:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1833 transitions. [2022-02-20 22:06:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:06:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1833 transitions. [2022-02-20 22:06:07,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 1833 transitions. [2022-02-20 22:06:08,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1833 edges. 1833 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:06:08,975 INFO L225 Difference]: With dead ends: 1296 [2022-02-20 22:06:08,975 INFO L226 Difference]: Without dead ends: 681 [2022-02-20 22:06:08,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 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:08,990 INFO L933 BasicCegarLoop]: 810 mSDtfsCounter, 444 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-02-20 22:06:08,991 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [461 Valid, 1555 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-02-20 22:06:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2022-02-20 22:06:09,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 592. [2022-02-20 22:06:09,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:06:09,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 681 states. Second operand has 592 states, 446 states have (on average 1.3318385650224216) internal successors, (594), 457 states have internal predecessors, (594), 107 states have call successors, (107), 39 states have call predecessors, (107), 38 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2022-02-20 22:06:09,065 INFO L74 IsIncluded]: Start isIncluded. First operand 681 states. Second operand has 592 states, 446 states have (on average 1.3318385650224216) internal successors, (594), 457 states have internal predecessors, (594), 107 states have call successors, (107), 39 states have call predecessors, (107), 38 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2022-02-20 22:06:09,069 INFO L87 Difference]: Start difference. First operand 681 states. Second operand has 592 states, 446 states have (on average 1.3318385650224216) internal successors, (594), 457 states have internal predecessors, (594), 107 states have call successors, (107), 39 states have call predecessors, (107), 38 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2022-02-20 22:06:09,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:06:09,103 INFO L93 Difference]: Finished difference Result 681 states and 942 transitions. [2022-02-20 22:06:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 942 transitions. [2022-02-20 22:06:09,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:06:09,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:06:09,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 592 states, 446 states have (on average 1.3318385650224216) internal successors, (594), 457 states have internal predecessors, (594), 107 states have call successors, (107), 39 states have call predecessors, (107), 38 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) Second operand 681 states. [2022-02-20 22:06:09,121 INFO L87 Difference]: Start difference. First operand has 592 states, 446 states have (on average 1.3318385650224216) internal successors, (594), 457 states have internal predecessors, (594), 107 states have call successors, (107), 39 states have call predecessors, (107), 38 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) Second operand 681 states. [2022-02-20 22:06:09,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:06:09,159 INFO L93 Difference]: Finished difference Result 681 states and 942 transitions. [2022-02-20 22:06:09,159 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 942 transitions. [2022-02-20 22:06:09,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:06:09,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:06:09,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:06:09,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:06:09,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 446 states have (on average 1.3318385650224216) internal successors, (594), 457 states have internal predecessors, (594), 107 states have call successors, (107), 39 states have call predecessors, (107), 38 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2022-02-20 22:06:09,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 803 transitions. [2022-02-20 22:06:09,190 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 803 transitions. Word has length 78 [2022-02-20 22:06:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:06:09,191 INFO L470 AbstractCegarLoop]: Abstraction has 592 states and 803 transitions. [2022-02-20 22:06:09,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:06:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 803 transitions. [2022-02-20 22:06:09,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 22:06:09,194 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:06:09,194 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:06:09,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:06:09,195 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:06:09,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:06:09,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1882990472, now seen corresponding path program 1 times [2022-02-20 22:06:09,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:06:09,196 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673140672] [2022-02-20 22:06:09,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:06:09,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:06:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:09,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:06:09,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:09,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:09,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {4754#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4691#true} is VALID [2022-02-20 22:06:09,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4691#true} {4691#true} #1456#return; {4691#true} is VALID [2022-02-20 22:06:09,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:09,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {4691#true} ~cond := #in~cond; {4691#true} is VALID [2022-02-20 22:06:09,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {4691#true} assume !(0 == ~cond); {4691#true} is VALID [2022-02-20 22:06:09,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4691#true} {4691#true} #1458#return; {4691#true} is VALID [2022-02-20 22:06:09,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {4746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {4691#true} is VALID [2022-02-20 22:06:09,360 INFO L272 TraceCheckUtils]: 1: Hoare triple {4691#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {4754#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:09,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {4754#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4691#true} is VALID [2022-02-20 22:06:09,361 INFO L290 TraceCheckUtils]: 3: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,361 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4691#true} {4691#true} #1456#return; {4691#true} is VALID [2022-02-20 22:06:09,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {4691#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {4691#true} is VALID [2022-02-20 22:06:09,361 INFO L272 TraceCheckUtils]: 6: Hoare triple {4691#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {4691#true} is VALID [2022-02-20 22:06:09,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {4691#true} ~cond := #in~cond; {4691#true} is VALID [2022-02-20 22:06:09,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {4691#true} assume !(0 == ~cond); {4691#true} is VALID [2022-02-20 22:06:09,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,362 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4691#true} {4691#true} #1458#return; {4691#true} is VALID [2022-02-20 22:06:09,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {4691#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {4691#true} is VALID [2022-02-20 22:06:09,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,362 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4691#true} {4691#true} #1466#return; {4691#true} is VALID [2022-02-20 22:06:09,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:06:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:09,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:09,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {4754#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4691#true} is VALID [2022-02-20 22:06:09,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,381 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4691#true} {4691#true} #1456#return; {4691#true} is VALID [2022-02-20 22:06:09,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:09,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:09,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {4691#true} ~cond := #in~cond; {4691#true} is VALID [2022-02-20 22:06:09,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {4691#true} assume !(0 == ~cond); {4691#true} is VALID [2022-02-20 22:06:09,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4691#true} {4691#true} #1458#return; {4691#true} is VALID [2022-02-20 22:06:09,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {4746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {4691#true} is VALID [2022-02-20 22:06:09,389 INFO L272 TraceCheckUtils]: 1: Hoare triple {4691#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {4754#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:09,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {4754#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4691#true} is VALID [2022-02-20 22:06:09,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,390 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4691#true} {4691#true} #1456#return; {4691#true} is VALID [2022-02-20 22:06:09,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {4691#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {4691#true} is VALID [2022-02-20 22:06:09,390 INFO L272 TraceCheckUtils]: 6: Hoare triple {4691#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {4691#true} is VALID [2022-02-20 22:06:09,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {4691#true} ~cond := #in~cond; {4691#true} is VALID [2022-02-20 22:06:09,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {4691#true} assume !(0 == ~cond); {4691#true} is VALID [2022-02-20 22:06:09,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,391 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4691#true} {4691#true} #1458#return; {4691#true} is VALID [2022-02-20 22:06:09,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {4691#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {4691#true} is VALID [2022-02-20 22:06:09,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,391 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4691#true} {4691#true} #1468#return; {4691#true} is VALID [2022-02-20 22:06:09,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:06:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:09,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:09,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:09,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {4754#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4691#true} is VALID [2022-02-20 22:06:09,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4691#true} {4691#true} #1456#return; {4691#true} is VALID [2022-02-20 22:06:09,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:09,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {4691#true} ~cond := #in~cond; {4691#true} is VALID [2022-02-20 22:06:09,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {4691#true} assume !(0 == ~cond); {4691#true} is VALID [2022-02-20 22:06:09,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4691#true} {4691#true} #1458#return; {4691#true} is VALID [2022-02-20 22:06:09,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {4746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {4691#true} is VALID [2022-02-20 22:06:09,411 INFO L272 TraceCheckUtils]: 1: Hoare triple {4691#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {4754#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:09,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {4754#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4691#true} is VALID [2022-02-20 22:06:09,411 INFO L290 TraceCheckUtils]: 3: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,411 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4691#true} {4691#true} #1456#return; {4691#true} is VALID [2022-02-20 22:06:09,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {4691#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {4691#true} is VALID [2022-02-20 22:06:09,412 INFO L272 TraceCheckUtils]: 6: Hoare triple {4691#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {4691#true} is VALID [2022-02-20 22:06:09,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {4691#true} ~cond := #in~cond; {4691#true} is VALID [2022-02-20 22:06:09,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {4691#true} assume !(0 == ~cond); {4691#true} is VALID [2022-02-20 22:06:09,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,412 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4691#true} {4691#true} #1458#return; {4691#true} is VALID [2022-02-20 22:06:09,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {4691#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {4691#true} is VALID [2022-02-20 22:06:09,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,413 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4691#true} {4691#true} #1470#return; {4691#true} is VALID [2022-02-20 22:06:09,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:06:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:09,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {4769#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {4691#true} is VALID [2022-02-20 22:06:09,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {4691#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {4691#true} is VALID [2022-02-20 22:06:09,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {4691#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {4691#true} is VALID [2022-02-20 22:06:09,430 INFO L290 TraceCheckUtils]: 3: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,430 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4691#true} {4691#true} #1472#return; {4691#true} is VALID [2022-02-20 22:06:09,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-20 22:06:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:09,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {4769#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {4691#true} is VALID [2022-02-20 22:06:09,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {4691#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {4691#true} is VALID [2022-02-20 22:06:09,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {4691#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {4691#true} is VALID [2022-02-20 22:06:09,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,438 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4691#true} {4691#true} #1474#return; {4691#true} is VALID [2022-02-20 22:06:09,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {4691#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(98, 2);call #Ultimate.allocInit(26, 3);call #Ultimate.allocInit(63, 4);call #Ultimate.allocInit(11, 5);call #Ultimate.allocInit(12, 6);call #Ultimate.allocInit(274, 7);call #Ultimate.allocInit(15, 8);call #Ultimate.allocInit(15, 9);call #Ultimate.allocInit(11, 10);call #Ultimate.allocInit(10, 11);call #Ultimate.allocInit(274, 12);call #Ultimate.allocInit(22, 13);call #Ultimate.allocInit(22, 14);call #Ultimate.allocInit(11, 15);call #Ultimate.allocInit(12, 16);call #Ultimate.allocInit(274, 17);call #Ultimate.allocInit(13, 18);call #Ultimate.allocInit(13, 19);call #Ultimate.allocInit(24, 20);call #Ultimate.allocInit(24, 21);call #Ultimate.allocInit(11, 22);call #Ultimate.allocInit(12, 23);call #Ultimate.allocInit(274, 24);call #Ultimate.allocInit(29, 25);call #Ultimate.allocInit(29, 26);call #Ultimate.allocInit(11, 27);call #Ultimate.allocInit(11, 28);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~usbpn_ops_group1~0.base, ~usbpn_ops_group1~0.offset := 0, 0;~usb_counter~0 := 0;~usbpn_driver_group1~0.base, ~usbpn_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~rxq_size~0 := 17;~#usbpn_ops~0.base, ~#usbpn_ops~0.offset := 29, 0;call #Ultimate.allocInit(376, 29);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 8 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_open.base, #funAddr~usbpn_open.offset, ~#usbpn_ops~0.base, 16 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_close.base, #funAddr~usbpn_close.offset, ~#usbpn_ops~0.base, 24 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_xmit.base, #funAddr~usbpn_xmit.offset, ~#usbpn_ops~0.base, 32 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 40 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 48 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 56 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 64 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 72 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_ioctl.base, #funAddr~usbpn_ioctl.offset, ~#usbpn_ops~0.base, 80 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 88 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_set_mtu.base, #funAddr~usbpn_set_mtu.offset, ~#usbpn_ops~0.base, 96 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 104 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 112 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 120 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 128 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 136 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 144 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 152 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 160 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 168 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 176 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 184 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 192 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 200 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 208 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 216 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 224 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 232 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 240 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 248 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 256 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 264 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 272 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 280 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 288 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 296 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 304 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 312 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 320 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 328 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 336 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 344 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 352 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 360 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 368 + ~#usbpn_ops~0.offset, 8);~#usbpn_ids~0.base, ~#usbpn_ids~0.offset := 30, 0;call #Ultimate.allocInit(50, 30);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#usbpn_ids~0.base);call write~unchecked~int(385, ~#usbpn_ids~0.base, ~#usbpn_ids~0.offset, 2);call write~unchecked~int(1057, ~#usbpn_ids~0.base, 2 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 4 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 6 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 8 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 10 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 11 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 12 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(2, ~#usbpn_ids~0.base, 13 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(254, ~#usbpn_ids~0.base, 14 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 15 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 16 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 17 + ~#usbpn_ids~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;~#usbpn_driver~0.base, ~#usbpn_driver~0.offset := 31, 0;call #Ultimate.allocInit(277, 31);call write~init~$Pointer$(27, 0, ~#usbpn_driver~0.base, ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_probe.base, #funAddr~usbpn_probe.offset, ~#usbpn_driver~0.base, 8 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_disconnect.base, #funAddr~usbpn_disconnect.offset, ~#usbpn_driver~0.base, 16 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 24 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 32 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 40 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 48 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 56 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 64 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(~#usbpn_ids~0.base, ~#usbpn_ids~0.offset, ~#usbpn_driver~0.base, 72 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 80 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 84 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 88 + ~#usbpn_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 92 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 100 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 108 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 116 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 124 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 132 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 136 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 148 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 156 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 164 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 172 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 180 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 188 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 196 + ~#usbpn_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 197 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 205 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 213 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 221 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 229 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 237 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 245 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 253 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 261 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 269 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 273 + ~#usbpn_driver~0.offset, 1);call write~init~int(0, ~#usbpn_driver~0.base, 274 + ~#usbpn_driver~0.offset, 1);call write~init~int(1, ~#usbpn_driver~0.base, 275 + ~#usbpn_driver~0.offset, 1);call write~init~int(0, ~#usbpn_driver~0.base, 276 + ~#usbpn_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~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; {4691#true} is VALID [2022-02-20 22:06:09,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {4691#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret270#1.base, main_#t~ret270#1.offset, main_#t~ret271#1.base, main_#t~ret271#1.offset, main_#t~ret272#1.base, main_#t~ret272#1.offset, main_#t~ret273#1.base, main_#t~ret273#1.offset, main_#t~ret274#1.base, main_#t~ret274#1.offset, main_#t~nondet275#1, main_#t~switch276#1, main_#t~nondet277#1, main_#t~switch278#1, main_#t~ret279#1, main_#t~nondet280#1, main_#t~switch281#1, main_#t~ret282#1, main_#t~nondet283#1, main_#t~switch284#1, main_#t~ret285#1, main_#t~mem286#1, main_#t~ret287#1, main_#t~mem288#1, main_#t~ret289#1, main_#t~mem290#1, main_#t~ret291#1, main_#t~mem292#1, main_#t~ret293#1, main_#t~mem294#1, main_#t~ret295#1, main_#t~ret296#1, main_#t~ret297#1, main_#t~ret298#1, main_#t~ret299#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~28#1.base, main_~tmp~28#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___2~2#1, main_~tmp___3~2#1, main_~tmp___4~2#1, main_~tmp___5~2#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~28#1.base, main_~tmp~28#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___2~2#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1;havoc main_~tmp___5~2#1; {4691#true} is VALID [2022-02-20 22:06:09,439 INFO L272 TraceCheckUtils]: 2: Hoare triple {4691#true} call main_#t~ret270#1.base, main_#t~ret270#1.offset := ldv_init_zalloc(32); {4746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:09,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {4746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {4691#true} is VALID [2022-02-20 22:06:09,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {4691#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {4754#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:09,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {4754#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4691#true} is VALID [2022-02-20 22:06:09,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,441 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4691#true} {4691#true} #1456#return; {4691#true} is VALID [2022-02-20 22:06:09,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {4691#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {4691#true} is VALID [2022-02-20 22:06:09,441 INFO L272 TraceCheckUtils]: 9: Hoare triple {4691#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {4691#true} is VALID [2022-02-20 22:06:09,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {4691#true} ~cond := #in~cond; {4691#true} is VALID [2022-02-20 22:06:09,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {4691#true} assume !(0 == ~cond); {4691#true} is VALID [2022-02-20 22:06:09,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,442 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4691#true} {4691#true} #1458#return; {4691#true} is VALID [2022-02-20 22:06:09,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {4691#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {4691#true} is VALID [2022-02-20 22:06:09,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,442 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4691#true} {4691#true} #1466#return; {4691#true} is VALID [2022-02-20 22:06:09,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {4691#true} main_~tmp~28#1.base, main_~tmp~28#1.offset := main_#t~ret270#1.base, main_#t~ret270#1.offset;havoc main_#t~ret270#1.base, main_#t~ret270#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~28#1.base, main_~tmp~28#1.offset; {4691#true} is VALID [2022-02-20 22:06:09,447 INFO L272 TraceCheckUtils]: 18: Hoare triple {4691#true} call main_#t~ret271#1.base, main_#t~ret271#1.offset := ldv_init_zalloc(240); {4746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:09,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {4746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {4691#true} is VALID [2022-02-20 22:06:09,448 INFO L272 TraceCheckUtils]: 20: Hoare triple {4691#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {4754#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:09,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {4754#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4691#true} is VALID [2022-02-20 22:06:09,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,448 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4691#true} {4691#true} #1456#return; {4691#true} is VALID [2022-02-20 22:06:09,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {4691#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {4691#true} is VALID [2022-02-20 22:06:09,448 INFO L272 TraceCheckUtils]: 25: Hoare triple {4691#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {4691#true} is VALID [2022-02-20 22:06:09,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {4691#true} ~cond := #in~cond; {4691#true} is VALID [2022-02-20 22:06:09,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {4691#true} assume !(0 == ~cond); {4691#true} is VALID [2022-02-20 22:06:09,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,449 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4691#true} {4691#true} #1458#return; {4691#true} is VALID [2022-02-20 22:06:09,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {4691#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {4691#true} is VALID [2022-02-20 22:06:09,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,449 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4691#true} {4691#true} #1468#return; {4691#true} is VALID [2022-02-20 22:06:09,450 INFO L290 TraceCheckUtils]: 33: Hoare triple {4691#true} main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset := main_#t~ret271#1.base, main_#t~ret271#1.offset;havoc main_#t~ret271#1.base, main_#t~ret271#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset; {4691#true} is VALID [2022-02-20 22:06:09,450 INFO L272 TraceCheckUtils]: 34: Hoare triple {4691#true} call main_#t~ret272#1.base, main_#t~ret272#1.offset := ldv_init_zalloc(40); {4746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:09,450 INFO L290 TraceCheckUtils]: 35: Hoare triple {4746#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {4691#true} is VALID [2022-02-20 22:06:09,451 INFO L272 TraceCheckUtils]: 36: Hoare triple {4691#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {4754#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:09,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {4754#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {4691#true} is VALID [2022-02-20 22:06:09,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,451 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4691#true} {4691#true} #1456#return; {4691#true} is VALID [2022-02-20 22:06:09,451 INFO L290 TraceCheckUtils]: 40: Hoare triple {4691#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {4691#true} is VALID [2022-02-20 22:06:09,452 INFO L272 TraceCheckUtils]: 41: Hoare triple {4691#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {4691#true} is VALID [2022-02-20 22:06:09,452 INFO L290 TraceCheckUtils]: 42: Hoare triple {4691#true} ~cond := #in~cond; {4691#true} is VALID [2022-02-20 22:06:09,452 INFO L290 TraceCheckUtils]: 43: Hoare triple {4691#true} assume !(0 == ~cond); {4691#true} is VALID [2022-02-20 22:06:09,452 INFO L290 TraceCheckUtils]: 44: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,452 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4691#true} {4691#true} #1458#return; {4691#true} is VALID [2022-02-20 22:06:09,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {4691#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {4691#true} is VALID [2022-02-20 22:06:09,452 INFO L290 TraceCheckUtils]: 47: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,453 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {4691#true} {4691#true} #1470#return; {4691#true} is VALID [2022-02-20 22:06:09,453 INFO L290 TraceCheckUtils]: 49: Hoare triple {4691#true} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret272#1.base, main_#t~ret272#1.offset;havoc main_#t~ret272#1.base, main_#t~ret272#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;assume { :begin_inline_ldv_initialize } true; {4691#true} is VALID [2022-02-20 22:06:09,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {4691#true} assume { :end_inline_ldv_initialize } true; {4691#true} is VALID [2022-02-20 22:06:09,453 INFO L272 TraceCheckUtils]: 51: Hoare triple {4691#true} call main_#t~ret273#1.base, main_#t~ret273#1.offset := ldv_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 4); {4769#(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:09,454 INFO L290 TraceCheckUtils]: 52: Hoare triple {4769#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {4691#true} is VALID [2022-02-20 22:06:09,454 INFO L290 TraceCheckUtils]: 53: Hoare triple {4691#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {4691#true} is VALID [2022-02-20 22:06:09,454 INFO L290 TraceCheckUtils]: 54: Hoare triple {4691#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {4691#true} is VALID [2022-02-20 22:06:09,454 INFO L290 TraceCheckUtils]: 55: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,454 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {4691#true} {4691#true} #1472#return; {4691#true} is VALID [2022-02-20 22:06:09,454 INFO L290 TraceCheckUtils]: 57: Hoare triple {4691#true} havoc main_#t~ret273#1.base, main_#t~ret273#1.offset; {4691#true} is VALID [2022-02-20 22:06:09,455 INFO L272 TraceCheckUtils]: 58: Hoare triple {4691#true} call main_#t~ret274#1.base, main_#t~ret274#1.offset := ldv_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {4769#(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:09,455 INFO L290 TraceCheckUtils]: 59: Hoare triple {4769#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {4691#true} is VALID [2022-02-20 22:06:09,455 INFO L290 TraceCheckUtils]: 60: Hoare triple {4691#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {4691#true} is VALID [2022-02-20 22:06:09,455 INFO L290 TraceCheckUtils]: 61: Hoare triple {4691#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {4691#true} is VALID [2022-02-20 22:06:09,456 INFO L290 TraceCheckUtils]: 62: Hoare triple {4691#true} assume true; {4691#true} is VALID [2022-02-20 22:06:09,456 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {4691#true} {4691#true} #1474#return; {4691#true} is VALID [2022-02-20 22:06:09,456 INFO L290 TraceCheckUtils]: 64: Hoare triple {4691#true} havoc main_#t~ret274#1.base, main_#t~ret274#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {4745#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:06:09,456 INFO L290 TraceCheckUtils]: 65: Hoare triple {4745#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet275#1 && main_#t~nondet275#1 <= 2147483647;main_~tmp___2~2#1 := main_#t~nondet275#1;havoc main_#t~nondet275#1;main_#t~switch276#1 := 0 == main_~tmp___2~2#1; {4745#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:06:09,457 INFO L290 TraceCheckUtils]: 66: Hoare triple {4745#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch276#1;main_#t~switch276#1 := main_#t~switch276#1 || 1 == main_~tmp___2~2#1; {4745#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:06:09,457 INFO L290 TraceCheckUtils]: 67: Hoare triple {4745#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch276#1; {4745#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:06:09,457 INFO L290 TraceCheckUtils]: 68: Hoare triple {4745#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet280#1 && main_#t~nondet280#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet280#1;havoc main_#t~nondet280#1;main_#t~switch281#1 := 0 == main_~tmp___4~2#1; {4745#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:06:09,458 INFO L290 TraceCheckUtils]: 69: Hoare triple {4745#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch281#1; {4745#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 22:06:09,458 INFO L290 TraceCheckUtils]: 70: Hoare triple {4745#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_usbpn_driver_exit } true;assume { :begin_inline_ldv_usb_deregister_18 } true;ldv_usb_deregister_18_#in~arg#1.base, ldv_usb_deregister_18_#in~arg#1.offset := ~#usbpn_driver~0.base, ~#usbpn_driver~0.offset;havoc ldv_usb_deregister_18_~arg#1.base, ldv_usb_deregister_18_~arg#1.offset;ldv_usb_deregister_18_~arg#1.base, ldv_usb_deregister_18_~arg#1.offset := ldv_usb_deregister_18_#in~arg#1.base, ldv_usb_deregister_18_#in~arg#1.offset;assume { :begin_inline_usb_deregister } true;usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset := ldv_usb_deregister_18_~arg#1.base, ldv_usb_deregister_18_~arg#1.offset;havoc usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset;usb_deregister_~arg0#1.base, usb_deregister_~arg0#1.offset := usb_deregister_#in~arg0#1.base, usb_deregister_#in~arg0#1.offset; {4692#false} is VALID [2022-02-20 22:06:09,458 INFO L290 TraceCheckUtils]: 71: Hoare triple {4692#false} assume { :end_inline_usb_deregister } true;~ldv_state_variable_1~0 := 0; {4692#false} is VALID [2022-02-20 22:06:09,458 INFO L290 TraceCheckUtils]: 72: Hoare triple {4692#false} assume { :end_inline_ldv_usb_deregister_18 } true; {4692#false} is VALID [2022-02-20 22:06:09,458 INFO L290 TraceCheckUtils]: 73: Hoare triple {4692#false} assume { :end_inline_usbpn_driver_exit } true;~ldv_state_variable_0~0 := 2; {4692#false} is VALID [2022-02-20 22:06:09,459 INFO L290 TraceCheckUtils]: 74: Hoare triple {4692#false} assume { :begin_inline_ldv_check_final_state } true; {4692#false} is VALID [2022-02-20 22:06:09,459 INFO L290 TraceCheckUtils]: 75: Hoare triple {4692#false} assume 0 != (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616; {4692#false} is VALID [2022-02-20 22:06:09,459 INFO L272 TraceCheckUtils]: 76: Hoare triple {4692#false} call ldv_error(); {4692#false} is VALID [2022-02-20 22:06:09,459 INFO L290 TraceCheckUtils]: 77: Hoare triple {4692#false} assume !false; {4692#false} is VALID [2022-02-20 22:06:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-02-20 22:06:09,460 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:06:09,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673140672] [2022-02-20 22:06:09,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673140672] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:06:09,460 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:06:09,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:06:09,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077727357] [2022-02-20 22:06:09,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:06:09,461 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 78 [2022-02-20 22:06:09,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:06:09,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 22:06:09,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:06:09,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:06:09,498 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:06:09,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:06:09,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:06:09,499 INFO L87 Difference]: Start difference. First operand 592 states and 803 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 22:06:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:06:19,479 INFO L93 Difference]: Finished difference Result 1891 states and 2607 transitions. [2022-02-20 22:06:19,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 22:06:19,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 78 [2022-02-20 22:06:19,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:06:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 22:06:19,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2607 transitions. [2022-02-20 22:06:19,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 22:06:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2607 transitions. [2022-02-20 22:06:19,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 2607 transitions. [2022-02-20 22:06:21,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2607 edges. 2607 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:06:21,618 INFO L225 Difference]: With dead ends: 1891 [2022-02-20 22:06:21,618 INFO L226 Difference]: Without dead ends: 1317 [2022-02-20 22:06:21,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-20 22:06:21,621 INFO L933 BasicCegarLoop]: 861 mSDtfsCounter, 2124 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 906 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 906 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-02-20 22:06:21,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2209 Valid, 1882 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [906 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-02-20 22:06:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2022-02-20 22:06:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1143. [2022-02-20 22:06:21,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:06:21,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1317 states. Second operand has 1143 states, 864 states have (on average 1.3321759259259258) internal successors, (1151), 882 states have internal predecessors, (1151), 203 states have call successors, (203), 76 states have call predecessors, (203), 75 states have return successors, (198), 194 states have call predecessors, (198), 198 states have call successors, (198) [2022-02-20 22:06:21,679 INFO L74 IsIncluded]: Start isIncluded. First operand 1317 states. Second operand has 1143 states, 864 states have (on average 1.3321759259259258) internal successors, (1151), 882 states have internal predecessors, (1151), 203 states have call successors, (203), 76 states have call predecessors, (203), 75 states have return successors, (198), 194 states have call predecessors, (198), 198 states have call successors, (198) [2022-02-20 22:06:21,681 INFO L87 Difference]: Start difference. First operand 1317 states. Second operand has 1143 states, 864 states have (on average 1.3321759259259258) internal successors, (1151), 882 states have internal predecessors, (1151), 203 states have call successors, (203), 76 states have call predecessors, (203), 75 states have return successors, (198), 194 states have call predecessors, (198), 198 states have call successors, (198) [2022-02-20 22:06:21,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:06:21,765 INFO L93 Difference]: Finished difference Result 1317 states and 1824 transitions. [2022-02-20 22:06:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1824 transitions. [2022-02-20 22:06:21,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:06:21,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:06:21,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 1143 states, 864 states have (on average 1.3321759259259258) internal successors, (1151), 882 states have internal predecessors, (1151), 203 states have call successors, (203), 76 states have call predecessors, (203), 75 states have return successors, (198), 194 states have call predecessors, (198), 198 states have call successors, (198) Second operand 1317 states. [2022-02-20 22:06:21,774 INFO L87 Difference]: Start difference. First operand has 1143 states, 864 states have (on average 1.3321759259259258) internal successors, (1151), 882 states have internal predecessors, (1151), 203 states have call successors, (203), 76 states have call predecessors, (203), 75 states have return successors, (198), 194 states have call predecessors, (198), 198 states have call successors, (198) Second operand 1317 states. [2022-02-20 22:06:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:06:21,836 INFO L93 Difference]: Finished difference Result 1317 states and 1824 transitions. [2022-02-20 22:06:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1824 transitions. [2022-02-20 22:06:21,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:06:21,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:06:21,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:06:21,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:06:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 864 states have (on average 1.3321759259259258) internal successors, (1151), 882 states have internal predecessors, (1151), 203 states have call successors, (203), 76 states have call predecessors, (203), 75 states have return successors, (198), 194 states have call predecessors, (198), 198 states have call successors, (198) [2022-02-20 22:06:21,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1552 transitions. [2022-02-20 22:06:21,905 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1552 transitions. Word has length 78 [2022-02-20 22:06:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:06:21,906 INFO L470 AbstractCegarLoop]: Abstraction has 1143 states and 1552 transitions. [2022-02-20 22:06:21,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-02-20 22:06:21,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1552 transitions. [2022-02-20 22:06:21,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 22:06:21,909 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:06:21,909 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-02-20 22:06:21,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 22:06:21,909 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:06:21,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:06:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1125703583, now seen corresponding path program 1 times [2022-02-20 22:06:21,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:06:21,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836826249] [2022-02-20 22:06:21,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:06:21,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:06:21,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:22,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:06:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:22,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:22,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {11696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11619#true} is VALID [2022-02-20 22:06:22,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11619#true} {11619#true} #1456#return; {11619#true} is VALID [2022-02-20 22:06:22,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:22,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {11619#true} ~cond := #in~cond; {11619#true} is VALID [2022-02-20 22:06:22,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {11619#true} assume !(0 == ~cond); {11619#true} is VALID [2022-02-20 22:06:22,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11619#true} {11619#true} #1458#return; {11619#true} is VALID [2022-02-20 22:06:22,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {11688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {11619#true} is VALID [2022-02-20 22:06:22,095 INFO L272 TraceCheckUtils]: 1: Hoare triple {11619#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {11696#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:22,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {11696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11619#true} is VALID [2022-02-20 22:06:22,095 INFO L290 TraceCheckUtils]: 3: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,095 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11619#true} {11619#true} #1456#return; {11619#true} is VALID [2022-02-20 22:06:22,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {11619#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {11619#true} is VALID [2022-02-20 22:06:22,096 INFO L272 TraceCheckUtils]: 6: Hoare triple {11619#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11619#true} is VALID [2022-02-20 22:06:22,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {11619#true} ~cond := #in~cond; {11619#true} is VALID [2022-02-20 22:06:22,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {11619#true} assume !(0 == ~cond); {11619#true} is VALID [2022-02-20 22:06:22,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,096 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11619#true} {11619#true} #1458#return; {11619#true} is VALID [2022-02-20 22:06:22,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {11619#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11619#true} is VALID [2022-02-20 22:06:22,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,097 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11619#true} {11619#true} #1466#return; {11619#true} is VALID [2022-02-20 22:06:22,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:06:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:22,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:22,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {11696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11619#true} is VALID [2022-02-20 22:06:22,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11619#true} {11619#true} #1456#return; {11619#true} is VALID [2022-02-20 22:06:22,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:22,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {11619#true} ~cond := #in~cond; {11619#true} is VALID [2022-02-20 22:06:22,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {11619#true} assume !(0 == ~cond); {11619#true} is VALID [2022-02-20 22:06:22,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11619#true} {11619#true} #1458#return; {11619#true} is VALID [2022-02-20 22:06:22,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {11688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {11619#true} is VALID [2022-02-20 22:06:22,126 INFO L272 TraceCheckUtils]: 1: Hoare triple {11619#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {11696#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:22,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {11696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11619#true} is VALID [2022-02-20 22:06:22,126 INFO L290 TraceCheckUtils]: 3: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,126 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11619#true} {11619#true} #1456#return; {11619#true} is VALID [2022-02-20 22:06:22,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {11619#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {11619#true} is VALID [2022-02-20 22:06:22,127 INFO L272 TraceCheckUtils]: 6: Hoare triple {11619#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11619#true} is VALID [2022-02-20 22:06:22,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {11619#true} ~cond := #in~cond; {11619#true} is VALID [2022-02-20 22:06:22,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {11619#true} assume !(0 == ~cond); {11619#true} is VALID [2022-02-20 22:06:22,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,127 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11619#true} {11619#true} #1458#return; {11619#true} is VALID [2022-02-20 22:06:22,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {11619#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11619#true} is VALID [2022-02-20 22:06:22,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,127 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11619#true} {11619#true} #1468#return; {11619#true} is VALID [2022-02-20 22:06:22,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:06:22,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:22,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:22,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {11696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11619#true} is VALID [2022-02-20 22:06:22,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11619#true} {11619#true} #1456#return; {11619#true} is VALID [2022-02-20 22:06:22,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:22,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {11619#true} ~cond := #in~cond; {11619#true} is VALID [2022-02-20 22:06:22,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {11619#true} assume !(0 == ~cond); {11619#true} is VALID [2022-02-20 22:06:22,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11619#true} {11619#true} #1458#return; {11619#true} is VALID [2022-02-20 22:06:22,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {11688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {11619#true} is VALID [2022-02-20 22:06:22,153 INFO L272 TraceCheckUtils]: 1: Hoare triple {11619#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {11696#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:22,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {11696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11619#true} is VALID [2022-02-20 22:06:22,153 INFO L290 TraceCheckUtils]: 3: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,153 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11619#true} {11619#true} #1456#return; {11619#true} is VALID [2022-02-20 22:06:22,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {11619#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {11619#true} is VALID [2022-02-20 22:06:22,154 INFO L272 TraceCheckUtils]: 6: Hoare triple {11619#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11619#true} is VALID [2022-02-20 22:06:22,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {11619#true} ~cond := #in~cond; {11619#true} is VALID [2022-02-20 22:06:22,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {11619#true} assume !(0 == ~cond); {11619#true} is VALID [2022-02-20 22:06:22,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,155 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11619#true} {11619#true} #1458#return; {11619#true} is VALID [2022-02-20 22:06:22,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {11619#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11619#true} is VALID [2022-02-20 22:06:22,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,155 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11619#true} {11619#true} #1470#return; {11619#true} is VALID [2022-02-20 22:06:22,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:06:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:22,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {11711#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {11619#true} is VALID [2022-02-20 22:06:22,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {11619#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {11619#true} is VALID [2022-02-20 22:06:22,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {11619#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {11619#true} is VALID [2022-02-20 22:06:22,172 INFO L290 TraceCheckUtils]: 3: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,173 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11619#true} {11619#true} #1472#return; {11619#true} is VALID [2022-02-20 22:06:22,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-20 22:06:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:22,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {11711#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {11619#true} is VALID [2022-02-20 22:06:22,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {11619#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {11619#true} is VALID [2022-02-20 22:06:22,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {11619#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {11619#true} is VALID [2022-02-20 22:06:22,183 INFO L290 TraceCheckUtils]: 3: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,183 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11619#true} {11619#true} #1474#return; {11619#true} is VALID [2022-02-20 22:06:22,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-02-20 22:06:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:22,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:22,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {11696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11619#true} is VALID [2022-02-20 22:06:22,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11619#true} {11619#true} #1456#return; {11619#true} is VALID [2022-02-20 22:06:22,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:22,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {11619#true} ~cond := #in~cond; {11619#true} is VALID [2022-02-20 22:06:22,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {11619#true} assume !(0 == ~cond); {11619#true} is VALID [2022-02-20 22:06:22,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11619#true} {11619#true} #1458#return; {11619#true} is VALID [2022-02-20 22:06:22,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {11688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {11619#true} is VALID [2022-02-20 22:06:22,210 INFO L272 TraceCheckUtils]: 1: Hoare triple {11619#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {11696#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:22,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {11696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11619#true} is VALID [2022-02-20 22:06:22,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,211 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11619#true} {11619#true} #1456#return; {11619#true} is VALID [2022-02-20 22:06:22,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {11619#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {11619#true} is VALID [2022-02-20 22:06:22,211 INFO L272 TraceCheckUtils]: 6: Hoare triple {11619#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11619#true} is VALID [2022-02-20 22:06:22,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {11619#true} ~cond := #in~cond; {11619#true} is VALID [2022-02-20 22:06:22,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {11619#true} assume !(0 == ~cond); {11619#true} is VALID [2022-02-20 22:06:22,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,211 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11619#true} {11619#true} #1458#return; {11619#true} is VALID [2022-02-20 22:06:22,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {11619#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11619#true} is VALID [2022-02-20 22:06:22,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,212 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11619#true} {11619#true} #1520#return; {11619#true} is VALID [2022-02-20 22:06:22,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {11619#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(98, 2);call #Ultimate.allocInit(26, 3);call #Ultimate.allocInit(63, 4);call #Ultimate.allocInit(11, 5);call #Ultimate.allocInit(12, 6);call #Ultimate.allocInit(274, 7);call #Ultimate.allocInit(15, 8);call #Ultimate.allocInit(15, 9);call #Ultimate.allocInit(11, 10);call #Ultimate.allocInit(10, 11);call #Ultimate.allocInit(274, 12);call #Ultimate.allocInit(22, 13);call #Ultimate.allocInit(22, 14);call #Ultimate.allocInit(11, 15);call #Ultimate.allocInit(12, 16);call #Ultimate.allocInit(274, 17);call #Ultimate.allocInit(13, 18);call #Ultimate.allocInit(13, 19);call #Ultimate.allocInit(24, 20);call #Ultimate.allocInit(24, 21);call #Ultimate.allocInit(11, 22);call #Ultimate.allocInit(12, 23);call #Ultimate.allocInit(274, 24);call #Ultimate.allocInit(29, 25);call #Ultimate.allocInit(29, 26);call #Ultimate.allocInit(11, 27);call #Ultimate.allocInit(11, 28);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~usbpn_ops_group1~0.base, ~usbpn_ops_group1~0.offset := 0, 0;~usb_counter~0 := 0;~usbpn_driver_group1~0.base, ~usbpn_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~rxq_size~0 := 17;~#usbpn_ops~0.base, ~#usbpn_ops~0.offset := 29, 0;call #Ultimate.allocInit(376, 29);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 8 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_open.base, #funAddr~usbpn_open.offset, ~#usbpn_ops~0.base, 16 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_close.base, #funAddr~usbpn_close.offset, ~#usbpn_ops~0.base, 24 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_xmit.base, #funAddr~usbpn_xmit.offset, ~#usbpn_ops~0.base, 32 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 40 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 48 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 56 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 64 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 72 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_ioctl.base, #funAddr~usbpn_ioctl.offset, ~#usbpn_ops~0.base, 80 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 88 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_set_mtu.base, #funAddr~usbpn_set_mtu.offset, ~#usbpn_ops~0.base, 96 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 104 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 112 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 120 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 128 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 136 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 144 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 152 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 160 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 168 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 176 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 184 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 192 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 200 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 208 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 216 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 224 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 232 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 240 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 248 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 256 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 264 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 272 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 280 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 288 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 296 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 304 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 312 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 320 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 328 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 336 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 344 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 352 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 360 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 368 + ~#usbpn_ops~0.offset, 8);~#usbpn_ids~0.base, ~#usbpn_ids~0.offset := 30, 0;call #Ultimate.allocInit(50, 30);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#usbpn_ids~0.base);call write~unchecked~int(385, ~#usbpn_ids~0.base, ~#usbpn_ids~0.offset, 2);call write~unchecked~int(1057, ~#usbpn_ids~0.base, 2 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 4 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 6 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 8 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 10 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 11 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 12 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(2, ~#usbpn_ids~0.base, 13 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(254, ~#usbpn_ids~0.base, 14 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 15 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 16 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 17 + ~#usbpn_ids~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;~#usbpn_driver~0.base, ~#usbpn_driver~0.offset := 31, 0;call #Ultimate.allocInit(277, 31);call write~init~$Pointer$(27, 0, ~#usbpn_driver~0.base, ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_probe.base, #funAddr~usbpn_probe.offset, ~#usbpn_driver~0.base, 8 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_disconnect.base, #funAddr~usbpn_disconnect.offset, ~#usbpn_driver~0.base, 16 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 24 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 32 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 40 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 48 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 56 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 64 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(~#usbpn_ids~0.base, ~#usbpn_ids~0.offset, ~#usbpn_driver~0.base, 72 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 80 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 84 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 88 + ~#usbpn_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 92 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 100 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 108 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 116 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 124 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 132 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 136 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 148 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 156 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 164 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 172 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 180 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 188 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 196 + ~#usbpn_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 197 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 205 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 213 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 221 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 229 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 237 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 245 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 253 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 261 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 269 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 273 + ~#usbpn_driver~0.offset, 1);call write~init~int(0, ~#usbpn_driver~0.base, 274 + ~#usbpn_driver~0.offset, 1);call write~init~int(1, ~#usbpn_driver~0.base, 275 + ~#usbpn_driver~0.offset, 1);call write~init~int(0, ~#usbpn_driver~0.base, 276 + ~#usbpn_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~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; {11619#true} is VALID [2022-02-20 22:06:22,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {11619#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret270#1.base, main_#t~ret270#1.offset, main_#t~ret271#1.base, main_#t~ret271#1.offset, main_#t~ret272#1.base, main_#t~ret272#1.offset, main_#t~ret273#1.base, main_#t~ret273#1.offset, main_#t~ret274#1.base, main_#t~ret274#1.offset, main_#t~nondet275#1, main_#t~switch276#1, main_#t~nondet277#1, main_#t~switch278#1, main_#t~ret279#1, main_#t~nondet280#1, main_#t~switch281#1, main_#t~ret282#1, main_#t~nondet283#1, main_#t~switch284#1, main_#t~ret285#1, main_#t~mem286#1, main_#t~ret287#1, main_#t~mem288#1, main_#t~ret289#1, main_#t~mem290#1, main_#t~ret291#1, main_#t~mem292#1, main_#t~ret293#1, main_#t~mem294#1, main_#t~ret295#1, main_#t~ret296#1, main_#t~ret297#1, main_#t~ret298#1, main_#t~ret299#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~28#1.base, main_~tmp~28#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___2~2#1, main_~tmp___3~2#1, main_~tmp___4~2#1, main_~tmp___5~2#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~28#1.base, main_~tmp~28#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___2~2#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1;havoc main_~tmp___5~2#1; {11619#true} is VALID [2022-02-20 22:06:22,213 INFO L272 TraceCheckUtils]: 2: Hoare triple {11619#true} call main_#t~ret270#1.base, main_#t~ret270#1.offset := ldv_init_zalloc(32); {11688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:22,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {11688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {11619#true} is VALID [2022-02-20 22:06:22,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {11619#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {11696#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:22,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {11696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11619#true} is VALID [2022-02-20 22:06:22,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,215 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11619#true} {11619#true} #1456#return; {11619#true} is VALID [2022-02-20 22:06:22,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {11619#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {11619#true} is VALID [2022-02-20 22:06:22,215 INFO L272 TraceCheckUtils]: 9: Hoare triple {11619#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11619#true} is VALID [2022-02-20 22:06:22,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {11619#true} ~cond := #in~cond; {11619#true} is VALID [2022-02-20 22:06:22,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {11619#true} assume !(0 == ~cond); {11619#true} is VALID [2022-02-20 22:06:22,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,215 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11619#true} {11619#true} #1458#return; {11619#true} is VALID [2022-02-20 22:06:22,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {11619#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11619#true} is VALID [2022-02-20 22:06:22,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,216 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {11619#true} {11619#true} #1466#return; {11619#true} is VALID [2022-02-20 22:06:22,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {11619#true} main_~tmp~28#1.base, main_~tmp~28#1.offset := main_#t~ret270#1.base, main_#t~ret270#1.offset;havoc main_#t~ret270#1.base, main_#t~ret270#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~28#1.base, main_~tmp~28#1.offset; {11619#true} is VALID [2022-02-20 22:06:22,216 INFO L272 TraceCheckUtils]: 18: Hoare triple {11619#true} call main_#t~ret271#1.base, main_#t~ret271#1.offset := ldv_init_zalloc(240); {11688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:22,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {11688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {11619#true} is VALID [2022-02-20 22:06:22,217 INFO L272 TraceCheckUtils]: 20: Hoare triple {11619#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {11696#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:22,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {11696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11619#true} is VALID [2022-02-20 22:06:22,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,217 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11619#true} {11619#true} #1456#return; {11619#true} is VALID [2022-02-20 22:06:22,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {11619#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {11619#true} is VALID [2022-02-20 22:06:22,218 INFO L272 TraceCheckUtils]: 25: Hoare triple {11619#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11619#true} is VALID [2022-02-20 22:06:22,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {11619#true} ~cond := #in~cond; {11619#true} is VALID [2022-02-20 22:06:22,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {11619#true} assume !(0 == ~cond); {11619#true} is VALID [2022-02-20 22:06:22,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,218 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {11619#true} {11619#true} #1458#return; {11619#true} is VALID [2022-02-20 22:06:22,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {11619#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11619#true} is VALID [2022-02-20 22:06:22,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,219 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {11619#true} {11619#true} #1468#return; {11619#true} is VALID [2022-02-20 22:06:22,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {11619#true} main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset := main_#t~ret271#1.base, main_#t~ret271#1.offset;havoc main_#t~ret271#1.base, main_#t~ret271#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset; {11619#true} is VALID [2022-02-20 22:06:22,220 INFO L272 TraceCheckUtils]: 34: Hoare triple {11619#true} call main_#t~ret272#1.base, main_#t~ret272#1.offset := ldv_init_zalloc(40); {11688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:22,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {11688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {11619#true} is VALID [2022-02-20 22:06:22,221 INFO L272 TraceCheckUtils]: 36: Hoare triple {11619#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {11696#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:22,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {11696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11619#true} is VALID [2022-02-20 22:06:22,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,221 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11619#true} {11619#true} #1456#return; {11619#true} is VALID [2022-02-20 22:06:22,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {11619#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {11619#true} is VALID [2022-02-20 22:06:22,221 INFO L272 TraceCheckUtils]: 41: Hoare triple {11619#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11619#true} is VALID [2022-02-20 22:06:22,222 INFO L290 TraceCheckUtils]: 42: Hoare triple {11619#true} ~cond := #in~cond; {11619#true} is VALID [2022-02-20 22:06:22,222 INFO L290 TraceCheckUtils]: 43: Hoare triple {11619#true} assume !(0 == ~cond); {11619#true} is VALID [2022-02-20 22:06:22,222 INFO L290 TraceCheckUtils]: 44: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,222 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11619#true} {11619#true} #1458#return; {11619#true} is VALID [2022-02-20 22:06:22,222 INFO L290 TraceCheckUtils]: 46: Hoare triple {11619#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11619#true} is VALID [2022-02-20 22:06:22,222 INFO L290 TraceCheckUtils]: 47: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,222 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {11619#true} {11619#true} #1470#return; {11619#true} is VALID [2022-02-20 22:06:22,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {11619#true} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret272#1.base, main_#t~ret272#1.offset;havoc main_#t~ret272#1.base, main_#t~ret272#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;assume { :begin_inline_ldv_initialize } true; {11619#true} is VALID [2022-02-20 22:06:22,223 INFO L290 TraceCheckUtils]: 50: Hoare triple {11619#true} assume { :end_inline_ldv_initialize } true; {11619#true} is VALID [2022-02-20 22:06:22,223 INFO L272 TraceCheckUtils]: 51: Hoare triple {11619#true} call main_#t~ret273#1.base, main_#t~ret273#1.offset := ldv_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 4); {11711#(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:22,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {11711#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {11619#true} is VALID [2022-02-20 22:06:22,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {11619#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {11619#true} is VALID [2022-02-20 22:06:22,224 INFO L290 TraceCheckUtils]: 54: Hoare triple {11619#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {11619#true} is VALID [2022-02-20 22:06:22,224 INFO L290 TraceCheckUtils]: 55: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,224 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {11619#true} {11619#true} #1472#return; {11619#true} is VALID [2022-02-20 22:06:22,224 INFO L290 TraceCheckUtils]: 57: Hoare triple {11619#true} havoc main_#t~ret273#1.base, main_#t~ret273#1.offset; {11619#true} is VALID [2022-02-20 22:06:22,225 INFO L272 TraceCheckUtils]: 58: Hoare triple {11619#true} call main_#t~ret274#1.base, main_#t~ret274#1.offset := ldv_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {11711#(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:22,225 INFO L290 TraceCheckUtils]: 59: Hoare triple {11711#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {11619#true} is VALID [2022-02-20 22:06:22,225 INFO L290 TraceCheckUtils]: 60: Hoare triple {11619#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {11619#true} is VALID [2022-02-20 22:06:22,225 INFO L290 TraceCheckUtils]: 61: Hoare triple {11619#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {11619#true} is VALID [2022-02-20 22:06:22,225 INFO L290 TraceCheckUtils]: 62: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,225 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {11619#true} {11619#true} #1474#return; {11619#true} is VALID [2022-02-20 22:06:22,225 INFO L290 TraceCheckUtils]: 64: Hoare triple {11619#true} havoc main_#t~ret274#1.base, main_#t~ret274#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {11619#true} is VALID [2022-02-20 22:06:22,225 INFO L290 TraceCheckUtils]: 65: Hoare triple {11619#true} assume -2147483648 <= main_#t~nondet275#1 && main_#t~nondet275#1 <= 2147483647;main_~tmp___2~2#1 := main_#t~nondet275#1;havoc main_#t~nondet275#1;main_#t~switch276#1 := 0 == main_~tmp___2~2#1; {11619#true} is VALID [2022-02-20 22:06:22,226 INFO L290 TraceCheckUtils]: 66: Hoare triple {11619#true} assume !main_#t~switch276#1;main_#t~switch276#1 := main_#t~switch276#1 || 1 == main_~tmp___2~2#1; {11619#true} is VALID [2022-02-20 22:06:22,226 INFO L290 TraceCheckUtils]: 67: Hoare triple {11619#true} assume main_#t~switch276#1; {11619#true} is VALID [2022-02-20 22:06:22,226 INFO L290 TraceCheckUtils]: 68: Hoare triple {11619#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet280#1 && main_#t~nondet280#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet280#1;havoc main_#t~nondet280#1;main_#t~switch281#1 := 0 == main_~tmp___4~2#1; {11619#true} is VALID [2022-02-20 22:06:22,227 INFO L290 TraceCheckUtils]: 69: Hoare triple {11619#true} assume !main_#t~switch281#1;main_#t~switch281#1 := main_#t~switch281#1 || 1 == main_~tmp___4~2#1; {11619#true} is VALID [2022-02-20 22:06:22,227 INFO L290 TraceCheckUtils]: 70: Hoare triple {11619#true} assume main_#t~switch281#1; {11619#true} is VALID [2022-02-20 22:06:22,227 INFO L290 TraceCheckUtils]: 71: Hoare triple {11619#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_usbpn_driver_init } true;havoc usbpn_driver_init_#res#1;havoc usbpn_driver_init_#t~ret267#1, usbpn_driver_init_~tmp~25#1;havoc usbpn_driver_init_~tmp~25#1;assume { :begin_inline_ldv_usb_register_driver_17 } true;ldv_usb_register_driver_17_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_17_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_17_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg3#1.offset := ~#usbpn_driver~0.base, ~#usbpn_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 28, 0;havoc ldv_usb_register_driver_17_#res#1;havoc ldv_usb_register_driver_17_#t~ret307#1, ldv_usb_register_driver_17_~ldv_func_arg1#1.base, ldv_usb_register_driver_17_~ldv_func_arg1#1.offset, ldv_usb_register_driver_17_~ldv_func_arg2#1.base, ldv_usb_register_driver_17_~ldv_func_arg2#1.offset, ldv_usb_register_driver_17_~ldv_func_arg3#1.base, ldv_usb_register_driver_17_~ldv_func_arg3#1.offset, ldv_usb_register_driver_17_~ldv_func_res~1#1, ldv_usb_register_driver_17_~tmp~36#1;ldv_usb_register_driver_17_~ldv_func_arg1#1.base, ldv_usb_register_driver_17_~ldv_func_arg1#1.offset := ldv_usb_register_driver_17_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_17_~ldv_func_arg2#1.base, ldv_usb_register_driver_17_~ldv_func_arg2#1.offset := ldv_usb_register_driver_17_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_17_~ldv_func_arg3#1.base, ldv_usb_register_driver_17_~ldv_func_arg3#1.offset := ldv_usb_register_driver_17_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_17_~ldv_func_res~1#1;havoc ldv_usb_register_driver_17_~tmp~36#1;assume { :begin_inline_usb_register_driver } true;usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset, usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset, usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset := ldv_usb_register_driver_17_~ldv_func_arg1#1.base, ldv_usb_register_driver_17_~ldv_func_arg1#1.offset, ldv_usb_register_driver_17_~ldv_func_arg2#1.base, ldv_usb_register_driver_17_~ldv_func_arg2#1.offset, ldv_usb_register_driver_17_~ldv_func_arg3#1.base, ldv_usb_register_driver_17_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet336#1, usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset, usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset, usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset;usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset := usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset;usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset := usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset;usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset := usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset;assume -2147483648 <= usb_register_driver_#t~nondet336#1 && usb_register_driver_#t~nondet336#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet336#1;havoc usb_register_driver_#t~nondet336#1; {11619#true} is VALID [2022-02-20 22:06:22,227 INFO L290 TraceCheckUtils]: 72: Hoare triple {11619#true} ldv_usb_register_driver_17_#t~ret307#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_17_#t~ret307#1 && ldv_usb_register_driver_17_#t~ret307#1 <= 2147483647;ldv_usb_register_driver_17_~tmp~36#1 := ldv_usb_register_driver_17_#t~ret307#1;havoc ldv_usb_register_driver_17_#t~ret307#1;ldv_usb_register_driver_17_~ldv_func_res~1#1 := ldv_usb_register_driver_17_~tmp~36#1;~ldv_state_variable_1~0 := 1;~usb_counter~0 := 0;assume { :begin_inline_ldv_usb_driver_1 } true;havoc ldv_usb_driver_1_#t~ret268#1.base, ldv_usb_driver_1_#t~ret268#1.offset, ldv_usb_driver_1_~tmp~26#1.base, ldv_usb_driver_1_~tmp~26#1.offset;havoc ldv_usb_driver_1_~tmp~26#1.base, ldv_usb_driver_1_~tmp~26#1.offset; {11619#true} is VALID [2022-02-20 22:06:22,228 INFO L272 TraceCheckUtils]: 73: Hoare triple {11619#true} call ldv_usb_driver_1_#t~ret268#1.base, ldv_usb_driver_1_#t~ret268#1.offset := ldv_init_zalloc(1288); {11688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:22,228 INFO L290 TraceCheckUtils]: 74: Hoare triple {11688#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {11619#true} is VALID [2022-02-20 22:06:22,228 INFO L272 TraceCheckUtils]: 75: Hoare triple {11619#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {11696#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:22,229 INFO L290 TraceCheckUtils]: 76: Hoare triple {11696#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {11619#true} is VALID [2022-02-20 22:06:22,229 INFO L290 TraceCheckUtils]: 77: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,229 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {11619#true} {11619#true} #1456#return; {11619#true} is VALID [2022-02-20 22:06:22,229 INFO L290 TraceCheckUtils]: 79: Hoare triple {11619#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {11619#true} is VALID [2022-02-20 22:06:22,229 INFO L272 TraceCheckUtils]: 80: Hoare triple {11619#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {11619#true} is VALID [2022-02-20 22:06:22,229 INFO L290 TraceCheckUtils]: 81: Hoare triple {11619#true} ~cond := #in~cond; {11619#true} is VALID [2022-02-20 22:06:22,229 INFO L290 TraceCheckUtils]: 82: Hoare triple {11619#true} assume !(0 == ~cond); {11619#true} is VALID [2022-02-20 22:06:22,229 INFO L290 TraceCheckUtils]: 83: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,230 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {11619#true} {11619#true} #1458#return; {11619#true} is VALID [2022-02-20 22:06:22,230 INFO L290 TraceCheckUtils]: 85: Hoare triple {11619#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {11619#true} is VALID [2022-02-20 22:06:22,230 INFO L290 TraceCheckUtils]: 86: Hoare triple {11619#true} assume true; {11619#true} is VALID [2022-02-20 22:06:22,230 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {11619#true} {11619#true} #1520#return; {11619#true} is VALID [2022-02-20 22:06:22,230 INFO L290 TraceCheckUtils]: 88: Hoare triple {11619#true} ldv_usb_driver_1_~tmp~26#1.base, ldv_usb_driver_1_~tmp~26#1.offset := ldv_usb_driver_1_#t~ret268#1.base, ldv_usb_driver_1_#t~ret268#1.offset;havoc ldv_usb_driver_1_#t~ret268#1.base, ldv_usb_driver_1_#t~ret268#1.offset;~usbpn_driver_group1~0.base, ~usbpn_driver_group1~0.offset := ldv_usb_driver_1_~tmp~26#1.base, ldv_usb_driver_1_~tmp~26#1.offset; {11619#true} is VALID [2022-02-20 22:06:22,230 INFO L290 TraceCheckUtils]: 89: Hoare triple {11619#true} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_17_#res#1 := ldv_usb_register_driver_17_~ldv_func_res~1#1; {11619#true} is VALID [2022-02-20 22:06:22,231 INFO L290 TraceCheckUtils]: 90: Hoare triple {11619#true} usbpn_driver_init_#t~ret267#1 := ldv_usb_register_driver_17_#res#1;assume { :end_inline_ldv_usb_register_driver_17 } true;assume -2147483648 <= usbpn_driver_init_#t~ret267#1 && usbpn_driver_init_#t~ret267#1 <= 2147483647;usbpn_driver_init_~tmp~25#1 := usbpn_driver_init_#t~ret267#1;havoc usbpn_driver_init_#t~ret267#1;usbpn_driver_init_#res#1 := usbpn_driver_init_~tmp~25#1; {11619#true} is VALID [2022-02-20 22:06:22,231 INFO L290 TraceCheckUtils]: 91: Hoare triple {11619#true} main_#t~ret282#1 := usbpn_driver_init_#res#1;assume { :end_inline_usbpn_driver_init } true;assume -2147483648 <= main_#t~ret282#1 && main_#t~ret282#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret282#1;havoc main_#t~ret282#1; {11619#true} is VALID [2022-02-20 22:06:22,232 INFO L290 TraceCheckUtils]: 92: Hoare triple {11619#true} assume 0 == ~ldv_retval_1~0;~ldv_state_variable_0~0 := 3; {11687#(= ~ldv_retval_1~0 0)} is VALID [2022-02-20 22:06:22,236 INFO L290 TraceCheckUtils]: 93: Hoare triple {11687#(= ~ldv_retval_1~0 0)} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {11620#false} is VALID [2022-02-20 22:06:22,236 INFO L290 TraceCheckUtils]: 94: Hoare triple {11620#false} assume { :begin_inline_ldv_check_final_state } true; {11620#false} is VALID [2022-02-20 22:06:22,236 INFO L290 TraceCheckUtils]: 95: Hoare triple {11620#false} assume 0 != (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616; {11620#false} is VALID [2022-02-20 22:06:22,236 INFO L272 TraceCheckUtils]: 96: Hoare triple {11620#false} call ldv_error(); {11620#false} is VALID [2022-02-20 22:06:22,236 INFO L290 TraceCheckUtils]: 97: Hoare triple {11620#false} assume !false; {11620#false} is VALID [2022-02-20 22:06:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-02-20 22:06:22,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:06:22,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836826249] [2022-02-20 22:06:22,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836826249] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:06:22,238 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:06:22,238 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:06:22,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003260010] [2022-02-20 22:06:22,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:06:22,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 98 [2022-02-20 22:06:22,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:06:22,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:06:22,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:06:22,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:06:22,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:06:22,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:06:22,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:06:22,290 INFO L87 Difference]: Start difference. First operand 1143 states and 1552 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:06:26,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:06:29,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:06:29,132 INFO L93 Difference]: Finished difference Result 1347 states and 1866 transitions. [2022-02-20 22:06:29,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 22:06:29,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 98 [2022-02-20 22:06:29,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:06:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:06:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 981 transitions. [2022-02-20 22:06:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:06:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 981 transitions. [2022-02-20 22:06:29,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 981 transitions. [2022-02-20 22:06:29,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 981 edges. 981 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:06:30,013 INFO L225 Difference]: With dead ends: 1347 [2022-02-20 22:06:30,014 INFO L226 Difference]: Without dead ends: 1334 [2022-02-20 22:06:30,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-20 22:06:30,015 INFO L933 BasicCegarLoop]: 785 mSDtfsCounter, 1172 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 378 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-02-20 22:06:30,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1243 Valid, 1545 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 446 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-02-20 22:06:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2022-02-20 22:06:30,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1143. [2022-02-20 22:06:30,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:06:30,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1334 states. Second operand has 1143 states, 864 states have (on average 1.3310185185185186) internal successors, (1150), 882 states have internal predecessors, (1150), 203 states have call successors, (203), 76 states have call predecessors, (203), 75 states have return successors, (198), 194 states have call predecessors, (198), 198 states have call successors, (198) [2022-02-20 22:06:30,052 INFO L74 IsIncluded]: Start isIncluded. First operand 1334 states. Second operand has 1143 states, 864 states have (on average 1.3310185185185186) internal successors, (1150), 882 states have internal predecessors, (1150), 203 states have call successors, (203), 76 states have call predecessors, (203), 75 states have return successors, (198), 194 states have call predecessors, (198), 198 states have call successors, (198) [2022-02-20 22:06:30,054 INFO L87 Difference]: Start difference. First operand 1334 states. Second operand has 1143 states, 864 states have (on average 1.3310185185185186) internal successors, (1150), 882 states have internal predecessors, (1150), 203 states have call successors, (203), 76 states have call predecessors, (203), 75 states have return successors, (198), 194 states have call predecessors, (198), 198 states have call successors, (198) [2022-02-20 22:06:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:06:30,112 INFO L93 Difference]: Finished difference Result 1334 states and 1849 transitions. [2022-02-20 22:06:30,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1849 transitions. [2022-02-20 22:06:30,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:06:30,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:06:30,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 1143 states, 864 states have (on average 1.3310185185185186) internal successors, (1150), 882 states have internal predecessors, (1150), 203 states have call successors, (203), 76 states have call predecessors, (203), 75 states have return successors, (198), 194 states have call predecessors, (198), 198 states have call successors, (198) Second operand 1334 states. [2022-02-20 22:06:30,121 INFO L87 Difference]: Start difference. First operand has 1143 states, 864 states have (on average 1.3310185185185186) internal successors, (1150), 882 states have internal predecessors, (1150), 203 states have call successors, (203), 76 states have call predecessors, (203), 75 states have return successors, (198), 194 states have call predecessors, (198), 198 states have call successors, (198) Second operand 1334 states. [2022-02-20 22:06:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:06:30,180 INFO L93 Difference]: Finished difference Result 1334 states and 1849 transitions. [2022-02-20 22:06:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1849 transitions. [2022-02-20 22:06:30,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:06:30,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:06:30,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:06:30,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:06:30,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 864 states have (on average 1.3310185185185186) internal successors, (1150), 882 states have internal predecessors, (1150), 203 states have call successors, (203), 76 states have call predecessors, (203), 75 states have return successors, (198), 194 states have call predecessors, (198), 198 states have call successors, (198) [2022-02-20 22:06:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1551 transitions. [2022-02-20 22:06:30,247 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1551 transitions. Word has length 98 [2022-02-20 22:06:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:06:30,247 INFO L470 AbstractCegarLoop]: Abstraction has 1143 states and 1551 transitions. [2022-02-20 22:06:30,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 22:06:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1551 transitions. [2022-02-20 22:06:30,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 22:06:30,250 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:06:30,250 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-02-20 22:06:30,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 22:06:30,250 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:06:30,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:06:30,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1068445281, now seen corresponding path program 1 times [2022-02-20 22:06:30,251 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:06:30,251 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777305522] [2022-02-20 22:06:30,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:06:30,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:06:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:30,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:06:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:30,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:30,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {17921#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17844#true} is VALID [2022-02-20 22:06:30,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,426 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17844#true} {17844#true} #1456#return; {17844#true} is VALID [2022-02-20 22:06:30,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:30,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {17844#true} ~cond := #in~cond; {17844#true} is VALID [2022-02-20 22:06:30,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {17844#true} assume !(0 == ~cond); {17844#true} is VALID [2022-02-20 22:06:30,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17844#true} {17844#true} #1458#return; {17844#true} is VALID [2022-02-20 22:06:30,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {17913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {17844#true} is VALID [2022-02-20 22:06:30,433 INFO L272 TraceCheckUtils]: 1: Hoare triple {17844#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {17921#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:30,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {17921#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17844#true} is VALID [2022-02-20 22:06:30,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,433 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17844#true} {17844#true} #1456#return; {17844#true} is VALID [2022-02-20 22:06:30,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {17844#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {17844#true} is VALID [2022-02-20 22:06:30,434 INFO L272 TraceCheckUtils]: 6: Hoare triple {17844#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {17844#true} is VALID [2022-02-20 22:06:30,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {17844#true} ~cond := #in~cond; {17844#true} is VALID [2022-02-20 22:06:30,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {17844#true} assume !(0 == ~cond); {17844#true} is VALID [2022-02-20 22:06:30,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,434 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17844#true} {17844#true} #1458#return; {17844#true} is VALID [2022-02-20 22:06:30,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {17844#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {17844#true} is VALID [2022-02-20 22:06:30,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,435 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {17844#true} {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1466#return; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:06:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:30,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:30,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:30,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {17921#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17844#true} is VALID [2022-02-20 22:06:30,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17844#true} {17844#true} #1456#return; {17844#true} is VALID [2022-02-20 22:06:30,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:30,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:30,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {17844#true} ~cond := #in~cond; {17844#true} is VALID [2022-02-20 22:06:30,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {17844#true} assume !(0 == ~cond); {17844#true} is VALID [2022-02-20 22:06:30,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17844#true} {17844#true} #1458#return; {17844#true} is VALID [2022-02-20 22:06:30,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {17913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {17844#true} is VALID [2022-02-20 22:06:30,462 INFO L272 TraceCheckUtils]: 1: Hoare triple {17844#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {17921#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:30,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {17921#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17844#true} is VALID [2022-02-20 22:06:30,462 INFO L290 TraceCheckUtils]: 3: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,462 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17844#true} {17844#true} #1456#return; {17844#true} is VALID [2022-02-20 22:06:30,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {17844#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {17844#true} is VALID [2022-02-20 22:06:30,463 INFO L272 TraceCheckUtils]: 6: Hoare triple {17844#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {17844#true} is VALID [2022-02-20 22:06:30,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {17844#true} ~cond := #in~cond; {17844#true} is VALID [2022-02-20 22:06:30,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {17844#true} assume !(0 == ~cond); {17844#true} is VALID [2022-02-20 22:06:30,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,463 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17844#true} {17844#true} #1458#return; {17844#true} is VALID [2022-02-20 22:06:30,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {17844#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {17844#true} is VALID [2022-02-20 22:06:30,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,464 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {17844#true} {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1468#return; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:06:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:30,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:30,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {17921#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17844#true} is VALID [2022-02-20 22:06:30,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17844#true} {17844#true} #1456#return; {17844#true} is VALID [2022-02-20 22:06:30,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:30,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {17844#true} ~cond := #in~cond; {17844#true} is VALID [2022-02-20 22:06:30,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {17844#true} assume !(0 == ~cond); {17844#true} is VALID [2022-02-20 22:06:30,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17844#true} {17844#true} #1458#return; {17844#true} is VALID [2022-02-20 22:06:30,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {17913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {17844#true} is VALID [2022-02-20 22:06:30,487 INFO L272 TraceCheckUtils]: 1: Hoare triple {17844#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {17921#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:30,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {17921#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17844#true} is VALID [2022-02-20 22:06:30,487 INFO L290 TraceCheckUtils]: 3: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,487 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17844#true} {17844#true} #1456#return; {17844#true} is VALID [2022-02-20 22:06:30,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {17844#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {17844#true} is VALID [2022-02-20 22:06:30,487 INFO L272 TraceCheckUtils]: 6: Hoare triple {17844#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {17844#true} is VALID [2022-02-20 22:06:30,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {17844#true} ~cond := #in~cond; {17844#true} is VALID [2022-02-20 22:06:30,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {17844#true} assume !(0 == ~cond); {17844#true} is VALID [2022-02-20 22:06:30,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,488 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17844#true} {17844#true} #1458#return; {17844#true} is VALID [2022-02-20 22:06:30,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {17844#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {17844#true} is VALID [2022-02-20 22:06:30,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,489 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {17844#true} {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1470#return; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:06:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:30,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {17936#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {17844#true} is VALID [2022-02-20 22:06:30,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {17844#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {17844#true} is VALID [2022-02-20 22:06:30,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {17844#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {17844#true} is VALID [2022-02-20 22:06:30,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,510 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17844#true} {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1472#return; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-20 22:06:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:30,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {17936#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {17844#true} is VALID [2022-02-20 22:06:30,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {17844#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {17844#true} is VALID [2022-02-20 22:06:30,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {17844#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {17844#true} is VALID [2022-02-20 22:06:30,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,524 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17844#true} {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1474#return; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-02-20 22:06:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:30,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:30,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {17921#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17844#true} is VALID [2022-02-20 22:06:30,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,544 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17844#true} {17844#true} #1456#return; {17844#true} is VALID [2022-02-20 22:06:30,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:30,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {17844#true} ~cond := #in~cond; {17844#true} is VALID [2022-02-20 22:06:30,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {17844#true} assume !(0 == ~cond); {17844#true} is VALID [2022-02-20 22:06:30,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17844#true} {17844#true} #1458#return; {17844#true} is VALID [2022-02-20 22:06:30,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {17913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {17844#true} is VALID [2022-02-20 22:06:30,554 INFO L272 TraceCheckUtils]: 1: Hoare triple {17844#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {17921#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:30,554 INFO L290 TraceCheckUtils]: 2: Hoare triple {17921#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17844#true} is VALID [2022-02-20 22:06:30,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,554 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {17844#true} {17844#true} #1456#return; {17844#true} is VALID [2022-02-20 22:06:30,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {17844#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {17844#true} is VALID [2022-02-20 22:06:30,555 INFO L272 TraceCheckUtils]: 6: Hoare triple {17844#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {17844#true} is VALID [2022-02-20 22:06:30,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {17844#true} ~cond := #in~cond; {17844#true} is VALID [2022-02-20 22:06:30,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {17844#true} assume !(0 == ~cond); {17844#true} is VALID [2022-02-20 22:06:30,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,555 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17844#true} {17844#true} #1458#return; {17844#true} is VALID [2022-02-20 22:06:30,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {17844#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {17844#true} is VALID [2022-02-20 22:06:30,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,556 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {17844#true} {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1520#return; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {17844#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(98, 2);call #Ultimate.allocInit(26, 3);call #Ultimate.allocInit(63, 4);call #Ultimate.allocInit(11, 5);call #Ultimate.allocInit(12, 6);call #Ultimate.allocInit(274, 7);call #Ultimate.allocInit(15, 8);call #Ultimate.allocInit(15, 9);call #Ultimate.allocInit(11, 10);call #Ultimate.allocInit(10, 11);call #Ultimate.allocInit(274, 12);call #Ultimate.allocInit(22, 13);call #Ultimate.allocInit(22, 14);call #Ultimate.allocInit(11, 15);call #Ultimate.allocInit(12, 16);call #Ultimate.allocInit(274, 17);call #Ultimate.allocInit(13, 18);call #Ultimate.allocInit(13, 19);call #Ultimate.allocInit(24, 20);call #Ultimate.allocInit(24, 21);call #Ultimate.allocInit(11, 22);call #Ultimate.allocInit(12, 23);call #Ultimate.allocInit(274, 24);call #Ultimate.allocInit(29, 25);call #Ultimate.allocInit(29, 26);call #Ultimate.allocInit(11, 27);call #Ultimate.allocInit(11, 28);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~usbpn_ops_group1~0.base, ~usbpn_ops_group1~0.offset := 0, 0;~usb_counter~0 := 0;~usbpn_driver_group1~0.base, ~usbpn_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~rxq_size~0 := 17;~#usbpn_ops~0.base, ~#usbpn_ops~0.offset := 29, 0;call #Ultimate.allocInit(376, 29);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 8 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_open.base, #funAddr~usbpn_open.offset, ~#usbpn_ops~0.base, 16 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_close.base, #funAddr~usbpn_close.offset, ~#usbpn_ops~0.base, 24 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_xmit.base, #funAddr~usbpn_xmit.offset, ~#usbpn_ops~0.base, 32 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 40 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 48 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 56 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 64 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 72 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_ioctl.base, #funAddr~usbpn_ioctl.offset, ~#usbpn_ops~0.base, 80 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 88 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_set_mtu.base, #funAddr~usbpn_set_mtu.offset, ~#usbpn_ops~0.base, 96 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 104 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 112 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 120 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 128 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 136 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 144 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 152 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 160 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 168 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 176 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 184 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 192 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 200 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 208 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 216 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 224 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 232 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 240 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 248 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 256 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 264 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 272 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 280 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 288 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 296 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 304 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 312 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 320 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 328 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 336 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 344 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 352 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 360 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 368 + ~#usbpn_ops~0.offset, 8);~#usbpn_ids~0.base, ~#usbpn_ids~0.offset := 30, 0;call #Ultimate.allocInit(50, 30);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#usbpn_ids~0.base);call write~unchecked~int(385, ~#usbpn_ids~0.base, ~#usbpn_ids~0.offset, 2);call write~unchecked~int(1057, ~#usbpn_ids~0.base, 2 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 4 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 6 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 8 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 10 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 11 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 12 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(2, ~#usbpn_ids~0.base, 13 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(254, ~#usbpn_ids~0.base, 14 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 15 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 16 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 17 + ~#usbpn_ids~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;~#usbpn_driver~0.base, ~#usbpn_driver~0.offset := 31, 0;call #Ultimate.allocInit(277, 31);call write~init~$Pointer$(27, 0, ~#usbpn_driver~0.base, ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_probe.base, #funAddr~usbpn_probe.offset, ~#usbpn_driver~0.base, 8 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_disconnect.base, #funAddr~usbpn_disconnect.offset, ~#usbpn_driver~0.base, 16 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 24 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 32 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 40 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 48 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 56 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 64 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(~#usbpn_ids~0.base, ~#usbpn_ids~0.offset, ~#usbpn_driver~0.base, 72 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 80 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 84 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 88 + ~#usbpn_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 92 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 100 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 108 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 116 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 124 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 132 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 136 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 148 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 156 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 164 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 172 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 180 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 188 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 196 + ~#usbpn_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 197 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 205 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 213 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 221 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 229 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 237 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 245 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 253 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 261 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 269 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 273 + ~#usbpn_driver~0.offset, 1);call write~init~int(0, ~#usbpn_driver~0.base, 274 + ~#usbpn_driver~0.offset, 1);call write~init~int(1, ~#usbpn_driver~0.base, 275 + ~#usbpn_driver~0.offset, 1);call write~init~int(0, ~#usbpn_driver~0.base, 276 + ~#usbpn_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~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; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {17846#(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~ret270#1.base, main_#t~ret270#1.offset, main_#t~ret271#1.base, main_#t~ret271#1.offset, main_#t~ret272#1.base, main_#t~ret272#1.offset, main_#t~ret273#1.base, main_#t~ret273#1.offset, main_#t~ret274#1.base, main_#t~ret274#1.offset, main_#t~nondet275#1, main_#t~switch276#1, main_#t~nondet277#1, main_#t~switch278#1, main_#t~ret279#1, main_#t~nondet280#1, main_#t~switch281#1, main_#t~ret282#1, main_#t~nondet283#1, main_#t~switch284#1, main_#t~ret285#1, main_#t~mem286#1, main_#t~ret287#1, main_#t~mem288#1, main_#t~ret289#1, main_#t~mem290#1, main_#t~ret291#1, main_#t~mem292#1, main_#t~ret293#1, main_#t~mem294#1, main_#t~ret295#1, main_#t~ret296#1, main_#t~ret297#1, main_#t~ret298#1, main_#t~ret299#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~28#1.base, main_~tmp~28#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___2~2#1, main_~tmp___3~2#1, main_~tmp___4~2#1, main_~tmp___5~2#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~28#1.base, main_~tmp~28#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___2~2#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1;havoc main_~tmp___5~2#1; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,567 INFO L272 TraceCheckUtils]: 2: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret270#1.base, main_#t~ret270#1.offset := ldv_init_zalloc(32); {17913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:30,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {17913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {17844#true} is VALID [2022-02-20 22:06:30,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {17844#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {17921#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:30,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {17921#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17844#true} is VALID [2022-02-20 22:06:30,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,568 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17844#true} {17844#true} #1456#return; {17844#true} is VALID [2022-02-20 22:06:30,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {17844#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {17844#true} is VALID [2022-02-20 22:06:30,569 INFO L272 TraceCheckUtils]: 9: Hoare triple {17844#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {17844#true} is VALID [2022-02-20 22:06:30,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {17844#true} ~cond := #in~cond; {17844#true} is VALID [2022-02-20 22:06:30,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {17844#true} assume !(0 == ~cond); {17844#true} is VALID [2022-02-20 22:06:30,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,570 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {17844#true} {17844#true} #1458#return; {17844#true} is VALID [2022-02-20 22:06:30,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {17844#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {17844#true} is VALID [2022-02-20 22:06:30,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,571 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {17844#true} {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1466#return; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp~28#1.base, main_~tmp~28#1.offset := main_#t~ret270#1.base, main_#t~ret270#1.offset;havoc main_#t~ret270#1.base, main_#t~ret270#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~28#1.base, main_~tmp~28#1.offset; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,572 INFO L272 TraceCheckUtils]: 18: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret271#1.base, main_#t~ret271#1.offset := ldv_init_zalloc(240); {17913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:30,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {17913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {17844#true} is VALID [2022-02-20 22:06:30,573 INFO L272 TraceCheckUtils]: 20: Hoare triple {17844#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {17921#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:30,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {17921#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17844#true} is VALID [2022-02-20 22:06:30,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,573 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17844#true} {17844#true} #1456#return; {17844#true} is VALID [2022-02-20 22:06:30,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {17844#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {17844#true} is VALID [2022-02-20 22:06:30,573 INFO L272 TraceCheckUtils]: 25: Hoare triple {17844#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {17844#true} is VALID [2022-02-20 22:06:30,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {17844#true} ~cond := #in~cond; {17844#true} is VALID [2022-02-20 22:06:30,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {17844#true} assume !(0 == ~cond); {17844#true} is VALID [2022-02-20 22:06:30,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,574 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {17844#true} {17844#true} #1458#return; {17844#true} is VALID [2022-02-20 22:06:30,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {17844#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {17844#true} is VALID [2022-02-20 22:06:30,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,575 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17844#true} {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1468#return; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset := main_#t~ret271#1.base, main_#t~ret271#1.offset;havoc main_#t~ret271#1.base, main_#t~ret271#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,576 INFO L272 TraceCheckUtils]: 34: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret272#1.base, main_#t~ret272#1.offset := ldv_init_zalloc(40); {17913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:30,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {17913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {17844#true} is VALID [2022-02-20 22:06:30,576 INFO L272 TraceCheckUtils]: 36: Hoare triple {17844#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {17921#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:30,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {17921#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17844#true} is VALID [2022-02-20 22:06:30,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,577 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17844#true} {17844#true} #1456#return; {17844#true} is VALID [2022-02-20 22:06:30,577 INFO L290 TraceCheckUtils]: 40: Hoare triple {17844#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {17844#true} is VALID [2022-02-20 22:06:30,577 INFO L272 TraceCheckUtils]: 41: Hoare triple {17844#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {17844#true} is VALID [2022-02-20 22:06:30,577 INFO L290 TraceCheckUtils]: 42: Hoare triple {17844#true} ~cond := #in~cond; {17844#true} is VALID [2022-02-20 22:06:30,577 INFO L290 TraceCheckUtils]: 43: Hoare triple {17844#true} assume !(0 == ~cond); {17844#true} is VALID [2022-02-20 22:06:30,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,578 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17844#true} {17844#true} #1458#return; {17844#true} is VALID [2022-02-20 22:06:30,578 INFO L290 TraceCheckUtils]: 46: Hoare triple {17844#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {17844#true} is VALID [2022-02-20 22:06:30,578 INFO L290 TraceCheckUtils]: 47: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,578 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {17844#true} {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1470#return; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,579 INFO L290 TraceCheckUtils]: 49: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret272#1.base, main_#t~ret272#1.offset;havoc main_#t~ret272#1.base, main_#t~ret272#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;assume { :begin_inline_ldv_initialize } true; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,579 INFO L290 TraceCheckUtils]: 50: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :end_inline_ldv_initialize } true; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,580 INFO L272 TraceCheckUtils]: 51: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret273#1.base, main_#t~ret273#1.offset := ldv_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 4); {17936#(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:30,580 INFO L290 TraceCheckUtils]: 52: Hoare triple {17936#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {17844#true} is VALID [2022-02-20 22:06:30,580 INFO L290 TraceCheckUtils]: 53: Hoare triple {17844#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {17844#true} is VALID [2022-02-20 22:06:30,580 INFO L290 TraceCheckUtils]: 54: Hoare triple {17844#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {17844#true} is VALID [2022-02-20 22:06:30,580 INFO L290 TraceCheckUtils]: 55: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,581 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {17844#true} {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1472#return; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,581 INFO L290 TraceCheckUtils]: 57: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} havoc main_#t~ret273#1.base, main_#t~ret273#1.offset; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,582 INFO L272 TraceCheckUtils]: 58: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call main_#t~ret274#1.base, main_#t~ret274#1.offset := ldv_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {17936#(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:30,582 INFO L290 TraceCheckUtils]: 59: Hoare triple {17936#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {17844#true} is VALID [2022-02-20 22:06:30,582 INFO L290 TraceCheckUtils]: 60: Hoare triple {17844#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {17844#true} is VALID [2022-02-20 22:06:30,583 INFO L290 TraceCheckUtils]: 61: Hoare triple {17844#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {17844#true} is VALID [2022-02-20 22:06:30,583 INFO L290 TraceCheckUtils]: 62: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,583 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17844#true} {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1474#return; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,584 INFO L290 TraceCheckUtils]: 64: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} havoc main_#t~ret274#1.base, main_#t~ret274#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,584 INFO L290 TraceCheckUtils]: 65: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume -2147483648 <= main_#t~nondet275#1 && main_#t~nondet275#1 <= 2147483647;main_~tmp___2~2#1 := main_#t~nondet275#1;havoc main_#t~nondet275#1;main_#t~switch276#1 := 0 == main_~tmp___2~2#1; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,585 INFO L290 TraceCheckUtils]: 66: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch276#1;main_#t~switch276#1 := main_#t~switch276#1 || 1 == main_~tmp___2~2#1; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,585 INFO L290 TraceCheckUtils]: 67: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume main_#t~switch276#1; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,585 INFO L290 TraceCheckUtils]: 68: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet280#1 && main_#t~nondet280#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet280#1;havoc main_#t~nondet280#1;main_#t~switch281#1 := 0 == main_~tmp___4~2#1; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,586 INFO L290 TraceCheckUtils]: 69: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !main_#t~switch281#1;main_#t~switch281#1 := main_#t~switch281#1 || 1 == main_~tmp___4~2#1; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,586 INFO L290 TraceCheckUtils]: 70: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume main_#t~switch281#1; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,587 INFO L290 TraceCheckUtils]: 71: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_usbpn_driver_init } true;havoc usbpn_driver_init_#res#1;havoc usbpn_driver_init_#t~ret267#1, usbpn_driver_init_~tmp~25#1;havoc usbpn_driver_init_~tmp~25#1;assume { :begin_inline_ldv_usb_register_driver_17 } true;ldv_usb_register_driver_17_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_17_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_17_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg3#1.offset := ~#usbpn_driver~0.base, ~#usbpn_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 28, 0;havoc ldv_usb_register_driver_17_#res#1;havoc ldv_usb_register_driver_17_#t~ret307#1, ldv_usb_register_driver_17_~ldv_func_arg1#1.base, ldv_usb_register_driver_17_~ldv_func_arg1#1.offset, ldv_usb_register_driver_17_~ldv_func_arg2#1.base, ldv_usb_register_driver_17_~ldv_func_arg2#1.offset, ldv_usb_register_driver_17_~ldv_func_arg3#1.base, ldv_usb_register_driver_17_~ldv_func_arg3#1.offset, ldv_usb_register_driver_17_~ldv_func_res~1#1, ldv_usb_register_driver_17_~tmp~36#1;ldv_usb_register_driver_17_~ldv_func_arg1#1.base, ldv_usb_register_driver_17_~ldv_func_arg1#1.offset := ldv_usb_register_driver_17_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_17_~ldv_func_arg2#1.base, ldv_usb_register_driver_17_~ldv_func_arg2#1.offset := ldv_usb_register_driver_17_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_17_~ldv_func_arg3#1.base, ldv_usb_register_driver_17_~ldv_func_arg3#1.offset := ldv_usb_register_driver_17_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_17_~ldv_func_res~1#1;havoc ldv_usb_register_driver_17_~tmp~36#1;assume { :begin_inline_usb_register_driver } true;usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset, usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset, usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset := ldv_usb_register_driver_17_~ldv_func_arg1#1.base, ldv_usb_register_driver_17_~ldv_func_arg1#1.offset, ldv_usb_register_driver_17_~ldv_func_arg2#1.base, ldv_usb_register_driver_17_~ldv_func_arg2#1.offset, ldv_usb_register_driver_17_~ldv_func_arg3#1.base, ldv_usb_register_driver_17_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet336#1, usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset, usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset, usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset;usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset := usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset;usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset := usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset;usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset := usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset;assume -2147483648 <= usb_register_driver_#t~nondet336#1 && usb_register_driver_#t~nondet336#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet336#1;havoc usb_register_driver_#t~nondet336#1; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,587 INFO L290 TraceCheckUtils]: 72: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} ldv_usb_register_driver_17_#t~ret307#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_17_#t~ret307#1 && ldv_usb_register_driver_17_#t~ret307#1 <= 2147483647;ldv_usb_register_driver_17_~tmp~36#1 := ldv_usb_register_driver_17_#t~ret307#1;havoc ldv_usb_register_driver_17_#t~ret307#1;ldv_usb_register_driver_17_~ldv_func_res~1#1 := ldv_usb_register_driver_17_~tmp~36#1;~ldv_state_variable_1~0 := 1;~usb_counter~0 := 0;assume { :begin_inline_ldv_usb_driver_1 } true;havoc ldv_usb_driver_1_#t~ret268#1.base, ldv_usb_driver_1_#t~ret268#1.offset, ldv_usb_driver_1_~tmp~26#1.base, ldv_usb_driver_1_~tmp~26#1.offset;havoc ldv_usb_driver_1_~tmp~26#1.base, ldv_usb_driver_1_~tmp~26#1.offset; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,588 INFO L272 TraceCheckUtils]: 73: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} call ldv_usb_driver_1_#t~ret268#1.base, ldv_usb_driver_1_#t~ret268#1.offset := ldv_init_zalloc(1288); {17913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:30,588 INFO L290 TraceCheckUtils]: 74: Hoare triple {17913#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {17844#true} is VALID [2022-02-20 22:06:30,589 INFO L272 TraceCheckUtils]: 75: Hoare triple {17844#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {17921#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:30,589 INFO L290 TraceCheckUtils]: 76: Hoare triple {17921#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {17844#true} is VALID [2022-02-20 22:06:30,589 INFO L290 TraceCheckUtils]: 77: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,589 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {17844#true} {17844#true} #1456#return; {17844#true} is VALID [2022-02-20 22:06:30,589 INFO L290 TraceCheckUtils]: 79: Hoare triple {17844#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {17844#true} is VALID [2022-02-20 22:06:30,589 INFO L272 TraceCheckUtils]: 80: Hoare triple {17844#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {17844#true} is VALID [2022-02-20 22:06:30,589 INFO L290 TraceCheckUtils]: 81: Hoare triple {17844#true} ~cond := #in~cond; {17844#true} is VALID [2022-02-20 22:06:30,590 INFO L290 TraceCheckUtils]: 82: Hoare triple {17844#true} assume !(0 == ~cond); {17844#true} is VALID [2022-02-20 22:06:30,590 INFO L290 TraceCheckUtils]: 83: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,590 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {17844#true} {17844#true} #1458#return; {17844#true} is VALID [2022-02-20 22:06:30,590 INFO L290 TraceCheckUtils]: 85: Hoare triple {17844#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {17844#true} is VALID [2022-02-20 22:06:30,590 INFO L290 TraceCheckUtils]: 86: Hoare triple {17844#true} assume true; {17844#true} is VALID [2022-02-20 22:06:30,591 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {17844#true} {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} #1520#return; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,591 INFO L290 TraceCheckUtils]: 88: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} ldv_usb_driver_1_~tmp~26#1.base, ldv_usb_driver_1_~tmp~26#1.offset := ldv_usb_driver_1_#t~ret268#1.base, ldv_usb_driver_1_#t~ret268#1.offset;havoc ldv_usb_driver_1_#t~ret268#1.base, ldv_usb_driver_1_#t~ret268#1.offset;~usbpn_driver_group1~0.base, ~usbpn_driver_group1~0.offset := ldv_usb_driver_1_~tmp~26#1.base, ldv_usb_driver_1_~tmp~26#1.offset; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,591 INFO L290 TraceCheckUtils]: 89: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_17_#res#1 := ldv_usb_register_driver_17_~ldv_func_res~1#1; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,592 INFO L290 TraceCheckUtils]: 90: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} usbpn_driver_init_#t~ret267#1 := ldv_usb_register_driver_17_#res#1;assume { :end_inline_ldv_usb_register_driver_17 } true;assume -2147483648 <= usbpn_driver_init_#t~ret267#1 && usbpn_driver_init_#t~ret267#1 <= 2147483647;usbpn_driver_init_~tmp~25#1 := usbpn_driver_init_#t~ret267#1;havoc usbpn_driver_init_#t~ret267#1;usbpn_driver_init_#res#1 := usbpn_driver_init_~tmp~25#1; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,592 INFO L290 TraceCheckUtils]: 91: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} main_#t~ret282#1 := usbpn_driver_init_#res#1;assume { :end_inline_usbpn_driver_init } true;assume -2147483648 <= main_#t~ret282#1 && main_#t~ret282#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret282#1;havoc main_#t~ret282#1; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,593 INFO L290 TraceCheckUtils]: 92: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume !(0 == ~ldv_retval_1~0); {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,593 INFO L290 TraceCheckUtils]: 93: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,593 INFO L290 TraceCheckUtils]: 94: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume { :begin_inline_ldv_check_final_state } true; {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} is VALID [2022-02-20 22:06:30,594 INFO L290 TraceCheckUtils]: 95: Hoare triple {17846#(and (= ~usb_urb~0.base 0) (= ~usb_urb~0.offset 0))} assume 0 != (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616; {17845#false} is VALID [2022-02-20 22:06:30,594 INFO L272 TraceCheckUtils]: 96: Hoare triple {17845#false} call ldv_error(); {17845#false} is VALID [2022-02-20 22:06:30,594 INFO L290 TraceCheckUtils]: 97: Hoare triple {17845#false} assume !false; {17845#false} is VALID [2022-02-20 22:06:30,594 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-02-20 22:06:30,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:06:30,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777305522] [2022-02-20 22:06:30,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777305522] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:06:30,595 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:06:30,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:06:30,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924716253] [2022-02-20 22:06:30,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:06:30,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 98 [2022-02-20 22:06:30,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:06:30,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:06:30,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:06:30,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:06:30,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:06:30,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:06:30,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:06:30,663 INFO L87 Difference]: Start difference. First operand 1143 states and 1551 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:06:35,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 22:06:43,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:06:43,270 INFO L93 Difference]: Finished difference Result 3736 states and 5252 transitions. [2022-02-20 22:06:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 22:06:43,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 98 [2022-02-20 22:06:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:06:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:06:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2688 transitions. [2022-02-20 22:06:43,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:06:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2688 transitions. [2022-02-20 22:06:43,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 2688 transitions. [2022-02-20 22:06:45,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2688 edges. 2688 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:06:45,701 INFO L225 Difference]: With dead ends: 3736 [2022-02-20 22:06:45,701 INFO L226 Difference]: Without dead ends: 2611 [2022-02-20 22:06:45,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-20 22:06:45,705 INFO L933 BasicCegarLoop]: 1095 mSDtfsCounter, 1917 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 809 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1990 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 809 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-02-20 22:06:45,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1990 Valid, 2258 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [809 Valid, 763 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2022-02-20 22:06:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2022-02-20 22:06:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2337. [2022-02-20 22:06:45,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:06:45,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2611 states. Second operand has 2337 states, 1767 states have (on average 1.328805885681947) internal successors, (2348), 1809 states have internal predecessors, (2348), 406 states have call successors, (406), 150 states have call predecessors, (406), 163 states have return successors, (463), 399 states have call predecessors, (463), 401 states have call successors, (463) [2022-02-20 22:06:45,771 INFO L74 IsIncluded]: Start isIncluded. First operand 2611 states. Second operand has 2337 states, 1767 states have (on average 1.328805885681947) internal successors, (2348), 1809 states have internal predecessors, (2348), 406 states have call successors, (406), 150 states have call predecessors, (406), 163 states have return successors, (463), 399 states have call predecessors, (463), 401 states have call successors, (463) [2022-02-20 22:06:45,776 INFO L87 Difference]: Start difference. First operand 2611 states. Second operand has 2337 states, 1767 states have (on average 1.328805885681947) internal successors, (2348), 1809 states have internal predecessors, (2348), 406 states have call successors, (406), 150 states have call predecessors, (406), 163 states have return successors, (463), 399 states have call predecessors, (463), 401 states have call successors, (463) [2022-02-20 22:06:45,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:06:45,979 INFO L93 Difference]: Finished difference Result 2611 states and 3657 transitions. [2022-02-20 22:06:45,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3657 transitions. [2022-02-20 22:06:45,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:06:45,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:06:45,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 2337 states, 1767 states have (on average 1.328805885681947) internal successors, (2348), 1809 states have internal predecessors, (2348), 406 states have call successors, (406), 150 states have call predecessors, (406), 163 states have return successors, (463), 399 states have call predecessors, (463), 401 states have call successors, (463) Second operand 2611 states. [2022-02-20 22:06:46,003 INFO L87 Difference]: Start difference. First operand has 2337 states, 1767 states have (on average 1.328805885681947) internal successors, (2348), 1809 states have internal predecessors, (2348), 406 states have call successors, (406), 150 states have call predecessors, (406), 163 states have return successors, (463), 399 states have call predecessors, (463), 401 states have call successors, (463) Second operand 2611 states. [2022-02-20 22:06:46,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:06:46,209 INFO L93 Difference]: Finished difference Result 2611 states and 3657 transitions. [2022-02-20 22:06:46,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 3657 transitions. [2022-02-20 22:06:46,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:06:46,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:06:46,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:06:46,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:06:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2337 states, 1767 states have (on average 1.328805885681947) internal successors, (2348), 1809 states have internal predecessors, (2348), 406 states have call successors, (406), 150 states have call predecessors, (406), 163 states have return successors, (463), 399 states have call predecessors, (463), 401 states have call successors, (463) [2022-02-20 22:06:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3217 transitions. [2022-02-20 22:06:46,493 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3217 transitions. Word has length 98 [2022-02-20 22:06:46,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:06:46,494 INFO L470 AbstractCegarLoop]: Abstraction has 2337 states and 3217 transitions. [2022-02-20 22:06:46,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 3 states have internal predecessors, (38), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:06:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3217 transitions. [2022-02-20 22:06:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-20 22:06:46,495 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:06:46,496 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-02-20 22:06:46,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 22:06:46,496 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:06:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:06:46,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1237704049, now seen corresponding path program 1 times [2022-02-20 22:06:46,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:06:46,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927801026] [2022-02-20 22:06:46,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:06:46,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:06:46,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 22:06:46,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:46,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:46,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {31650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {31573#true} is VALID [2022-02-20 22:06:46,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,621 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31573#true} {31573#true} #1456#return; {31573#true} is VALID [2022-02-20 22:06:46,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:46,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {31573#true} ~cond := #in~cond; {31573#true} is VALID [2022-02-20 22:06:46,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {31573#true} assume !(0 == ~cond); {31573#true} is VALID [2022-02-20 22:06:46,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31573#true} {31573#true} #1458#return; {31573#true} is VALID [2022-02-20 22:06:46,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {31642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {31573#true} is VALID [2022-02-20 22:06:46,627 INFO L272 TraceCheckUtils]: 1: Hoare triple {31573#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {31650#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:46,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {31650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {31573#true} is VALID [2022-02-20 22:06:46,627 INFO L290 TraceCheckUtils]: 3: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,627 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31573#true} {31573#true} #1456#return; {31573#true} is VALID [2022-02-20 22:06:46,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {31573#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {31573#true} is VALID [2022-02-20 22:06:46,639 INFO L272 TraceCheckUtils]: 6: Hoare triple {31573#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {31573#true} is VALID [2022-02-20 22:06:46,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {31573#true} ~cond := #in~cond; {31573#true} is VALID [2022-02-20 22:06:46,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {31573#true} assume !(0 == ~cond); {31573#true} is VALID [2022-02-20 22:06:46,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,639 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31573#true} {31573#true} #1458#return; {31573#true} is VALID [2022-02-20 22:06:46,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {31573#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {31573#true} is VALID [2022-02-20 22:06:46,639 INFO L290 TraceCheckUtils]: 12: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,640 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {31573#true} {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1466#return; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 22:06:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:46,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:46,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {31650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {31573#true} is VALID [2022-02-20 22:06:46,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,656 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31573#true} {31573#true} #1456#return; {31573#true} is VALID [2022-02-20 22:06:46,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:46,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {31573#true} ~cond := #in~cond; {31573#true} is VALID [2022-02-20 22:06:46,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {31573#true} assume !(0 == ~cond); {31573#true} is VALID [2022-02-20 22:06:46,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31573#true} {31573#true} #1458#return; {31573#true} is VALID [2022-02-20 22:06:46,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {31642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {31573#true} is VALID [2022-02-20 22:06:46,662 INFO L272 TraceCheckUtils]: 1: Hoare triple {31573#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {31650#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:46,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {31650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {31573#true} is VALID [2022-02-20 22:06:46,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,663 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31573#true} {31573#true} #1456#return; {31573#true} is VALID [2022-02-20 22:06:46,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {31573#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {31573#true} is VALID [2022-02-20 22:06:46,663 INFO L272 TraceCheckUtils]: 6: Hoare triple {31573#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {31573#true} is VALID [2022-02-20 22:06:46,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {31573#true} ~cond := #in~cond; {31573#true} is VALID [2022-02-20 22:06:46,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {31573#true} assume !(0 == ~cond); {31573#true} is VALID [2022-02-20 22:06:46,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,663 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31573#true} {31573#true} #1458#return; {31573#true} is VALID [2022-02-20 22:06:46,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {31573#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {31573#true} is VALID [2022-02-20 22:06:46,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,664 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {31573#true} {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1468#return; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-20 22:06:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:46,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:46,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {31650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {31573#true} is VALID [2022-02-20 22:06:46,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,677 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31573#true} {31573#true} #1456#return; {31573#true} is VALID [2022-02-20 22:06:46,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:46,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {31573#true} ~cond := #in~cond; {31573#true} is VALID [2022-02-20 22:06:46,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {31573#true} assume !(0 == ~cond); {31573#true} is VALID [2022-02-20 22:06:46,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31573#true} {31573#true} #1458#return; {31573#true} is VALID [2022-02-20 22:06:46,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {31642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {31573#true} is VALID [2022-02-20 22:06:46,683 INFO L272 TraceCheckUtils]: 1: Hoare triple {31573#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {31650#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:46,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {31650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {31573#true} is VALID [2022-02-20 22:06:46,683 INFO L290 TraceCheckUtils]: 3: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,683 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31573#true} {31573#true} #1456#return; {31573#true} is VALID [2022-02-20 22:06:46,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {31573#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {31573#true} is VALID [2022-02-20 22:06:46,683 INFO L272 TraceCheckUtils]: 6: Hoare triple {31573#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {31573#true} is VALID [2022-02-20 22:06:46,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {31573#true} ~cond := #in~cond; {31573#true} is VALID [2022-02-20 22:06:46,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {31573#true} assume !(0 == ~cond); {31573#true} is VALID [2022-02-20 22:06:46,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,684 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31573#true} {31573#true} #1458#return; {31573#true} is VALID [2022-02-20 22:06:46,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {31573#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {31573#true} is VALID [2022-02-20 22:06:46,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,684 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {31573#true} {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1470#return; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 22:06:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:46,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {31665#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {31573#true} is VALID [2022-02-20 22:06:46,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {31573#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {31573#true} is VALID [2022-02-20 22:06:46,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {31573#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {31573#true} is VALID [2022-02-20 22:06:46,698 INFO L290 TraceCheckUtils]: 3: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,698 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31573#true} {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1472#return; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-20 22:06:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:46,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {31665#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {31573#true} is VALID [2022-02-20 22:06:46,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {31573#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {31573#true} is VALID [2022-02-20 22:06:46,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {31573#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {31573#true} is VALID [2022-02-20 22:06:46,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,707 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31573#true} {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1474#return; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-02-20 22:06:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:46,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:06:46,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:46,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {31650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {31573#true} is VALID [2022-02-20 22:06:46,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,723 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31573#true} {31573#true} #1456#return; {31573#true} is VALID [2022-02-20 22:06:46,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 22:06:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:06:46,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {31573#true} ~cond := #in~cond; {31573#true} is VALID [2022-02-20 22:06:46,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {31573#true} assume !(0 == ~cond); {31573#true} is VALID [2022-02-20 22:06:46,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31573#true} {31573#true} #1458#return; {31573#true} is VALID [2022-02-20 22:06:46,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {31642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {31573#true} is VALID [2022-02-20 22:06:46,729 INFO L272 TraceCheckUtils]: 1: Hoare triple {31573#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {31650#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:46,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {31650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {31573#true} is VALID [2022-02-20 22:06:46,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,729 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31573#true} {31573#true} #1456#return; {31573#true} is VALID [2022-02-20 22:06:46,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {31573#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {31573#true} is VALID [2022-02-20 22:06:46,730 INFO L272 TraceCheckUtils]: 6: Hoare triple {31573#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {31573#true} is VALID [2022-02-20 22:06:46,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {31573#true} ~cond := #in~cond; {31573#true} is VALID [2022-02-20 22:06:46,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {31573#true} assume !(0 == ~cond); {31573#true} is VALID [2022-02-20 22:06:46,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31573#true} {31573#true} #1458#return; {31573#true} is VALID [2022-02-20 22:06:46,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {31573#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {31573#true} is VALID [2022-02-20 22:06:46,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,731 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {31573#true} {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1520#return; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {31573#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(98, 2);call #Ultimate.allocInit(26, 3);call #Ultimate.allocInit(63, 4);call #Ultimate.allocInit(11, 5);call #Ultimate.allocInit(12, 6);call #Ultimate.allocInit(274, 7);call #Ultimate.allocInit(15, 8);call #Ultimate.allocInit(15, 9);call #Ultimate.allocInit(11, 10);call #Ultimate.allocInit(10, 11);call #Ultimate.allocInit(274, 12);call #Ultimate.allocInit(22, 13);call #Ultimate.allocInit(22, 14);call #Ultimate.allocInit(11, 15);call #Ultimate.allocInit(12, 16);call #Ultimate.allocInit(274, 17);call #Ultimate.allocInit(13, 18);call #Ultimate.allocInit(13, 19);call #Ultimate.allocInit(24, 20);call #Ultimate.allocInit(24, 21);call #Ultimate.allocInit(11, 22);call #Ultimate.allocInit(12, 23);call #Ultimate.allocInit(274, 24);call #Ultimate.allocInit(29, 25);call #Ultimate.allocInit(29, 26);call #Ultimate.allocInit(11, 27);call #Ultimate.allocInit(11, 28);~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_1~0 := 0;~usbpn_ops_group1~0.base, ~usbpn_ops_group1~0.offset := 0, 0;~usb_counter~0 := 0;~usbpn_driver_group1~0.base, ~usbpn_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~rxq_size~0 := 17;~#usbpn_ops~0.base, ~#usbpn_ops~0.offset := 29, 0;call #Ultimate.allocInit(376, 29);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 8 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_open.base, #funAddr~usbpn_open.offset, ~#usbpn_ops~0.base, 16 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_close.base, #funAddr~usbpn_close.offset, ~#usbpn_ops~0.base, 24 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_xmit.base, #funAddr~usbpn_xmit.offset, ~#usbpn_ops~0.base, 32 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 40 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 48 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 56 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 64 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 72 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_ioctl.base, #funAddr~usbpn_ioctl.offset, ~#usbpn_ops~0.base, 80 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 88 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_set_mtu.base, #funAddr~usbpn_set_mtu.offset, ~#usbpn_ops~0.base, 96 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 104 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 112 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 120 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 128 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 136 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 144 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 152 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 160 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 168 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 176 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 184 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 192 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 200 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 208 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 216 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 224 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 232 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 240 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 248 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 256 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 264 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 272 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 280 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 288 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 296 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 304 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 312 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 320 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 328 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 336 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 344 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 352 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 360 + ~#usbpn_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_ops~0.base, 368 + ~#usbpn_ops~0.offset, 8);~#usbpn_ids~0.base, ~#usbpn_ids~0.offset := 30, 0;call #Ultimate.allocInit(50, 30);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#usbpn_ids~0.base);call write~unchecked~int(385, ~#usbpn_ids~0.base, ~#usbpn_ids~0.offset, 2);call write~unchecked~int(1057, ~#usbpn_ids~0.base, 2 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 4 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 6 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 8 + ~#usbpn_ids~0.offset, 2);call write~unchecked~int(0, ~#usbpn_ids~0.base, 10 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 11 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 12 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(2, ~#usbpn_ids~0.base, 13 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(254, ~#usbpn_ids~0.base, 14 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 15 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 16 + ~#usbpn_ids~0.offset, 1);call write~unchecked~int(0, ~#usbpn_ids~0.base, 17 + ~#usbpn_ids~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;~#usbpn_driver~0.base, ~#usbpn_driver~0.offset := 31, 0;call #Ultimate.allocInit(277, 31);call write~init~$Pointer$(27, 0, ~#usbpn_driver~0.base, ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_probe.base, #funAddr~usbpn_probe.offset, ~#usbpn_driver~0.base, 8 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbpn_disconnect.base, #funAddr~usbpn_disconnect.offset, ~#usbpn_driver~0.base, 16 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 24 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 32 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 40 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 48 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 56 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 64 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(~#usbpn_ids~0.base, ~#usbpn_ids~0.offset, ~#usbpn_driver~0.base, 72 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 80 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 84 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 88 + ~#usbpn_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 92 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 100 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 108 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 116 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 124 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 132 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 136 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 148 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 156 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 164 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 172 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 180 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 188 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 196 + ~#usbpn_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 197 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 205 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 213 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 221 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 229 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 237 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 245 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 253 + ~#usbpn_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#usbpn_driver~0.base, 261 + ~#usbpn_driver~0.offset, 8);call write~init~int(0, ~#usbpn_driver~0.base, 269 + ~#usbpn_driver~0.offset, 4);call write~init~int(0, ~#usbpn_driver~0.base, 273 + ~#usbpn_driver~0.offset, 1);call write~init~int(0, ~#usbpn_driver~0.base, 274 + ~#usbpn_driver~0.offset, 1);call write~init~int(1, ~#usbpn_driver~0.base, 275 + ~#usbpn_driver~0.offset, 1);call write~init~int(0, ~#usbpn_driver~0.base, 276 + ~#usbpn_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~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; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret270#1.base, main_#t~ret270#1.offset, main_#t~ret271#1.base, main_#t~ret271#1.offset, main_#t~ret272#1.base, main_#t~ret272#1.offset, main_#t~ret273#1.base, main_#t~ret273#1.offset, main_#t~ret274#1.base, main_#t~ret274#1.offset, main_#t~nondet275#1, main_#t~switch276#1, main_#t~nondet277#1, main_#t~switch278#1, main_#t~ret279#1, main_#t~nondet280#1, main_#t~switch281#1, main_#t~ret282#1, main_#t~nondet283#1, main_#t~switch284#1, main_#t~ret285#1, main_#t~mem286#1, main_#t~ret287#1, main_#t~mem288#1, main_#t~ret289#1, main_#t~mem290#1, main_#t~ret291#1, main_#t~mem292#1, main_#t~ret293#1, main_#t~mem294#1, main_#t~ret295#1, main_#t~ret296#1, main_#t~ret297#1, main_#t~ret298#1, main_#t~ret299#1, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp~28#1.base, main_~tmp~28#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset, main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset, main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset, main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___2~2#1, main_~tmp___3~2#1, main_~tmp___4~2#1, main_~tmp___5~2#1;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp~28#1.base, main_~tmp~28#1.offset;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset;havoc main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset;havoc main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;call main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___2~2#1;havoc main_~tmp___3~2#1;havoc main_~tmp___4~2#1;havoc main_~tmp___5~2#1; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,738 INFO L272 TraceCheckUtils]: 2: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~ret270#1.base, main_#t~ret270#1.offset := ldv_init_zalloc(32); {31642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:46,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {31642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {31573#true} is VALID [2022-02-20 22:06:46,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {31573#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {31650#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:46,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {31650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {31573#true} is VALID [2022-02-20 22:06:46,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,739 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {31573#true} {31573#true} #1456#return; {31573#true} is VALID [2022-02-20 22:06:46,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {31573#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {31573#true} is VALID [2022-02-20 22:06:46,739 INFO L272 TraceCheckUtils]: 9: Hoare triple {31573#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {31573#true} is VALID [2022-02-20 22:06:46,739 INFO L290 TraceCheckUtils]: 10: Hoare triple {31573#true} ~cond := #in~cond; {31573#true} is VALID [2022-02-20 22:06:46,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {31573#true} assume !(0 == ~cond); {31573#true} is VALID [2022-02-20 22:06:46,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,739 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {31573#true} {31573#true} #1458#return; {31573#true} is VALID [2022-02-20 22:06:46,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {31573#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {31573#true} is VALID [2022-02-20 22:06:46,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,740 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {31573#true} {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1466#return; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_~tmp~28#1.base, main_~tmp~28#1.offset := main_#t~ret270#1.base, main_#t~ret270#1.offset;havoc main_#t~ret270#1.base, main_#t~ret270#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp~28#1.base, main_~tmp~28#1.offset; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,741 INFO L272 TraceCheckUtils]: 18: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~ret271#1.base, main_#t~ret271#1.offset := ldv_init_zalloc(240); {31642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:46,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {31642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {31573#true} is VALID [2022-02-20 22:06:46,742 INFO L272 TraceCheckUtils]: 20: Hoare triple {31573#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {31650#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:46,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {31650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {31573#true} is VALID [2022-02-20 22:06:46,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,742 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31573#true} {31573#true} #1456#return; {31573#true} is VALID [2022-02-20 22:06:46,742 INFO L290 TraceCheckUtils]: 24: Hoare triple {31573#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {31573#true} is VALID [2022-02-20 22:06:46,742 INFO L272 TraceCheckUtils]: 25: Hoare triple {31573#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {31573#true} is VALID [2022-02-20 22:06:46,742 INFO L290 TraceCheckUtils]: 26: Hoare triple {31573#true} ~cond := #in~cond; {31573#true} is VALID [2022-02-20 22:06:46,743 INFO L290 TraceCheckUtils]: 27: Hoare triple {31573#true} assume !(0 == ~cond); {31573#true} is VALID [2022-02-20 22:06:46,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,743 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {31573#true} {31573#true} #1458#return; {31573#true} is VALID [2022-02-20 22:06:46,743 INFO L290 TraceCheckUtils]: 30: Hoare triple {31573#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {31573#true} is VALID [2022-02-20 22:06:46,743 INFO L290 TraceCheckUtils]: 31: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,746 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {31573#true} {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1468#return; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,746 INFO L290 TraceCheckUtils]: 33: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset := main_#t~ret271#1.base, main_#t~ret271#1.offset;havoc main_#t~ret271#1.base, main_#t~ret271#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp___0~13#1.base, main_~tmp___0~13#1.offset; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,747 INFO L272 TraceCheckUtils]: 34: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~ret272#1.base, main_#t~ret272#1.offset := ldv_init_zalloc(40); {31642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:46,747 INFO L290 TraceCheckUtils]: 35: Hoare triple {31642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {31573#true} is VALID [2022-02-20 22:06:46,747 INFO L272 TraceCheckUtils]: 36: Hoare triple {31573#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {31650#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:46,748 INFO L290 TraceCheckUtils]: 37: Hoare triple {31650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {31573#true} is VALID [2022-02-20 22:06:46,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,748 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {31573#true} {31573#true} #1456#return; {31573#true} is VALID [2022-02-20 22:06:46,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {31573#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {31573#true} is VALID [2022-02-20 22:06:46,748 INFO L272 TraceCheckUtils]: 41: Hoare triple {31573#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {31573#true} is VALID [2022-02-20 22:06:46,748 INFO L290 TraceCheckUtils]: 42: Hoare triple {31573#true} ~cond := #in~cond; {31573#true} is VALID [2022-02-20 22:06:46,748 INFO L290 TraceCheckUtils]: 43: Hoare triple {31573#true} assume !(0 == ~cond); {31573#true} is VALID [2022-02-20 22:06:46,748 INFO L290 TraceCheckUtils]: 44: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,748 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {31573#true} {31573#true} #1458#return; {31573#true} is VALID [2022-02-20 22:06:46,749 INFO L290 TraceCheckUtils]: 46: Hoare triple {31573#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {31573#true} is VALID [2022-02-20 22:06:46,749 INFO L290 TraceCheckUtils]: 47: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,749 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {31573#true} {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1470#return; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,750 INFO L290 TraceCheckUtils]: 49: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset := main_#t~ret272#1.base, main_#t~ret272#1.offset;havoc main_#t~ret272#1.base, main_#t~ret272#1.offset;main_~ldvarg4~0#1.base, main_~ldvarg4~0#1.offset := main_~tmp___1~4#1.base, main_~tmp___1~4#1.offset;assume { :begin_inline_ldv_initialize } true; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,750 INFO L290 TraceCheckUtils]: 50: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume { :end_inline_ldv_initialize } true; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,750 INFO L272 TraceCheckUtils]: 51: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~ret273#1.base, main_#t~ret273#1.offset := ldv_memset(main_~#ldvarg3~0#1.base, main_~#ldvarg3~0#1.offset, 0, 4); {31665#(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:46,751 INFO L290 TraceCheckUtils]: 52: Hoare triple {31665#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {31573#true} is VALID [2022-02-20 22:06:46,751 INFO L290 TraceCheckUtils]: 53: Hoare triple {31573#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {31573#true} is VALID [2022-02-20 22:06:46,751 INFO L290 TraceCheckUtils]: 54: Hoare triple {31573#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {31573#true} is VALID [2022-02-20 22:06:46,751 INFO L290 TraceCheckUtils]: 55: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,752 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {31573#true} {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1472#return; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} havoc main_#t~ret273#1.base, main_#t~ret273#1.offset; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,753 INFO L272 TraceCheckUtils]: 58: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call main_#t~ret274#1.base, main_#t~ret274#1.offset := ldv_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {31665#(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:46,753 INFO L290 TraceCheckUtils]: 59: Hoare triple {31665#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~s#1.base, ~s#1.offset := #in~s#1.base, #in~s#1.offset;~c#1 := #in~c#1;~n#1 := #in~n#1;havoc ~tmp~7#1.base, ~tmp~7#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := ~s#1.base, ~s#1.offset, ~c#1, ~n#1;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr340#1;#Ultimate.C_memset_#t~loopctr340#1 := 0; {31573#true} is VALID [2022-02-20 22:06:46,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {31573#true} assume !(#Ultimate.C_memset_#t~loopctr340#1 % 18446744073709551616 < #Ultimate.C_memset_#amount#1 % 18446744073709551616); {31573#true} is VALID [2022-02-20 22:06:46,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {31573#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;#t~memset~res62#1.base, #t~memset~res62#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;~tmp~7#1.base, ~tmp~7#1.offset := ~s#1.base, ~s#1.offset;havoc #t~memset~res62#1.base, #t~memset~res62#1.offset;#res#1.base, #res#1.offset := ~tmp~7#1.base, ~tmp~7#1.offset; {31573#true} is VALID [2022-02-20 22:06:46,753 INFO L290 TraceCheckUtils]: 62: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,754 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31573#true} {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1474#return; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,754 INFO L290 TraceCheckUtils]: 64: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} havoc main_#t~ret274#1.base, main_#t~ret274#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,754 INFO L290 TraceCheckUtils]: 65: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume -2147483648 <= main_#t~nondet275#1 && main_#t~nondet275#1 <= 2147483647;main_~tmp___2~2#1 := main_#t~nondet275#1;havoc main_#t~nondet275#1;main_#t~switch276#1 := 0 == main_~tmp___2~2#1; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,755 INFO L290 TraceCheckUtils]: 66: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !main_#t~switch276#1;main_#t~switch276#1 := main_#t~switch276#1 || 1 == main_~tmp___2~2#1; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,755 INFO L290 TraceCheckUtils]: 67: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume main_#t~switch276#1; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,755 INFO L290 TraceCheckUtils]: 68: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet280#1 && main_#t~nondet280#1 <= 2147483647;main_~tmp___4~2#1 := main_#t~nondet280#1;havoc main_#t~nondet280#1;main_#t~switch281#1 := 0 == main_~tmp___4~2#1; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,756 INFO L290 TraceCheckUtils]: 69: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !main_#t~switch281#1;main_#t~switch281#1 := main_#t~switch281#1 || 1 == main_~tmp___4~2#1; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,756 INFO L290 TraceCheckUtils]: 70: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume main_#t~switch281#1; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,757 INFO L290 TraceCheckUtils]: 71: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_usbpn_driver_init } true;havoc usbpn_driver_init_#res#1;havoc usbpn_driver_init_#t~ret267#1, usbpn_driver_init_~tmp~25#1;havoc usbpn_driver_init_~tmp~25#1;assume { :begin_inline_ldv_usb_register_driver_17 } true;ldv_usb_register_driver_17_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_17_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_17_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg3#1.offset := ~#usbpn_driver~0.base, ~#usbpn_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 28, 0;havoc ldv_usb_register_driver_17_#res#1;havoc ldv_usb_register_driver_17_#t~ret307#1, ldv_usb_register_driver_17_~ldv_func_arg1#1.base, ldv_usb_register_driver_17_~ldv_func_arg1#1.offset, ldv_usb_register_driver_17_~ldv_func_arg2#1.base, ldv_usb_register_driver_17_~ldv_func_arg2#1.offset, ldv_usb_register_driver_17_~ldv_func_arg3#1.base, ldv_usb_register_driver_17_~ldv_func_arg3#1.offset, ldv_usb_register_driver_17_~ldv_func_res~1#1, ldv_usb_register_driver_17_~tmp~36#1;ldv_usb_register_driver_17_~ldv_func_arg1#1.base, ldv_usb_register_driver_17_~ldv_func_arg1#1.offset := ldv_usb_register_driver_17_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_17_~ldv_func_arg2#1.base, ldv_usb_register_driver_17_~ldv_func_arg2#1.offset := ldv_usb_register_driver_17_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_17_~ldv_func_arg3#1.base, ldv_usb_register_driver_17_~ldv_func_arg3#1.offset := ldv_usb_register_driver_17_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_17_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_17_~ldv_func_res~1#1;havoc ldv_usb_register_driver_17_~tmp~36#1;assume { :begin_inline_usb_register_driver } true;usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset, usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset, usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset := ldv_usb_register_driver_17_~ldv_func_arg1#1.base, ldv_usb_register_driver_17_~ldv_func_arg1#1.offset, ldv_usb_register_driver_17_~ldv_func_arg2#1.base, ldv_usb_register_driver_17_~ldv_func_arg2#1.offset, ldv_usb_register_driver_17_~ldv_func_arg3#1.base, ldv_usb_register_driver_17_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet336#1, usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset, usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset, usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset;usb_register_driver_~arg0#1.base, usb_register_driver_~arg0#1.offset := usb_register_driver_#in~arg0#1.base, usb_register_driver_#in~arg0#1.offset;usb_register_driver_~arg1#1.base, usb_register_driver_~arg1#1.offset := usb_register_driver_#in~arg1#1.base, usb_register_driver_#in~arg1#1.offset;usb_register_driver_~arg2#1.base, usb_register_driver_~arg2#1.offset := usb_register_driver_#in~arg2#1.base, usb_register_driver_#in~arg2#1.offset;assume -2147483648 <= usb_register_driver_#t~nondet336#1 && usb_register_driver_#t~nondet336#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet336#1;havoc usb_register_driver_#t~nondet336#1; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,757 INFO L290 TraceCheckUtils]: 72: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} ldv_usb_register_driver_17_#t~ret307#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_17_#t~ret307#1 && ldv_usb_register_driver_17_#t~ret307#1 <= 2147483647;ldv_usb_register_driver_17_~tmp~36#1 := ldv_usb_register_driver_17_#t~ret307#1;havoc ldv_usb_register_driver_17_#t~ret307#1;ldv_usb_register_driver_17_~ldv_func_res~1#1 := ldv_usb_register_driver_17_~tmp~36#1;~ldv_state_variable_1~0 := 1;~usb_counter~0 := 0;assume { :begin_inline_ldv_usb_driver_1 } true;havoc ldv_usb_driver_1_#t~ret268#1.base, ldv_usb_driver_1_#t~ret268#1.offset, ldv_usb_driver_1_~tmp~26#1.base, ldv_usb_driver_1_~tmp~26#1.offset;havoc ldv_usb_driver_1_~tmp~26#1.base, ldv_usb_driver_1_~tmp~26#1.offset; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,758 INFO L272 TraceCheckUtils]: 73: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} call ldv_usb_driver_1_#t~ret268#1.base, ldv_usb_driver_1_#t~ret268#1.offset := ldv_init_zalloc(1288); {31642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:06:46,758 INFO L290 TraceCheckUtils]: 74: Hoare triple {31642#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~2.base, ~p~2.offset;havoc ~tmp~6.base, ~tmp~6.offset;call #t~malloc61.base, #t~malloc61.offset := #Ultimate.allocOnHeap(~size); {31573#true} is VALID [2022-02-20 22:06:46,758 INFO L272 TraceCheckUtils]: 75: Hoare triple {31573#true} call #Ultimate.meminit(#t~malloc61.base, #t~malloc61.offset, 1, ~size, ~size); {31650#(= |#memory_int| |old(#memory_int)|)} is VALID [2022-02-20 22:06:46,758 INFO L290 TraceCheckUtils]: 76: Hoare triple {31650#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {31573#true} is VALID [2022-02-20 22:06:46,759 INFO L290 TraceCheckUtils]: 77: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,759 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {31573#true} {31573#true} #1456#return; {31573#true} is VALID [2022-02-20 22:06:46,759 INFO L290 TraceCheckUtils]: 79: Hoare triple {31573#true} ~tmp~6.base, ~tmp~6.offset := #t~malloc61.base, #t~malloc61.offset;~p~2.base, ~p~2.offset := ~tmp~6.base, ~tmp~6.offset; {31573#true} is VALID [2022-02-20 22:06:46,759 INFO L272 TraceCheckUtils]: 80: Hoare triple {31573#true} call assume_abort_if_not((if 0 != (~p~2.base + ~p~2.offset) % 18446744073709551616 then 1 else 0)); {31573#true} is VALID [2022-02-20 22:06:46,759 INFO L290 TraceCheckUtils]: 81: Hoare triple {31573#true} ~cond := #in~cond; {31573#true} is VALID [2022-02-20 22:06:46,759 INFO L290 TraceCheckUtils]: 82: Hoare triple {31573#true} assume !(0 == ~cond); {31573#true} is VALID [2022-02-20 22:06:46,759 INFO L290 TraceCheckUtils]: 83: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,759 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {31573#true} {31573#true} #1458#return; {31573#true} is VALID [2022-02-20 22:06:46,759 INFO L290 TraceCheckUtils]: 85: Hoare triple {31573#true} #res.base, #res.offset := ~p~2.base, ~p~2.offset; {31573#true} is VALID [2022-02-20 22:06:46,760 INFO L290 TraceCheckUtils]: 86: Hoare triple {31573#true} assume true; {31573#true} is VALID [2022-02-20 22:06:46,760 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {31573#true} {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} #1520#return; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,760 INFO L290 TraceCheckUtils]: 88: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} ldv_usb_driver_1_~tmp~26#1.base, ldv_usb_driver_1_~tmp~26#1.offset := ldv_usb_driver_1_#t~ret268#1.base, ldv_usb_driver_1_#t~ret268#1.offset;havoc ldv_usb_driver_1_#t~ret268#1.base, ldv_usb_driver_1_#t~ret268#1.offset;~usbpn_driver_group1~0.base, ~usbpn_driver_group1~0.offset := ldv_usb_driver_1_~tmp~26#1.base, ldv_usb_driver_1_~tmp~26#1.offset; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,761 INFO L290 TraceCheckUtils]: 89: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_17_#res#1 := ldv_usb_register_driver_17_~ldv_func_res~1#1; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,761 INFO L290 TraceCheckUtils]: 90: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} usbpn_driver_init_#t~ret267#1 := ldv_usb_register_driver_17_#res#1;assume { :end_inline_ldv_usb_register_driver_17 } true;assume -2147483648 <= usbpn_driver_init_#t~ret267#1 && usbpn_driver_init_#t~ret267#1 <= 2147483647;usbpn_driver_init_~tmp~25#1 := usbpn_driver_init_#t~ret267#1;havoc usbpn_driver_init_#t~ret267#1;usbpn_driver_init_#res#1 := usbpn_driver_init_~tmp~25#1; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,761 INFO L290 TraceCheckUtils]: 91: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} main_#t~ret282#1 := usbpn_driver_init_#res#1;assume { :end_inline_usbpn_driver_init } true;assume -2147483648 <= main_#t~ret282#1 && main_#t~ret282#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret282#1;havoc main_#t~ret282#1; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,762 INFO L290 TraceCheckUtils]: 92: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !(0 == ~ldv_retval_1~0); {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,762 INFO L290 TraceCheckUtils]: 93: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,762 INFO L290 TraceCheckUtils]: 94: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume { :begin_inline_ldv_check_final_state } true; {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,763 INFO L290 TraceCheckUtils]: 95: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume !(0 != (~usb_urb~0.base + ~usb_urb~0.offset) % 18446744073709551616); {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} is VALID [2022-02-20 22:06:46,763 INFO L290 TraceCheckUtils]: 96: Hoare triple {31575#(and (= ~usb_dev~0.base 0) (= ~usb_dev~0.offset 0))} assume 0 != (~usb_dev~0.base + ~usb_dev~0.offset) % 18446744073709551616; {31574#false} is VALID [2022-02-20 22:06:46,763 INFO L272 TraceCheckUtils]: 97: Hoare triple {31574#false} call ldv_error(); {31574#false} is VALID [2022-02-20 22:06:46,763 INFO L290 TraceCheckUtils]: 98: Hoare triple {31574#false} assume !false; {31574#false} is VALID [2022-02-20 22:06:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2022-02-20 22:06:46,764 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:06:46,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927801026] [2022-02-20 22:06:46,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927801026] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:06:46,764 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:06:46,764 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 22:06:46,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072960258] [2022-02-20 22:06:46,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:06:46,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2022-02-20 22:06:46,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:06:46,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:06:46,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:06:46,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 22:06:46,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:06:46,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 22:06:46,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:06:46,810 INFO L87 Difference]: Start difference. First operand 2337 states and 3217 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 3 states have internal predecessors, (39), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 22:06:52,185 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []