./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:55:24,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:55:24,866 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:55:24,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:55:24,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:55:24,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:55:24,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:55:24,906 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:55:24,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:55:24,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:55:24,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:55:24,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:55:24,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:55:24,917 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:55:24,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:55:24,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:55:24,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:55:24,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:55:24,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:55:24,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:55:24,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:55:24,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:55:24,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:55:24,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:55:24,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:55:24,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:55:24,941 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:55:24,942 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:55:24,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:55:24,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:55:24,944 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:55:24,945 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:55:24,946 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:55:24,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:55:24,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:55:24,948 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:55:24,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:55:24,949 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:55:24,949 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:55:24,949 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:55:24,950 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:55:24,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 21:55:24,971 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:55:24,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:55:24,974 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:55:24,975 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:55:24,975 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:55:24,976 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:55:24,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:55:24,976 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:55:24,976 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:55:24,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:55:24,977 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:55:24,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:55:24,978 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:55:24,978 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:55:24,978 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:55:24,978 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:55:24,978 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:55:24,978 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:55:24,979 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:55:24,979 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:55:24,979 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:55:24,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:55:24,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:55:24,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:55:24,979 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:55:24,980 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:55:24,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:55:24,981 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:55:24,982 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:55:24,982 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:55:24,982 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 -> 4e983f35cff7a0c67962e23f6c3d66292f25c728e4d1df204c975f306d1512a3 [2022-02-20 21:55:25,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:55:25,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:55:25,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:55:25,215 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:55:25,215 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:55:25,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2022-02-20 21:55:25,280 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e16342e/9a53616fbc044ba48d8e90f5344aebb6/FLAGa97cc9d1d [2022-02-20 21:55:25,884 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:55:25,884 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2022-02-20 21:55:25,911 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e16342e/9a53616fbc044ba48d8e90f5344aebb6/FLAGa97cc9d1d [2022-02-20 21:55:26,325 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34e16342e/9a53616fbc044ba48d8e90f5344aebb6 [2022-02-20 21:55:26,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:55:26,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:55:26,331 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:55:26,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:55:26,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:55:26,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:55:26" (1/1) ... [2022-02-20 21:55:26,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68df5c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:26, skipping insertion in model container [2022-02-20 21:55:26,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:55:26" (1/1) ... [2022-02-20 21:55:26,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:55:26,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:55:26,951 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2022-02-20 21:55:27,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:55:27,259 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:55:27,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i[159401,159414] [2022-02-20 21:55:27,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:55:27,454 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:55:27,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:27 WrapperNode [2022-02-20 21:55:27,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:55:27,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:55:27,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:55:27,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:55:27,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:27" (1/1) ... [2022-02-20 21:55:27,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:27" (1/1) ... [2022-02-20 21:55:27,549 INFO L137 Inliner]: procedures = 102, calls = 315, calls flagged for inlining = 35, calls inlined = 32, statements flattened = 987 [2022-02-20 21:55:27,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:55:27,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:55:27,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:55:27,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:55:27,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:27" (1/1) ... [2022-02-20 21:55:27,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:27" (1/1) ... [2022-02-20 21:55:27,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:27" (1/1) ... [2022-02-20 21:55:27,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:27" (1/1) ... [2022-02-20 21:55:27,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:27" (1/1) ... [2022-02-20 21:55:27,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:27" (1/1) ... [2022-02-20 21:55:27,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:27" (1/1) ... [2022-02-20 21:55:27,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:55:27,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:55:27,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:55:27,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:55:27,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:27" (1/1) ... [2022-02-20 21:55:27,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:55:27,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:55:27,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 21:55:27,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 21:55:27,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:55:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:55:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:55:27,715 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-02-20 21:55:27,715 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-02-20 21:55:27,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:55:27,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:55:27,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:55:27,743 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_tx_fixup [2022-02-20 21:55:27,743 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_tx_fixup [2022-02-20 21:55:27,743 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_disconnect [2022-02-20 21:55:27,744 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_disconnect [2022-02-20 21:55:27,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:55:27,744 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:55:27,744 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-02-20 21:55:27,744 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-02-20 21:55:27,744 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:55:27,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:55:27,744 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_rx_fixup [2022-02-20 21:55:27,745 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_rx_fixup [2022-02-20 21:55:27,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_skb_12 [2022-02-20 21:55:27,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_skb_12 [2022-02-20 21:55:27,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-02-20 21:55:27,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-02-20 21:55:27,745 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:55:27,745 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:55:27,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:55:27,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:55:27,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:55:27,746 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-02-20 21:55:27,746 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-02-20 21:55:27,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 21:55:27,746 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 21:55:27,746 INFO L130 BoogieDeclarations]: Found specification of procedure usbnet_skb_return [2022-02-20 21:55:27,746 INFO L138 BoogieDeclarations]: Found implementation of procedure usbnet_skb_return [2022-02-20 21:55:27,746 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:55:27,746 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:55:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:55:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:55:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:55:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:55:27,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:55:27,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:55:27,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:55:27,748 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-02-20 21:55:27,748 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-02-20 21:55:27,748 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-02-20 21:55:27,748 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-02-20 21:55:27,748 INFO L130 BoogieDeclarations]: Found specification of procedure cx82310_cmd [2022-02-20 21:55:27,748 INFO L138 BoogieDeclarations]: Found implementation of procedure cx82310_cmd [2022-02-20 21:55:27,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:55:27,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:55:27,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:55:27,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:55:27,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:55:27,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:55:27,965 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:55:27,967 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:55:28,077 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:55:29,183 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:55:29,198 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:55:29,198 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 21:55:29,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:55:29 BoogieIcfgContainer [2022-02-20 21:55:29,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:55:29,202 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:55:29,202 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:55:29,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:55:29,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:55:26" (1/3) ... [2022-02-20 21:55:29,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fa575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:55:29, skipping insertion in model container [2022-02-20 21:55:29,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:55:27" (2/3) ... [2022-02-20 21:55:29,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30fa575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:55:29, skipping insertion in model container [2022-02-20 21:55:29,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:55:29" (3/3) ... [2022-02-20 21:55:29,208 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--usb--cx82310_eth.ko-entry_point.cil.out.i [2022-02-20 21:55:29,211 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:55:29,211 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:55:29,247 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:55:29,252 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 21:55:29,252 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:55:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 306 states, 230 states have (on average 1.4) internal successors, (322), 236 states have internal predecessors, (322), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-02-20 21:55:29,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 21:55:29,284 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:29,285 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:55:29,285 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:29,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:29,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1372626135, now seen corresponding path program 1 times [2022-02-20 21:55:29,294 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:29,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721993060] [2022-02-20 21:55:29,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:29,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:29,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {324#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {309#true} is VALID [2022-02-20 21:55:29,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {309#true} is VALID [2022-02-20 21:55:29,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-02-20 21:55:29,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #766#return; {309#true} is VALID [2022-02-20 21:55:29,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 21:55:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:29,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {325#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {309#true} is VALID [2022-02-20 21:55:29,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {309#true} is VALID [2022-02-20 21:55:29,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {309#true} is VALID [2022-02-20 21:55:29,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #768#return; {309#true} is VALID [2022-02-20 21:55:29,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:55:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:29,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {325#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {309#true} is VALID [2022-02-20 21:55:29,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {309#true} is VALID [2022-02-20 21:55:29,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {309#true} is VALID [2022-02-20 21:55:29,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #770#return; {309#true} is VALID [2022-02-20 21:55:29,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {309#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(106, 2);call #Ultimate.allocInit(28, 3);call #Ultimate.allocInit(24, 4);call #Ultimate.allocInit(25, 5);call #Ultimate.allocInit(41, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(34, 9);call #Ultimate.allocInit(2, 10);call write~init~int(1, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(36, 11);call #Ultimate.allocInit(32, 12);call #Ultimate.allocInit(26, 13);call #Ultimate.allocInit(30, 14);call #Ultimate.allocInit(12, 15);call #Ultimate.allocInit(12, 16);~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~cx82310_info_group1~0.base, ~cx82310_info_group1~0.offset := 0, 0;~cx82310_driver_group1~0.base, ~cx82310_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#cx82310_info~0.base, ~#cx82310_info~0.offset := 17, 0;call #Ultimate.allocInit(124, 17);call write~init~$Pointer$(14, 0, ~#cx82310_info~0.base, ~#cx82310_info~0.offset, 8);call write~init~int(32, ~#cx82310_info~0.base, 8 + ~#cx82310_info~0.offset, 4);call write~init~$Pointer$(#funAddr~cx82310_bind.base, #funAddr~cx82310_bind.offset, ~#cx82310_info~0.base, 12 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_unbind.base, #funAddr~cx82310_unbind.offset, ~#cx82310_info~0.base, 20 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 28 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 36 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 44 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 52 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 60 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 68 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_rx_fixup.base, #funAddr~cx82310_rx_fixup.offset, ~#cx82310_info~0.base, 76 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_tx_fixup.base, #funAddr~cx82310_tx_fixup.offset, ~#cx82310_info~0.base, 84 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 92 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 100 + ~#cx82310_info~0.offset, 8);call write~init~int(0, ~#cx82310_info~0.base, 108 + ~#cx82310_info~0.offset, 4);call write~init~int(0, ~#cx82310_info~0.base, 112 + ~#cx82310_info~0.offset, 4);call write~init~int(0, ~#cx82310_info~0.base, 116 + ~#cx82310_info~0.offset, 8);~#products~0.base, ~#products~0.offset := 18, 0;call #Ultimate.allocInit(50, 18);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#products~0.base);call write~unchecked~int(899, ~#products~0.base, ~#products~0.offset, 2);call write~unchecked~int(1394, ~#products~0.base, 2 + ~#products~0.offset, 2);call write~unchecked~int(51969, ~#products~0.base, 4 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 6 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 8 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 10 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 11 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 12 + ~#products~0.offset, 1);call write~unchecked~int(255, ~#products~0.base, 13 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 14 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 15 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 16 + ~#products~0.offset, 1);call write~unchecked~int(~#cx82310_info~0.base + ~#cx82310_info~0.offset, ~#products~0.base, 17 + ~#products~0.offset, 8);~__mod_usb__products_device_table~0.match_flags := 0;~__mod_usb__products_device_table~0.idVendor := 0;~__mod_usb__products_device_table~0.idProduct := 0;~__mod_usb__products_device_table~0.bcdDevice_lo := 0;~__mod_usb__products_device_table~0.bcdDevice_hi := 0;~__mod_usb__products_device_table~0.bDeviceClass := 0;~__mod_usb__products_device_table~0.bDeviceSubClass := 0;~__mod_usb__products_device_table~0.bDeviceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceClass := 0;~__mod_usb__products_device_table~0.bInterfaceSubClass := 0;~__mod_usb__products_device_table~0.bInterfaceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceNumber := 0;~__mod_usb__products_device_table~0.driver_info := 0;~#cx82310_driver~0.base, ~#cx82310_driver~0.offset := 19, 0;call #Ultimate.allocInit(285, 19);call write~init~$Pointer$(15, 0, ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_probe.base, #funAddr~usbnet_probe.offset, ~#cx82310_driver~0.base, 8 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_disconnect.base, #funAddr~usbnet_disconnect.offset, ~#cx82310_driver~0.base, 16 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 24 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_suspend.base, #funAddr~usbnet_suspend.offset, ~#cx82310_driver~0.base, 32 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_resume.base, #funAddr~usbnet_resume.offset, ~#cx82310_driver~0.base, 40 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 48 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 56 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 64 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(~#products~0.base, ~#products~0.offset, ~#cx82310_driver~0.base, 72 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 80 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 84 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 88 + ~#cx82310_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 92 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 100 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 108 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 116 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 124 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 132 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 136 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 148 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 156 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 164 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 172 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 180 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 188 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 196 + ~#cx82310_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 197 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 205 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 213 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 221 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 229 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 237 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 245 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 253 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 261 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 269 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 277 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 281 + ~#cx82310_driver~0.offset, 1);call write~init~int(0, ~#cx82310_driver~0.base, 282 + ~#cx82310_driver~0.offset, 1);call write~init~int(1, ~#cx82310_driver~0.base, 283 + ~#cx82310_driver~0.offset, 1);call write~init~int(0, ~#cx82310_driver~0.base, 284 + ~#cx82310_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 20, 0;call #Ultimate.allocInit(120, 20);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {309#true} is VALID [2022-02-20 21:55:29,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret172#1.base, main_#t~ret172#1.offset, main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset, main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset, main_#t~nondet175#1, main_#t~switch176#1, main_#t~nondet177#1, main_#t~switch178#1, main_#t~ret179#1, main_#t~mem180#1, main_#t~ret181#1, main_#t~ret182#1, main_#t~ret183#1, main_#t~nondet184#1, main_#t~switch185#1, main_#t~ret186#1, main_#t~nondet187#1, main_#t~switch188#1, main_#t~ret189#1, main_#t~ret190#1, main_#t~ret191#1, main_#t~mem192#1, main_#t~ret193#1.base, main_#t~ret193#1.offset, main_#t~mem194#1, main_#t~ret195#1.base, main_#t~ret195#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~11#1.base, main_~tmp~11#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___0~6#1, main_~tmp___1~3#1, main_~tmp___2~1#1, main_~tmp___3~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~11#1.base, main_~tmp~11#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___0~6#1;havoc main_~tmp___1~3#1;havoc main_~tmp___2~1#1;havoc main_~tmp___3~0#1; {309#true} is VALID [2022-02-20 21:55:29,818 INFO L272 TraceCheckUtils]: 2: Hoare triple {309#true} call main_#t~ret172#1.base, main_#t~ret172#1.offset := ldv_zalloc(32); {324#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:29,818 INFO L290 TraceCheckUtils]: 3: Hoare triple {324#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {309#true} is VALID [2022-02-20 21:55:29,818 INFO L290 TraceCheckUtils]: 4: Hoare triple {309#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {309#true} is VALID [2022-02-20 21:55:29,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#true} assume true; {309#true} is VALID [2022-02-20 21:55:29,819 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {309#true} {309#true} #766#return; {309#true} is VALID [2022-02-20 21:55:29,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#true} main_~tmp~11#1.base, main_~tmp~11#1.offset := main_#t~ret172#1.base, main_#t~ret172#1.offset;havoc main_#t~ret172#1.base, main_#t~ret172#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~11#1.base, main_~tmp~11#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {309#true} is VALID [2022-02-20 21:55:29,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} assume { :end_inline_ldv_set_init } true; {309#true} is VALID [2022-02-20 21:55:29,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {309#true} assume { :end_inline_ldv_initialize } true; {309#true} is VALID [2022-02-20 21:55:29,821 INFO L272 TraceCheckUtils]: 10: Hoare triple {309#true} call main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset := #Ultimate.C_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {325#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:55:29,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {325#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {309#true} is VALID [2022-02-20 21:55:29,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {309#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {309#true} is VALID [2022-02-20 21:55:29,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {309#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {309#true} is VALID [2022-02-20 21:55:29,821 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {309#true} {309#true} #768#return; {309#true} is VALID [2022-02-20 21:55:29,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {309#true} havoc main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset; {309#true} is VALID [2022-02-20 21:55:29,823 INFO L272 TraceCheckUtils]: 16: Hoare triple {309#true} call main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset := #Ultimate.C_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {325#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:55:29,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {325#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {309#true} is VALID [2022-02-20 21:55:29,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {309#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {309#true} is VALID [2022-02-20 21:55:29,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {309#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {309#true} is VALID [2022-02-20 21:55:29,824 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {309#true} {309#true} #770#return; {309#true} is VALID [2022-02-20 21:55:29,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {309#true} havoc main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {323#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:29,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {323#(= ~ldv_state_variable_0~0 1)} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {323#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:29,825 INFO L290 TraceCheckUtils]: 23: Hoare triple {323#(= ~ldv_state_variable_0~0 1)} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {323#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:29,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {323#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch176#1; {323#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:29,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {323#(= ~ldv_state_variable_0~0 1)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet184#1 && main_#t~nondet184#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet184#1;havoc main_#t~nondet184#1;main_#t~switch185#1 := 0 == main_~tmp___2~1#1; {323#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:29,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {323#(= ~ldv_state_variable_0~0 1)} assume main_#t~switch185#1; {323#(= ~ldv_state_variable_0~0 1)} is VALID [2022-02-20 21:55:29,827 INFO L290 TraceCheckUtils]: 27: Hoare triple {323#(= ~ldv_state_variable_0~0 1)} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_cx82310_driver_exit } true;assume { :begin_inline_ldv_usb_deregister_15 } true;ldv_usb_deregister_15_#in~arg#1.base, ldv_usb_deregister_15_#in~arg#1.offset := ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset;havoc ldv_usb_deregister_15_~arg#1.base, ldv_usb_deregister_15_~arg#1.offset;ldv_usb_deregister_15_~arg#1.base, ldv_usb_deregister_15_~arg#1.offset := ldv_usb_deregister_15_#in~arg#1.base, ldv_usb_deregister_15_#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_15_~arg#1.base, ldv_usb_deregister_15_~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; {310#false} is VALID [2022-02-20 21:55:29,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {310#false} assume { :end_inline_usb_deregister } true;~ldv_state_variable_1~0 := 0; {310#false} is VALID [2022-02-20 21:55:29,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {310#false} assume { :end_inline_ldv_usb_deregister_15 } true; {310#false} is VALID [2022-02-20 21:55:29,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {310#false} assume { :end_inline_cx82310_driver_exit } true;~ldv_state_variable_0~0 := 2; {310#false} is VALID [2022-02-20 21:55:29,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {310#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret209#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {310#false} is VALID [2022-02-20 21:55:29,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {310#false} ldv_check_final_state_#t~ret209#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret209#1 && ldv_check_final_state_#t~ret209#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret209#1;havoc ldv_check_final_state_#t~ret209#1; {310#false} is VALID [2022-02-20 21:55:29,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {310#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {310#false} is VALID [2022-02-20 21:55:29,829 INFO L272 TraceCheckUtils]: 34: Hoare triple {310#false} call ldv_error(); {310#false} is VALID [2022-02-20 21:55:29,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {310#false} assume !false; {310#false} is VALID [2022-02-20 21:55:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 21:55:29,830 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:29,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721993060] [2022-02-20 21:55:29,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721993060] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:29,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:29,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:55:29,832 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202520508] [2022-02-20 21:55:29,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:29,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-20 21:55:29,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:29,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:55:29,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:29,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:55:29,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:29,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:55:29,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:55:29,895 INFO L87 Difference]: Start difference. First operand has 306 states, 230 states have (on average 1.4) internal successors, (322), 236 states have internal predecessors, (322), 55 states have call successors, (55), 20 states have call predecessors, (55), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:55:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:36,673 INFO L93 Difference]: Finished difference Result 1045 states and 1591 transitions. [2022-02-20 21:55:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:55:36,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-02-20 21:55:36,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:55:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:55:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1591 transitions. [2022-02-20 21:55:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:55:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1591 transitions. [2022-02-20 21:55:36,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1591 transitions. [2022-02-20 21:55:38,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1591 edges. 1591 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:38,211 INFO L225 Difference]: With dead ends: 1045 [2022-02-20 21:55:38,212 INFO L226 Difference]: Without dead ends: 728 [2022-02-20 21:55:38,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:55:38,223 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 840 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:55:38,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [879 Valid, 1248 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 21:55:38,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-02-20 21:55:38,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 553. [2022-02-20 21:55:38,287 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:55:38,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 728 states. Second operand has 553 states, 423 states have (on average 1.375886524822695) internal successors, (582), 423 states have internal predecessors, (582), 94 states have call successors, (94), 36 states have call predecessors, (94), 35 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-02-20 21:55:38,292 INFO L74 IsIncluded]: Start isIncluded. First operand 728 states. Second operand has 553 states, 423 states have (on average 1.375886524822695) internal successors, (582), 423 states have internal predecessors, (582), 94 states have call successors, (94), 36 states have call predecessors, (94), 35 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-02-20 21:55:38,293 INFO L87 Difference]: Start difference. First operand 728 states. Second operand has 553 states, 423 states have (on average 1.375886524822695) internal successors, (582), 423 states have internal predecessors, (582), 94 states have call successors, (94), 36 states have call predecessors, (94), 35 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-02-20 21:55:38,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:38,365 INFO L93 Difference]: Finished difference Result 728 states and 1063 transitions. [2022-02-20 21:55:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1063 transitions. [2022-02-20 21:55:38,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:38,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:38,378 INFO L74 IsIncluded]: Start isIncluded. First operand has 553 states, 423 states have (on average 1.375886524822695) internal successors, (582), 423 states have internal predecessors, (582), 94 states have call successors, (94), 36 states have call predecessors, (94), 35 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) Second operand 728 states. [2022-02-20 21:55:38,381 INFO L87 Difference]: Start difference. First operand has 553 states, 423 states have (on average 1.375886524822695) internal successors, (582), 423 states have internal predecessors, (582), 94 states have call successors, (94), 36 states have call predecessors, (94), 35 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) Second operand 728 states. [2022-02-20 21:55:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:38,415 INFO L93 Difference]: Finished difference Result 728 states and 1063 transitions. [2022-02-20 21:55:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1063 transitions. [2022-02-20 21:55:38,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:38,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:38,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:55:38,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:55:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 423 states have (on average 1.375886524822695) internal successors, (582), 423 states have internal predecessors, (582), 94 states have call successors, (94), 36 states have call predecessors, (94), 35 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2022-02-20 21:55:38,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 769 transitions. [2022-02-20 21:55:38,485 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 769 transitions. Word has length 36 [2022-02-20 21:55:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:55:38,486 INFO L470 AbstractCegarLoop]: Abstraction has 553 states and 769 transitions. [2022-02-20 21:55:38,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 21:55:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 769 transitions. [2022-02-20 21:55:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 21:55:38,488 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:38,488 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:55:38,488 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:55:38,488 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:38,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:38,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2092020101, now seen corresponding path program 1 times [2022-02-20 21:55:38,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:38,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770173894] [2022-02-20 21:55:38,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:38,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:38,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:38,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {3980#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {3959#true} is VALID [2022-02-20 21:55:38,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {3959#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {3959#true} is VALID [2022-02-20 21:55:38,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {3959#true} assume true; {3959#true} is VALID [2022-02-20 21:55:38,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3959#true} {3959#true} #766#return; {3959#true} is VALID [2022-02-20 21:55:38,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 21:55:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:38,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {3981#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {3959#true} is VALID [2022-02-20 21:55:38,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {3959#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {3959#true} is VALID [2022-02-20 21:55:38,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {3959#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3959#true} is VALID [2022-02-20 21:55:38,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3959#true} {3965#(= ~last_index~0 0)} #768#return; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:55:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:38,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {3981#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {3959#true} is VALID [2022-02-20 21:55:38,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {3959#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {3959#true} is VALID [2022-02-20 21:55:38,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {3959#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3959#true} is VALID [2022-02-20 21:55:38,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3959#true} {3965#(= ~last_index~0 0)} #770#return; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:55:38,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:38,756 INFO L290 TraceCheckUtils]: 0: Hoare triple {3980#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {3959#true} is VALID [2022-02-20 21:55:38,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {3959#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {3959#true} is VALID [2022-02-20 21:55:38,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {3959#true} assume true; {3959#true} is VALID [2022-02-20 21:55:38,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3959#true} {3965#(= ~last_index~0 0)} #778#return; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {3959#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(106, 2);call #Ultimate.allocInit(28, 3);call #Ultimate.allocInit(24, 4);call #Ultimate.allocInit(25, 5);call #Ultimate.allocInit(41, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(34, 9);call #Ultimate.allocInit(2, 10);call write~init~int(1, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(36, 11);call #Ultimate.allocInit(32, 12);call #Ultimate.allocInit(26, 13);call #Ultimate.allocInit(30, 14);call #Ultimate.allocInit(12, 15);call #Ultimate.allocInit(12, 16);~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~cx82310_info_group1~0.base, ~cx82310_info_group1~0.offset := 0, 0;~cx82310_driver_group1~0.base, ~cx82310_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#cx82310_info~0.base, ~#cx82310_info~0.offset := 17, 0;call #Ultimate.allocInit(124, 17);call write~init~$Pointer$(14, 0, ~#cx82310_info~0.base, ~#cx82310_info~0.offset, 8);call write~init~int(32, ~#cx82310_info~0.base, 8 + ~#cx82310_info~0.offset, 4);call write~init~$Pointer$(#funAddr~cx82310_bind.base, #funAddr~cx82310_bind.offset, ~#cx82310_info~0.base, 12 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_unbind.base, #funAddr~cx82310_unbind.offset, ~#cx82310_info~0.base, 20 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 28 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 36 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 44 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 52 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 60 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 68 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_rx_fixup.base, #funAddr~cx82310_rx_fixup.offset, ~#cx82310_info~0.base, 76 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_tx_fixup.base, #funAddr~cx82310_tx_fixup.offset, ~#cx82310_info~0.base, 84 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 92 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 100 + ~#cx82310_info~0.offset, 8);call write~init~int(0, ~#cx82310_info~0.base, 108 + ~#cx82310_info~0.offset, 4);call write~init~int(0, ~#cx82310_info~0.base, 112 + ~#cx82310_info~0.offset, 4);call write~init~int(0, ~#cx82310_info~0.base, 116 + ~#cx82310_info~0.offset, 8);~#products~0.base, ~#products~0.offset := 18, 0;call #Ultimate.allocInit(50, 18);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#products~0.base);call write~unchecked~int(899, ~#products~0.base, ~#products~0.offset, 2);call write~unchecked~int(1394, ~#products~0.base, 2 + ~#products~0.offset, 2);call write~unchecked~int(51969, ~#products~0.base, 4 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 6 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 8 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 10 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 11 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 12 + ~#products~0.offset, 1);call write~unchecked~int(255, ~#products~0.base, 13 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 14 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 15 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 16 + ~#products~0.offset, 1);call write~unchecked~int(~#cx82310_info~0.base + ~#cx82310_info~0.offset, ~#products~0.base, 17 + ~#products~0.offset, 8);~__mod_usb__products_device_table~0.match_flags := 0;~__mod_usb__products_device_table~0.idVendor := 0;~__mod_usb__products_device_table~0.idProduct := 0;~__mod_usb__products_device_table~0.bcdDevice_lo := 0;~__mod_usb__products_device_table~0.bcdDevice_hi := 0;~__mod_usb__products_device_table~0.bDeviceClass := 0;~__mod_usb__products_device_table~0.bDeviceSubClass := 0;~__mod_usb__products_device_table~0.bDeviceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceClass := 0;~__mod_usb__products_device_table~0.bInterfaceSubClass := 0;~__mod_usb__products_device_table~0.bInterfaceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceNumber := 0;~__mod_usb__products_device_table~0.driver_info := 0;~#cx82310_driver~0.base, ~#cx82310_driver~0.offset := 19, 0;call #Ultimate.allocInit(285, 19);call write~init~$Pointer$(15, 0, ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_probe.base, #funAddr~usbnet_probe.offset, ~#cx82310_driver~0.base, 8 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_disconnect.base, #funAddr~usbnet_disconnect.offset, ~#cx82310_driver~0.base, 16 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 24 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_suspend.base, #funAddr~usbnet_suspend.offset, ~#cx82310_driver~0.base, 32 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_resume.base, #funAddr~usbnet_resume.offset, ~#cx82310_driver~0.base, 40 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 48 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 56 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 64 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(~#products~0.base, ~#products~0.offset, ~#cx82310_driver~0.base, 72 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 80 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 84 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 88 + ~#cx82310_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 92 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 100 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 108 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 116 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 124 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 132 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 136 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 148 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 156 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 164 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 172 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 180 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 188 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 196 + ~#cx82310_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 197 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 205 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 213 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 221 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 229 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 237 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 245 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 253 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 261 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 269 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 277 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 281 + ~#cx82310_driver~0.offset, 1);call write~init~int(0, ~#cx82310_driver~0.base, 282 + ~#cx82310_driver~0.offset, 1);call write~init~int(1, ~#cx82310_driver~0.base, 283 + ~#cx82310_driver~0.offset, 1);call write~init~int(0, ~#cx82310_driver~0.base, 284 + ~#cx82310_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 20, 0;call #Ultimate.allocInit(120, 20);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {3959#true} is VALID [2022-02-20 21:55:38,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {3959#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret172#1.base, main_#t~ret172#1.offset, main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset, main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset, main_#t~nondet175#1, main_#t~switch176#1, main_#t~nondet177#1, main_#t~switch178#1, main_#t~ret179#1, main_#t~mem180#1, main_#t~ret181#1, main_#t~ret182#1, main_#t~ret183#1, main_#t~nondet184#1, main_#t~switch185#1, main_#t~ret186#1, main_#t~nondet187#1, main_#t~switch188#1, main_#t~ret189#1, main_#t~ret190#1, main_#t~ret191#1, main_#t~mem192#1, main_#t~ret193#1.base, main_#t~ret193#1.offset, main_#t~mem194#1, main_#t~ret195#1.base, main_#t~ret195#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~11#1.base, main_~tmp~11#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___0~6#1, main_~tmp___1~3#1, main_~tmp___2~1#1, main_~tmp___3~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~11#1.base, main_~tmp~11#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___0~6#1;havoc main_~tmp___1~3#1;havoc main_~tmp___2~1#1;havoc main_~tmp___3~0#1; {3959#true} is VALID [2022-02-20 21:55:38,758 INFO L272 TraceCheckUtils]: 2: Hoare triple {3959#true} call main_#t~ret172#1.base, main_#t~ret172#1.offset := ldv_zalloc(32); {3980#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:38,759 INFO L290 TraceCheckUtils]: 3: Hoare triple {3980#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {3959#true} is VALID [2022-02-20 21:55:38,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {3959#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {3959#true} is VALID [2022-02-20 21:55:38,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {3959#true} assume true; {3959#true} is VALID [2022-02-20 21:55:38,759 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3959#true} {3959#true} #766#return; {3959#true} is VALID [2022-02-20 21:55:38,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {3959#true} main_~tmp~11#1.base, main_~tmp~11#1.offset := main_#t~ret172#1.base, main_#t~ret172#1.offset;havoc main_#t~ret172#1.base, main_#t~ret172#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~11#1.base, main_~tmp~11#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {3965#(= ~last_index~0 0)} assume { :end_inline_ldv_set_init } true; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {3965#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize } true; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,761 INFO L272 TraceCheckUtils]: 10: Hoare triple {3965#(= ~last_index~0 0)} call main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset := #Ultimate.C_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {3981#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:55:38,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {3981#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {3959#true} is VALID [2022-02-20 21:55:38,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {3959#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {3959#true} is VALID [2022-02-20 21:55:38,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {3959#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3959#true} is VALID [2022-02-20 21:55:38,762 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3959#true} {3965#(= ~last_index~0 0)} #768#return; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {3965#(= ~last_index~0 0)} havoc main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,763 INFO L272 TraceCheckUtils]: 16: Hoare triple {3965#(= ~last_index~0 0)} call main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset := #Ultimate.C_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {3981#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:55:38,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {3981#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {3959#true} is VALID [2022-02-20 21:55:38,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {3959#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {3959#true} is VALID [2022-02-20 21:55:38,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {3959#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {3959#true} is VALID [2022-02-20 21:55:38,764 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3959#true} {3965#(= ~last_index~0 0)} #770#return; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {3965#(= ~last_index~0 0)} havoc main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {3965#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {3965#(= ~last_index~0 0)} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {3965#(= ~last_index~0 0)} assume main_#t~switch176#1; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {3965#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet184#1 && main_#t~nondet184#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet184#1;havoc main_#t~nondet184#1;main_#t~switch185#1 := 0 == main_~tmp___2~1#1; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {3965#(= ~last_index~0 0)} assume !main_#t~switch185#1;main_#t~switch185#1 := main_#t~switch185#1 || 1 == main_~tmp___2~1#1; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {3965#(= ~last_index~0 0)} assume main_#t~switch185#1; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {3965#(= ~last_index~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_cx82310_driver_init } true;havoc cx82310_driver_init_#res#1;havoc cx82310_driver_init_#t~ret167#1, cx82310_driver_init_~tmp~8#1;havoc cx82310_driver_init_~tmp~8#1;assume { :begin_inline_ldv_usb_register_driver_14 } true;ldv_usb_register_driver_14_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.offset := ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 16, 0;havoc ldv_usb_register_driver_14_#res#1;havoc ldv_usb_register_driver_14_#t~ret199#1, ldv_usb_register_driver_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset, ldv_usb_register_driver_14_~ldv_func_res~0#1, ldv_usb_register_driver_14_~tmp~13#1;ldv_usb_register_driver_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_14_~ldv_func_res~0#1;havoc ldv_usb_register_driver_14_~tmp~13#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_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet220#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~nondet220#1 && usb_register_driver_#t~nondet220#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet220#1;havoc usb_register_driver_#t~nondet220#1; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {3965#(= ~last_index~0 0)} ldv_usb_register_driver_14_#t~ret199#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_14_#t~ret199#1 && ldv_usb_register_driver_14_#t~ret199#1 <= 2147483647;ldv_usb_register_driver_14_~tmp~13#1 := ldv_usb_register_driver_14_#t~ret199#1;havoc ldv_usb_register_driver_14_#t~ret199#1;ldv_usb_register_driver_14_~ldv_func_res~0#1 := ldv_usb_register_driver_14_~tmp~13#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~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset, ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset;havoc ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,770 INFO L272 TraceCheckUtils]: 30: Hoare triple {3965#(= ~last_index~0 0)} call ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset := ldv_zalloc(1560); {3980#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:38,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {3980#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {3959#true} is VALID [2022-02-20 21:55:38,771 INFO L290 TraceCheckUtils]: 32: Hoare triple {3959#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {3959#true} is VALID [2022-02-20 21:55:38,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {3959#true} assume true; {3959#true} is VALID [2022-02-20 21:55:38,772 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {3959#true} {3965#(= ~last_index~0 0)} #778#return; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {3965#(= ~last_index~0 0)} ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset := ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset;havoc ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset;~cx82310_driver_group1~0.base, ~cx82310_driver_group1~0.offset := ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {3965#(= ~last_index~0 0)} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_14_#res#1 := ldv_usb_register_driver_14_~ldv_func_res~0#1; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {3965#(= ~last_index~0 0)} cx82310_driver_init_#t~ret167#1 := ldv_usb_register_driver_14_#res#1;assume { :end_inline_ldv_usb_register_driver_14 } true;assume -2147483648 <= cx82310_driver_init_#t~ret167#1 && cx82310_driver_init_#t~ret167#1 <= 2147483647;cx82310_driver_init_~tmp~8#1 := cx82310_driver_init_#t~ret167#1;havoc cx82310_driver_init_#t~ret167#1;cx82310_driver_init_#res#1 := cx82310_driver_init_~tmp~8#1; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,773 INFO L290 TraceCheckUtils]: 38: Hoare triple {3965#(= ~last_index~0 0)} main_#t~ret186#1 := cx82310_driver_init_#res#1;assume { :end_inline_cx82310_driver_init } true;assume -2147483648 <= main_#t~ret186#1 && main_#t~ret186#1 <= 2147483647;~ldv_retval_4~0 := main_#t~ret186#1;havoc main_#t~ret186#1; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,773 INFO L290 TraceCheckUtils]: 39: Hoare triple {3965#(= ~last_index~0 0)} assume !(0 == ~ldv_retval_4~0); {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {3965#(= ~last_index~0 0)} assume 0 != ~ldv_retval_4~0;~ldv_state_variable_0~0 := 2; {3965#(= ~last_index~0 0)} is VALID [2022-02-20 21:55:38,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {3965#(= ~last_index~0 0)} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret209#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {3978#(<= 1 |ULTIMATE.start_ldv_set_is_empty_#res#1|)} is VALID [2022-02-20 21:55:38,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {3978#(<= 1 |ULTIMATE.start_ldv_set_is_empty_#res#1|)} ldv_check_final_state_#t~ret209#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret209#1 && ldv_check_final_state_#t~ret209#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret209#1;havoc ldv_check_final_state_#t~ret209#1; {3979#(<= 1 |ULTIMATE.start_ldv_check_final_state_~tmp___7~5#1|)} is VALID [2022-02-20 21:55:38,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {3979#(<= 1 |ULTIMATE.start_ldv_check_final_state_~tmp___7~5#1|)} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {3960#false} is VALID [2022-02-20 21:55:38,776 INFO L272 TraceCheckUtils]: 44: Hoare triple {3960#false} call ldv_error(); {3960#false} is VALID [2022-02-20 21:55:38,776 INFO L290 TraceCheckUtils]: 45: Hoare triple {3960#false} assume !false; {3960#false} is VALID [2022-02-20 21:55:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 21:55:38,777 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:38,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770173894] [2022-02-20 21:55:38,777 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770173894] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:38,778 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:38,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:55:38,778 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628343127] [2022-02-20 21:55:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:38,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-02-20 21:55:38,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:38,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:55:38,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:38,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:55:38,814 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:38,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:55:38,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:55:38,816 INFO L87 Difference]: Start difference. First operand 553 states and 769 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:55:46,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:46,037 INFO L93 Difference]: Finished difference Result 1975 states and 2881 transitions. [2022-02-20 21:55:46,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:55:46,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-02-20 21:55:46,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:55:46,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:55:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1500 transitions. [2022-02-20 21:55:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:55:46,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1500 transitions. [2022-02-20 21:55:46,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 1500 transitions. [2022-02-20 21:55:47,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1500 edges. 1500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:47,448 INFO L225 Difference]: With dead ends: 1975 [2022-02-20 21:55:47,449 INFO L226 Difference]: Without dead ends: 1430 [2022-02-20 21:55:47,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-20 21:55:47,458 INFO L933 BasicCegarLoop]: 517 mSDtfsCounter, 847 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 2280 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-02-20 21:55:47,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [888 Valid, 2280 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-02-20 21:55:47,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2022-02-20 21:55:47,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1163. [2022-02-20 21:55:47,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:55:47,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1430 states. Second operand has 1163 states, 897 states have (on average 1.3812709030100334) internal successors, (1239), 899 states have internal predecessors, (1239), 188 states have call successors, (188), 70 states have call predecessors, (188), 77 states have return successors, (215), 193 states have call predecessors, (215), 187 states have call successors, (215) [2022-02-20 21:55:47,630 INFO L74 IsIncluded]: Start isIncluded. First operand 1430 states. Second operand has 1163 states, 897 states have (on average 1.3812709030100334) internal successors, (1239), 899 states have internal predecessors, (1239), 188 states have call successors, (188), 70 states have call predecessors, (188), 77 states have return successors, (215), 193 states have call predecessors, (215), 187 states have call successors, (215) [2022-02-20 21:55:47,633 INFO L87 Difference]: Start difference. First operand 1430 states. Second operand has 1163 states, 897 states have (on average 1.3812709030100334) internal successors, (1239), 899 states have internal predecessors, (1239), 188 states have call successors, (188), 70 states have call predecessors, (188), 77 states have return successors, (215), 193 states have call predecessors, (215), 187 states have call successors, (215) [2022-02-20 21:55:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:47,715 INFO L93 Difference]: Finished difference Result 1430 states and 2102 transitions. [2022-02-20 21:55:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2102 transitions. [2022-02-20 21:55:47,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:47,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:47,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 1163 states, 897 states have (on average 1.3812709030100334) internal successors, (1239), 899 states have internal predecessors, (1239), 188 states have call successors, (188), 70 states have call predecessors, (188), 77 states have return successors, (215), 193 states have call predecessors, (215), 187 states have call successors, (215) Second operand 1430 states. [2022-02-20 21:55:47,725 INFO L87 Difference]: Start difference. First operand has 1163 states, 897 states have (on average 1.3812709030100334) internal successors, (1239), 899 states have internal predecessors, (1239), 188 states have call successors, (188), 70 states have call predecessors, (188), 77 states have return successors, (215), 193 states have call predecessors, (215), 187 states have call successors, (215) Second operand 1430 states. [2022-02-20 21:55:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:47,803 INFO L93 Difference]: Finished difference Result 1430 states and 2102 transitions. [2022-02-20 21:55:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2102 transitions. [2022-02-20 21:55:47,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:47,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:47,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:55:47,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:55:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 897 states have (on average 1.3812709030100334) internal successors, (1239), 899 states have internal predecessors, (1239), 188 states have call successors, (188), 70 states have call predecessors, (188), 77 states have return successors, (215), 193 states have call predecessors, (215), 187 states have call successors, (215) [2022-02-20 21:55:47,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1642 transitions. [2022-02-20 21:55:47,880 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1642 transitions. Word has length 46 [2022-02-20 21:55:47,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:55:47,881 INFO L470 AbstractCegarLoop]: Abstraction has 1163 states and 1642 transitions. [2022-02-20 21:55:47,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 21:55:47,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1642 transitions. [2022-02-20 21:55:47,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-02-20 21:55:47,887 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:47,888 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:55:47,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:55:47,888 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:47,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:47,889 INFO L85 PathProgramCache]: Analyzing trace with hash -2091695119, now seen corresponding path program 1 times [2022-02-20 21:55:47,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:47,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794947441] [2022-02-20 21:55:47,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:47,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:48,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:48,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {11105#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {11058#true} is VALID [2022-02-20 21:55:48,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {11058#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {11058#true} is VALID [2022-02-20 21:55:48,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11058#true} {11058#true} #766#return; {11058#true} is VALID [2022-02-20 21:55:48,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 21:55:48,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:48,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {11106#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {11058#true} is VALID [2022-02-20 21:55:48,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {11058#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {11058#true} is VALID [2022-02-20 21:55:48,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {11058#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11058#true} is VALID [2022-02-20 21:55:48,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11058#true} {11058#true} #768#return; {11058#true} is VALID [2022-02-20 21:55:48,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:55:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:48,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {11106#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {11058#true} is VALID [2022-02-20 21:55:48,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {11058#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {11058#true} is VALID [2022-02-20 21:55:48,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {11058#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11058#true} is VALID [2022-02-20 21:55:48,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11058#true} {11058#true} #770#return; {11058#true} is VALID [2022-02-20 21:55:48,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:55:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:48,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:48,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:48,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:48,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {11105#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {11058#true} is VALID [2022-02-20 21:55:48,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {11058#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {11058#true} is VALID [2022-02-20 21:55:48,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11058#true} {11058#true} #736#return; {11058#true} is VALID [2022-02-20 21:55:48,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {11129#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {11058#true} is VALID [2022-02-20 21:55:48,148 INFO L272 TraceCheckUtils]: 1: Hoare triple {11058#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {11105#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:48,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {11105#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {11058#true} is VALID [2022-02-20 21:55:48,149 INFO L290 TraceCheckUtils]: 3: Hoare triple {11058#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {11058#true} is VALID [2022-02-20 21:55:48,149 INFO L290 TraceCheckUtils]: 4: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,149 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11058#true} {11058#true} #736#return; {11058#true} is VALID [2022-02-20 21:55:48,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {11058#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {11058#true} is VALID [2022-02-20 21:55:48,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {11058#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {11058#true} is VALID [2022-02-20 21:55:48,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {11058#true} assume !false; {11058#true} is VALID [2022-02-20 21:55:48,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {11058#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {11058#true} is VALID [2022-02-20 21:55:48,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {11058#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {11058#true} is VALID [2022-02-20 21:55:48,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {11058#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {11058#true} is VALID [2022-02-20 21:55:48,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,151 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {11058#true} {11058#true} #842#return; {11058#true} is VALID [2022-02-20 21:55:48,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {11129#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~12.base, ~tmp~12.offset; {11058#true} is VALID [2022-02-20 21:55:48,152 INFO L272 TraceCheckUtils]: 1: Hoare triple {11058#true} call #t~ret196.base, #t~ret196.offset := ldv_skb_alloc(); {11129#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:48,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {11129#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {11058#true} is VALID [2022-02-20 21:55:48,153 INFO L272 TraceCheckUtils]: 3: Hoare triple {11058#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {11105#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:48,153 INFO L290 TraceCheckUtils]: 4: Hoare triple {11105#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {11058#true} is VALID [2022-02-20 21:55:48,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {11058#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {11058#true} is VALID [2022-02-20 21:55:48,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,154 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11058#true} {11058#true} #736#return; {11058#true} is VALID [2022-02-20 21:55:48,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {11058#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {11058#true} is VALID [2022-02-20 21:55:48,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {11058#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {11058#true} is VALID [2022-02-20 21:55:48,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {11058#true} assume !false; {11058#true} is VALID [2022-02-20 21:55:48,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {11058#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {11058#true} is VALID [2022-02-20 21:55:48,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {11058#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {11058#true} is VALID [2022-02-20 21:55:48,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {11058#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {11058#true} is VALID [2022-02-20 21:55:48,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,155 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11058#true} {11058#true} #842#return; {11058#true} is VALID [2022-02-20 21:55:48,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {11058#true} ~tmp~12.base, ~tmp~12.offset := #t~ret196.base, #t~ret196.offset;havoc #t~ret196.base, #t~ret196.offset; {11058#true} is VALID [2022-02-20 21:55:48,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {11058#true} assume !(~tmp~12.base != 0 || ~tmp~12.offset != 0); {11058#true} is VALID [2022-02-20 21:55:48,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {11058#true} #res.base, #res.offset := ~tmp~12.base, ~tmp~12.offset; {11058#true} is VALID [2022-02-20 21:55:48,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,156 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11058#true} {11058#true} #814#return; {11058#true} is VALID [2022-02-20 21:55:48,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {11107#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5838)| abs_5838) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~len~0#1;havoc ~skb2~0#1.base, ~skb2~0#1.offset;havoc ~__len~1#1;havoc ~__ret~1#1.base, ~__ret~1#1.offset;havoc ~__len___0~1#1;havoc ~__ret___0~1#1.base, ~__ret___0~1#1.offset;havoc ~__len___1~0#1;havoc ~__ret___1~0#1.base, ~__ret___1~0#1.offset;havoc ~__len___2~0#1;havoc ~__ret___2~0#1.base, ~__ret___2~0#1.offset;call #t~mem111#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8); {11058#true} is VALID [2022-02-20 21:55:48,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {11058#true} assume 0 != #t~mem111#1 % 18446744073709551616;havoc #t~mem111#1;call #t~mem112#1 := read~int(~dev#1.base, 452 + ~dev#1.offset, 8);call #t~mem113#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8);~len~0#1 := (if (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 <= 2147483647 then (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 else (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 - 4294967296);havoc #t~mem112#1;havoc #t~mem113#1; {11058#true} is VALID [2022-02-20 21:55:48,157 INFO L272 TraceCheckUtils]: 2: Hoare triple {11058#true} call #t~ret114#1.base, #t~ret114#1.offset := ldv_alloc_skb_12(~len~0#1, 32); {11129#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:48,158 INFO L290 TraceCheckUtils]: 3: Hoare triple {11129#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~12.base, ~tmp~12.offset; {11058#true} is VALID [2022-02-20 21:55:48,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {11058#true} call #t~ret196.base, #t~ret196.offset := ldv_skb_alloc(); {11129#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:48,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {11129#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {11058#true} is VALID [2022-02-20 21:55:48,159 INFO L272 TraceCheckUtils]: 6: Hoare triple {11058#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {11105#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:48,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {11105#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {11058#true} is VALID [2022-02-20 21:55:48,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {11058#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {11058#true} is VALID [2022-02-20 21:55:48,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,160 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11058#true} {11058#true} #736#return; {11058#true} is VALID [2022-02-20 21:55:48,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {11058#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {11058#true} is VALID [2022-02-20 21:55:48,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {11058#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {11058#true} is VALID [2022-02-20 21:55:48,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {11058#true} assume !false; {11058#true} is VALID [2022-02-20 21:55:48,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {11058#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {11058#true} is VALID [2022-02-20 21:55:48,161 INFO L290 TraceCheckUtils]: 15: Hoare triple {11058#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {11058#true} is VALID [2022-02-20 21:55:48,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {11058#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {11058#true} is VALID [2022-02-20 21:55:48,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,161 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11058#true} {11058#true} #842#return; {11058#true} is VALID [2022-02-20 21:55:48,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {11058#true} ~tmp~12.base, ~tmp~12.offset := #t~ret196.base, #t~ret196.offset;havoc #t~ret196.base, #t~ret196.offset; {11058#true} is VALID [2022-02-20 21:55:48,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {11058#true} assume !(~tmp~12.base != 0 || ~tmp~12.offset != 0); {11058#true} is VALID [2022-02-20 21:55:48,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {11058#true} #res.base, #res.offset := ~tmp~12.base, ~tmp~12.offset; {11058#true} is VALID [2022-02-20 21:55:48,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,162 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11058#true} {11058#true} #814#return; {11058#true} is VALID [2022-02-20 21:55:48,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {11058#true} ~skb2~0#1.base, ~skb2~0#1.offset := #t~ret114#1.base, #t~ret114#1.offset;havoc #t~ret114#1.base, #t~ret114#1.offset; {11058#true} is VALID [2022-02-20 21:55:48,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {11058#true} assume 0 == (~skb2~0#1.base + ~skb2~0#1.offset) % 18446744073709551616;#res#1 := 0; {11058#true} is VALID [2022-02-20 21:55:48,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,163 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11058#true} {11059#false} #790#return; {11059#false} is VALID [2022-02-20 21:55:48,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 21:55:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:48,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {11105#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {11058#true} is VALID [2022-02-20 21:55:48,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {11058#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {11058#true} is VALID [2022-02-20 21:55:48,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11058#true} {11059#false} #778#return; {11059#false} is VALID [2022-02-20 21:55:48,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {11058#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(106, 2);call #Ultimate.allocInit(28, 3);call #Ultimate.allocInit(24, 4);call #Ultimate.allocInit(25, 5);call #Ultimate.allocInit(41, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(34, 9);call #Ultimate.allocInit(2, 10);call write~init~int(1, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(36, 11);call #Ultimate.allocInit(32, 12);call #Ultimate.allocInit(26, 13);call #Ultimate.allocInit(30, 14);call #Ultimate.allocInit(12, 15);call #Ultimate.allocInit(12, 16);~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~cx82310_info_group1~0.base, ~cx82310_info_group1~0.offset := 0, 0;~cx82310_driver_group1~0.base, ~cx82310_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#cx82310_info~0.base, ~#cx82310_info~0.offset := 17, 0;call #Ultimate.allocInit(124, 17);call write~init~$Pointer$(14, 0, ~#cx82310_info~0.base, ~#cx82310_info~0.offset, 8);call write~init~int(32, ~#cx82310_info~0.base, 8 + ~#cx82310_info~0.offset, 4);call write~init~$Pointer$(#funAddr~cx82310_bind.base, #funAddr~cx82310_bind.offset, ~#cx82310_info~0.base, 12 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_unbind.base, #funAddr~cx82310_unbind.offset, ~#cx82310_info~0.base, 20 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 28 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 36 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 44 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 52 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 60 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 68 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_rx_fixup.base, #funAddr~cx82310_rx_fixup.offset, ~#cx82310_info~0.base, 76 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_tx_fixup.base, #funAddr~cx82310_tx_fixup.offset, ~#cx82310_info~0.base, 84 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 92 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 100 + ~#cx82310_info~0.offset, 8);call write~init~int(0, ~#cx82310_info~0.base, 108 + ~#cx82310_info~0.offset, 4);call write~init~int(0, ~#cx82310_info~0.base, 112 + ~#cx82310_info~0.offset, 4);call write~init~int(0, ~#cx82310_info~0.base, 116 + ~#cx82310_info~0.offset, 8);~#products~0.base, ~#products~0.offset := 18, 0;call #Ultimate.allocInit(50, 18);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#products~0.base);call write~unchecked~int(899, ~#products~0.base, ~#products~0.offset, 2);call write~unchecked~int(1394, ~#products~0.base, 2 + ~#products~0.offset, 2);call write~unchecked~int(51969, ~#products~0.base, 4 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 6 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 8 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 10 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 11 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 12 + ~#products~0.offset, 1);call write~unchecked~int(255, ~#products~0.base, 13 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 14 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 15 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 16 + ~#products~0.offset, 1);call write~unchecked~int(~#cx82310_info~0.base + ~#cx82310_info~0.offset, ~#products~0.base, 17 + ~#products~0.offset, 8);~__mod_usb__products_device_table~0.match_flags := 0;~__mod_usb__products_device_table~0.idVendor := 0;~__mod_usb__products_device_table~0.idProduct := 0;~__mod_usb__products_device_table~0.bcdDevice_lo := 0;~__mod_usb__products_device_table~0.bcdDevice_hi := 0;~__mod_usb__products_device_table~0.bDeviceClass := 0;~__mod_usb__products_device_table~0.bDeviceSubClass := 0;~__mod_usb__products_device_table~0.bDeviceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceClass := 0;~__mod_usb__products_device_table~0.bInterfaceSubClass := 0;~__mod_usb__products_device_table~0.bInterfaceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceNumber := 0;~__mod_usb__products_device_table~0.driver_info := 0;~#cx82310_driver~0.base, ~#cx82310_driver~0.offset := 19, 0;call #Ultimate.allocInit(285, 19);call write~init~$Pointer$(15, 0, ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_probe.base, #funAddr~usbnet_probe.offset, ~#cx82310_driver~0.base, 8 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_disconnect.base, #funAddr~usbnet_disconnect.offset, ~#cx82310_driver~0.base, 16 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 24 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_suspend.base, #funAddr~usbnet_suspend.offset, ~#cx82310_driver~0.base, 32 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_resume.base, #funAddr~usbnet_resume.offset, ~#cx82310_driver~0.base, 40 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 48 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 56 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 64 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(~#products~0.base, ~#products~0.offset, ~#cx82310_driver~0.base, 72 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 80 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 84 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 88 + ~#cx82310_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 92 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 100 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 108 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 116 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 124 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 132 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 136 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 148 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 156 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 164 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 172 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 180 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 188 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 196 + ~#cx82310_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 197 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 205 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 213 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 221 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 229 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 237 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 245 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 253 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 261 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 269 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 277 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 281 + ~#cx82310_driver~0.offset, 1);call write~init~int(0, ~#cx82310_driver~0.base, 282 + ~#cx82310_driver~0.offset, 1);call write~init~int(1, ~#cx82310_driver~0.base, 283 + ~#cx82310_driver~0.offset, 1);call write~init~int(0, ~#cx82310_driver~0.base, 284 + ~#cx82310_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 20, 0;call #Ultimate.allocInit(120, 20);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {11058#true} is VALID [2022-02-20 21:55:48,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {11058#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret172#1.base, main_#t~ret172#1.offset, main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset, main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset, main_#t~nondet175#1, main_#t~switch176#1, main_#t~nondet177#1, main_#t~switch178#1, main_#t~ret179#1, main_#t~mem180#1, main_#t~ret181#1, main_#t~ret182#1, main_#t~ret183#1, main_#t~nondet184#1, main_#t~switch185#1, main_#t~ret186#1, main_#t~nondet187#1, main_#t~switch188#1, main_#t~ret189#1, main_#t~ret190#1, main_#t~ret191#1, main_#t~mem192#1, main_#t~ret193#1.base, main_#t~ret193#1.offset, main_#t~mem194#1, main_#t~ret195#1.base, main_#t~ret195#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~11#1.base, main_~tmp~11#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___0~6#1, main_~tmp___1~3#1, main_~tmp___2~1#1, main_~tmp___3~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~11#1.base, main_~tmp~11#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___0~6#1;havoc main_~tmp___1~3#1;havoc main_~tmp___2~1#1;havoc main_~tmp___3~0#1; {11058#true} is VALID [2022-02-20 21:55:48,175 INFO L272 TraceCheckUtils]: 2: Hoare triple {11058#true} call main_#t~ret172#1.base, main_#t~ret172#1.offset := ldv_zalloc(32); {11105#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:48,175 INFO L290 TraceCheckUtils]: 3: Hoare triple {11105#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {11058#true} is VALID [2022-02-20 21:55:48,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {11058#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {11058#true} is VALID [2022-02-20 21:55:48,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,179 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {11058#true} {11058#true} #766#return; {11058#true} is VALID [2022-02-20 21:55:48,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {11058#true} main_~tmp~11#1.base, main_~tmp~11#1.offset := main_#t~ret172#1.base, main_#t~ret172#1.offset;havoc main_#t~ret172#1.base, main_#t~ret172#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~11#1.base, main_~tmp~11#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {11058#true} is VALID [2022-02-20 21:55:48,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {11058#true} assume { :end_inline_ldv_set_init } true; {11058#true} is VALID [2022-02-20 21:55:48,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {11058#true} assume { :end_inline_ldv_initialize } true; {11058#true} is VALID [2022-02-20 21:55:48,180 INFO L272 TraceCheckUtils]: 10: Hoare triple {11058#true} call main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset := #Ultimate.C_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {11106#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:55:48,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {11106#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {11058#true} is VALID [2022-02-20 21:55:48,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {11058#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {11058#true} is VALID [2022-02-20 21:55:48,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {11058#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11058#true} is VALID [2022-02-20 21:55:48,181 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {11058#true} {11058#true} #768#return; {11058#true} is VALID [2022-02-20 21:55:48,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {11058#true} havoc main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset; {11058#true} is VALID [2022-02-20 21:55:48,182 INFO L272 TraceCheckUtils]: 16: Hoare triple {11058#true} call main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset := #Ultimate.C_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {11106#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:55:48,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {11106#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {11058#true} is VALID [2022-02-20 21:55:48,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {11058#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {11058#true} is VALID [2022-02-20 21:55:48,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {11058#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {11058#true} is VALID [2022-02-20 21:55:48,182 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {11058#true} {11058#true} #770#return; {11058#true} is VALID [2022-02-20 21:55:48,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {11058#true} havoc main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {11072#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:55:48,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {11072#(= ~ldv_state_variable_2~0 0)} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {11072#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:55:48,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {11072#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {11072#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:55:48,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {11072#(= ~ldv_state_variable_2~0 0)} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 2 == main_~tmp___0~6#1; {11072#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:55:48,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {11072#(= ~ldv_state_variable_2~0 0)} assume main_#t~switch176#1; {11072#(= ~ldv_state_variable_2~0 0)} is VALID [2022-02-20 21:55:48,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {11072#(= ~ldv_state_variable_2~0 0)} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet187#1 && main_#t~nondet187#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet187#1;havoc main_#t~nondet187#1;main_#t~switch188#1 := 0 == main_~tmp___3~0#1; {11059#false} is VALID [2022-02-20 21:55:48,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {11059#false} assume main_#t~switch188#1; {11059#false} is VALID [2022-02-20 21:55:48,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {11059#false} assume !(1 == ~ldv_state_variable_2~0); {11059#false} is VALID [2022-02-20 21:55:48,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {11059#false} assume 2 == ~ldv_state_variable_2~0; {11059#false} is VALID [2022-02-20 21:55:48,185 INFO L272 TraceCheckUtils]: 30: Hoare triple {11059#false} call main_#t~ret190#1 := cx82310_rx_fixup(~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset, ~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset); {11107#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5838)| abs_5838) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:48,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {11107#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5838)| abs_5838) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~len~0#1;havoc ~skb2~0#1.base, ~skb2~0#1.offset;havoc ~__len~1#1;havoc ~__ret~1#1.base, ~__ret~1#1.offset;havoc ~__len___0~1#1;havoc ~__ret___0~1#1.base, ~__ret___0~1#1.offset;havoc ~__len___1~0#1;havoc ~__ret___1~0#1.base, ~__ret___1~0#1.offset;havoc ~__len___2~0#1;havoc ~__ret___2~0#1.base, ~__ret___2~0#1.offset;call #t~mem111#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8); {11058#true} is VALID [2022-02-20 21:55:48,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {11058#true} assume 0 != #t~mem111#1 % 18446744073709551616;havoc #t~mem111#1;call #t~mem112#1 := read~int(~dev#1.base, 452 + ~dev#1.offset, 8);call #t~mem113#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8);~len~0#1 := (if (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 <= 2147483647 then (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 else (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 - 4294967296);havoc #t~mem112#1;havoc #t~mem113#1; {11058#true} is VALID [2022-02-20 21:55:48,186 INFO L272 TraceCheckUtils]: 33: Hoare triple {11058#true} call #t~ret114#1.base, #t~ret114#1.offset := ldv_alloc_skb_12(~len~0#1, 32); {11129#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:48,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {11129#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~12.base, ~tmp~12.offset; {11058#true} is VALID [2022-02-20 21:55:48,187 INFO L272 TraceCheckUtils]: 35: Hoare triple {11058#true} call #t~ret196.base, #t~ret196.offset := ldv_skb_alloc(); {11129#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:48,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {11129#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {11058#true} is VALID [2022-02-20 21:55:48,188 INFO L272 TraceCheckUtils]: 37: Hoare triple {11058#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {11105#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:48,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {11105#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {11058#true} is VALID [2022-02-20 21:55:48,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {11058#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {11058#true} is VALID [2022-02-20 21:55:48,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,188 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11058#true} {11058#true} #736#return; {11058#true} is VALID [2022-02-20 21:55:48,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {11058#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {11058#true} is VALID [2022-02-20 21:55:48,193 INFO L290 TraceCheckUtils]: 43: Hoare triple {11058#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {11058#true} is VALID [2022-02-20 21:55:48,193 INFO L290 TraceCheckUtils]: 44: Hoare triple {11058#true} assume !false; {11058#true} is VALID [2022-02-20 21:55:48,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {11058#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {11058#true} is VALID [2022-02-20 21:55:48,194 INFO L290 TraceCheckUtils]: 46: Hoare triple {11058#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {11058#true} is VALID [2022-02-20 21:55:48,197 INFO L290 TraceCheckUtils]: 47: Hoare triple {11058#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {11058#true} is VALID [2022-02-20 21:55:48,198 INFO L290 TraceCheckUtils]: 48: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,199 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {11058#true} {11058#true} #842#return; {11058#true} is VALID [2022-02-20 21:55:48,199 INFO L290 TraceCheckUtils]: 50: Hoare triple {11058#true} ~tmp~12.base, ~tmp~12.offset := #t~ret196.base, #t~ret196.offset;havoc #t~ret196.base, #t~ret196.offset; {11058#true} is VALID [2022-02-20 21:55:48,199 INFO L290 TraceCheckUtils]: 51: Hoare triple {11058#true} assume !(~tmp~12.base != 0 || ~tmp~12.offset != 0); {11058#true} is VALID [2022-02-20 21:55:48,199 INFO L290 TraceCheckUtils]: 52: Hoare triple {11058#true} #res.base, #res.offset := ~tmp~12.base, ~tmp~12.offset; {11058#true} is VALID [2022-02-20 21:55:48,200 INFO L290 TraceCheckUtils]: 53: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,200 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11058#true} {11058#true} #814#return; {11058#true} is VALID [2022-02-20 21:55:48,201 INFO L290 TraceCheckUtils]: 55: Hoare triple {11058#true} ~skb2~0#1.base, ~skb2~0#1.offset := #t~ret114#1.base, #t~ret114#1.offset;havoc #t~ret114#1.base, #t~ret114#1.offset; {11058#true} is VALID [2022-02-20 21:55:48,201 INFO L290 TraceCheckUtils]: 56: Hoare triple {11058#true} assume 0 == (~skb2~0#1.base + ~skb2~0#1.offset) % 18446744073709551616;#res#1 := 0; {11058#true} is VALID [2022-02-20 21:55:48,201 INFO L290 TraceCheckUtils]: 57: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,202 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {11058#true} {11059#false} #790#return; {11059#false} is VALID [2022-02-20 21:55:48,202 INFO L290 TraceCheckUtils]: 59: Hoare triple {11059#false} assume -2147483648 <= main_#t~ret190#1 && main_#t~ret190#1 <= 2147483647;havoc main_#t~ret190#1;~ldv_state_variable_2~0 := 2; {11059#false} is VALID [2022-02-20 21:55:48,202 INFO L290 TraceCheckUtils]: 60: Hoare triple {11059#false} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {11059#false} is VALID [2022-02-20 21:55:48,202 INFO L290 TraceCheckUtils]: 61: Hoare triple {11059#false} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {11059#false} is VALID [2022-02-20 21:55:48,204 INFO L290 TraceCheckUtils]: 62: Hoare triple {11059#false} assume main_#t~switch176#1; {11059#false} is VALID [2022-02-20 21:55:48,205 INFO L290 TraceCheckUtils]: 63: Hoare triple {11059#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet184#1 && main_#t~nondet184#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet184#1;havoc main_#t~nondet184#1;main_#t~switch185#1 := 0 == main_~tmp___2~1#1; {11059#false} is VALID [2022-02-20 21:55:48,205 INFO L290 TraceCheckUtils]: 64: Hoare triple {11059#false} assume !main_#t~switch185#1;main_#t~switch185#1 := main_#t~switch185#1 || 1 == main_~tmp___2~1#1; {11059#false} is VALID [2022-02-20 21:55:48,205 INFO L290 TraceCheckUtils]: 65: Hoare triple {11059#false} assume main_#t~switch185#1; {11059#false} is VALID [2022-02-20 21:55:48,205 INFO L290 TraceCheckUtils]: 66: Hoare triple {11059#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_cx82310_driver_init } true;havoc cx82310_driver_init_#res#1;havoc cx82310_driver_init_#t~ret167#1, cx82310_driver_init_~tmp~8#1;havoc cx82310_driver_init_~tmp~8#1;assume { :begin_inline_ldv_usb_register_driver_14 } true;ldv_usb_register_driver_14_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.offset := ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 16, 0;havoc ldv_usb_register_driver_14_#res#1;havoc ldv_usb_register_driver_14_#t~ret199#1, ldv_usb_register_driver_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset, ldv_usb_register_driver_14_~ldv_func_res~0#1, ldv_usb_register_driver_14_~tmp~13#1;ldv_usb_register_driver_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_14_~ldv_func_res~0#1;havoc ldv_usb_register_driver_14_~tmp~13#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_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet220#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~nondet220#1 && usb_register_driver_#t~nondet220#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet220#1;havoc usb_register_driver_#t~nondet220#1; {11059#false} is VALID [2022-02-20 21:55:48,205 INFO L290 TraceCheckUtils]: 67: Hoare triple {11059#false} ldv_usb_register_driver_14_#t~ret199#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_14_#t~ret199#1 && ldv_usb_register_driver_14_#t~ret199#1 <= 2147483647;ldv_usb_register_driver_14_~tmp~13#1 := ldv_usb_register_driver_14_#t~ret199#1;havoc ldv_usb_register_driver_14_#t~ret199#1;ldv_usb_register_driver_14_~ldv_func_res~0#1 := ldv_usb_register_driver_14_~tmp~13#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~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset, ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset;havoc ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset; {11059#false} is VALID [2022-02-20 21:55:48,206 INFO L272 TraceCheckUtils]: 68: Hoare triple {11059#false} call ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset := ldv_zalloc(1560); {11105#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:48,206 INFO L290 TraceCheckUtils]: 69: Hoare triple {11105#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {11058#true} is VALID [2022-02-20 21:55:48,206 INFO L290 TraceCheckUtils]: 70: Hoare triple {11058#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {11058#true} is VALID [2022-02-20 21:55:48,206 INFO L290 TraceCheckUtils]: 71: Hoare triple {11058#true} assume true; {11058#true} is VALID [2022-02-20 21:55:48,206 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {11058#true} {11059#false} #778#return; {11059#false} is VALID [2022-02-20 21:55:48,206 INFO L290 TraceCheckUtils]: 73: Hoare triple {11059#false} ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset := ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset;havoc ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset;~cx82310_driver_group1~0.base, ~cx82310_driver_group1~0.offset := ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset; {11059#false} is VALID [2022-02-20 21:55:48,206 INFO L290 TraceCheckUtils]: 74: Hoare triple {11059#false} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_14_#res#1 := ldv_usb_register_driver_14_~ldv_func_res~0#1; {11059#false} is VALID [2022-02-20 21:55:48,207 INFO L290 TraceCheckUtils]: 75: Hoare triple {11059#false} cx82310_driver_init_#t~ret167#1 := ldv_usb_register_driver_14_#res#1;assume { :end_inline_ldv_usb_register_driver_14 } true;assume -2147483648 <= cx82310_driver_init_#t~ret167#1 && cx82310_driver_init_#t~ret167#1 <= 2147483647;cx82310_driver_init_~tmp~8#1 := cx82310_driver_init_#t~ret167#1;havoc cx82310_driver_init_#t~ret167#1;cx82310_driver_init_#res#1 := cx82310_driver_init_~tmp~8#1; {11059#false} is VALID [2022-02-20 21:55:48,207 INFO L290 TraceCheckUtils]: 76: Hoare triple {11059#false} main_#t~ret186#1 := cx82310_driver_init_#res#1;assume { :end_inline_cx82310_driver_init } true;assume -2147483648 <= main_#t~ret186#1 && main_#t~ret186#1 <= 2147483647;~ldv_retval_4~0 := main_#t~ret186#1;havoc main_#t~ret186#1; {11059#false} is VALID [2022-02-20 21:55:48,207 INFO L290 TraceCheckUtils]: 77: Hoare triple {11059#false} assume !(0 == ~ldv_retval_4~0); {11059#false} is VALID [2022-02-20 21:55:48,207 INFO L290 TraceCheckUtils]: 78: Hoare triple {11059#false} assume 0 != ~ldv_retval_4~0;~ldv_state_variable_0~0 := 2; {11059#false} is VALID [2022-02-20 21:55:48,207 INFO L290 TraceCheckUtils]: 79: Hoare triple {11059#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret209#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {11059#false} is VALID [2022-02-20 21:55:48,207 INFO L290 TraceCheckUtils]: 80: Hoare triple {11059#false} ldv_check_final_state_#t~ret209#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret209#1 && ldv_check_final_state_#t~ret209#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret209#1;havoc ldv_check_final_state_#t~ret209#1; {11059#false} is VALID [2022-02-20 21:55:48,207 INFO L290 TraceCheckUtils]: 81: Hoare triple {11059#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {11059#false} is VALID [2022-02-20 21:55:48,207 INFO L272 TraceCheckUtils]: 82: Hoare triple {11059#false} call ldv_error(); {11059#false} is VALID [2022-02-20 21:55:48,208 INFO L290 TraceCheckUtils]: 83: Hoare triple {11059#false} assume !false; {11059#false} is VALID [2022-02-20 21:55:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 21:55:48,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:48,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794947441] [2022-02-20 21:55:48,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794947441] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:48,210 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:48,210 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:55:48,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973809397] [2022-02-20 21:55:48,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:48,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 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 84 [2022-02-20 21:55:48,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:48,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 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 21:55:48,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:48,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:55:48,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:48,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:55:48,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:55:48,273 INFO L87 Difference]: Start difference. First operand 1163 states and 1642 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 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 21:55:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:54,836 INFO L93 Difference]: Finished difference Result 2875 states and 4169 transitions. [2022-02-20 21:55:54,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 21:55:54,836 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 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 84 [2022-02-20 21:55:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:55:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 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 21:55:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1078 transitions. [2022-02-20 21:55:54,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 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 21:55:54,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1078 transitions. [2022-02-20 21:55:54,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1078 transitions. [2022-02-20 21:55:55,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1078 edges. 1078 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:55,817 INFO L225 Difference]: With dead ends: 2875 [2022-02-20 21:55:55,818 INFO L226 Difference]: Without dead ends: 1726 [2022-02-20 21:55:55,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:55:55,822 INFO L933 BasicCegarLoop]: 419 mSDtfsCounter, 290 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:55:55,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [301 Valid, 1328 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 21:55:55,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2022-02-20 21:55:55,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1384. [2022-02-20 21:55:55,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:55:55,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1726 states. Second operand has 1384 states, 1095 states have (on average 1.3990867579908677) internal successors, (1532), 1097 states have internal predecessors, (1532), 201 states have call successors, (201), 80 states have call predecessors, (201), 87 states have return successors, (228), 206 states have call predecessors, (228), 200 states have call successors, (228) [2022-02-20 21:55:55,882 INFO L74 IsIncluded]: Start isIncluded. First operand 1726 states. Second operand has 1384 states, 1095 states have (on average 1.3990867579908677) internal successors, (1532), 1097 states have internal predecessors, (1532), 201 states have call successors, (201), 80 states have call predecessors, (201), 87 states have return successors, (228), 206 states have call predecessors, (228), 200 states have call successors, (228) [2022-02-20 21:55:55,885 INFO L87 Difference]: Start difference. First operand 1726 states. Second operand has 1384 states, 1095 states have (on average 1.3990867579908677) internal successors, (1532), 1097 states have internal predecessors, (1532), 201 states have call successors, (201), 80 states have call predecessors, (201), 87 states have return successors, (228), 206 states have call predecessors, (228), 200 states have call successors, (228) [2022-02-20 21:55:56,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:56,009 INFO L93 Difference]: Finished difference Result 1726 states and 2540 transitions. [2022-02-20 21:55:56,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2540 transitions. [2022-02-20 21:55:56,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:56,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:56,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 1384 states, 1095 states have (on average 1.3990867579908677) internal successors, (1532), 1097 states have internal predecessors, (1532), 201 states have call successors, (201), 80 states have call predecessors, (201), 87 states have return successors, (228), 206 states have call predecessors, (228), 200 states have call successors, (228) Second operand 1726 states. [2022-02-20 21:55:56,018 INFO L87 Difference]: Start difference. First operand has 1384 states, 1095 states have (on average 1.3990867579908677) internal successors, (1532), 1097 states have internal predecessors, (1532), 201 states have call successors, (201), 80 states have call predecessors, (201), 87 states have return successors, (228), 206 states have call predecessors, (228), 200 states have call successors, (228) Second operand 1726 states. [2022-02-20 21:55:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:56,127 INFO L93 Difference]: Finished difference Result 1726 states and 2540 transitions. [2022-02-20 21:55:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2540 transitions. [2022-02-20 21:55:56,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:56,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:56,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:55:56,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:55:56,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1095 states have (on average 1.3990867579908677) internal successors, (1532), 1097 states have internal predecessors, (1532), 201 states have call successors, (201), 80 states have call predecessors, (201), 87 states have return successors, (228), 206 states have call predecessors, (228), 200 states have call successors, (228) [2022-02-20 21:55:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1961 transitions. [2022-02-20 21:55:56,228 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1961 transitions. Word has length 84 [2022-02-20 21:55:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:55:56,228 INFO L470 AbstractCegarLoop]: Abstraction has 1384 states and 1961 transitions. [2022-02-20 21:55:56,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 3 states have internal predecessors, (58), 2 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 21:55:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1961 transitions. [2022-02-20 21:55:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-02-20 21:55:56,231 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:56,231 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:55:56,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:55:56,232 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:56,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:56,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1899779352, now seen corresponding path program 1 times [2022-02-20 21:55:56,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:56,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318065094] [2022-02-20 21:55:56,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:56,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {20251#true} is VALID [2022-02-20 21:55:56,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {20251#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20251#true} {20251#true} #766#return; {20251#true} is VALID [2022-02-20 21:55:56,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 21:55:56,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {20311#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {20251#true} is VALID [2022-02-20 21:55:56,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {20251#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {20251#true} is VALID [2022-02-20 21:55:56,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {20251#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {20251#true} is VALID [2022-02-20 21:55:56,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20251#true} {20251#true} #768#return; {20251#true} is VALID [2022-02-20 21:55:56,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:55:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {20311#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {20251#true} is VALID [2022-02-20 21:55:56,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {20251#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {20251#true} is VALID [2022-02-20 21:55:56,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {20251#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {20251#true} is VALID [2022-02-20 21:55:56,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20251#true} {20251#true} #770#return; {20251#true} is VALID [2022-02-20 21:55:56,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:55:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {20251#true} is VALID [2022-02-20 21:55:56,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {20251#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20251#true} {20251#true} #778#return; {20251#true} is VALID [2022-02-20 21:55:56,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 21:55:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {20251#true} is VALID [2022-02-20 21:55:56,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {20251#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20251#true} {20269#(= ~ldv_state_variable_2~0 1)} #780#return; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:55:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,413 INFO L290 TraceCheckUtils]: 0: Hoare triple {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {20251#true} is VALID [2022-02-20 21:55:56,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {20251#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20251#true} {20269#(= ~ldv_state_variable_2~0 1)} #782#return; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 21:55:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {20251#true} is VALID [2022-02-20 21:55:56,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {20251#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20251#true} {20269#(= ~ldv_state_variable_2~0 1)} #784#return; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-02-20 21:55:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:56,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:56,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {20251#true} is VALID [2022-02-20 21:55:56,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {20251#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20251#true} {20251#true} #736#return; {20251#true} is VALID [2022-02-20 21:55:56,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {20334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,508 INFO L272 TraceCheckUtils]: 1: Hoare triple {20251#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:56,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {20251#true} is VALID [2022-02-20 21:55:56,508 INFO L290 TraceCheckUtils]: 3: Hoare triple {20251#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,509 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {20251#true} {20251#true} #736#return; {20251#true} is VALID [2022-02-20 21:55:56,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {20251#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {20251#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {20251#true} is VALID [2022-02-20 21:55:56,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {20251#true} assume !false; {20251#true} is VALID [2022-02-20 21:55:56,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {20251#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {20251#true} is VALID [2022-02-20 21:55:56,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {20251#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {20251#true} is VALID [2022-02-20 21:55:56,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {20251#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,510 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {20251#true} {20251#true} #842#return; {20251#true} is VALID [2022-02-20 21:55:56,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {20334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~12.base, ~tmp~12.offset; {20251#true} is VALID [2022-02-20 21:55:56,511 INFO L272 TraceCheckUtils]: 1: Hoare triple {20251#true} call #t~ret196.base, #t~ret196.offset := ldv_skb_alloc(); {20334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:56,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {20334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,511 INFO L272 TraceCheckUtils]: 3: Hoare triple {20251#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:56,516 INFO L290 TraceCheckUtils]: 4: Hoare triple {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {20251#true} is VALID [2022-02-20 21:55:56,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {20251#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,516 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20251#true} {20251#true} #736#return; {20251#true} is VALID [2022-02-20 21:55:56,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {20251#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {20251#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {20251#true} is VALID [2022-02-20 21:55:56,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {20251#true} assume !false; {20251#true} is VALID [2022-02-20 21:55:56,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {20251#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {20251#true} is VALID [2022-02-20 21:55:56,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {20251#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {20251#true} is VALID [2022-02-20 21:55:56,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {20251#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,517 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20251#true} {20251#true} #842#return; {20251#true} is VALID [2022-02-20 21:55:56,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {20251#true} ~tmp~12.base, ~tmp~12.offset := #t~ret196.base, #t~ret196.offset;havoc #t~ret196.base, #t~ret196.offset; {20251#true} is VALID [2022-02-20 21:55:56,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {20251#true} assume !(~tmp~12.base != 0 || ~tmp~12.offset != 0); {20251#true} is VALID [2022-02-20 21:55:56,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {20251#true} #res.base, #res.offset := ~tmp~12.base, ~tmp~12.offset; {20251#true} is VALID [2022-02-20 21:55:56,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,518 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20251#true} {20251#true} #814#return; {20251#true} is VALID [2022-02-20 21:55:56,518 INFO L290 TraceCheckUtils]: 0: Hoare triple {20312#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5838)| abs_5838) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~len~0#1;havoc ~skb2~0#1.base, ~skb2~0#1.offset;havoc ~__len~1#1;havoc ~__ret~1#1.base, ~__ret~1#1.offset;havoc ~__len___0~1#1;havoc ~__ret___0~1#1.base, ~__ret___0~1#1.offset;havoc ~__len___1~0#1;havoc ~__ret___1~0#1.base, ~__ret___1~0#1.offset;havoc ~__len___2~0#1;havoc ~__ret___2~0#1.base, ~__ret___2~0#1.offset;call #t~mem111#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8); {20251#true} is VALID [2022-02-20 21:55:56,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {20251#true} assume 0 != #t~mem111#1 % 18446744073709551616;havoc #t~mem111#1;call #t~mem112#1 := read~int(~dev#1.base, 452 + ~dev#1.offset, 8);call #t~mem113#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8);~len~0#1 := (if (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 <= 2147483647 then (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 else (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 - 4294967296);havoc #t~mem112#1;havoc #t~mem113#1; {20251#true} is VALID [2022-02-20 21:55:56,519 INFO L272 TraceCheckUtils]: 2: Hoare triple {20251#true} call #t~ret114#1.base, #t~ret114#1.offset := ldv_alloc_skb_12(~len~0#1, 32); {20334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:56,520 INFO L290 TraceCheckUtils]: 3: Hoare triple {20334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~12.base, ~tmp~12.offset; {20251#true} is VALID [2022-02-20 21:55:56,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {20251#true} call #t~ret196.base, #t~ret196.offset := ldv_skb_alloc(); {20334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:56,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {20334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,521 INFO L272 TraceCheckUtils]: 6: Hoare triple {20251#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:56,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {20251#true} is VALID [2022-02-20 21:55:56,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {20251#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,521 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20251#true} {20251#true} #736#return; {20251#true} is VALID [2022-02-20 21:55:56,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {20251#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {20251#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {20251#true} is VALID [2022-02-20 21:55:56,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {20251#true} assume !false; {20251#true} is VALID [2022-02-20 21:55:56,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {20251#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {20251#true} is VALID [2022-02-20 21:55:56,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {20251#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {20251#true} is VALID [2022-02-20 21:55:56,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {20251#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,522 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20251#true} {20251#true} #842#return; {20251#true} is VALID [2022-02-20 21:55:56,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {20251#true} ~tmp~12.base, ~tmp~12.offset := #t~ret196.base, #t~ret196.offset;havoc #t~ret196.base, #t~ret196.offset; {20251#true} is VALID [2022-02-20 21:55:56,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {20251#true} assume !(~tmp~12.base != 0 || ~tmp~12.offset != 0); {20251#true} is VALID [2022-02-20 21:55:56,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {20251#true} #res.base, #res.offset := ~tmp~12.base, ~tmp~12.offset; {20251#true} is VALID [2022-02-20 21:55:56,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,526 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20251#true} {20251#true} #814#return; {20251#true} is VALID [2022-02-20 21:55:56,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {20251#true} ~skb2~0#1.base, ~skb2~0#1.offset := #t~ret114#1.base, #t~ret114#1.offset;havoc #t~ret114#1.base, #t~ret114#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {20251#true} assume 0 == (~skb2~0#1.base + ~skb2~0#1.offset) % 18446744073709551616;#res#1 := 0; {20251#true} is VALID [2022-02-20 21:55:56,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,527 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20251#true} {20252#false} #790#return; {20252#false} is VALID [2022-02-20 21:55:56,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {20251#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(106, 2);call #Ultimate.allocInit(28, 3);call #Ultimate.allocInit(24, 4);call #Ultimate.allocInit(25, 5);call #Ultimate.allocInit(41, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(34, 9);call #Ultimate.allocInit(2, 10);call write~init~int(1, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(36, 11);call #Ultimate.allocInit(32, 12);call #Ultimate.allocInit(26, 13);call #Ultimate.allocInit(30, 14);call #Ultimate.allocInit(12, 15);call #Ultimate.allocInit(12, 16);~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~cx82310_info_group1~0.base, ~cx82310_info_group1~0.offset := 0, 0;~cx82310_driver_group1~0.base, ~cx82310_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#cx82310_info~0.base, ~#cx82310_info~0.offset := 17, 0;call #Ultimate.allocInit(124, 17);call write~init~$Pointer$(14, 0, ~#cx82310_info~0.base, ~#cx82310_info~0.offset, 8);call write~init~int(32, ~#cx82310_info~0.base, 8 + ~#cx82310_info~0.offset, 4);call write~init~$Pointer$(#funAddr~cx82310_bind.base, #funAddr~cx82310_bind.offset, ~#cx82310_info~0.base, 12 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_unbind.base, #funAddr~cx82310_unbind.offset, ~#cx82310_info~0.base, 20 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 28 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 36 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 44 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 52 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 60 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 68 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_rx_fixup.base, #funAddr~cx82310_rx_fixup.offset, ~#cx82310_info~0.base, 76 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_tx_fixup.base, #funAddr~cx82310_tx_fixup.offset, ~#cx82310_info~0.base, 84 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 92 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 100 + ~#cx82310_info~0.offset, 8);call write~init~int(0, ~#cx82310_info~0.base, 108 + ~#cx82310_info~0.offset, 4);call write~init~int(0, ~#cx82310_info~0.base, 112 + ~#cx82310_info~0.offset, 4);call write~init~int(0, ~#cx82310_info~0.base, 116 + ~#cx82310_info~0.offset, 8);~#products~0.base, ~#products~0.offset := 18, 0;call #Ultimate.allocInit(50, 18);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#products~0.base);call write~unchecked~int(899, ~#products~0.base, ~#products~0.offset, 2);call write~unchecked~int(1394, ~#products~0.base, 2 + ~#products~0.offset, 2);call write~unchecked~int(51969, ~#products~0.base, 4 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 6 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 8 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 10 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 11 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 12 + ~#products~0.offset, 1);call write~unchecked~int(255, ~#products~0.base, 13 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 14 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 15 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 16 + ~#products~0.offset, 1);call write~unchecked~int(~#cx82310_info~0.base + ~#cx82310_info~0.offset, ~#products~0.base, 17 + ~#products~0.offset, 8);~__mod_usb__products_device_table~0.match_flags := 0;~__mod_usb__products_device_table~0.idVendor := 0;~__mod_usb__products_device_table~0.idProduct := 0;~__mod_usb__products_device_table~0.bcdDevice_lo := 0;~__mod_usb__products_device_table~0.bcdDevice_hi := 0;~__mod_usb__products_device_table~0.bDeviceClass := 0;~__mod_usb__products_device_table~0.bDeviceSubClass := 0;~__mod_usb__products_device_table~0.bDeviceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceClass := 0;~__mod_usb__products_device_table~0.bInterfaceSubClass := 0;~__mod_usb__products_device_table~0.bInterfaceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceNumber := 0;~__mod_usb__products_device_table~0.driver_info := 0;~#cx82310_driver~0.base, ~#cx82310_driver~0.offset := 19, 0;call #Ultimate.allocInit(285, 19);call write~init~$Pointer$(15, 0, ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_probe.base, #funAddr~usbnet_probe.offset, ~#cx82310_driver~0.base, 8 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_disconnect.base, #funAddr~usbnet_disconnect.offset, ~#cx82310_driver~0.base, 16 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 24 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_suspend.base, #funAddr~usbnet_suspend.offset, ~#cx82310_driver~0.base, 32 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_resume.base, #funAddr~usbnet_resume.offset, ~#cx82310_driver~0.base, 40 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 48 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 56 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 64 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(~#products~0.base, ~#products~0.offset, ~#cx82310_driver~0.base, 72 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 80 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 84 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 88 + ~#cx82310_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 92 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 100 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 108 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 116 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 124 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 132 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 136 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 148 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 156 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 164 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 172 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 180 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 188 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 196 + ~#cx82310_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 197 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 205 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 213 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 221 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 229 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 237 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 245 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 253 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 261 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 269 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 277 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 281 + ~#cx82310_driver~0.offset, 1);call write~init~int(0, ~#cx82310_driver~0.base, 282 + ~#cx82310_driver~0.offset, 1);call write~init~int(1, ~#cx82310_driver~0.base, 283 + ~#cx82310_driver~0.offset, 1);call write~init~int(0, ~#cx82310_driver~0.base, 284 + ~#cx82310_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 20, 0;call #Ultimate.allocInit(120, 20);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {20251#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret172#1.base, main_#t~ret172#1.offset, main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset, main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset, main_#t~nondet175#1, main_#t~switch176#1, main_#t~nondet177#1, main_#t~switch178#1, main_#t~ret179#1, main_#t~mem180#1, main_#t~ret181#1, main_#t~ret182#1, main_#t~ret183#1, main_#t~nondet184#1, main_#t~switch185#1, main_#t~ret186#1, main_#t~nondet187#1, main_#t~switch188#1, main_#t~ret189#1, main_#t~ret190#1, main_#t~ret191#1, main_#t~mem192#1, main_#t~ret193#1.base, main_#t~ret193#1.offset, main_#t~mem194#1, main_#t~ret195#1.base, main_#t~ret195#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~11#1.base, main_~tmp~11#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___0~6#1, main_~tmp___1~3#1, main_~tmp___2~1#1, main_~tmp___3~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~11#1.base, main_~tmp~11#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___0~6#1;havoc main_~tmp___1~3#1;havoc main_~tmp___2~1#1;havoc main_~tmp___3~0#1; {20251#true} is VALID [2022-02-20 21:55:56,528 INFO L272 TraceCheckUtils]: 2: Hoare triple {20251#true} call main_#t~ret172#1.base, main_#t~ret172#1.offset := ldv_zalloc(32); {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:56,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {20251#true} is VALID [2022-02-20 21:55:56,528 INFO L290 TraceCheckUtils]: 4: Hoare triple {20251#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,528 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {20251#true} {20251#true} #766#return; {20251#true} is VALID [2022-02-20 21:55:56,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {20251#true} main_~tmp~11#1.base, main_~tmp~11#1.offset := main_#t~ret172#1.base, main_#t~ret172#1.offset;havoc main_#t~ret172#1.base, main_#t~ret172#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~11#1.base, main_~tmp~11#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {20251#true} is VALID [2022-02-20 21:55:56,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {20251#true} assume { :end_inline_ldv_set_init } true; {20251#true} is VALID [2022-02-20 21:55:56,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {20251#true} assume { :end_inline_ldv_initialize } true; {20251#true} is VALID [2022-02-20 21:55:56,530 INFO L272 TraceCheckUtils]: 10: Hoare triple {20251#true} call main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset := #Ultimate.C_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {20311#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:55:56,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {20311#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {20251#true} is VALID [2022-02-20 21:55:56,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {20251#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {20251#true} is VALID [2022-02-20 21:55:56,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {20251#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {20251#true} is VALID [2022-02-20 21:55:56,530 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {20251#true} {20251#true} #768#return; {20251#true} is VALID [2022-02-20 21:55:56,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {20251#true} havoc main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,531 INFO L272 TraceCheckUtils]: 16: Hoare triple {20251#true} call main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset := #Ultimate.C_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {20311#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:55:56,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {20311#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {20251#true} is VALID [2022-02-20 21:55:56,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {20251#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {20251#true} is VALID [2022-02-20 21:55:56,531 INFO L290 TraceCheckUtils]: 19: Hoare triple {20251#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {20251#true} is VALID [2022-02-20 21:55:56,531 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {20251#true} {20251#true} #770#return; {20251#true} is VALID [2022-02-20 21:55:56,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {20251#true} havoc main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {20251#true} is VALID [2022-02-20 21:55:56,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {20251#true} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {20251#true} is VALID [2022-02-20 21:55:56,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {20251#true} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {20251#true} is VALID [2022-02-20 21:55:56,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {20251#true} assume main_#t~switch176#1; {20251#true} is VALID [2022-02-20 21:55:56,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {20251#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet184#1 && main_#t~nondet184#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet184#1;havoc main_#t~nondet184#1;main_#t~switch185#1 := 0 == main_~tmp___2~1#1; {20251#true} is VALID [2022-02-20 21:55:56,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {20251#true} assume !main_#t~switch185#1;main_#t~switch185#1 := main_#t~switch185#1 || 1 == main_~tmp___2~1#1; {20251#true} is VALID [2022-02-20 21:55:56,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {20251#true} assume main_#t~switch185#1; {20251#true} is VALID [2022-02-20 21:55:56,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {20251#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_cx82310_driver_init } true;havoc cx82310_driver_init_#res#1;havoc cx82310_driver_init_#t~ret167#1, cx82310_driver_init_~tmp~8#1;havoc cx82310_driver_init_~tmp~8#1;assume { :begin_inline_ldv_usb_register_driver_14 } true;ldv_usb_register_driver_14_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.offset := ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 16, 0;havoc ldv_usb_register_driver_14_#res#1;havoc ldv_usb_register_driver_14_#t~ret199#1, ldv_usb_register_driver_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset, ldv_usb_register_driver_14_~ldv_func_res~0#1, ldv_usb_register_driver_14_~tmp~13#1;ldv_usb_register_driver_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_14_~ldv_func_res~0#1;havoc ldv_usb_register_driver_14_~tmp~13#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_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet220#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~nondet220#1 && usb_register_driver_#t~nondet220#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet220#1;havoc usb_register_driver_#t~nondet220#1; {20251#true} is VALID [2022-02-20 21:55:56,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {20251#true} ldv_usb_register_driver_14_#t~ret199#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_14_#t~ret199#1 && ldv_usb_register_driver_14_#t~ret199#1 <= 2147483647;ldv_usb_register_driver_14_~tmp~13#1 := ldv_usb_register_driver_14_#t~ret199#1;havoc ldv_usb_register_driver_14_#t~ret199#1;ldv_usb_register_driver_14_~ldv_func_res~0#1 := ldv_usb_register_driver_14_~tmp~13#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~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset, ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset;havoc ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,533 INFO L272 TraceCheckUtils]: 30: Hoare triple {20251#true} call ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset := ldv_zalloc(1560); {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:56,533 INFO L290 TraceCheckUtils]: 31: Hoare triple {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {20251#true} is VALID [2022-02-20 21:55:56,533 INFO L290 TraceCheckUtils]: 32: Hoare triple {20251#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,533 INFO L290 TraceCheckUtils]: 33: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,533 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {20251#true} {20251#true} #778#return; {20251#true} is VALID [2022-02-20 21:55:56,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {20251#true} ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset := ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset;havoc ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset;~cx82310_driver_group1~0.base, ~cx82310_driver_group1~0.offset := ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,534 INFO L290 TraceCheckUtils]: 36: Hoare triple {20251#true} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_14_#res#1 := ldv_usb_register_driver_14_~ldv_func_res~0#1; {20251#true} is VALID [2022-02-20 21:55:56,534 INFO L290 TraceCheckUtils]: 37: Hoare triple {20251#true} cx82310_driver_init_#t~ret167#1 := ldv_usb_register_driver_14_#res#1;assume { :end_inline_ldv_usb_register_driver_14 } true;assume -2147483648 <= cx82310_driver_init_#t~ret167#1 && cx82310_driver_init_#t~ret167#1 <= 2147483647;cx82310_driver_init_~tmp~8#1 := cx82310_driver_init_#t~ret167#1;havoc cx82310_driver_init_#t~ret167#1;cx82310_driver_init_#res#1 := cx82310_driver_init_~tmp~8#1; {20251#true} is VALID [2022-02-20 21:55:56,534 INFO L290 TraceCheckUtils]: 38: Hoare triple {20251#true} main_#t~ret186#1 := cx82310_driver_init_#res#1;assume { :end_inline_cx82310_driver_init } true;assume -2147483648 <= main_#t~ret186#1 && main_#t~ret186#1 <= 2147483647;~ldv_retval_4~0 := main_#t~ret186#1;havoc main_#t~ret186#1; {20251#true} is VALID [2022-02-20 21:55:56,534 INFO L290 TraceCheckUtils]: 39: Hoare triple {20251#true} assume 0 == ~ldv_retval_4~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_initialize_driver_info_2 } true;havoc ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset, ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset, ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset, ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset, ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset, ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset;havoc ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset;havoc ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset;havoc ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,535 INFO L272 TraceCheckUtils]: 40: Hoare triple {20269#(= ~ldv_state_variable_2~0 1)} call ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset := ldv_zalloc(1472); {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:56,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {20251#true} is VALID [2022-02-20 21:55:56,535 INFO L290 TraceCheckUtils]: 42: Hoare triple {20251#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,536 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {20251#true} {20269#(= ~ldv_state_variable_2~0 1)} #780#return; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,536 INFO L290 TraceCheckUtils]: 45: Hoare triple {20269#(= ~ldv_state_variable_2~0 1)} ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset := ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset;havoc ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset;~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset := ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,537 INFO L272 TraceCheckUtils]: 46: Hoare triple {20269#(= ~ldv_state_variable_2~0 1)} call ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset := ldv_zalloc(1560); {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:56,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {20251#true} is VALID [2022-02-20 21:55:56,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {20251#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,537 INFO L290 TraceCheckUtils]: 49: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,537 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {20251#true} {20269#(= ~ldv_state_variable_2~0 1)} #782#return; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,538 INFO L290 TraceCheckUtils]: 51: Hoare triple {20269#(= ~ldv_state_variable_2~0 1)} ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset := ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset;havoc ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset;~cx82310_info_group1~0.base, ~cx82310_info_group1~0.offset := ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,538 INFO L272 TraceCheckUtils]: 52: Hoare triple {20269#(= ~ldv_state_variable_2~0 1)} call ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset := ldv_zalloc(232); {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:56,538 INFO L290 TraceCheckUtils]: 53: Hoare triple {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {20251#true} is VALID [2022-02-20 21:55:56,538 INFO L290 TraceCheckUtils]: 54: Hoare triple {20251#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,539 INFO L290 TraceCheckUtils]: 55: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,539 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {20251#true} {20269#(= ~ldv_state_variable_2~0 1)} #784#return; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,539 INFO L290 TraceCheckUtils]: 57: Hoare triple {20269#(= ~ldv_state_variable_2~0 1)} ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset := ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset;havoc ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset;~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset := ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,540 INFO L290 TraceCheckUtils]: 58: Hoare triple {20269#(= ~ldv_state_variable_2~0 1)} assume { :end_inline_ldv_initialize_driver_info_2 } true; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,540 INFO L290 TraceCheckUtils]: 59: Hoare triple {20269#(= ~ldv_state_variable_2~0 1)} assume !(0 != ~ldv_retval_4~0); {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,540 INFO L290 TraceCheckUtils]: 60: Hoare triple {20269#(= ~ldv_state_variable_2~0 1)} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,541 INFO L290 TraceCheckUtils]: 61: Hoare triple {20269#(= ~ldv_state_variable_2~0 1)} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,541 INFO L290 TraceCheckUtils]: 62: Hoare triple {20269#(= ~ldv_state_variable_2~0 1)} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 2 == main_~tmp___0~6#1; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,541 INFO L290 TraceCheckUtils]: 63: Hoare triple {20269#(= ~ldv_state_variable_2~0 1)} assume main_#t~switch176#1; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,541 INFO L290 TraceCheckUtils]: 64: Hoare triple {20269#(= ~ldv_state_variable_2~0 1)} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet187#1 && main_#t~nondet187#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet187#1;havoc main_#t~nondet187#1;main_#t~switch188#1 := 0 == main_~tmp___3~0#1; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,542 INFO L290 TraceCheckUtils]: 65: Hoare triple {20269#(= ~ldv_state_variable_2~0 1)} assume main_#t~switch188#1; {20269#(= ~ldv_state_variable_2~0 1)} is VALID [2022-02-20 21:55:56,542 INFO L290 TraceCheckUtils]: 66: Hoare triple {20269#(= ~ldv_state_variable_2~0 1)} assume !(1 == ~ldv_state_variable_2~0); {20252#false} is VALID [2022-02-20 21:55:56,542 INFO L290 TraceCheckUtils]: 67: Hoare triple {20252#false} assume 2 == ~ldv_state_variable_2~0; {20252#false} is VALID [2022-02-20 21:55:56,542 INFO L272 TraceCheckUtils]: 68: Hoare triple {20252#false} call main_#t~ret190#1 := cx82310_rx_fixup(~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset, ~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset); {20312#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5838)| abs_5838) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:56,542 INFO L290 TraceCheckUtils]: 69: Hoare triple {20312#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5838)| abs_5838) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~len~0#1;havoc ~skb2~0#1.base, ~skb2~0#1.offset;havoc ~__len~1#1;havoc ~__ret~1#1.base, ~__ret~1#1.offset;havoc ~__len___0~1#1;havoc ~__ret___0~1#1.base, ~__ret___0~1#1.offset;havoc ~__len___1~0#1;havoc ~__ret___1~0#1.base, ~__ret___1~0#1.offset;havoc ~__len___2~0#1;havoc ~__ret___2~0#1.base, ~__ret___2~0#1.offset;call #t~mem111#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8); {20251#true} is VALID [2022-02-20 21:55:56,542 INFO L290 TraceCheckUtils]: 70: Hoare triple {20251#true} assume 0 != #t~mem111#1 % 18446744073709551616;havoc #t~mem111#1;call #t~mem112#1 := read~int(~dev#1.base, 452 + ~dev#1.offset, 8);call #t~mem113#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8);~len~0#1 := (if (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 <= 2147483647 then (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 else (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 - 4294967296);havoc #t~mem112#1;havoc #t~mem113#1; {20251#true} is VALID [2022-02-20 21:55:56,543 INFO L272 TraceCheckUtils]: 71: Hoare triple {20251#true} call #t~ret114#1.base, #t~ret114#1.offset := ldv_alloc_skb_12(~len~0#1, 32); {20334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:56,543 INFO L290 TraceCheckUtils]: 72: Hoare triple {20334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~12.base, ~tmp~12.offset; {20251#true} is VALID [2022-02-20 21:55:56,544 INFO L272 TraceCheckUtils]: 73: Hoare triple {20251#true} call #t~ret196.base, #t~ret196.offset := ldv_skb_alloc(); {20334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:56,544 INFO L290 TraceCheckUtils]: 74: Hoare triple {20334#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,545 INFO L272 TraceCheckUtils]: 75: Hoare triple {20251#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:56,545 INFO L290 TraceCheckUtils]: 76: Hoare triple {20310#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {20251#true} is VALID [2022-02-20 21:55:56,545 INFO L290 TraceCheckUtils]: 77: Hoare triple {20251#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {20251#true} is VALID [2022-02-20 21:55:56,545 INFO L290 TraceCheckUtils]: 78: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,545 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {20251#true} {20251#true} #736#return; {20251#true} is VALID [2022-02-20 21:55:56,545 INFO L290 TraceCheckUtils]: 80: Hoare triple {20251#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,545 INFO L290 TraceCheckUtils]: 81: Hoare triple {20251#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {20251#true} is VALID [2022-02-20 21:55:56,545 INFO L290 TraceCheckUtils]: 82: Hoare triple {20251#true} assume !false; {20251#true} is VALID [2022-02-20 21:55:56,546 INFO L290 TraceCheckUtils]: 83: Hoare triple {20251#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {20251#true} is VALID [2022-02-20 21:55:56,546 INFO L290 TraceCheckUtils]: 84: Hoare triple {20251#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {20251#true} is VALID [2022-02-20 21:55:56,546 INFO L290 TraceCheckUtils]: 85: Hoare triple {20251#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,546 INFO L290 TraceCheckUtils]: 86: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,546 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {20251#true} {20251#true} #842#return; {20251#true} is VALID [2022-02-20 21:55:56,546 INFO L290 TraceCheckUtils]: 88: Hoare triple {20251#true} ~tmp~12.base, ~tmp~12.offset := #t~ret196.base, #t~ret196.offset;havoc #t~ret196.base, #t~ret196.offset; {20251#true} is VALID [2022-02-20 21:55:56,546 INFO L290 TraceCheckUtils]: 89: Hoare triple {20251#true} assume !(~tmp~12.base != 0 || ~tmp~12.offset != 0); {20251#true} is VALID [2022-02-20 21:55:56,546 INFO L290 TraceCheckUtils]: 90: Hoare triple {20251#true} #res.base, #res.offset := ~tmp~12.base, ~tmp~12.offset; {20251#true} is VALID [2022-02-20 21:55:56,547 INFO L290 TraceCheckUtils]: 91: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,547 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {20251#true} {20251#true} #814#return; {20251#true} is VALID [2022-02-20 21:55:56,547 INFO L290 TraceCheckUtils]: 93: Hoare triple {20251#true} ~skb2~0#1.base, ~skb2~0#1.offset := #t~ret114#1.base, #t~ret114#1.offset;havoc #t~ret114#1.base, #t~ret114#1.offset; {20251#true} is VALID [2022-02-20 21:55:56,547 INFO L290 TraceCheckUtils]: 94: Hoare triple {20251#true} assume 0 == (~skb2~0#1.base + ~skb2~0#1.offset) % 18446744073709551616;#res#1 := 0; {20251#true} is VALID [2022-02-20 21:55:56,547 INFO L290 TraceCheckUtils]: 95: Hoare triple {20251#true} assume true; {20251#true} is VALID [2022-02-20 21:55:56,547 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {20251#true} {20252#false} #790#return; {20252#false} is VALID [2022-02-20 21:55:56,547 INFO L290 TraceCheckUtils]: 97: Hoare triple {20252#false} assume -2147483648 <= main_#t~ret190#1 && main_#t~ret190#1 <= 2147483647;havoc main_#t~ret190#1;~ldv_state_variable_2~0 := 2; {20252#false} is VALID [2022-02-20 21:55:56,547 INFO L290 TraceCheckUtils]: 98: Hoare triple {20252#false} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {20252#false} is VALID [2022-02-20 21:55:56,548 INFO L290 TraceCheckUtils]: 99: Hoare triple {20252#false} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {20252#false} is VALID [2022-02-20 21:55:56,548 INFO L290 TraceCheckUtils]: 100: Hoare triple {20252#false} assume main_#t~switch176#1; {20252#false} is VALID [2022-02-20 21:55:56,548 INFO L290 TraceCheckUtils]: 101: Hoare triple {20252#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet184#1 && main_#t~nondet184#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet184#1;havoc main_#t~nondet184#1;main_#t~switch185#1 := 0 == main_~tmp___2~1#1; {20252#false} is VALID [2022-02-20 21:55:56,548 INFO L290 TraceCheckUtils]: 102: Hoare triple {20252#false} assume main_#t~switch185#1; {20252#false} is VALID [2022-02-20 21:55:56,548 INFO L290 TraceCheckUtils]: 103: Hoare triple {20252#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_cx82310_driver_exit } true;assume { :begin_inline_ldv_usb_deregister_15 } true;ldv_usb_deregister_15_#in~arg#1.base, ldv_usb_deregister_15_#in~arg#1.offset := ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset;havoc ldv_usb_deregister_15_~arg#1.base, ldv_usb_deregister_15_~arg#1.offset;ldv_usb_deregister_15_~arg#1.base, ldv_usb_deregister_15_~arg#1.offset := ldv_usb_deregister_15_#in~arg#1.base, ldv_usb_deregister_15_#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_15_~arg#1.base, ldv_usb_deregister_15_~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; {20252#false} is VALID [2022-02-20 21:55:56,548 INFO L290 TraceCheckUtils]: 104: Hoare triple {20252#false} assume { :end_inline_usb_deregister } true;~ldv_state_variable_1~0 := 0; {20252#false} is VALID [2022-02-20 21:55:56,548 INFO L290 TraceCheckUtils]: 105: Hoare triple {20252#false} assume { :end_inline_ldv_usb_deregister_15 } true; {20252#false} is VALID [2022-02-20 21:55:56,548 INFO L290 TraceCheckUtils]: 106: Hoare triple {20252#false} assume { :end_inline_cx82310_driver_exit } true;~ldv_state_variable_0~0 := 2; {20252#false} is VALID [2022-02-20 21:55:56,548 INFO L290 TraceCheckUtils]: 107: Hoare triple {20252#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret209#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {20252#false} is VALID [2022-02-20 21:55:56,549 INFO L290 TraceCheckUtils]: 108: Hoare triple {20252#false} ldv_check_final_state_#t~ret209#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret209#1 && ldv_check_final_state_#t~ret209#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret209#1;havoc ldv_check_final_state_#t~ret209#1; {20252#false} is VALID [2022-02-20 21:55:56,549 INFO L290 TraceCheckUtils]: 109: Hoare triple {20252#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {20252#false} is VALID [2022-02-20 21:55:56,549 INFO L272 TraceCheckUtils]: 110: Hoare triple {20252#false} call ldv_error(); {20252#false} is VALID [2022-02-20 21:55:56,549 INFO L290 TraceCheckUtils]: 111: Hoare triple {20252#false} assume !false; {20252#false} is VALID [2022-02-20 21:55:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-02-20 21:55:56,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:56,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318065094] [2022-02-20 21:55:56,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318065094] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:56,550 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:56,550 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 21:55:56,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350702058] [2022-02-20 21:55:56,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:56,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 112 [2022-02-20 21:55:56,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:56,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 21:55:56,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:56,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 21:55:56,623 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:56,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 21:55:56,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-20 21:55:56,624 INFO L87 Difference]: Start difference. First operand 1384 states and 1961 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 21:56:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:03,822 INFO L93 Difference]: Finished difference Result 4181 states and 6057 transitions. [2022-02-20 21:56:03,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:56:03,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 112 [2022-02-20 21:56:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:56:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 21:56:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1387 transitions. [2022-02-20 21:56:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 21:56:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1387 transitions. [2022-02-20 21:56:03,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 1387 transitions. [2022-02-20 21:56:04,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1387 edges. 1387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:05,288 INFO L225 Difference]: With dead ends: 4181 [2022-02-20 21:56:05,288 INFO L226 Difference]: Without dead ends: 2822 [2022-02-20 21:56:05,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 21:56:05,292 INFO L933 BasicCegarLoop]: 538 mSDtfsCounter, 1124 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 21:56:05,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1159 Valid, 1413 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 21:56:05,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2022-02-20 21:56:05,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2180. [2022-02-20 21:56:05,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:56:05,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2822 states. Second operand has 2180 states, 1729 states have (on average 1.3846153846153846) internal successors, (2394), 1733 states have internal predecessors, (2394), 303 states have call successors, (303), 132 states have call predecessors, (303), 147 states have return successors, (347), 314 states have call predecessors, (347), 302 states have call successors, (347) [2022-02-20 21:56:05,378 INFO L74 IsIncluded]: Start isIncluded. First operand 2822 states. Second operand has 2180 states, 1729 states have (on average 1.3846153846153846) internal successors, (2394), 1733 states have internal predecessors, (2394), 303 states have call successors, (303), 132 states have call predecessors, (303), 147 states have return successors, (347), 314 states have call predecessors, (347), 302 states have call successors, (347) [2022-02-20 21:56:05,381 INFO L87 Difference]: Start difference. First operand 2822 states. Second operand has 2180 states, 1729 states have (on average 1.3846153846153846) internal successors, (2394), 1733 states have internal predecessors, (2394), 303 states have call successors, (303), 132 states have call predecessors, (303), 147 states have return successors, (347), 314 states have call predecessors, (347), 302 states have call successors, (347) [2022-02-20 21:56:05,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:05,639 INFO L93 Difference]: Finished difference Result 2822 states and 4096 transitions. [2022-02-20 21:56:05,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 4096 transitions. [2022-02-20 21:56:05,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:05,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:05,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 2180 states, 1729 states have (on average 1.3846153846153846) internal successors, (2394), 1733 states have internal predecessors, (2394), 303 states have call successors, (303), 132 states have call predecessors, (303), 147 states have return successors, (347), 314 states have call predecessors, (347), 302 states have call successors, (347) Second operand 2822 states. [2022-02-20 21:56:05,652 INFO L87 Difference]: Start difference. First operand has 2180 states, 1729 states have (on average 1.3846153846153846) internal successors, (2394), 1733 states have internal predecessors, (2394), 303 states have call successors, (303), 132 states have call predecessors, (303), 147 states have return successors, (347), 314 states have call predecessors, (347), 302 states have call successors, (347) Second operand 2822 states. [2022-02-20 21:56:05,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:05,896 INFO L93 Difference]: Finished difference Result 2822 states and 4096 transitions. [2022-02-20 21:56:05,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 4096 transitions. [2022-02-20 21:56:05,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:05,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:05,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:56:05,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:56:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2180 states, 1729 states have (on average 1.3846153846153846) internal successors, (2394), 1733 states have internal predecessors, (2394), 303 states have call successors, (303), 132 states have call predecessors, (303), 147 states have return successors, (347), 314 states have call predecessors, (347), 302 states have call successors, (347) [2022-02-20 21:56:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 3044 transitions. [2022-02-20 21:56:06,127 INFO L78 Accepts]: Start accepts. Automaton has 2180 states and 3044 transitions. Word has length 112 [2022-02-20 21:56:06,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:56:06,127 INFO L470 AbstractCegarLoop]: Abstraction has 2180 states and 3044 transitions. [2022-02-20 21:56:06,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-02-20 21:56:06,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2180 states and 3044 transitions. [2022-02-20 21:56:06,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-02-20 21:56:06,130 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:56:06,130 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:56:06,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 21:56:06,130 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:56:06,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:56:06,131 INFO L85 PathProgramCache]: Analyzing trace with hash -80175978, now seen corresponding path program 1 times [2022-02-20 21:56:06,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:56:06,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405082182] [2022-02-20 21:56:06,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:56:06,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:56:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:06,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:56:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:06,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {34388#true} is VALID [2022-02-20 21:56:06,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {34388#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {34388#true} assume true; {34388#true} is VALID [2022-02-20 21:56:06,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34388#true} {34388#true} #766#return; {34388#true} is VALID [2022-02-20 21:56:06,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 21:56:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:06,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {34447#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {34388#true} is VALID [2022-02-20 21:56:06,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {34388#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {34388#true} is VALID [2022-02-20 21:56:06,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {34388#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {34388#true} is VALID [2022-02-20 21:56:06,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34388#true} {34388#true} #768#return; {34388#true} is VALID [2022-02-20 21:56:06,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:56:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:06,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {34447#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {34388#true} is VALID [2022-02-20 21:56:06,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {34388#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {34388#true} is VALID [2022-02-20 21:56:06,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {34388#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {34388#true} is VALID [2022-02-20 21:56:06,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34388#true} {34388#true} #770#return; {34388#true} is VALID [2022-02-20 21:56:06,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:56:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:06,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {34388#true} is VALID [2022-02-20 21:56:06,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {34388#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {34388#true} assume true; {34388#true} is VALID [2022-02-20 21:56:06,278 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34388#true} {34388#true} #778#return; {34388#true} is VALID [2022-02-20 21:56:06,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 21:56:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:06,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {34388#true} is VALID [2022-02-20 21:56:06,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {34388#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {34388#true} assume true; {34388#true} is VALID [2022-02-20 21:56:06,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34388#true} {34388#true} #780#return; {34388#true} is VALID [2022-02-20 21:56:06,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:56:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:06,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {34388#true} is VALID [2022-02-20 21:56:06,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {34388#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {34388#true} assume true; {34388#true} is VALID [2022-02-20 21:56:06,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34388#true} {34388#true} #782#return; {34388#true} is VALID [2022-02-20 21:56:06,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 21:56:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:06,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {34388#true} is VALID [2022-02-20 21:56:06,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {34388#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {34388#true} assume true; {34388#true} is VALID [2022-02-20 21:56:06,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34388#true} {34388#true} #784#return; {34388#true} is VALID [2022-02-20 21:56:06,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 21:56:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:06,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:56:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:06,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:06,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {34388#true} is VALID [2022-02-20 21:56:06,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {34388#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {34388#true} assume true; {34388#true} is VALID [2022-02-20 21:56:06,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34388#true} {34388#true} #736#return; {34388#true} is VALID [2022-02-20 21:56:06,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {34470#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {34388#true} is VALID [2022-02-20 21:56:06,445 INFO L272 TraceCheckUtils]: 1: Hoare triple {34388#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:06,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {34388#true} is VALID [2022-02-20 21:56:06,445 INFO L290 TraceCheckUtils]: 3: Hoare triple {34388#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,445 INFO L290 TraceCheckUtils]: 4: Hoare triple {34388#true} assume true; {34388#true} is VALID [2022-02-20 21:56:06,446 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {34388#true} {34388#true} #736#return; {34388#true} is VALID [2022-02-20 21:56:06,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {34388#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {34388#true} is VALID [2022-02-20 21:56:06,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {34388#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume !false; {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} is VALID [2022-02-20 21:56:06,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} assume true; {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} is VALID [2022-02-20 21:56:06,448 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} {34388#true} #842#return; {34485#(or (not (= 0 |ldv_alloc_skb_12_#t~ret196.offset|)) (not (= |ldv_alloc_skb_12_#t~ret196.base| 0)))} is VALID [2022-02-20 21:56:06,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {34470#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~12.base, ~tmp~12.offset; {34388#true} is VALID [2022-02-20 21:56:06,449 INFO L272 TraceCheckUtils]: 1: Hoare triple {34388#true} call #t~ret196.base, #t~ret196.offset := ldv_skb_alloc(); {34470#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:06,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {34470#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {34388#true} is VALID [2022-02-20 21:56:06,451 INFO L272 TraceCheckUtils]: 3: Hoare triple {34388#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:06,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {34388#true} is VALID [2022-02-20 21:56:06,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {34388#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {34388#true} assume true; {34388#true} is VALID [2022-02-20 21:56:06,452 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {34388#true} {34388#true} #736#return; {34388#true} is VALID [2022-02-20 21:56:06,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {34388#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {34388#true} is VALID [2022-02-20 21:56:06,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {34388#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume !false; {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} is VALID [2022-02-20 21:56:06,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} assume true; {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} is VALID [2022-02-20 21:56:06,454 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} {34388#true} #842#return; {34485#(or (not (= 0 |ldv_alloc_skb_12_#t~ret196.offset|)) (not (= |ldv_alloc_skb_12_#t~ret196.base| 0)))} is VALID [2022-02-20 21:56:06,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {34485#(or (not (= 0 |ldv_alloc_skb_12_#t~ret196.offset|)) (not (= |ldv_alloc_skb_12_#t~ret196.base| 0)))} ~tmp~12.base, ~tmp~12.offset := #t~ret196.base, #t~ret196.offset;havoc #t~ret196.base, #t~ret196.offset; {34486#(or (not (= 0 ldv_alloc_skb_12_~tmp~12.offset)) (not (= ldv_alloc_skb_12_~tmp~12.base 0)))} is VALID [2022-02-20 21:56:06,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {34486#(or (not (= 0 ldv_alloc_skb_12_~tmp~12.offset)) (not (= ldv_alloc_skb_12_~tmp~12.base 0)))} assume !(~tmp~12.base != 0 || ~tmp~12.offset != 0); {34389#false} is VALID [2022-02-20 21:56:06,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {34389#false} #res.base, #res.offset := ~tmp~12.base, ~tmp~12.offset; {34389#false} is VALID [2022-02-20 21:56:06,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {34389#false} assume true; {34389#false} is VALID [2022-02-20 21:56:06,456 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {34389#false} {34388#true} #814#return; {34389#false} is VALID [2022-02-20 21:56:06,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {34448#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5838)| abs_5838) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~len~0#1;havoc ~skb2~0#1.base, ~skb2~0#1.offset;havoc ~__len~1#1;havoc ~__ret~1#1.base, ~__ret~1#1.offset;havoc ~__len___0~1#1;havoc ~__ret___0~1#1.base, ~__ret___0~1#1.offset;havoc ~__len___1~0#1;havoc ~__ret___1~0#1.base, ~__ret___1~0#1.offset;havoc ~__len___2~0#1;havoc ~__ret___2~0#1.base, ~__ret___2~0#1.offset;call #t~mem111#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8); {34388#true} is VALID [2022-02-20 21:56:06,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {34388#true} assume 0 != #t~mem111#1 % 18446744073709551616;havoc #t~mem111#1;call #t~mem112#1 := read~int(~dev#1.base, 452 + ~dev#1.offset, 8);call #t~mem113#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8);~len~0#1 := (if (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 <= 2147483647 then (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 else (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 - 4294967296);havoc #t~mem112#1;havoc #t~mem113#1; {34388#true} is VALID [2022-02-20 21:56:06,457 INFO L272 TraceCheckUtils]: 2: Hoare triple {34388#true} call #t~ret114#1.base, #t~ret114#1.offset := ldv_alloc_skb_12(~len~0#1, 32); {34470#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:06,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {34470#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~12.base, ~tmp~12.offset; {34388#true} is VALID [2022-02-20 21:56:06,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {34388#true} call #t~ret196.base, #t~ret196.offset := ldv_skb_alloc(); {34470#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:06,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {34470#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {34388#true} is VALID [2022-02-20 21:56:06,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {34388#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:06,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {34388#true} is VALID [2022-02-20 21:56:06,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {34388#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {34388#true} assume true; {34388#true} is VALID [2022-02-20 21:56:06,459 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34388#true} {34388#true} #736#return; {34388#true} is VALID [2022-02-20 21:56:06,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {34388#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {34388#true} is VALID [2022-02-20 21:56:06,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {34388#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume !false; {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} is VALID [2022-02-20 21:56:06,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} assume true; {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} is VALID [2022-02-20 21:56:06,461 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} {34388#true} #842#return; {34485#(or (not (= 0 |ldv_alloc_skb_12_#t~ret196.offset|)) (not (= |ldv_alloc_skb_12_#t~ret196.base| 0)))} is VALID [2022-02-20 21:56:06,462 INFO L290 TraceCheckUtils]: 19: Hoare triple {34485#(or (not (= 0 |ldv_alloc_skb_12_#t~ret196.offset|)) (not (= |ldv_alloc_skb_12_#t~ret196.base| 0)))} ~tmp~12.base, ~tmp~12.offset := #t~ret196.base, #t~ret196.offset;havoc #t~ret196.base, #t~ret196.offset; {34486#(or (not (= 0 ldv_alloc_skb_12_~tmp~12.offset)) (not (= ldv_alloc_skb_12_~tmp~12.base 0)))} is VALID [2022-02-20 21:56:06,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {34486#(or (not (= 0 ldv_alloc_skb_12_~tmp~12.offset)) (not (= ldv_alloc_skb_12_~tmp~12.base 0)))} assume !(~tmp~12.base != 0 || ~tmp~12.offset != 0); {34389#false} is VALID [2022-02-20 21:56:06,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {34389#false} #res.base, #res.offset := ~tmp~12.base, ~tmp~12.offset; {34389#false} is VALID [2022-02-20 21:56:06,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {34389#false} assume true; {34389#false} is VALID [2022-02-20 21:56:06,462 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {34389#false} {34388#true} #814#return; {34389#false} is VALID [2022-02-20 21:56:06,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {34389#false} ~skb2~0#1.base, ~skb2~0#1.offset := #t~ret114#1.base, #t~ret114#1.offset;havoc #t~ret114#1.base, #t~ret114#1.offset; {34389#false} is VALID [2022-02-20 21:56:06,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {34389#false} assume 0 == (~skb2~0#1.base + ~skb2~0#1.offset) % 18446744073709551616;#res#1 := 0; {34389#false} is VALID [2022-02-20 21:56:06,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {34389#false} assume true; {34389#false} is VALID [2022-02-20 21:56:06,463 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {34389#false} {34388#true} #788#return; {34389#false} is VALID [2022-02-20 21:56:06,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {34388#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(106, 2);call #Ultimate.allocInit(28, 3);call #Ultimate.allocInit(24, 4);call #Ultimate.allocInit(25, 5);call #Ultimate.allocInit(41, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(34, 9);call #Ultimate.allocInit(2, 10);call write~init~int(1, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(36, 11);call #Ultimate.allocInit(32, 12);call #Ultimate.allocInit(26, 13);call #Ultimate.allocInit(30, 14);call #Ultimate.allocInit(12, 15);call #Ultimate.allocInit(12, 16);~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~cx82310_info_group1~0.base, ~cx82310_info_group1~0.offset := 0, 0;~cx82310_driver_group1~0.base, ~cx82310_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#cx82310_info~0.base, ~#cx82310_info~0.offset := 17, 0;call #Ultimate.allocInit(124, 17);call write~init~$Pointer$(14, 0, ~#cx82310_info~0.base, ~#cx82310_info~0.offset, 8);call write~init~int(32, ~#cx82310_info~0.base, 8 + ~#cx82310_info~0.offset, 4);call write~init~$Pointer$(#funAddr~cx82310_bind.base, #funAddr~cx82310_bind.offset, ~#cx82310_info~0.base, 12 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_unbind.base, #funAddr~cx82310_unbind.offset, ~#cx82310_info~0.base, 20 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 28 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 36 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 44 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 52 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 60 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 68 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_rx_fixup.base, #funAddr~cx82310_rx_fixup.offset, ~#cx82310_info~0.base, 76 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_tx_fixup.base, #funAddr~cx82310_tx_fixup.offset, ~#cx82310_info~0.base, 84 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 92 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 100 + ~#cx82310_info~0.offset, 8);call write~init~int(0, ~#cx82310_info~0.base, 108 + ~#cx82310_info~0.offset, 4);call write~init~int(0, ~#cx82310_info~0.base, 112 + ~#cx82310_info~0.offset, 4);call write~init~int(0, ~#cx82310_info~0.base, 116 + ~#cx82310_info~0.offset, 8);~#products~0.base, ~#products~0.offset := 18, 0;call #Ultimate.allocInit(50, 18);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#products~0.base);call write~unchecked~int(899, ~#products~0.base, ~#products~0.offset, 2);call write~unchecked~int(1394, ~#products~0.base, 2 + ~#products~0.offset, 2);call write~unchecked~int(51969, ~#products~0.base, 4 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 6 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 8 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 10 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 11 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 12 + ~#products~0.offset, 1);call write~unchecked~int(255, ~#products~0.base, 13 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 14 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 15 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 16 + ~#products~0.offset, 1);call write~unchecked~int(~#cx82310_info~0.base + ~#cx82310_info~0.offset, ~#products~0.base, 17 + ~#products~0.offset, 8);~__mod_usb__products_device_table~0.match_flags := 0;~__mod_usb__products_device_table~0.idVendor := 0;~__mod_usb__products_device_table~0.idProduct := 0;~__mod_usb__products_device_table~0.bcdDevice_lo := 0;~__mod_usb__products_device_table~0.bcdDevice_hi := 0;~__mod_usb__products_device_table~0.bDeviceClass := 0;~__mod_usb__products_device_table~0.bDeviceSubClass := 0;~__mod_usb__products_device_table~0.bDeviceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceClass := 0;~__mod_usb__products_device_table~0.bInterfaceSubClass := 0;~__mod_usb__products_device_table~0.bInterfaceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceNumber := 0;~__mod_usb__products_device_table~0.driver_info := 0;~#cx82310_driver~0.base, ~#cx82310_driver~0.offset := 19, 0;call #Ultimate.allocInit(285, 19);call write~init~$Pointer$(15, 0, ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_probe.base, #funAddr~usbnet_probe.offset, ~#cx82310_driver~0.base, 8 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_disconnect.base, #funAddr~usbnet_disconnect.offset, ~#cx82310_driver~0.base, 16 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 24 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_suspend.base, #funAddr~usbnet_suspend.offset, ~#cx82310_driver~0.base, 32 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_resume.base, #funAddr~usbnet_resume.offset, ~#cx82310_driver~0.base, 40 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 48 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 56 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 64 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(~#products~0.base, ~#products~0.offset, ~#cx82310_driver~0.base, 72 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 80 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 84 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 88 + ~#cx82310_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 92 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 100 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 108 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 116 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 124 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 132 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 136 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 148 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 156 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 164 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 172 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 180 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 188 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 196 + ~#cx82310_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 197 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 205 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 213 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 221 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 229 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 237 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 245 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 253 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 261 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 269 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 277 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 281 + ~#cx82310_driver~0.offset, 1);call write~init~int(0, ~#cx82310_driver~0.base, 282 + ~#cx82310_driver~0.offset, 1);call write~init~int(1, ~#cx82310_driver~0.base, 283 + ~#cx82310_driver~0.offset, 1);call write~init~int(0, ~#cx82310_driver~0.base, 284 + ~#cx82310_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 20, 0;call #Ultimate.allocInit(120, 20);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {34388#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret172#1.base, main_#t~ret172#1.offset, main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset, main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset, main_#t~nondet175#1, main_#t~switch176#1, main_#t~nondet177#1, main_#t~switch178#1, main_#t~ret179#1, main_#t~mem180#1, main_#t~ret181#1, main_#t~ret182#1, main_#t~ret183#1, main_#t~nondet184#1, main_#t~switch185#1, main_#t~ret186#1, main_#t~nondet187#1, main_#t~switch188#1, main_#t~ret189#1, main_#t~ret190#1, main_#t~ret191#1, main_#t~mem192#1, main_#t~ret193#1.base, main_#t~ret193#1.offset, main_#t~mem194#1, main_#t~ret195#1.base, main_#t~ret195#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~11#1.base, main_~tmp~11#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___0~6#1, main_~tmp___1~3#1, main_~tmp___2~1#1, main_~tmp___3~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~11#1.base, main_~tmp~11#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___0~6#1;havoc main_~tmp___1~3#1;havoc main_~tmp___2~1#1;havoc main_~tmp___3~0#1; {34388#true} is VALID [2022-02-20 21:56:06,465 INFO L272 TraceCheckUtils]: 2: Hoare triple {34388#true} call main_#t~ret172#1.base, main_#t~ret172#1.offset := ldv_zalloc(32); {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:06,465 INFO L290 TraceCheckUtils]: 3: Hoare triple {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {34388#true} is VALID [2022-02-20 21:56:06,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {34388#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {34388#true} assume true; {34388#true} is VALID [2022-02-20 21:56:06,465 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {34388#true} {34388#true} #766#return; {34388#true} is VALID [2022-02-20 21:56:06,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {34388#true} main_~tmp~11#1.base, main_~tmp~11#1.offset := main_#t~ret172#1.base, main_#t~ret172#1.offset;havoc main_#t~ret172#1.base, main_#t~ret172#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~11#1.base, main_~tmp~11#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {34388#true} is VALID [2022-02-20 21:56:06,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {34388#true} assume { :end_inline_ldv_set_init } true; {34388#true} is VALID [2022-02-20 21:56:06,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {34388#true} assume { :end_inline_ldv_initialize } true; {34388#true} is VALID [2022-02-20 21:56:06,466 INFO L272 TraceCheckUtils]: 10: Hoare triple {34388#true} call main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset := #Ultimate.C_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {34447#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:56:06,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {34447#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {34388#true} is VALID [2022-02-20 21:56:06,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {34388#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {34388#true} is VALID [2022-02-20 21:56:06,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {34388#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {34388#true} is VALID [2022-02-20 21:56:06,468 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {34388#true} {34388#true} #768#return; {34388#true} is VALID [2022-02-20 21:56:06,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {34388#true} havoc main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset; {34388#true} is VALID [2022-02-20 21:56:06,468 INFO L272 TraceCheckUtils]: 16: Hoare triple {34388#true} call main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset := #Ultimate.C_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {34447#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:56:06,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {34447#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {34388#true} is VALID [2022-02-20 21:56:06,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {34388#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {34388#true} is VALID [2022-02-20 21:56:06,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {34388#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {34388#true} is VALID [2022-02-20 21:56:06,469 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {34388#true} {34388#true} #770#return; {34388#true} is VALID [2022-02-20 21:56:06,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {34388#true} havoc main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {34388#true} is VALID [2022-02-20 21:56:06,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {34388#true} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {34388#true} is VALID [2022-02-20 21:56:06,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {34388#true} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {34388#true} is VALID [2022-02-20 21:56:06,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {34388#true} assume main_#t~switch176#1; {34388#true} is VALID [2022-02-20 21:56:06,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {34388#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet184#1 && main_#t~nondet184#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet184#1;havoc main_#t~nondet184#1;main_#t~switch185#1 := 0 == main_~tmp___2~1#1; {34388#true} is VALID [2022-02-20 21:56:06,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {34388#true} assume !main_#t~switch185#1;main_#t~switch185#1 := main_#t~switch185#1 || 1 == main_~tmp___2~1#1; {34388#true} is VALID [2022-02-20 21:56:06,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {34388#true} assume main_#t~switch185#1; {34388#true} is VALID [2022-02-20 21:56:06,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {34388#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_cx82310_driver_init } true;havoc cx82310_driver_init_#res#1;havoc cx82310_driver_init_#t~ret167#1, cx82310_driver_init_~tmp~8#1;havoc cx82310_driver_init_~tmp~8#1;assume { :begin_inline_ldv_usb_register_driver_14 } true;ldv_usb_register_driver_14_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.offset := ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 16, 0;havoc ldv_usb_register_driver_14_#res#1;havoc ldv_usb_register_driver_14_#t~ret199#1, ldv_usb_register_driver_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset, ldv_usb_register_driver_14_~ldv_func_res~0#1, ldv_usb_register_driver_14_~tmp~13#1;ldv_usb_register_driver_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_14_~ldv_func_res~0#1;havoc ldv_usb_register_driver_14_~tmp~13#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_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet220#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~nondet220#1 && usb_register_driver_#t~nondet220#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet220#1;havoc usb_register_driver_#t~nondet220#1; {34388#true} is VALID [2022-02-20 21:56:06,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {34388#true} ldv_usb_register_driver_14_#t~ret199#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_14_#t~ret199#1 && ldv_usb_register_driver_14_#t~ret199#1 <= 2147483647;ldv_usb_register_driver_14_~tmp~13#1 := ldv_usb_register_driver_14_#t~ret199#1;havoc ldv_usb_register_driver_14_#t~ret199#1;ldv_usb_register_driver_14_~ldv_func_res~0#1 := ldv_usb_register_driver_14_~tmp~13#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~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset, ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset;havoc ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset; {34388#true} is VALID [2022-02-20 21:56:06,470 INFO L272 TraceCheckUtils]: 30: Hoare triple {34388#true} call ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset := ldv_zalloc(1560); {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:06,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {34388#true} is VALID [2022-02-20 21:56:06,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {34388#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,471 INFO L290 TraceCheckUtils]: 33: Hoare triple {34388#true} assume true; {34388#true} is VALID [2022-02-20 21:56:06,471 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {34388#true} {34388#true} #778#return; {34388#true} is VALID [2022-02-20 21:56:06,471 INFO L290 TraceCheckUtils]: 35: Hoare triple {34388#true} ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset := ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset;havoc ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset;~cx82310_driver_group1~0.base, ~cx82310_driver_group1~0.offset := ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset; {34388#true} is VALID [2022-02-20 21:56:06,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {34388#true} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_14_#res#1 := ldv_usb_register_driver_14_~ldv_func_res~0#1; {34388#true} is VALID [2022-02-20 21:56:06,471 INFO L290 TraceCheckUtils]: 37: Hoare triple {34388#true} cx82310_driver_init_#t~ret167#1 := ldv_usb_register_driver_14_#res#1;assume { :end_inline_ldv_usb_register_driver_14 } true;assume -2147483648 <= cx82310_driver_init_#t~ret167#1 && cx82310_driver_init_#t~ret167#1 <= 2147483647;cx82310_driver_init_~tmp~8#1 := cx82310_driver_init_#t~ret167#1;havoc cx82310_driver_init_#t~ret167#1;cx82310_driver_init_#res#1 := cx82310_driver_init_~tmp~8#1; {34388#true} is VALID [2022-02-20 21:56:06,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {34388#true} main_#t~ret186#1 := cx82310_driver_init_#res#1;assume { :end_inline_cx82310_driver_init } true;assume -2147483648 <= main_#t~ret186#1 && main_#t~ret186#1 <= 2147483647;~ldv_retval_4~0 := main_#t~ret186#1;havoc main_#t~ret186#1; {34388#true} is VALID [2022-02-20 21:56:06,471 INFO L290 TraceCheckUtils]: 39: Hoare triple {34388#true} assume 0 == ~ldv_retval_4~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_initialize_driver_info_2 } true;havoc ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset, ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset, ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset, ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset, ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset, ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset;havoc ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset;havoc ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset;havoc ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset; {34388#true} is VALID [2022-02-20 21:56:06,472 INFO L272 TraceCheckUtils]: 40: Hoare triple {34388#true} call ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset := ldv_zalloc(1472); {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:06,472 INFO L290 TraceCheckUtils]: 41: Hoare triple {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {34388#true} is VALID [2022-02-20 21:56:06,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {34388#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {34388#true} assume true; {34388#true} is VALID [2022-02-20 21:56:06,472 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {34388#true} {34388#true} #780#return; {34388#true} is VALID [2022-02-20 21:56:06,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {34388#true} ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset := ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset;havoc ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset;~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset := ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset; {34388#true} is VALID [2022-02-20 21:56:06,473 INFO L272 TraceCheckUtils]: 46: Hoare triple {34388#true} call ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset := ldv_zalloc(1560); {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:06,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {34388#true} is VALID [2022-02-20 21:56:06,473 INFO L290 TraceCheckUtils]: 48: Hoare triple {34388#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,473 INFO L290 TraceCheckUtils]: 49: Hoare triple {34388#true} assume true; {34388#true} is VALID [2022-02-20 21:56:06,474 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {34388#true} {34388#true} #782#return; {34388#true} is VALID [2022-02-20 21:56:06,474 INFO L290 TraceCheckUtils]: 51: Hoare triple {34388#true} ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset := ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset;havoc ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset;~cx82310_info_group1~0.base, ~cx82310_info_group1~0.offset := ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset; {34388#true} is VALID [2022-02-20 21:56:06,474 INFO L272 TraceCheckUtils]: 52: Hoare triple {34388#true} call ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset := ldv_zalloc(232); {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:06,474 INFO L290 TraceCheckUtils]: 53: Hoare triple {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {34388#true} is VALID [2022-02-20 21:56:06,474 INFO L290 TraceCheckUtils]: 54: Hoare triple {34388#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,474 INFO L290 TraceCheckUtils]: 55: Hoare triple {34388#true} assume true; {34388#true} is VALID [2022-02-20 21:56:06,475 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {34388#true} {34388#true} #784#return; {34388#true} is VALID [2022-02-20 21:56:06,475 INFO L290 TraceCheckUtils]: 57: Hoare triple {34388#true} ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset := ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset;havoc ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset;~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset := ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset; {34388#true} is VALID [2022-02-20 21:56:06,475 INFO L290 TraceCheckUtils]: 58: Hoare triple {34388#true} assume { :end_inline_ldv_initialize_driver_info_2 } true; {34388#true} is VALID [2022-02-20 21:56:06,475 INFO L290 TraceCheckUtils]: 59: Hoare triple {34388#true} assume !(0 != ~ldv_retval_4~0); {34388#true} is VALID [2022-02-20 21:56:06,475 INFO L290 TraceCheckUtils]: 60: Hoare triple {34388#true} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {34388#true} is VALID [2022-02-20 21:56:06,475 INFO L290 TraceCheckUtils]: 61: Hoare triple {34388#true} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {34388#true} is VALID [2022-02-20 21:56:06,475 INFO L290 TraceCheckUtils]: 62: Hoare triple {34388#true} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 2 == main_~tmp___0~6#1; {34388#true} is VALID [2022-02-20 21:56:06,475 INFO L290 TraceCheckUtils]: 63: Hoare triple {34388#true} assume main_#t~switch176#1; {34388#true} is VALID [2022-02-20 21:56:06,476 INFO L290 TraceCheckUtils]: 64: Hoare triple {34388#true} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet187#1 && main_#t~nondet187#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet187#1;havoc main_#t~nondet187#1;main_#t~switch188#1 := 0 == main_~tmp___3~0#1; {34388#true} is VALID [2022-02-20 21:56:06,476 INFO L290 TraceCheckUtils]: 65: Hoare triple {34388#true} assume main_#t~switch188#1; {34388#true} is VALID [2022-02-20 21:56:06,476 INFO L290 TraceCheckUtils]: 66: Hoare triple {34388#true} assume 1 == ~ldv_state_variable_2~0; {34388#true} is VALID [2022-02-20 21:56:06,477 INFO L272 TraceCheckUtils]: 67: Hoare triple {34388#true} call main_#t~ret189#1 := cx82310_rx_fixup(~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset, ~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset); {34448#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5838)| abs_5838) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:06,477 INFO L290 TraceCheckUtils]: 68: Hoare triple {34448#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5838)| abs_5838) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~len~0#1;havoc ~skb2~0#1.base, ~skb2~0#1.offset;havoc ~__len~1#1;havoc ~__ret~1#1.base, ~__ret~1#1.offset;havoc ~__len___0~1#1;havoc ~__ret___0~1#1.base, ~__ret___0~1#1.offset;havoc ~__len___1~0#1;havoc ~__ret___1~0#1.base, ~__ret___1~0#1.offset;havoc ~__len___2~0#1;havoc ~__ret___2~0#1.base, ~__ret___2~0#1.offset;call #t~mem111#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8); {34388#true} is VALID [2022-02-20 21:56:06,478 INFO L290 TraceCheckUtils]: 69: Hoare triple {34388#true} assume 0 != #t~mem111#1 % 18446744073709551616;havoc #t~mem111#1;call #t~mem112#1 := read~int(~dev#1.base, 452 + ~dev#1.offset, 8);call #t~mem113#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8);~len~0#1 := (if (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 <= 2147483647 then (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 else (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 - 4294967296);havoc #t~mem112#1;havoc #t~mem113#1; {34388#true} is VALID [2022-02-20 21:56:06,478 INFO L272 TraceCheckUtils]: 70: Hoare triple {34388#true} call #t~ret114#1.base, #t~ret114#1.offset := ldv_alloc_skb_12(~len~0#1, 32); {34470#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:06,478 INFO L290 TraceCheckUtils]: 71: Hoare triple {34470#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~12.base, ~tmp~12.offset; {34388#true} is VALID [2022-02-20 21:56:06,479 INFO L272 TraceCheckUtils]: 72: Hoare triple {34388#true} call #t~ret196.base, #t~ret196.offset := ldv_skb_alloc(); {34470#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:06,479 INFO L290 TraceCheckUtils]: 73: Hoare triple {34470#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {34388#true} is VALID [2022-02-20 21:56:06,480 INFO L272 TraceCheckUtils]: 74: Hoare triple {34388#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:06,480 INFO L290 TraceCheckUtils]: 75: Hoare triple {34446#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {34388#true} is VALID [2022-02-20 21:56:06,480 INFO L290 TraceCheckUtils]: 76: Hoare triple {34388#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {34388#true} is VALID [2022-02-20 21:56:06,480 INFO L290 TraceCheckUtils]: 77: Hoare triple {34388#true} assume true; {34388#true} is VALID [2022-02-20 21:56:06,480 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {34388#true} {34388#true} #736#return; {34388#true} is VALID [2022-02-20 21:56:06,480 INFO L290 TraceCheckUtils]: 79: Hoare triple {34388#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {34388#true} is VALID [2022-02-20 21:56:06,481 INFO L290 TraceCheckUtils]: 80: Hoare triple {34388#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,481 INFO L290 TraceCheckUtils]: 81: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume !false; {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,481 INFO L290 TraceCheckUtils]: 82: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,481 INFO L290 TraceCheckUtils]: 83: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} is VALID [2022-02-20 21:56:06,482 INFO L290 TraceCheckUtils]: 84: Hoare triple {34491#(or (not (= |ldv_skb_alloc_~skb~0#1.offset| 0)) (not (= |ldv_skb_alloc_~skb~0#1.base| 0)))} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} is VALID [2022-02-20 21:56:06,482 INFO L290 TraceCheckUtils]: 85: Hoare triple {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} assume true; {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} is VALID [2022-02-20 21:56:06,483 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {34492#(or (not (= |ldv_skb_alloc_#res#1.offset| 0)) (not (= |ldv_skb_alloc_#res#1.base| 0)))} {34388#true} #842#return; {34485#(or (not (= 0 |ldv_alloc_skb_12_#t~ret196.offset|)) (not (= |ldv_alloc_skb_12_#t~ret196.base| 0)))} is VALID [2022-02-20 21:56:06,483 INFO L290 TraceCheckUtils]: 87: Hoare triple {34485#(or (not (= 0 |ldv_alloc_skb_12_#t~ret196.offset|)) (not (= |ldv_alloc_skb_12_#t~ret196.base| 0)))} ~tmp~12.base, ~tmp~12.offset := #t~ret196.base, #t~ret196.offset;havoc #t~ret196.base, #t~ret196.offset; {34486#(or (not (= 0 ldv_alloc_skb_12_~tmp~12.offset)) (not (= ldv_alloc_skb_12_~tmp~12.base 0)))} is VALID [2022-02-20 21:56:06,483 INFO L290 TraceCheckUtils]: 88: Hoare triple {34486#(or (not (= 0 ldv_alloc_skb_12_~tmp~12.offset)) (not (= ldv_alloc_skb_12_~tmp~12.base 0)))} assume !(~tmp~12.base != 0 || ~tmp~12.offset != 0); {34389#false} is VALID [2022-02-20 21:56:06,484 INFO L290 TraceCheckUtils]: 89: Hoare triple {34389#false} #res.base, #res.offset := ~tmp~12.base, ~tmp~12.offset; {34389#false} is VALID [2022-02-20 21:56:06,484 INFO L290 TraceCheckUtils]: 90: Hoare triple {34389#false} assume true; {34389#false} is VALID [2022-02-20 21:56:06,484 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {34389#false} {34388#true} #814#return; {34389#false} is VALID [2022-02-20 21:56:06,484 INFO L290 TraceCheckUtils]: 92: Hoare triple {34389#false} ~skb2~0#1.base, ~skb2~0#1.offset := #t~ret114#1.base, #t~ret114#1.offset;havoc #t~ret114#1.base, #t~ret114#1.offset; {34389#false} is VALID [2022-02-20 21:56:06,484 INFO L290 TraceCheckUtils]: 93: Hoare triple {34389#false} assume 0 == (~skb2~0#1.base + ~skb2~0#1.offset) % 18446744073709551616;#res#1 := 0; {34389#false} is VALID [2022-02-20 21:56:06,484 INFO L290 TraceCheckUtils]: 94: Hoare triple {34389#false} assume true; {34389#false} is VALID [2022-02-20 21:56:06,484 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {34389#false} {34388#true} #788#return; {34389#false} is VALID [2022-02-20 21:56:06,485 INFO L290 TraceCheckUtils]: 96: Hoare triple {34389#false} assume -2147483648 <= main_#t~ret189#1 && main_#t~ret189#1 <= 2147483647;havoc main_#t~ret189#1;~ldv_state_variable_2~0 := 1; {34389#false} is VALID [2022-02-20 21:56:06,485 INFO L290 TraceCheckUtils]: 97: Hoare triple {34389#false} assume !(2 == ~ldv_state_variable_2~0); {34389#false} is VALID [2022-02-20 21:56:06,485 INFO L290 TraceCheckUtils]: 98: Hoare triple {34389#false} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {34389#false} is VALID [2022-02-20 21:56:06,485 INFO L290 TraceCheckUtils]: 99: Hoare triple {34389#false} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {34389#false} is VALID [2022-02-20 21:56:06,485 INFO L290 TraceCheckUtils]: 100: Hoare triple {34389#false} assume main_#t~switch176#1; {34389#false} is VALID [2022-02-20 21:56:06,485 INFO L290 TraceCheckUtils]: 101: Hoare triple {34389#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet184#1 && main_#t~nondet184#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet184#1;havoc main_#t~nondet184#1;main_#t~switch185#1 := 0 == main_~tmp___2~1#1; {34389#false} is VALID [2022-02-20 21:56:06,485 INFO L290 TraceCheckUtils]: 102: Hoare triple {34389#false} assume main_#t~switch185#1; {34389#false} is VALID [2022-02-20 21:56:06,485 INFO L290 TraceCheckUtils]: 103: Hoare triple {34389#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_cx82310_driver_exit } true;assume { :begin_inline_ldv_usb_deregister_15 } true;ldv_usb_deregister_15_#in~arg#1.base, ldv_usb_deregister_15_#in~arg#1.offset := ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset;havoc ldv_usb_deregister_15_~arg#1.base, ldv_usb_deregister_15_~arg#1.offset;ldv_usb_deregister_15_~arg#1.base, ldv_usb_deregister_15_~arg#1.offset := ldv_usb_deregister_15_#in~arg#1.base, ldv_usb_deregister_15_#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_15_~arg#1.base, ldv_usb_deregister_15_~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; {34389#false} is VALID [2022-02-20 21:56:06,486 INFO L290 TraceCheckUtils]: 104: Hoare triple {34389#false} assume { :end_inline_usb_deregister } true;~ldv_state_variable_1~0 := 0; {34389#false} is VALID [2022-02-20 21:56:06,486 INFO L290 TraceCheckUtils]: 105: Hoare triple {34389#false} assume { :end_inline_ldv_usb_deregister_15 } true; {34389#false} is VALID [2022-02-20 21:56:06,486 INFO L290 TraceCheckUtils]: 106: Hoare triple {34389#false} assume { :end_inline_cx82310_driver_exit } true;~ldv_state_variable_0~0 := 2; {34389#false} is VALID [2022-02-20 21:56:06,486 INFO L290 TraceCheckUtils]: 107: Hoare triple {34389#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret209#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {34389#false} is VALID [2022-02-20 21:56:06,486 INFO L290 TraceCheckUtils]: 108: Hoare triple {34389#false} ldv_check_final_state_#t~ret209#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret209#1 && ldv_check_final_state_#t~ret209#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret209#1;havoc ldv_check_final_state_#t~ret209#1; {34389#false} is VALID [2022-02-20 21:56:06,486 INFO L290 TraceCheckUtils]: 109: Hoare triple {34389#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {34389#false} is VALID [2022-02-20 21:56:06,486 INFO L272 TraceCheckUtils]: 110: Hoare triple {34389#false} call ldv_error(); {34389#false} is VALID [2022-02-20 21:56:06,486 INFO L290 TraceCheckUtils]: 111: Hoare triple {34389#false} assume !false; {34389#false} is VALID [2022-02-20 21:56:06,487 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-02-20 21:56:06,487 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:56:06,487 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405082182] [2022-02-20 21:56:06,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405082182] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:56:06,487 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:56:06,487 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 21:56:06,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183513837] [2022-02-20 21:56:06,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:56:06,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2022-02-20 21:56:06,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:56:06,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 6.9) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) [2022-02-20 21:56:06,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:06,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 21:56:06,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:56:06,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 21:56:06,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-02-20 21:56:06,571 INFO L87 Difference]: Start difference. First operand 2180 states and 3044 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) [2022-02-20 21:56:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:14,549 INFO L93 Difference]: Finished difference Result 5056 states and 7336 transitions. [2022-02-20 21:56:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 21:56:14,549 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2022-02-20 21:56:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:56:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) [2022-02-20 21:56:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1001 transitions. [2022-02-20 21:56:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) [2022-02-20 21:56:14,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1001 transitions. [2022-02-20 21:56:14,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1001 transitions. [2022-02-20 21:56:15,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1001 edges. 1001 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:15,705 INFO L225 Difference]: With dead ends: 5056 [2022-02-20 21:56:15,705 INFO L226 Difference]: Without dead ends: 2901 [2022-02-20 21:56:15,710 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-02-20 21:56:15,711 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 344 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:56:15,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 2078 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 21:56:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2022-02-20 21:56:15,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2232. [2022-02-20 21:56:15,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:56:15,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2901 states. Second operand has 2232 states, 1765 states have (on average 1.3767705382436262) internal successors, (2430), 1777 states have internal predecessors, (2430), 303 states have call successors, (303), 132 states have call predecessors, (303), 163 states have return successors, (371), 322 states have call predecessors, (371), 302 states have call successors, (371) [2022-02-20 21:56:15,775 INFO L74 IsIncluded]: Start isIncluded. First operand 2901 states. Second operand has 2232 states, 1765 states have (on average 1.3767705382436262) internal successors, (2430), 1777 states have internal predecessors, (2430), 303 states have call successors, (303), 132 states have call predecessors, (303), 163 states have return successors, (371), 322 states have call predecessors, (371), 302 states have call successors, (371) [2022-02-20 21:56:15,777 INFO L87 Difference]: Start difference. First operand 2901 states. Second operand has 2232 states, 1765 states have (on average 1.3767705382436262) internal successors, (2430), 1777 states have internal predecessors, (2430), 303 states have call successors, (303), 132 states have call predecessors, (303), 163 states have return successors, (371), 322 states have call predecessors, (371), 302 states have call successors, (371) [2022-02-20 21:56:16,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:16,037 INFO L93 Difference]: Finished difference Result 2901 states and 4208 transitions. [2022-02-20 21:56:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 4208 transitions. [2022-02-20 21:56:16,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:16,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:16,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 2232 states, 1765 states have (on average 1.3767705382436262) internal successors, (2430), 1777 states have internal predecessors, (2430), 303 states have call successors, (303), 132 states have call predecessors, (303), 163 states have return successors, (371), 322 states have call predecessors, (371), 302 states have call successors, (371) Second operand 2901 states. [2022-02-20 21:56:16,049 INFO L87 Difference]: Start difference. First operand has 2232 states, 1765 states have (on average 1.3767705382436262) internal successors, (2430), 1777 states have internal predecessors, (2430), 303 states have call successors, (303), 132 states have call predecessors, (303), 163 states have return successors, (371), 322 states have call predecessors, (371), 302 states have call successors, (371) Second operand 2901 states. [2022-02-20 21:56:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:16,332 INFO L93 Difference]: Finished difference Result 2901 states and 4208 transitions. [2022-02-20 21:56:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 4208 transitions. [2022-02-20 21:56:16,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:16,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:16,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:56:16,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:56:16,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2232 states, 1765 states have (on average 1.3767705382436262) internal successors, (2430), 1777 states have internal predecessors, (2430), 303 states have call successors, (303), 132 states have call predecessors, (303), 163 states have return successors, (371), 322 states have call predecessors, (371), 302 states have call successors, (371) [2022-02-20 21:56:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2232 states to 2232 states and 3104 transitions. [2022-02-20 21:56:16,575 INFO L78 Accepts]: Start accepts. Automaton has 2232 states and 3104 transitions. Word has length 112 [2022-02-20 21:56:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:56:16,575 INFO L470 AbstractCegarLoop]: Abstraction has 2232 states and 3104 transitions. [2022-02-20 21:56:16,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 1 states have call successors, (11) [2022-02-20 21:56:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2232 states and 3104 transitions. [2022-02-20 21:56:16,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-02-20 21:56:16,578 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:56:16,578 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:56:16,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 21:56:16,579 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:56:16,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:56:16,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1707497592, now seen corresponding path program 1 times [2022-02-20 21:56:16,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:56:16,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999006345] [2022-02-20 21:56:16,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:56:16,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:56:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:56:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {49855#true} is VALID [2022-02-20 21:56:16,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {49855#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {49855#true} is VALID [2022-02-20 21:56:16,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {49855#true} assume true; {49855#true} is VALID [2022-02-20 21:56:16,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49855#true} {49855#true} #766#return; {49855#true} is VALID [2022-02-20 21:56:16,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 21:56:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {49920#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {49855#true} is VALID [2022-02-20 21:56:16,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {49855#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {49855#true} is VALID [2022-02-20 21:56:16,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {49855#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {49855#true} is VALID [2022-02-20 21:56:16,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49855#true} {49855#true} #768#return; {49855#true} is VALID [2022-02-20 21:56:16,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:56:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {49920#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {49855#true} is VALID [2022-02-20 21:56:16,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {49855#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {49855#true} is VALID [2022-02-20 21:56:16,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {49855#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {49855#true} is VALID [2022-02-20 21:56:16,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49855#true} {49855#true} #770#return; {49855#true} is VALID [2022-02-20 21:56:16,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:56:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {49855#true} is VALID [2022-02-20 21:56:16,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {49855#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {49855#true} is VALID [2022-02-20 21:56:16,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {49855#true} assume true; {49855#true} is VALID [2022-02-20 21:56:16,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49855#true} {49855#true} #778#return; {49855#true} is VALID [2022-02-20 21:56:16,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 21:56:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {49855#true} is VALID [2022-02-20 21:56:16,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {49855#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {49855#true} is VALID [2022-02-20 21:56:16,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {49855#true} assume true; {49855#true} is VALID [2022-02-20 21:56:16,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49855#true} {49855#true} #780#return; {49855#true} is VALID [2022-02-20 21:56:16,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:56:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {49855#true} is VALID [2022-02-20 21:56:16,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {49855#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {49855#true} is VALID [2022-02-20 21:56:16,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {49855#true} assume true; {49855#true} is VALID [2022-02-20 21:56:16,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49855#true} {49855#true} #782#return; {49855#true} is VALID [2022-02-20 21:56:16,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 21:56:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {49855#true} is VALID [2022-02-20 21:56:16,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {49855#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {49855#true} is VALID [2022-02-20 21:56:16,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {49855#true} assume true; {49855#true} is VALID [2022-02-20 21:56:16,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49855#true} {49855#true} #784#return; {49855#true} is VALID [2022-02-20 21:56:16,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 21:56:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:56:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {49855#true} is VALID [2022-02-20 21:56:16,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {49855#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:56:16,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} assume true; {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:56:16,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} {49855#true} #736#return; {49972#(and (<= |ldv_skb_alloc_#t~ret205#1.offset| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.base| 1)) (<= |ldv_skb_alloc_#t~ret205#1.base| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.offset| 1)))} is VALID [2022-02-20 21:56:16,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {49949#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {49855#true} is VALID [2022-02-20 21:56:16,954 INFO L272 TraceCheckUtils]: 1: Hoare triple {49855#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {49855#true} is VALID [2022-02-20 21:56:16,955 INFO L290 TraceCheckUtils]: 3: Hoare triple {49855#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:56:16,955 INFO L290 TraceCheckUtils]: 4: Hoare triple {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} assume true; {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:56:16,956 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} {49855#true} #736#return; {49972#(and (<= |ldv_skb_alloc_#t~ret205#1.offset| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.base| 1)) (<= |ldv_skb_alloc_#t~ret205#1.base| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.offset| 1)))} is VALID [2022-02-20 21:56:16,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {49972#(and (<= |ldv_skb_alloc_#t~ret205#1.offset| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.base| 1)) (<= |ldv_skb_alloc_#t~ret205#1.base| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.offset| 1)))} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {49973#(and (= |ldv_skb_alloc_~skb~0#1.base| 0) (= |ldv_skb_alloc_~skb~0#1.offset| 0))} is VALID [2022-02-20 21:56:16,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {49973#(and (= |ldv_skb_alloc_~skb~0#1.base| 0) (= |ldv_skb_alloc_~skb~0#1.offset| 0))} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {49856#false} is VALID [2022-02-20 21:56:16,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {49856#false} assume !false; {49856#false} is VALID [2022-02-20 21:56:16,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {49856#false} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {49856#false} is VALID [2022-02-20 21:56:16,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {49856#false} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {49856#false} is VALID [2022-02-20 21:56:16,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {49856#false} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {49856#false} is VALID [2022-02-20 21:56:16,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {49856#false} assume true; {49856#false} is VALID [2022-02-20 21:56:16,958 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {49856#false} {49855#true} #842#return; {49856#false} is VALID [2022-02-20 21:56:16,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 21:56:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:16,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {49975#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___0~0 := #t~nondet30;havoc #t~nondet30; {49855#true} is VALID [2022-02-20 21:56:16,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {49855#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {49855#true} is VALID [2022-02-20 21:56:16,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {49855#true} assume true; {49855#true} is VALID [2022-02-20 21:56:16,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49855#true} {49856#false} #844#return; {49856#false} is VALID [2022-02-20 21:56:16,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {49949#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~12.base, ~tmp~12.offset; {49855#true} is VALID [2022-02-20 21:56:16,972 INFO L272 TraceCheckUtils]: 1: Hoare triple {49855#true} call #t~ret196.base, #t~ret196.offset := ldv_skb_alloc(); {49949#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:16,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {49949#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {49855#true} is VALID [2022-02-20 21:56:16,973 INFO L272 TraceCheckUtils]: 3: Hoare triple {49855#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {49855#true} is VALID [2022-02-20 21:56:16,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {49855#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:56:16,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} assume true; {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:56:16,974 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} {49855#true} #736#return; {49972#(and (<= |ldv_skb_alloc_#t~ret205#1.offset| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.base| 1)) (<= |ldv_skb_alloc_#t~ret205#1.base| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.offset| 1)))} is VALID [2022-02-20 21:56:16,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {49972#(and (<= |ldv_skb_alloc_#t~ret205#1.offset| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.base| 1)) (<= |ldv_skb_alloc_#t~ret205#1.base| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.offset| 1)))} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {49973#(and (= |ldv_skb_alloc_~skb~0#1.base| 0) (= |ldv_skb_alloc_~skb~0#1.offset| 0))} is VALID [2022-02-20 21:56:16,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {49973#(and (= |ldv_skb_alloc_~skb~0#1.base| 0) (= |ldv_skb_alloc_~skb~0#1.offset| 0))} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {49856#false} is VALID [2022-02-20 21:56:16,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {49856#false} assume !false; {49856#false} is VALID [2022-02-20 21:56:16,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {49856#false} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {49856#false} is VALID [2022-02-20 21:56:16,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {49856#false} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {49856#false} is VALID [2022-02-20 21:56:16,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {49856#false} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {49856#false} is VALID [2022-02-20 21:56:16,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {49856#false} assume true; {49856#false} is VALID [2022-02-20 21:56:16,976 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {49856#false} {49855#true} #842#return; {49856#false} is VALID [2022-02-20 21:56:16,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {49856#false} ~tmp~12.base, ~tmp~12.offset := #t~ret196.base, #t~ret196.offset;havoc #t~ret196.base, #t~ret196.offset; {49856#false} is VALID [2022-02-20 21:56:16,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {49856#false} assume ~tmp~12.base != 0 || ~tmp~12.offset != 0; {49856#false} is VALID [2022-02-20 21:56:16,977 INFO L272 TraceCheckUtils]: 18: Hoare triple {49856#false} call #t~ret197.base, #t~ret197.offset := ldv_malloc(~size % 4294967296); {49975#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {49975#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___0~0 := #t~nondet30;havoc #t~nondet30; {49855#true} is VALID [2022-02-20 21:56:16,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {49855#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {49855#true} is VALID [2022-02-20 21:56:16,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {49855#true} assume true; {49855#true} is VALID [2022-02-20 21:56:16,977 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {49855#true} {49856#false} #844#return; {49856#false} is VALID [2022-02-20 21:56:16,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {49856#false} call write~$Pointer$(#t~ret197.base, #t~ret197.offset, ~tmp~12.base, 224 + ~tmp~12.offset, 8);havoc #t~ret197.base, #t~ret197.offset;call #t~mem198.base, #t~mem198.offset := read~$Pointer$(~tmp~12.base, 224 + ~tmp~12.offset, 8);call write~$Pointer$(#t~mem198.base, #t~mem198.offset, ~tmp~12.base, 232 + ~tmp~12.offset, 8);havoc #t~mem198.base, #t~mem198.offset; {49856#false} is VALID [2022-02-20 21:56:16,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {49856#false} #res.base, #res.offset := ~tmp~12.base, ~tmp~12.offset; {49856#false} is VALID [2022-02-20 21:56:16,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {49856#false} assume true; {49856#false} is VALID [2022-02-20 21:56:16,978 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {49856#false} {49855#true} #814#return; {49856#false} is VALID [2022-02-20 21:56:16,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {49921#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5838)| abs_5838) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~len~0#1;havoc ~skb2~0#1.base, ~skb2~0#1.offset;havoc ~__len~1#1;havoc ~__ret~1#1.base, ~__ret~1#1.offset;havoc ~__len___0~1#1;havoc ~__ret___0~1#1.base, ~__ret___0~1#1.offset;havoc ~__len___1~0#1;havoc ~__ret___1~0#1.base, ~__ret___1~0#1.offset;havoc ~__len___2~0#1;havoc ~__ret___2~0#1.base, ~__ret___2~0#1.offset;call #t~mem111#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8); {49855#true} is VALID [2022-02-20 21:56:16,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {49855#true} assume 0 != #t~mem111#1 % 18446744073709551616;havoc #t~mem111#1;call #t~mem112#1 := read~int(~dev#1.base, 452 + ~dev#1.offset, 8);call #t~mem113#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8);~len~0#1 := (if (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 <= 2147483647 then (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 else (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 - 4294967296);havoc #t~mem112#1;havoc #t~mem113#1; {49855#true} is VALID [2022-02-20 21:56:16,979 INFO L272 TraceCheckUtils]: 2: Hoare triple {49855#true} call #t~ret114#1.base, #t~ret114#1.offset := ldv_alloc_skb_12(~len~0#1, 32); {49949#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:16,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {49949#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~12.base, ~tmp~12.offset; {49855#true} is VALID [2022-02-20 21:56:16,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {49855#true} call #t~ret196.base, #t~ret196.offset := ldv_skb_alloc(); {49949#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:16,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {49949#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {49855#true} is VALID [2022-02-20 21:56:16,980 INFO L272 TraceCheckUtils]: 6: Hoare triple {49855#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {49855#true} is VALID [2022-02-20 21:56:16,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {49855#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:56:16,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} assume true; {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:56:16,982 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} {49855#true} #736#return; {49972#(and (<= |ldv_skb_alloc_#t~ret205#1.offset| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.base| 1)) (<= |ldv_skb_alloc_#t~ret205#1.base| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.offset| 1)))} is VALID [2022-02-20 21:56:16,982 INFO L290 TraceCheckUtils]: 11: Hoare triple {49972#(and (<= |ldv_skb_alloc_#t~ret205#1.offset| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.base| 1)) (<= |ldv_skb_alloc_#t~ret205#1.base| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.offset| 1)))} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {49973#(and (= |ldv_skb_alloc_~skb~0#1.base| 0) (= |ldv_skb_alloc_~skb~0#1.offset| 0))} is VALID [2022-02-20 21:56:16,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {49973#(and (= |ldv_skb_alloc_~skb~0#1.base| 0) (= |ldv_skb_alloc_~skb~0#1.offset| 0))} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {49856#false} is VALID [2022-02-20 21:56:16,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {49856#false} assume !false; {49856#false} is VALID [2022-02-20 21:56:16,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {49856#false} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {49856#false} is VALID [2022-02-20 21:56:16,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {49856#false} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {49856#false} is VALID [2022-02-20 21:56:16,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {49856#false} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {49856#false} is VALID [2022-02-20 21:56:16,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {49856#false} assume true; {49856#false} is VALID [2022-02-20 21:56:16,983 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {49856#false} {49855#true} #842#return; {49856#false} is VALID [2022-02-20 21:56:16,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {49856#false} ~tmp~12.base, ~tmp~12.offset := #t~ret196.base, #t~ret196.offset;havoc #t~ret196.base, #t~ret196.offset; {49856#false} is VALID [2022-02-20 21:56:16,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {49856#false} assume ~tmp~12.base != 0 || ~tmp~12.offset != 0; {49856#false} is VALID [2022-02-20 21:56:16,984 INFO L272 TraceCheckUtils]: 21: Hoare triple {49856#false} call #t~ret197.base, #t~ret197.offset := ldv_malloc(~size % 4294967296); {49975#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {49975#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___0~0 := #t~nondet30;havoc #t~nondet30; {49855#true} is VALID [2022-02-20 21:56:16,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {49855#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {49855#true} is VALID [2022-02-20 21:56:16,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {49855#true} assume true; {49855#true} is VALID [2022-02-20 21:56:16,984 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {49855#true} {49856#false} #844#return; {49856#false} is VALID [2022-02-20 21:56:16,984 INFO L290 TraceCheckUtils]: 26: Hoare triple {49856#false} call write~$Pointer$(#t~ret197.base, #t~ret197.offset, ~tmp~12.base, 224 + ~tmp~12.offset, 8);havoc #t~ret197.base, #t~ret197.offset;call #t~mem198.base, #t~mem198.offset := read~$Pointer$(~tmp~12.base, 224 + ~tmp~12.offset, 8);call write~$Pointer$(#t~mem198.base, #t~mem198.offset, ~tmp~12.base, 232 + ~tmp~12.offset, 8);havoc #t~mem198.base, #t~mem198.offset; {49856#false} is VALID [2022-02-20 21:56:16,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {49856#false} #res.base, #res.offset := ~tmp~12.base, ~tmp~12.offset; {49856#false} is VALID [2022-02-20 21:56:16,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {49856#false} assume true; {49856#false} is VALID [2022-02-20 21:56:16,990 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {49856#false} {49855#true} #814#return; {49856#false} is VALID [2022-02-20 21:56:16,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {49856#false} ~skb2~0#1.base, ~skb2~0#1.offset := #t~ret114#1.base, #t~ret114#1.offset;havoc #t~ret114#1.base, #t~ret114#1.offset; {49856#false} is VALID [2022-02-20 21:56:16,990 INFO L290 TraceCheckUtils]: 31: Hoare triple {49856#false} assume 0 == (~skb2~0#1.base + ~skb2~0#1.offset) % 18446744073709551616;#res#1 := 0; {49856#false} is VALID [2022-02-20 21:56:16,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {49856#false} assume true; {49856#false} is VALID [2022-02-20 21:56:16,991 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {49856#false} {49855#true} #788#return; {49856#false} is VALID [2022-02-20 21:56:16,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {49855#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(106, 2);call #Ultimate.allocInit(28, 3);call #Ultimate.allocInit(24, 4);call #Ultimate.allocInit(25, 5);call #Ultimate.allocInit(41, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(34, 9);call #Ultimate.allocInit(2, 10);call write~init~int(1, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(36, 11);call #Ultimate.allocInit(32, 12);call #Ultimate.allocInit(26, 13);call #Ultimate.allocInit(30, 14);call #Ultimate.allocInit(12, 15);call #Ultimate.allocInit(12, 16);~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~cx82310_info_group1~0.base, ~cx82310_info_group1~0.offset := 0, 0;~cx82310_driver_group1~0.base, ~cx82310_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#cx82310_info~0.base, ~#cx82310_info~0.offset := 17, 0;call #Ultimate.allocInit(124, 17);call write~init~$Pointer$(14, 0, ~#cx82310_info~0.base, ~#cx82310_info~0.offset, 8);call write~init~int(32, ~#cx82310_info~0.base, 8 + ~#cx82310_info~0.offset, 4);call write~init~$Pointer$(#funAddr~cx82310_bind.base, #funAddr~cx82310_bind.offset, ~#cx82310_info~0.base, 12 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_unbind.base, #funAddr~cx82310_unbind.offset, ~#cx82310_info~0.base, 20 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 28 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 36 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 44 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 52 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 60 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 68 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_rx_fixup.base, #funAddr~cx82310_rx_fixup.offset, ~#cx82310_info~0.base, 76 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_tx_fixup.base, #funAddr~cx82310_tx_fixup.offset, ~#cx82310_info~0.base, 84 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 92 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 100 + ~#cx82310_info~0.offset, 8);call write~init~int(0, ~#cx82310_info~0.base, 108 + ~#cx82310_info~0.offset, 4);call write~init~int(0, ~#cx82310_info~0.base, 112 + ~#cx82310_info~0.offset, 4);call write~init~int(0, ~#cx82310_info~0.base, 116 + ~#cx82310_info~0.offset, 8);~#products~0.base, ~#products~0.offset := 18, 0;call #Ultimate.allocInit(50, 18);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#products~0.base);call write~unchecked~int(899, ~#products~0.base, ~#products~0.offset, 2);call write~unchecked~int(1394, ~#products~0.base, 2 + ~#products~0.offset, 2);call write~unchecked~int(51969, ~#products~0.base, 4 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 6 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 8 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 10 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 11 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 12 + ~#products~0.offset, 1);call write~unchecked~int(255, ~#products~0.base, 13 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 14 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 15 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 16 + ~#products~0.offset, 1);call write~unchecked~int(~#cx82310_info~0.base + ~#cx82310_info~0.offset, ~#products~0.base, 17 + ~#products~0.offset, 8);~__mod_usb__products_device_table~0.match_flags := 0;~__mod_usb__products_device_table~0.idVendor := 0;~__mod_usb__products_device_table~0.idProduct := 0;~__mod_usb__products_device_table~0.bcdDevice_lo := 0;~__mod_usb__products_device_table~0.bcdDevice_hi := 0;~__mod_usb__products_device_table~0.bDeviceClass := 0;~__mod_usb__products_device_table~0.bDeviceSubClass := 0;~__mod_usb__products_device_table~0.bDeviceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceClass := 0;~__mod_usb__products_device_table~0.bInterfaceSubClass := 0;~__mod_usb__products_device_table~0.bInterfaceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceNumber := 0;~__mod_usb__products_device_table~0.driver_info := 0;~#cx82310_driver~0.base, ~#cx82310_driver~0.offset := 19, 0;call #Ultimate.allocInit(285, 19);call write~init~$Pointer$(15, 0, ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_probe.base, #funAddr~usbnet_probe.offset, ~#cx82310_driver~0.base, 8 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_disconnect.base, #funAddr~usbnet_disconnect.offset, ~#cx82310_driver~0.base, 16 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 24 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_suspend.base, #funAddr~usbnet_suspend.offset, ~#cx82310_driver~0.base, 32 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_resume.base, #funAddr~usbnet_resume.offset, ~#cx82310_driver~0.base, 40 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 48 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 56 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 64 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(~#products~0.base, ~#products~0.offset, ~#cx82310_driver~0.base, 72 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 80 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 84 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 88 + ~#cx82310_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 92 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 100 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 108 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 116 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 124 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 132 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 136 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 148 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 156 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 164 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 172 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 180 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 188 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 196 + ~#cx82310_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 197 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 205 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 213 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 221 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 229 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 237 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 245 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 253 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 261 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 269 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 277 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 281 + ~#cx82310_driver~0.offset, 1);call write~init~int(0, ~#cx82310_driver~0.base, 282 + ~#cx82310_driver~0.offset, 1);call write~init~int(1, ~#cx82310_driver~0.base, 283 + ~#cx82310_driver~0.offset, 1);call write~init~int(0, ~#cx82310_driver~0.base, 284 + ~#cx82310_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 20, 0;call #Ultimate.allocInit(120, 20);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {49855#true} is VALID [2022-02-20 21:56:16,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {49855#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret172#1.base, main_#t~ret172#1.offset, main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset, main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset, main_#t~nondet175#1, main_#t~switch176#1, main_#t~nondet177#1, main_#t~switch178#1, main_#t~ret179#1, main_#t~mem180#1, main_#t~ret181#1, main_#t~ret182#1, main_#t~ret183#1, main_#t~nondet184#1, main_#t~switch185#1, main_#t~ret186#1, main_#t~nondet187#1, main_#t~switch188#1, main_#t~ret189#1, main_#t~ret190#1, main_#t~ret191#1, main_#t~mem192#1, main_#t~ret193#1.base, main_#t~ret193#1.offset, main_#t~mem194#1, main_#t~ret195#1.base, main_#t~ret195#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~11#1.base, main_~tmp~11#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___0~6#1, main_~tmp___1~3#1, main_~tmp___2~1#1, main_~tmp___3~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~11#1.base, main_~tmp~11#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___0~6#1;havoc main_~tmp___1~3#1;havoc main_~tmp___2~1#1;havoc main_~tmp___3~0#1; {49855#true} is VALID [2022-02-20 21:56:16,992 INFO L272 TraceCheckUtils]: 2: Hoare triple {49855#true} call main_#t~ret172#1.base, main_#t~ret172#1.offset := ldv_zalloc(32); {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {49855#true} is VALID [2022-02-20 21:56:16,992 INFO L290 TraceCheckUtils]: 4: Hoare triple {49855#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {49855#true} is VALID [2022-02-20 21:56:16,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {49855#true} assume true; {49855#true} is VALID [2022-02-20 21:56:16,992 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {49855#true} {49855#true} #766#return; {49855#true} is VALID [2022-02-20 21:56:16,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {49855#true} main_~tmp~11#1.base, main_~tmp~11#1.offset := main_#t~ret172#1.base, main_#t~ret172#1.offset;havoc main_#t~ret172#1.base, main_#t~ret172#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~11#1.base, main_~tmp~11#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {49855#true} is VALID [2022-02-20 21:56:16,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {49855#true} assume { :end_inline_ldv_set_init } true; {49855#true} is VALID [2022-02-20 21:56:16,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {49855#true} assume { :end_inline_ldv_initialize } true; {49855#true} is VALID [2022-02-20 21:56:16,993 INFO L272 TraceCheckUtils]: 10: Hoare triple {49855#true} call main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset := #Ultimate.C_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {49920#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:56:16,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {49920#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {49855#true} is VALID [2022-02-20 21:56:16,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {49855#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {49855#true} is VALID [2022-02-20 21:56:16,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {49855#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {49855#true} is VALID [2022-02-20 21:56:16,994 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {49855#true} {49855#true} #768#return; {49855#true} is VALID [2022-02-20 21:56:16,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {49855#true} havoc main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset; {49855#true} is VALID [2022-02-20 21:56:16,995 INFO L272 TraceCheckUtils]: 16: Hoare triple {49855#true} call main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset := #Ultimate.C_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {49920#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:56:16,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {49920#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {49855#true} is VALID [2022-02-20 21:56:16,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {49855#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {49855#true} is VALID [2022-02-20 21:56:16,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {49855#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {49855#true} is VALID [2022-02-20 21:56:16,996 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {49855#true} {49855#true} #770#return; {49855#true} is VALID [2022-02-20 21:56:16,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {49855#true} havoc main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {49855#true} is VALID [2022-02-20 21:56:16,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {49855#true} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {49855#true} is VALID [2022-02-20 21:56:16,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {49855#true} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {49855#true} is VALID [2022-02-20 21:56:16,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {49855#true} assume main_#t~switch176#1; {49855#true} is VALID [2022-02-20 21:56:16,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {49855#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet184#1 && main_#t~nondet184#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet184#1;havoc main_#t~nondet184#1;main_#t~switch185#1 := 0 == main_~tmp___2~1#1; {49855#true} is VALID [2022-02-20 21:56:16,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {49855#true} assume !main_#t~switch185#1;main_#t~switch185#1 := main_#t~switch185#1 || 1 == main_~tmp___2~1#1; {49855#true} is VALID [2022-02-20 21:56:16,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {49855#true} assume main_#t~switch185#1; {49855#true} is VALID [2022-02-20 21:56:16,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {49855#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_cx82310_driver_init } true;havoc cx82310_driver_init_#res#1;havoc cx82310_driver_init_#t~ret167#1, cx82310_driver_init_~tmp~8#1;havoc cx82310_driver_init_~tmp~8#1;assume { :begin_inline_ldv_usb_register_driver_14 } true;ldv_usb_register_driver_14_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.offset := ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 16, 0;havoc ldv_usb_register_driver_14_#res#1;havoc ldv_usb_register_driver_14_#t~ret199#1, ldv_usb_register_driver_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset, ldv_usb_register_driver_14_~ldv_func_res~0#1, ldv_usb_register_driver_14_~tmp~13#1;ldv_usb_register_driver_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_14_~ldv_func_res~0#1;havoc ldv_usb_register_driver_14_~tmp~13#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_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet220#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~nondet220#1 && usb_register_driver_#t~nondet220#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet220#1;havoc usb_register_driver_#t~nondet220#1; {49855#true} is VALID [2022-02-20 21:56:16,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {49855#true} ldv_usb_register_driver_14_#t~ret199#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_14_#t~ret199#1 && ldv_usb_register_driver_14_#t~ret199#1 <= 2147483647;ldv_usb_register_driver_14_~tmp~13#1 := ldv_usb_register_driver_14_#t~ret199#1;havoc ldv_usb_register_driver_14_#t~ret199#1;ldv_usb_register_driver_14_~ldv_func_res~0#1 := ldv_usb_register_driver_14_~tmp~13#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~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset, ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset;havoc ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset; {49855#true} is VALID [2022-02-20 21:56:16,997 INFO L272 TraceCheckUtils]: 30: Hoare triple {49855#true} call ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset := ldv_zalloc(1560); {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {49855#true} is VALID [2022-02-20 21:56:16,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {49855#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {49855#true} is VALID [2022-02-20 21:56:16,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {49855#true} assume true; {49855#true} is VALID [2022-02-20 21:56:16,998 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {49855#true} {49855#true} #778#return; {49855#true} is VALID [2022-02-20 21:56:16,998 INFO L290 TraceCheckUtils]: 35: Hoare triple {49855#true} ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset := ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset;havoc ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset;~cx82310_driver_group1~0.base, ~cx82310_driver_group1~0.offset := ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset; {49855#true} is VALID [2022-02-20 21:56:16,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {49855#true} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_14_#res#1 := ldv_usb_register_driver_14_~ldv_func_res~0#1; {49855#true} is VALID [2022-02-20 21:56:16,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {49855#true} cx82310_driver_init_#t~ret167#1 := ldv_usb_register_driver_14_#res#1;assume { :end_inline_ldv_usb_register_driver_14 } true;assume -2147483648 <= cx82310_driver_init_#t~ret167#1 && cx82310_driver_init_#t~ret167#1 <= 2147483647;cx82310_driver_init_~tmp~8#1 := cx82310_driver_init_#t~ret167#1;havoc cx82310_driver_init_#t~ret167#1;cx82310_driver_init_#res#1 := cx82310_driver_init_~tmp~8#1; {49855#true} is VALID [2022-02-20 21:56:16,998 INFO L290 TraceCheckUtils]: 38: Hoare triple {49855#true} main_#t~ret186#1 := cx82310_driver_init_#res#1;assume { :end_inline_cx82310_driver_init } true;assume -2147483648 <= main_#t~ret186#1 && main_#t~ret186#1 <= 2147483647;~ldv_retval_4~0 := main_#t~ret186#1;havoc main_#t~ret186#1; {49855#true} is VALID [2022-02-20 21:56:16,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {49855#true} assume 0 == ~ldv_retval_4~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_initialize_driver_info_2 } true;havoc ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset, ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset, ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset, ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset, ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset, ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset;havoc ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset;havoc ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset;havoc ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset; {49855#true} is VALID [2022-02-20 21:56:16,999 INFO L272 TraceCheckUtils]: 40: Hoare triple {49855#true} call ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset := ldv_zalloc(1472); {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:16,999 INFO L290 TraceCheckUtils]: 41: Hoare triple {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {49855#true} is VALID [2022-02-20 21:56:16,999 INFO L290 TraceCheckUtils]: 42: Hoare triple {49855#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {49855#true} is VALID [2022-02-20 21:56:16,999 INFO L290 TraceCheckUtils]: 43: Hoare triple {49855#true} assume true; {49855#true} is VALID [2022-02-20 21:56:16,999 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {49855#true} {49855#true} #780#return; {49855#true} is VALID [2022-02-20 21:56:17,000 INFO L290 TraceCheckUtils]: 45: Hoare triple {49855#true} ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset := ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset;havoc ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset;~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset := ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset; {49855#true} is VALID [2022-02-20 21:56:17,000 INFO L272 TraceCheckUtils]: 46: Hoare triple {49855#true} call ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset := ldv_zalloc(1560); {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:17,000 INFO L290 TraceCheckUtils]: 47: Hoare triple {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {49855#true} is VALID [2022-02-20 21:56:17,000 INFO L290 TraceCheckUtils]: 48: Hoare triple {49855#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {49855#true} is VALID [2022-02-20 21:56:17,000 INFO L290 TraceCheckUtils]: 49: Hoare triple {49855#true} assume true; {49855#true} is VALID [2022-02-20 21:56:17,000 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {49855#true} {49855#true} #782#return; {49855#true} is VALID [2022-02-20 21:56:17,001 INFO L290 TraceCheckUtils]: 51: Hoare triple {49855#true} ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset := ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset;havoc ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset;~cx82310_info_group1~0.base, ~cx82310_info_group1~0.offset := ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset; {49855#true} is VALID [2022-02-20 21:56:17,001 INFO L272 TraceCheckUtils]: 52: Hoare triple {49855#true} call ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset := ldv_zalloc(232); {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:17,001 INFO L290 TraceCheckUtils]: 53: Hoare triple {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {49855#true} is VALID [2022-02-20 21:56:17,001 INFO L290 TraceCheckUtils]: 54: Hoare triple {49855#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {49855#true} is VALID [2022-02-20 21:56:17,001 INFO L290 TraceCheckUtils]: 55: Hoare triple {49855#true} assume true; {49855#true} is VALID [2022-02-20 21:56:17,002 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {49855#true} {49855#true} #784#return; {49855#true} is VALID [2022-02-20 21:56:17,002 INFO L290 TraceCheckUtils]: 57: Hoare triple {49855#true} ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset := ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset;havoc ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset;~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset := ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset; {49855#true} is VALID [2022-02-20 21:56:17,002 INFO L290 TraceCheckUtils]: 58: Hoare triple {49855#true} assume { :end_inline_ldv_initialize_driver_info_2 } true; {49855#true} is VALID [2022-02-20 21:56:17,002 INFO L290 TraceCheckUtils]: 59: Hoare triple {49855#true} assume !(0 != ~ldv_retval_4~0); {49855#true} is VALID [2022-02-20 21:56:17,002 INFO L290 TraceCheckUtils]: 60: Hoare triple {49855#true} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {49855#true} is VALID [2022-02-20 21:56:17,002 INFO L290 TraceCheckUtils]: 61: Hoare triple {49855#true} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {49855#true} is VALID [2022-02-20 21:56:17,002 INFO L290 TraceCheckUtils]: 62: Hoare triple {49855#true} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 2 == main_~tmp___0~6#1; {49855#true} is VALID [2022-02-20 21:56:17,002 INFO L290 TraceCheckUtils]: 63: Hoare triple {49855#true} assume main_#t~switch176#1; {49855#true} is VALID [2022-02-20 21:56:17,003 INFO L290 TraceCheckUtils]: 64: Hoare triple {49855#true} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet187#1 && main_#t~nondet187#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet187#1;havoc main_#t~nondet187#1;main_#t~switch188#1 := 0 == main_~tmp___3~0#1; {49855#true} is VALID [2022-02-20 21:56:17,003 INFO L290 TraceCheckUtils]: 65: Hoare triple {49855#true} assume main_#t~switch188#1; {49855#true} is VALID [2022-02-20 21:56:17,003 INFO L290 TraceCheckUtils]: 66: Hoare triple {49855#true} assume 1 == ~ldv_state_variable_2~0; {49855#true} is VALID [2022-02-20 21:56:17,004 INFO L272 TraceCheckUtils]: 67: Hoare triple {49855#true} call main_#t~ret189#1 := cx82310_rx_fixup(~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset, ~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset); {49921#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5838)| abs_5838) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:17,004 INFO L290 TraceCheckUtils]: 68: Hoare triple {49921#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5838)| abs_5838) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~len~0#1;havoc ~skb2~0#1.base, ~skb2~0#1.offset;havoc ~__len~1#1;havoc ~__ret~1#1.base, ~__ret~1#1.offset;havoc ~__len___0~1#1;havoc ~__ret___0~1#1.base, ~__ret___0~1#1.offset;havoc ~__len___1~0#1;havoc ~__ret___1~0#1.base, ~__ret___1~0#1.offset;havoc ~__len___2~0#1;havoc ~__ret___2~0#1.base, ~__ret___2~0#1.offset;call #t~mem111#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8); {49855#true} is VALID [2022-02-20 21:56:17,004 INFO L290 TraceCheckUtils]: 69: Hoare triple {49855#true} assume 0 != #t~mem111#1 % 18446744073709551616;havoc #t~mem111#1;call #t~mem112#1 := read~int(~dev#1.base, 452 + ~dev#1.offset, 8);call #t~mem113#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8);~len~0#1 := (if (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 <= 2147483647 then (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 else (#t~mem112#1 + #t~mem113#1) % 4294967296 % 4294967296 - 4294967296);havoc #t~mem112#1;havoc #t~mem113#1; {49855#true} is VALID [2022-02-20 21:56:17,005 INFO L272 TraceCheckUtils]: 70: Hoare triple {49855#true} call #t~ret114#1.base, #t~ret114#1.offset := ldv_alloc_skb_12(~len~0#1, 32); {49949#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:17,005 INFO L290 TraceCheckUtils]: 71: Hoare triple {49949#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~12.base, ~tmp~12.offset; {49855#true} is VALID [2022-02-20 21:56:17,005 INFO L272 TraceCheckUtils]: 72: Hoare triple {49855#true} call #t~ret196.base, #t~ret196.offset := ldv_skb_alloc(); {49949#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:17,005 INFO L290 TraceCheckUtils]: 73: Hoare triple {49949#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {49855#true} is VALID [2022-02-20 21:56:17,006 INFO L272 TraceCheckUtils]: 74: Hoare triple {49855#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:17,006 INFO L290 TraceCheckUtils]: 75: Hoare triple {49919#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {49855#true} is VALID [2022-02-20 21:56:17,006 INFO L290 TraceCheckUtils]: 76: Hoare triple {49855#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:56:17,007 INFO L290 TraceCheckUtils]: 77: Hoare triple {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} assume true; {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 21:56:17,007 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {49974#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} {49855#true} #736#return; {49972#(and (<= |ldv_skb_alloc_#t~ret205#1.offset| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.base| 1)) (<= |ldv_skb_alloc_#t~ret205#1.base| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.offset| 1)))} is VALID [2022-02-20 21:56:17,008 INFO L290 TraceCheckUtils]: 79: Hoare triple {49972#(and (<= |ldv_skb_alloc_#t~ret205#1.offset| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.base| 1)) (<= |ldv_skb_alloc_#t~ret205#1.base| 0) (< 0 (+ |ldv_skb_alloc_#t~ret205#1.offset| 1)))} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {49973#(and (= |ldv_skb_alloc_~skb~0#1.base| 0) (= |ldv_skb_alloc_~skb~0#1.offset| 0))} is VALID [2022-02-20 21:56:17,008 INFO L290 TraceCheckUtils]: 80: Hoare triple {49973#(and (= |ldv_skb_alloc_~skb~0#1.base| 0) (= |ldv_skb_alloc_~skb~0#1.offset| 0))} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {49856#false} is VALID [2022-02-20 21:56:17,008 INFO L290 TraceCheckUtils]: 81: Hoare triple {49856#false} assume !false; {49856#false} is VALID [2022-02-20 21:56:17,009 INFO L290 TraceCheckUtils]: 82: Hoare triple {49856#false} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {49856#false} is VALID [2022-02-20 21:56:17,009 INFO L290 TraceCheckUtils]: 83: Hoare triple {49856#false} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {49856#false} is VALID [2022-02-20 21:56:17,009 INFO L290 TraceCheckUtils]: 84: Hoare triple {49856#false} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {49856#false} is VALID [2022-02-20 21:56:17,009 INFO L290 TraceCheckUtils]: 85: Hoare triple {49856#false} assume true; {49856#false} is VALID [2022-02-20 21:56:17,009 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {49856#false} {49855#true} #842#return; {49856#false} is VALID [2022-02-20 21:56:17,009 INFO L290 TraceCheckUtils]: 87: Hoare triple {49856#false} ~tmp~12.base, ~tmp~12.offset := #t~ret196.base, #t~ret196.offset;havoc #t~ret196.base, #t~ret196.offset; {49856#false} is VALID [2022-02-20 21:56:17,009 INFO L290 TraceCheckUtils]: 88: Hoare triple {49856#false} assume ~tmp~12.base != 0 || ~tmp~12.offset != 0; {49856#false} is VALID [2022-02-20 21:56:17,009 INFO L272 TraceCheckUtils]: 89: Hoare triple {49856#false} call #t~ret197.base, #t~ret197.offset := ldv_malloc(~size % 4294967296); {49975#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:17,010 INFO L290 TraceCheckUtils]: 90: Hoare triple {49975#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___0~0 := #t~nondet30;havoc #t~nondet30; {49855#true} is VALID [2022-02-20 21:56:17,010 INFO L290 TraceCheckUtils]: 91: Hoare triple {49855#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {49855#true} is VALID [2022-02-20 21:56:17,010 INFO L290 TraceCheckUtils]: 92: Hoare triple {49855#true} assume true; {49855#true} is VALID [2022-02-20 21:56:17,010 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {49855#true} {49856#false} #844#return; {49856#false} is VALID [2022-02-20 21:56:17,010 INFO L290 TraceCheckUtils]: 94: Hoare triple {49856#false} call write~$Pointer$(#t~ret197.base, #t~ret197.offset, ~tmp~12.base, 224 + ~tmp~12.offset, 8);havoc #t~ret197.base, #t~ret197.offset;call #t~mem198.base, #t~mem198.offset := read~$Pointer$(~tmp~12.base, 224 + ~tmp~12.offset, 8);call write~$Pointer$(#t~mem198.base, #t~mem198.offset, ~tmp~12.base, 232 + ~tmp~12.offset, 8);havoc #t~mem198.base, #t~mem198.offset; {49856#false} is VALID [2022-02-20 21:56:17,010 INFO L290 TraceCheckUtils]: 95: Hoare triple {49856#false} #res.base, #res.offset := ~tmp~12.base, ~tmp~12.offset; {49856#false} is VALID [2022-02-20 21:56:17,010 INFO L290 TraceCheckUtils]: 96: Hoare triple {49856#false} assume true; {49856#false} is VALID [2022-02-20 21:56:17,010 INFO L284 TraceCheckUtils]: 97: Hoare quadruple {49856#false} {49855#true} #814#return; {49856#false} is VALID [2022-02-20 21:56:17,011 INFO L290 TraceCheckUtils]: 98: Hoare triple {49856#false} ~skb2~0#1.base, ~skb2~0#1.offset := #t~ret114#1.base, #t~ret114#1.offset;havoc #t~ret114#1.base, #t~ret114#1.offset; {49856#false} is VALID [2022-02-20 21:56:17,011 INFO L290 TraceCheckUtils]: 99: Hoare triple {49856#false} assume 0 == (~skb2~0#1.base + ~skb2~0#1.offset) % 18446744073709551616;#res#1 := 0; {49856#false} is VALID [2022-02-20 21:56:17,011 INFO L290 TraceCheckUtils]: 100: Hoare triple {49856#false} assume true; {49856#false} is VALID [2022-02-20 21:56:17,011 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {49856#false} {49855#true} #788#return; {49856#false} is VALID [2022-02-20 21:56:17,011 INFO L290 TraceCheckUtils]: 102: Hoare triple {49856#false} assume -2147483648 <= main_#t~ret189#1 && main_#t~ret189#1 <= 2147483647;havoc main_#t~ret189#1;~ldv_state_variable_2~0 := 1; {49856#false} is VALID [2022-02-20 21:56:17,011 INFO L290 TraceCheckUtils]: 103: Hoare triple {49856#false} assume !(2 == ~ldv_state_variable_2~0); {49856#false} is VALID [2022-02-20 21:56:17,011 INFO L290 TraceCheckUtils]: 104: Hoare triple {49856#false} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {49856#false} is VALID [2022-02-20 21:56:17,011 INFO L290 TraceCheckUtils]: 105: Hoare triple {49856#false} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {49856#false} is VALID [2022-02-20 21:56:17,011 INFO L290 TraceCheckUtils]: 106: Hoare triple {49856#false} assume main_#t~switch176#1; {49856#false} is VALID [2022-02-20 21:56:17,012 INFO L290 TraceCheckUtils]: 107: Hoare triple {49856#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet184#1 && main_#t~nondet184#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet184#1;havoc main_#t~nondet184#1;main_#t~switch185#1 := 0 == main_~tmp___2~1#1; {49856#false} is VALID [2022-02-20 21:56:17,012 INFO L290 TraceCheckUtils]: 108: Hoare triple {49856#false} assume main_#t~switch185#1; {49856#false} is VALID [2022-02-20 21:56:17,012 INFO L290 TraceCheckUtils]: 109: Hoare triple {49856#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_cx82310_driver_exit } true;assume { :begin_inline_ldv_usb_deregister_15 } true;ldv_usb_deregister_15_#in~arg#1.base, ldv_usb_deregister_15_#in~arg#1.offset := ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset;havoc ldv_usb_deregister_15_~arg#1.base, ldv_usb_deregister_15_~arg#1.offset;ldv_usb_deregister_15_~arg#1.base, ldv_usb_deregister_15_~arg#1.offset := ldv_usb_deregister_15_#in~arg#1.base, ldv_usb_deregister_15_#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_15_~arg#1.base, ldv_usb_deregister_15_~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; {49856#false} is VALID [2022-02-20 21:56:17,012 INFO L290 TraceCheckUtils]: 110: Hoare triple {49856#false} assume { :end_inline_usb_deregister } true;~ldv_state_variable_1~0 := 0; {49856#false} is VALID [2022-02-20 21:56:17,012 INFO L290 TraceCheckUtils]: 111: Hoare triple {49856#false} assume { :end_inline_ldv_usb_deregister_15 } true; {49856#false} is VALID [2022-02-20 21:56:17,012 INFO L290 TraceCheckUtils]: 112: Hoare triple {49856#false} assume { :end_inline_cx82310_driver_exit } true;~ldv_state_variable_0~0 := 2; {49856#false} is VALID [2022-02-20 21:56:17,012 INFO L290 TraceCheckUtils]: 113: Hoare triple {49856#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret209#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {49856#false} is VALID [2022-02-20 21:56:17,012 INFO L290 TraceCheckUtils]: 114: Hoare triple {49856#false} ldv_check_final_state_#t~ret209#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret209#1 && ldv_check_final_state_#t~ret209#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret209#1;havoc ldv_check_final_state_#t~ret209#1; {49856#false} is VALID [2022-02-20 21:56:17,013 INFO L290 TraceCheckUtils]: 115: Hoare triple {49856#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {49856#false} is VALID [2022-02-20 21:56:17,013 INFO L272 TraceCheckUtils]: 116: Hoare triple {49856#false} call ldv_error(); {49856#false} is VALID [2022-02-20 21:56:17,013 INFO L290 TraceCheckUtils]: 117: Hoare triple {49856#false} assume !false; {49856#false} is VALID [2022-02-20 21:56:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-02-20 21:56:17,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:56:17,016 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999006345] [2022-02-20 21:56:17,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999006345] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:56:17,016 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:56:17,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 21:56:17,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420836737] [2022-02-20 21:56:17,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:56:17,017 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2022-02-20 21:56:17,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:56:17,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 7.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 21:56:17,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:17,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 21:56:17,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:56:17,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 21:56:17,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-20 21:56:17,098 INFO L87 Difference]: Start difference. First operand 2232 states and 3104 transitions. Second operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 21:56:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:27,271 INFO L93 Difference]: Finished difference Result 5416 states and 7968 transitions. [2022-02-20 21:56:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 21:56:27,272 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2022-02-20 21:56:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:56:27,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 21:56:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1069 transitions. [2022-02-20 21:56:27,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 7.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 21:56:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1069 transitions. [2022-02-20 21:56:27,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1069 transitions. [2022-02-20 21:56:27,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1069 edges. 1069 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:28,445 INFO L225 Difference]: With dead ends: 5416 [2022-02-20 21:56:28,445 INFO L226 Difference]: Without dead ends: 3209 [2022-02-20 21:56:28,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-02-20 21:56:28,450 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 378 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 21:56:28,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 1872 Invalid, 1116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 21:56:28,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3209 states. [2022-02-20 21:56:28,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3209 to 2412. [2022-02-20 21:56:28,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:56:28,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3209 states. Second operand has 2412 states, 1877 states have (on average 1.3670751198721365) internal successors, (2566), 1893 states have internal predecessors, (2566), 359 states have call successors, (359), 132 states have call predecessors, (359), 175 states have return successors, (514), 386 states have call predecessors, (514), 358 states have call successors, (514) [2022-02-20 21:56:28,525 INFO L74 IsIncluded]: Start isIncluded. First operand 3209 states. Second operand has 2412 states, 1877 states have (on average 1.3670751198721365) internal successors, (2566), 1893 states have internal predecessors, (2566), 359 states have call successors, (359), 132 states have call predecessors, (359), 175 states have return successors, (514), 386 states have call predecessors, (514), 358 states have call successors, (514) [2022-02-20 21:56:28,527 INFO L87 Difference]: Start difference. First operand 3209 states. Second operand has 2412 states, 1877 states have (on average 1.3670751198721365) internal successors, (2566), 1893 states have internal predecessors, (2566), 359 states have call successors, (359), 132 states have call predecessors, (359), 175 states have return successors, (514), 386 states have call predecessors, (514), 358 states have call successors, (514) [2022-02-20 21:56:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:28,881 INFO L93 Difference]: Finished difference Result 3209 states and 4784 transitions. [2022-02-20 21:56:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 3209 states and 4784 transitions. [2022-02-20 21:56:28,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:28,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:28,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 2412 states, 1877 states have (on average 1.3670751198721365) internal successors, (2566), 1893 states have internal predecessors, (2566), 359 states have call successors, (359), 132 states have call predecessors, (359), 175 states have return successors, (514), 386 states have call predecessors, (514), 358 states have call successors, (514) Second operand 3209 states. [2022-02-20 21:56:28,895 INFO L87 Difference]: Start difference. First operand has 2412 states, 1877 states have (on average 1.3670751198721365) internal successors, (2566), 1893 states have internal predecessors, (2566), 359 states have call successors, (359), 132 states have call predecessors, (359), 175 states have return successors, (514), 386 states have call predecessors, (514), 358 states have call successors, (514) Second operand 3209 states. [2022-02-20 21:56:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:56:29,251 INFO L93 Difference]: Finished difference Result 3209 states and 4784 transitions. [2022-02-20 21:56:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 3209 states and 4784 transitions. [2022-02-20 21:56:29,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:56:29,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:56:29,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:56:29,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:56:29,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2412 states, 1877 states have (on average 1.3670751198721365) internal successors, (2566), 1893 states have internal predecessors, (2566), 359 states have call successors, (359), 132 states have call predecessors, (359), 175 states have return successors, (514), 386 states have call predecessors, (514), 358 states have call successors, (514) [2022-02-20 21:56:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2412 states to 2412 states and 3439 transitions. [2022-02-20 21:56:29,527 INFO L78 Accepts]: Start accepts. Automaton has 2412 states and 3439 transitions. Word has length 118 [2022-02-20 21:56:29,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:56:29,529 INFO L470 AbstractCegarLoop]: Abstraction has 2412 states and 3439 transitions. [2022-02-20 21:56:29,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-02-20 21:56:29,529 INFO L276 IsEmpty]: Start isEmpty. Operand 2412 states and 3439 transitions. [2022-02-20 21:56:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-02-20 21:56:29,533 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:56:29,533 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:56:29,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 21:56:29,533 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:56:29,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:56:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash -916115273, now seen corresponding path program 1 times [2022-02-20 21:56:29,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:56:29,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175907378] [2022-02-20 21:56:29,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:56:29,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:56:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:56:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {66664#true} is VALID [2022-02-20 21:56:29,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {66664#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66664#true} {66664#true} #766#return; {66664#true} is VALID [2022-02-20 21:56:29,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-20 21:56:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {66756#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {66664#true} is VALID [2022-02-20 21:56:29,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {66664#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {66664#true} is VALID [2022-02-20 21:56:29,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {66664#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {66664#true} is VALID [2022-02-20 21:56:29,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66664#true} {66664#true} #768#return; {66664#true} is VALID [2022-02-20 21:56:29,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-20 21:56:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {66756#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {66664#true} is VALID [2022-02-20 21:56:29,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {66664#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {66664#true} is VALID [2022-02-20 21:56:29,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {66664#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {66664#true} is VALID [2022-02-20 21:56:29,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66664#true} {66664#true} #770#return; {66664#true} is VALID [2022-02-20 21:56:29,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-20 21:56:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {66664#true} is VALID [2022-02-20 21:56:29,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {66664#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66664#true} {66664#true} #778#return; {66664#true} is VALID [2022-02-20 21:56:29,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 21:56:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {66664#true} is VALID [2022-02-20 21:56:29,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {66664#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66664#true} {66664#true} #780#return; {66664#true} is VALID [2022-02-20 21:56:29,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-02-20 21:56:29,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {66664#true} is VALID [2022-02-20 21:56:29,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {66664#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66664#true} {66664#true} #782#return; {66664#true} is VALID [2022-02-20 21:56:29,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 21:56:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {66664#true} is VALID [2022-02-20 21:56:29,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {66664#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66664#true} {66664#true} #784#return; {66664#true} is VALID [2022-02-20 21:56:29,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-02-20 21:56:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 21:56:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___0~0 := #t~nondet30;havoc #t~nondet30; {66664#true} is VALID [2022-02-20 21:56:29,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {66664#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66664#true} {66664#true} #738#return; {66664#true} is VALID [2022-02-20 21:56:29,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {66664#true} is VALID [2022-02-20 21:56:29,738 INFO L272 TraceCheckUtils]: 1: Hoare triple {66664#true} call #t~ret214.base, #t~ret214.offset := ldv_malloc(1); {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___0~0 := #t~nondet30;havoc #t~nondet30; {66664#true} is VALID [2022-02-20 21:56:29,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {66664#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,738 INFO L290 TraceCheckUtils]: 4: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,739 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {66664#true} {66664#true} #738#return; {66664#true} is VALID [2022-02-20 21:56:29,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {66664#true} #res.base, #res.offset := #t~ret214.base, #t~ret214.offset;havoc #t~ret214.base, #t~ret214.offset; {66664#true} is VALID [2022-02-20 21:56:29,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,739 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {66664#true} {66664#true} #826#return; {66664#true} is VALID [2022-02-20 21:56:29,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-02-20 21:56:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:56:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 21:56:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {66664#true} ~cond := #in~cond; {66664#true} is VALID [2022-02-20 21:56:29,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {66664#true} assume !(0 == ~cond); {66664#true} is VALID [2022-02-20 21:56:29,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66664#true} {66664#true} #764#return; {66664#true} is VALID [2022-02-20 21:56:29,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {66664#true} is VALID [2022-02-20 21:56:29,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {66664#true} assume !(0 != ~tmp___0~1#1);call #t~malloc33#1.base, #t~malloc33#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc33#1.base, #t~malloc33#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {66664#true} is VALID [2022-02-20 21:56:29,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {66664#true} assume { :end_inline_#Ultimate.meminit } true;~tmp~2#1.base, ~tmp~2#1.offset := #t~malloc33#1.base, #t~malloc33#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~2#1.base, ~tmp~2#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,788 INFO L272 TraceCheckUtils]: 3: Hoare triple {66664#true} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {66664#true} is VALID [2022-02-20 21:56:29,788 INFO L290 TraceCheckUtils]: 4: Hoare triple {66664#true} ~cond := #in~cond; {66664#true} is VALID [2022-02-20 21:56:29,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {66664#true} assume !(0 == ~cond); {66664#true} is VALID [2022-02-20 21:56:29,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,788 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {66664#true} {66664#true} #764#return; {66664#true} is VALID [2022-02-20 21:56:29,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {66664#true} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,788 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {66664#true} {66664#true} #736#return; {66664#true} is VALID [2022-02-20 21:56:29,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {66807#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,789 INFO L272 TraceCheckUtils]: 1: Hoare triple {66664#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {66664#true} is VALID [2022-02-20 21:56:29,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {66664#true} assume !(0 != ~tmp___0~1#1);call #t~malloc33#1.base, #t~malloc33#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc33#1.base, #t~malloc33#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {66664#true} is VALID [2022-02-20 21:56:29,790 INFO L290 TraceCheckUtils]: 4: Hoare triple {66664#true} assume { :end_inline_#Ultimate.meminit } true;~tmp~2#1.base, ~tmp~2#1.offset := #t~malloc33#1.base, #t~malloc33#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~2#1.base, ~tmp~2#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,790 INFO L272 TraceCheckUtils]: 5: Hoare triple {66664#true} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {66664#true} is VALID [2022-02-20 21:56:29,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {66664#true} ~cond := #in~cond; {66664#true} is VALID [2022-02-20 21:56:29,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {66664#true} assume !(0 == ~cond); {66664#true} is VALID [2022-02-20 21:56:29,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,790 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {66664#true} {66664#true} #764#return; {66664#true} is VALID [2022-02-20 21:56:29,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {66664#true} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,791 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {66664#true} {66664#true} #736#return; {66664#true} is VALID [2022-02-20 21:56:29,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {66664#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {66664#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {66664#true} is VALID [2022-02-20 21:56:29,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {66664#true} assume !false; {66664#true} is VALID [2022-02-20 21:56:29,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {66664#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {66664#true} is VALID [2022-02-20 21:56:29,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {66664#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {66664#true} is VALID [2022-02-20 21:56:29,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {66664#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,792 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {66664#true} {66664#true} #842#return; {66664#true} is VALID [2022-02-20 21:56:29,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-02-20 21:56:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:56:29,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___0~0 := #t~nondet30;havoc #t~nondet30; {66664#true} is VALID [2022-02-20 21:56:29,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {66664#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66664#true} {66664#true} #844#return; {66664#true} is VALID [2022-02-20 21:56:29,814 INFO L290 TraceCheckUtils]: 0: Hoare triple {66807#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~12.base, ~tmp~12.offset; {66664#true} is VALID [2022-02-20 21:56:29,815 INFO L272 TraceCheckUtils]: 1: Hoare triple {66664#true} call #t~ret196.base, #t~ret196.offset := ldv_skb_alloc(); {66807#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:29,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {66807#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,815 INFO L272 TraceCheckUtils]: 3: Hoare triple {66664#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,815 INFO L290 TraceCheckUtils]: 4: Hoare triple {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {66664#true} is VALID [2022-02-20 21:56:29,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {66664#true} assume !(0 != ~tmp___0~1#1);call #t~malloc33#1.base, #t~malloc33#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc33#1.base, #t~malloc33#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {66664#true} is VALID [2022-02-20 21:56:29,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {66664#true} assume { :end_inline_#Ultimate.meminit } true;~tmp~2#1.base, ~tmp~2#1.offset := #t~malloc33#1.base, #t~malloc33#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~2#1.base, ~tmp~2#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,816 INFO L272 TraceCheckUtils]: 7: Hoare triple {66664#true} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {66664#true} is VALID [2022-02-20 21:56:29,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {66664#true} ~cond := #in~cond; {66664#true} is VALID [2022-02-20 21:56:29,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {66664#true} assume !(0 == ~cond); {66664#true} is VALID [2022-02-20 21:56:29,816 INFO L290 TraceCheckUtils]: 10: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,816 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {66664#true} {66664#true} #764#return; {66664#true} is VALID [2022-02-20 21:56:29,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {66664#true} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,817 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {66664#true} {66664#true} #736#return; {66664#true} is VALID [2022-02-20 21:56:29,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {66664#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {66664#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {66664#true} is VALID [2022-02-20 21:56:29,817 INFO L290 TraceCheckUtils]: 17: Hoare triple {66664#true} assume !false; {66664#true} is VALID [2022-02-20 21:56:29,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {66664#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {66664#true} is VALID [2022-02-20 21:56:29,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {66664#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {66664#true} is VALID [2022-02-20 21:56:29,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {66664#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,818 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {66664#true} {66664#true} #842#return; {66664#true} is VALID [2022-02-20 21:56:29,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {66664#true} ~tmp~12.base, ~tmp~12.offset := #t~ret196.base, #t~ret196.offset;havoc #t~ret196.base, #t~ret196.offset; {66664#true} is VALID [2022-02-20 21:56:29,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {66664#true} assume ~tmp~12.base != 0 || ~tmp~12.offset != 0; {66664#true} is VALID [2022-02-20 21:56:29,818 INFO L272 TraceCheckUtils]: 25: Hoare triple {66664#true} call #t~ret197.base, #t~ret197.offset := ldv_malloc(~size % 4294967296); {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___0~0 := #t~nondet30;havoc #t~nondet30; {66664#true} is VALID [2022-02-20 21:56:29,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {66664#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,819 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {66664#true} {66664#true} #844#return; {66664#true} is VALID [2022-02-20 21:56:29,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {66664#true} call write~$Pointer$(#t~ret197.base, #t~ret197.offset, ~tmp~12.base, 224 + ~tmp~12.offset, 8);havoc #t~ret197.base, #t~ret197.offset;call #t~mem198.base, #t~mem198.offset := read~$Pointer$(~tmp~12.base, 224 + ~tmp~12.offset, 8);call write~$Pointer$(#t~mem198.base, #t~mem198.offset, ~tmp~12.base, 232 + ~tmp~12.offset, 8);havoc #t~mem198.base, #t~mem198.offset; {66664#true} is VALID [2022-02-20 21:56:29,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {66664#true} #res.base, #res.offset := ~tmp~12.base, ~tmp~12.offset; {66664#true} is VALID [2022-02-20 21:56:29,819 INFO L290 TraceCheckUtils]: 32: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,820 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {66664#true} {66665#false} #832#return; {66665#false} is VALID [2022-02-20 21:56:29,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {66757#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5838)| abs_5838) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~len~0#1;havoc ~skb2~0#1.base, ~skb2~0#1.offset;havoc ~__len~1#1;havoc ~__ret~1#1.base, ~__ret~1#1.offset;havoc ~__len___0~1#1;havoc ~__ret___0~1#1.base, ~__ret___0~1#1.offset;havoc ~__len___1~0#1;havoc ~__ret___1~0#1.base, ~__ret___1~0#1.offset;havoc ~__len___2~0#1;havoc ~__ret___2~0#1.base, ~__ret___2~0#1.offset;call #t~mem111#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8); {66664#true} is VALID [2022-02-20 21:56:29,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {66664#true} assume !(0 != #t~mem111#1 % 18446744073709551616);havoc #t~mem111#1; {66664#true} is VALID [2022-02-20 21:56:29,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {66664#true} call #t~mem160#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {66664#true} is VALID [2022-02-20 21:56:29,820 INFO L290 TraceCheckUtils]: 3: Hoare triple {66664#true} assume #t~mem160#1 % 4294967296 > 1;havoc #t~mem160#1; {66664#true} is VALID [2022-02-20 21:56:29,820 INFO L290 TraceCheckUtils]: 4: Hoare triple {66664#true} call #t~mem132#1.base, #t~mem132#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem133#1 := read~int(#t~mem132#1.base, #t~mem132#1.offset, 1);call #t~mem134#1.base, #t~mem134#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem135#1 := read~int(#t~mem134#1.base, 1 + #t~mem134#1.offset, 1);call #t~mem136#1.base, #t~mem136#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem137#1 := read~int(#t~mem136#1.base, 1 + #t~mem136#1.offset, 1); {66664#true} is VALID [2022-02-20 21:56:29,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {66664#true} assume (1 == #t~mem133#1 % 256 && (0 == 256 * (#t~mem135#1 % 256) || 1 == 256 * (#t~mem135#1 % 256))) || ((0 == #t~mem133#1 % 256 || 1 == #t~mem133#1 % 256) && 1 == 256 * (#t~mem135#1 % 256));~len~0#1 := 1; {66664#true} is VALID [2022-02-20 21:56:29,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {66664#true} havoc #t~mem132#1.base, #t~mem132#1.offset;havoc #t~mem133#1;havoc #t~mem134#1.base, #t~mem134#1.offset;havoc #t~mem135#1;havoc #t~mem136#1.base, #t~mem136#1.offset;havoc #t~mem137#1; {66664#true} is VALID [2022-02-20 21:56:29,821 INFO L272 TraceCheckUtils]: 7: Hoare triple {66664#true} call #t~ret139#1.base, #t~ret139#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, 2); {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {66664#true} is VALID [2022-02-20 21:56:29,822 INFO L272 TraceCheckUtils]: 9: Hoare triple {66664#true} call #t~ret214.base, #t~ret214.offset := ldv_malloc(1); {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___0~0 := #t~nondet30;havoc #t~nondet30; {66664#true} is VALID [2022-02-20 21:56:29,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {66664#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,822 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {66664#true} {66664#true} #738#return; {66664#true} is VALID [2022-02-20 21:56:29,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {66664#true} #res.base, #res.offset := #t~ret214.base, #t~ret214.offset;havoc #t~ret214.base, #t~ret214.offset; {66664#true} is VALID [2022-02-20 21:56:29,823 INFO L290 TraceCheckUtils]: 15: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,823 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {66664#true} {66664#true} #826#return; {66664#true} is VALID [2022-02-20 21:56:29,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {66664#true} havoc #t~ret139#1.base, #t~ret139#1.offset;call #t~mem140#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4);#t~short142#1 := ~len~0#1 % 4294967296 == #t~mem140#1 % 4294967296; {66664#true} is VALID [2022-02-20 21:56:29,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {66664#true} assume #t~short142#1; {66767#|cx82310_rx_fixup_#t~short142#1|} is VALID [2022-02-20 21:56:29,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {66767#|cx82310_rx_fixup_#t~short142#1|} assume !#t~short142#1;havoc #t~mem140#1;havoc #t~mem141#1;havoc #t~short142#1; {66665#false} is VALID [2022-02-20 21:56:29,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {66665#false} assume !(~len~0#1 > 1514);call #t~mem145#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {66665#false} is VALID [2022-02-20 21:56:29,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {66665#false} assume !(~len~0#1 % 4294967296 > #t~mem145#1 % 4294967296);havoc #t~mem145#1; {66665#false} is VALID [2022-02-20 21:56:29,824 INFO L272 TraceCheckUtils]: 22: Hoare triple {66665#false} call #t~ret154#1.base, #t~ret154#1.offset := ldv_alloc_skb_12(~len~0#1, 32); {66807#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:29,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {66807#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~12.base, ~tmp~12.offset; {66664#true} is VALID [2022-02-20 21:56:29,825 INFO L272 TraceCheckUtils]: 24: Hoare triple {66664#true} call #t~ret196.base, #t~ret196.offset := ldv_skb_alloc(); {66807#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:29,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {66807#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,825 INFO L272 TraceCheckUtils]: 26: Hoare triple {66664#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {66664#true} is VALID [2022-02-20 21:56:29,825 INFO L290 TraceCheckUtils]: 28: Hoare triple {66664#true} assume !(0 != ~tmp___0~1#1);call #t~malloc33#1.base, #t~malloc33#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc33#1.base, #t~malloc33#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {66664#true} is VALID [2022-02-20 21:56:29,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {66664#true} assume { :end_inline_#Ultimate.meminit } true;~tmp~2#1.base, ~tmp~2#1.offset := #t~malloc33#1.base, #t~malloc33#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~2#1.base, ~tmp~2#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,826 INFO L272 TraceCheckUtils]: 30: Hoare triple {66664#true} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {66664#true} is VALID [2022-02-20 21:56:29,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {66664#true} ~cond := #in~cond; {66664#true} is VALID [2022-02-20 21:56:29,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {66664#true} assume !(0 == ~cond); {66664#true} is VALID [2022-02-20 21:56:29,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,826 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {66664#true} {66664#true} #764#return; {66664#true} is VALID [2022-02-20 21:56:29,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {66664#true} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,827 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {66664#true} {66664#true} #736#return; {66664#true} is VALID [2022-02-20 21:56:29,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {66664#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {66664#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {66664#true} is VALID [2022-02-20 21:56:29,827 INFO L290 TraceCheckUtils]: 40: Hoare triple {66664#true} assume !false; {66664#true} is VALID [2022-02-20 21:56:29,827 INFO L290 TraceCheckUtils]: 41: Hoare triple {66664#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {66664#true} is VALID [2022-02-20 21:56:29,827 INFO L290 TraceCheckUtils]: 42: Hoare triple {66664#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {66664#true} is VALID [2022-02-20 21:56:29,827 INFO L290 TraceCheckUtils]: 43: Hoare triple {66664#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,827 INFO L290 TraceCheckUtils]: 44: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,828 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {66664#true} {66664#true} #842#return; {66664#true} is VALID [2022-02-20 21:56:29,828 INFO L290 TraceCheckUtils]: 46: Hoare triple {66664#true} ~tmp~12.base, ~tmp~12.offset := #t~ret196.base, #t~ret196.offset;havoc #t~ret196.base, #t~ret196.offset; {66664#true} is VALID [2022-02-20 21:56:29,828 INFO L290 TraceCheckUtils]: 47: Hoare triple {66664#true} assume ~tmp~12.base != 0 || ~tmp~12.offset != 0; {66664#true} is VALID [2022-02-20 21:56:29,828 INFO L272 TraceCheckUtils]: 48: Hoare triple {66664#true} call #t~ret197.base, #t~ret197.offset := ldv_malloc(~size % 4294967296); {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,828 INFO L290 TraceCheckUtils]: 49: Hoare triple {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___0~0 := #t~nondet30;havoc #t~nondet30; {66664#true} is VALID [2022-02-20 21:56:29,829 INFO L290 TraceCheckUtils]: 50: Hoare triple {66664#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,829 INFO L290 TraceCheckUtils]: 51: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,829 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {66664#true} {66664#true} #844#return; {66664#true} is VALID [2022-02-20 21:56:29,829 INFO L290 TraceCheckUtils]: 53: Hoare triple {66664#true} call write~$Pointer$(#t~ret197.base, #t~ret197.offset, ~tmp~12.base, 224 + ~tmp~12.offset, 8);havoc #t~ret197.base, #t~ret197.offset;call #t~mem198.base, #t~mem198.offset := read~$Pointer$(~tmp~12.base, 224 + ~tmp~12.offset, 8);call write~$Pointer$(#t~mem198.base, #t~mem198.offset, ~tmp~12.base, 232 + ~tmp~12.offset, 8);havoc #t~mem198.base, #t~mem198.offset; {66664#true} is VALID [2022-02-20 21:56:29,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {66664#true} #res.base, #res.offset := ~tmp~12.base, ~tmp~12.offset; {66664#true} is VALID [2022-02-20 21:56:29,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,829 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {66664#true} {66665#false} #832#return; {66665#false} is VALID [2022-02-20 21:56:29,829 INFO L290 TraceCheckUtils]: 57: Hoare triple {66665#false} ~skb2~0#1.base, ~skb2~0#1.offset := #t~ret154#1.base, #t~ret154#1.offset;havoc #t~ret154#1.base, #t~ret154#1.offset; {66665#false} is VALID [2022-02-20 21:56:29,830 INFO L290 TraceCheckUtils]: 58: Hoare triple {66665#false} assume 0 == (~skb2~0#1.base + ~skb2~0#1.offset) % 18446744073709551616;#res#1 := 0; {66665#false} is VALID [2022-02-20 21:56:29,830 INFO L290 TraceCheckUtils]: 59: Hoare triple {66665#false} assume true; {66665#false} is VALID [2022-02-20 21:56:29,830 INFO L284 TraceCheckUtils]: 60: Hoare quadruple {66665#false} {66664#true} #788#return; {66665#false} is VALID [2022-02-20 21:56:29,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {66664#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(106, 2);call #Ultimate.allocInit(28, 3);call #Ultimate.allocInit(24, 4);call #Ultimate.allocInit(25, 5);call #Ultimate.allocInit(41, 6);call #Ultimate.allocInit(25, 7);call #Ultimate.allocInit(13, 8);call #Ultimate.allocInit(34, 9);call #Ultimate.allocInit(2, 10);call write~init~int(1, 10, 0, 1);call write~init~int(0, 10, 1, 1);call #Ultimate.allocInit(36, 11);call #Ultimate.allocInit(32, 12);call #Ultimate.allocInit(26, 13);call #Ultimate.allocInit(30, 14);call #Ultimate.allocInit(12, 15);call #Ultimate.allocInit(12, 16);~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~ldv_state_variable_2~0 := 0;~ref_cnt~0 := 0;~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~usb_counter~0 := 0;~cx82310_info_group1~0.base, ~cx82310_info_group1~0.offset := 0, 0;~cx82310_driver_group1~0.base, ~cx82310_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~#cx82310_info~0.base, ~#cx82310_info~0.offset := 17, 0;call #Ultimate.allocInit(124, 17);call write~init~$Pointer$(14, 0, ~#cx82310_info~0.base, ~#cx82310_info~0.offset, 8);call write~init~int(32, ~#cx82310_info~0.base, 8 + ~#cx82310_info~0.offset, 4);call write~init~$Pointer$(#funAddr~cx82310_bind.base, #funAddr~cx82310_bind.offset, ~#cx82310_info~0.base, 12 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_unbind.base, #funAddr~cx82310_unbind.offset, ~#cx82310_info~0.base, 20 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 28 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 36 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 44 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 52 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 60 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 68 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_rx_fixup.base, #funAddr~cx82310_rx_fixup.offset, ~#cx82310_info~0.base, 76 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(#funAddr~cx82310_tx_fixup.base, #funAddr~cx82310_tx_fixup.offset, ~#cx82310_info~0.base, 84 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 92 + ~#cx82310_info~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_info~0.base, 100 + ~#cx82310_info~0.offset, 8);call write~init~int(0, ~#cx82310_info~0.base, 108 + ~#cx82310_info~0.offset, 4);call write~init~int(0, ~#cx82310_info~0.base, 112 + ~#cx82310_info~0.offset, 4);call write~init~int(0, ~#cx82310_info~0.base, 116 + ~#cx82310_info~0.offset, 8);~#products~0.base, ~#products~0.offset := 18, 0;call #Ultimate.allocInit(50, 18);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#products~0.base);call write~unchecked~int(899, ~#products~0.base, ~#products~0.offset, 2);call write~unchecked~int(1394, ~#products~0.base, 2 + ~#products~0.offset, 2);call write~unchecked~int(51969, ~#products~0.base, 4 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 6 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 8 + ~#products~0.offset, 2);call write~unchecked~int(0, ~#products~0.base, 10 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 11 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 12 + ~#products~0.offset, 1);call write~unchecked~int(255, ~#products~0.base, 13 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 14 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 15 + ~#products~0.offset, 1);call write~unchecked~int(0, ~#products~0.base, 16 + ~#products~0.offset, 1);call write~unchecked~int(~#cx82310_info~0.base + ~#cx82310_info~0.offset, ~#products~0.base, 17 + ~#products~0.offset, 8);~__mod_usb__products_device_table~0.match_flags := 0;~__mod_usb__products_device_table~0.idVendor := 0;~__mod_usb__products_device_table~0.idProduct := 0;~__mod_usb__products_device_table~0.bcdDevice_lo := 0;~__mod_usb__products_device_table~0.bcdDevice_hi := 0;~__mod_usb__products_device_table~0.bDeviceClass := 0;~__mod_usb__products_device_table~0.bDeviceSubClass := 0;~__mod_usb__products_device_table~0.bDeviceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceClass := 0;~__mod_usb__products_device_table~0.bInterfaceSubClass := 0;~__mod_usb__products_device_table~0.bInterfaceProtocol := 0;~__mod_usb__products_device_table~0.bInterfaceNumber := 0;~__mod_usb__products_device_table~0.driver_info := 0;~#cx82310_driver~0.base, ~#cx82310_driver~0.offset := 19, 0;call #Ultimate.allocInit(285, 19);call write~init~$Pointer$(15, 0, ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_probe.base, #funAddr~usbnet_probe.offset, ~#cx82310_driver~0.base, 8 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_disconnect.base, #funAddr~usbnet_disconnect.offset, ~#cx82310_driver~0.base, 16 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 24 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_suspend.base, #funAddr~usbnet_suspend.offset, ~#cx82310_driver~0.base, 32 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~usbnet_resume.base, #funAddr~usbnet_resume.offset, ~#cx82310_driver~0.base, 40 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 48 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 56 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 64 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(~#products~0.base, ~#products~0.offset, ~#cx82310_driver~0.base, 72 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 80 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 84 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 88 + ~#cx82310_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 92 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 100 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 108 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 116 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 124 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 132 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 136 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 148 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 156 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 164 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 172 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 180 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 188 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 196 + ~#cx82310_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 197 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 205 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 213 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 221 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 229 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 237 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 245 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 253 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 261 + ~#cx82310_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#cx82310_driver~0.base, 269 + ~#cx82310_driver~0.offset, 8);call write~init~int(0, ~#cx82310_driver~0.base, 277 + ~#cx82310_driver~0.offset, 4);call write~init~int(0, ~#cx82310_driver~0.base, 281 + ~#cx82310_driver~0.offset, 1);call write~init~int(0, ~#cx82310_driver~0.base, 282 + ~#cx82310_driver~0.offset, 1);call write~init~int(1, ~#cx82310_driver~0.base, 283 + ~#cx82310_driver~0.offset, 1);call write~init~int(0, ~#cx82310_driver~0.base, 284 + ~#cx82310_driver~0.offset, 1);~ldv_retval_2~0 := 0;~ldv_retval_0~0 := 0;~ldv_retval_5~0 := 0;~ldv_retval_4~0 := 0;~ldv_retval_1~0 := 0;~ldv_retval_3~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 20, 0;call #Ultimate.allocInit(120, 20);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#set_impl~0.base);~last_index~0 := 0;~LDV_SKBS~0.base, ~LDV_SKBS~0.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {66664#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret172#1.base, main_#t~ret172#1.offset, main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset, main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset, main_#t~nondet175#1, main_#t~switch176#1, main_#t~nondet177#1, main_#t~switch178#1, main_#t~ret179#1, main_#t~mem180#1, main_#t~ret181#1, main_#t~ret182#1, main_#t~ret183#1, main_#t~nondet184#1, main_#t~switch185#1, main_#t~ret186#1, main_#t~nondet187#1, main_#t~switch188#1, main_#t~ret189#1, main_#t~ret190#1, main_#t~ret191#1, main_#t~mem192#1, main_#t~ret193#1.base, main_#t~ret193#1.offset, main_#t~mem194#1, main_#t~ret195#1.base, main_#t~ret195#1.offset, main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset, main_~tmp~11#1.base, main_~tmp~11#1.offset, main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, main_~tmp___0~6#1, main_~tmp___1~3#1, main_~tmp___2~1#1, main_~tmp___3~0#1;havoc main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset;havoc main_~tmp~11#1.base, main_~tmp~11#1.offset;call main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset := #Ultimate.allocOnStack(4);call main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset := #Ultimate.allocOnStack(4);havoc main_~tmp___0~6#1;havoc main_~tmp___1~3#1;havoc main_~tmp___2~1#1;havoc main_~tmp___3~0#1; {66664#true} is VALID [2022-02-20 21:56:29,831 INFO L272 TraceCheckUtils]: 2: Hoare triple {66664#true} call main_#t~ret172#1.base, main_#t~ret172#1.offset := ldv_zalloc(32); {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,831 INFO L290 TraceCheckUtils]: 3: Hoare triple {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {66664#true} is VALID [2022-02-20 21:56:29,831 INFO L290 TraceCheckUtils]: 4: Hoare triple {66664#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,831 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {66664#true} {66664#true} #766#return; {66664#true} is VALID [2022-02-20 21:56:29,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {66664#true} main_~tmp~11#1.base, main_~tmp~11#1.offset := main_#t~ret172#1.base, main_#t~ret172#1.offset;havoc main_#t~ret172#1.base, main_#t~ret172#1.offset;main_~ldvarg1~0#1.base, main_~ldvarg1~0#1.offset := main_~tmp~11#1.base, main_~tmp~11#1.offset;assume { :begin_inline_ldv_initialize } true;assume { :begin_inline_ldv_set_init } true;ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ldv_set_init_#in~set#1.base, ldv_set_init_#in~set#1.offset;ldv_set_init_~set#1.base, ldv_set_init_~set#1.offset := ~#set_impl~0.base, ~#set_impl~0.offset;~last_index~0 := 0; {66664#true} is VALID [2022-02-20 21:56:29,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {66664#true} assume { :end_inline_ldv_set_init } true; {66664#true} is VALID [2022-02-20 21:56:29,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {66664#true} assume { :end_inline_ldv_initialize } true; {66664#true} is VALID [2022-02-20 21:56:29,832 INFO L272 TraceCheckUtils]: 10: Hoare triple {66664#true} call main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset := #Ultimate.C_memset(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset, 0, 4); {66756#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:56:29,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {66756#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {66664#true} is VALID [2022-02-20 21:56:29,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {66664#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {66664#true} is VALID [2022-02-20 21:56:29,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {66664#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {66664#true} is VALID [2022-02-20 21:56:29,833 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {66664#true} {66664#true} #768#return; {66664#true} is VALID [2022-02-20 21:56:29,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {66664#true} havoc main_#t~memset~res173#1.base, main_#t~memset~res173#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,834 INFO L272 TraceCheckUtils]: 16: Hoare triple {66664#true} call main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset := #Ultimate.C_memset(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset, 0, 4); {66756#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2022-02-20 21:56:29,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {66756#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} #t~loopctr228 := 0; {66664#true} is VALID [2022-02-20 21:56:29,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {66664#true} assume !(#t~loopctr228 % 18446744073709551616 < #amount % 18446744073709551616); {66664#true} is VALID [2022-02-20 21:56:29,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {66664#true} assume #res.base == #ptr.base && #res.offset == #ptr.offset; {66664#true} is VALID [2022-02-20 21:56:29,834 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {66664#true} {66664#true} #770#return; {66664#true} is VALID [2022-02-20 21:56:29,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {66664#true} havoc main_#t~memset~res174#1.base, main_#t~memset~res174#1.offset;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1;~ldv_state_variable_2~0 := 0; {66664#true} is VALID [2022-02-20 21:56:29,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {66664#true} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {66664#true} is VALID [2022-02-20 21:56:29,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {66664#true} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {66664#true} is VALID [2022-02-20 21:56:29,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {66664#true} assume main_#t~switch176#1; {66664#true} is VALID [2022-02-20 21:56:29,835 INFO L290 TraceCheckUtils]: 25: Hoare triple {66664#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet184#1 && main_#t~nondet184#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet184#1;havoc main_#t~nondet184#1;main_#t~switch185#1 := 0 == main_~tmp___2~1#1; {66664#true} is VALID [2022-02-20 21:56:29,835 INFO L290 TraceCheckUtils]: 26: Hoare triple {66664#true} assume !main_#t~switch185#1;main_#t~switch185#1 := main_#t~switch185#1 || 1 == main_~tmp___2~1#1; {66664#true} is VALID [2022-02-20 21:56:29,835 INFO L290 TraceCheckUtils]: 27: Hoare triple {66664#true} assume main_#t~switch185#1; {66664#true} is VALID [2022-02-20 21:56:29,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {66664#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_cx82310_driver_init } true;havoc cx82310_driver_init_#res#1;havoc cx82310_driver_init_#t~ret167#1, cx82310_driver_init_~tmp~8#1;havoc cx82310_driver_init_~tmp~8#1;assume { :begin_inline_ldv_usb_register_driver_14 } true;ldv_usb_register_driver_14_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.offset := ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset, ~#__this_module~0.base, ~#__this_module~0.offset, 16, 0;havoc ldv_usb_register_driver_14_#res#1;havoc ldv_usb_register_driver_14_#t~ret199#1, ldv_usb_register_driver_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset, ldv_usb_register_driver_14_~ldv_func_res~0#1, ldv_usb_register_driver_14_~tmp~13#1;ldv_usb_register_driver_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg1#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg1#1.offset;ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg2#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg2#1.offset;ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset := ldv_usb_register_driver_14_#in~ldv_func_arg3#1.base, ldv_usb_register_driver_14_#in~ldv_func_arg3#1.offset;havoc ldv_usb_register_driver_14_~ldv_func_res~0#1;havoc ldv_usb_register_driver_14_~tmp~13#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_14_~ldv_func_arg1#1.base, ldv_usb_register_driver_14_~ldv_func_arg1#1.offset, ldv_usb_register_driver_14_~ldv_func_arg2#1.base, ldv_usb_register_driver_14_~ldv_func_arg2#1.offset, ldv_usb_register_driver_14_~ldv_func_arg3#1.base, ldv_usb_register_driver_14_~ldv_func_arg3#1.offset;havoc usb_register_driver_#res#1;havoc usb_register_driver_#t~nondet220#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~nondet220#1 && usb_register_driver_#t~nondet220#1 <= 2147483647;usb_register_driver_#res#1 := usb_register_driver_#t~nondet220#1;havoc usb_register_driver_#t~nondet220#1; {66664#true} is VALID [2022-02-20 21:56:29,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {66664#true} ldv_usb_register_driver_14_#t~ret199#1 := usb_register_driver_#res#1;assume { :end_inline_usb_register_driver } true;assume -2147483648 <= ldv_usb_register_driver_14_#t~ret199#1 && ldv_usb_register_driver_14_#t~ret199#1 <= 2147483647;ldv_usb_register_driver_14_~tmp~13#1 := ldv_usb_register_driver_14_#t~ret199#1;havoc ldv_usb_register_driver_14_#t~ret199#1;ldv_usb_register_driver_14_~ldv_func_res~0#1 := ldv_usb_register_driver_14_~tmp~13#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~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset, ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset;havoc ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,836 INFO L272 TraceCheckUtils]: 30: Hoare triple {66664#true} call ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset := ldv_zalloc(1560); {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {66664#true} is VALID [2022-02-20 21:56:29,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {66664#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,836 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {66664#true} {66664#true} #778#return; {66664#true} is VALID [2022-02-20 21:56:29,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {66664#true} ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset := ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset;havoc ldv_usb_driver_1_#t~ret171#1.base, ldv_usb_driver_1_#t~ret171#1.offset;~cx82310_driver_group1~0.base, ~cx82310_driver_group1~0.offset := ldv_usb_driver_1_~tmp~10#1.base, ldv_usb_driver_1_~tmp~10#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {66664#true} assume { :end_inline_ldv_usb_driver_1 } true;ldv_usb_register_driver_14_#res#1 := ldv_usb_register_driver_14_~ldv_func_res~0#1; {66664#true} is VALID [2022-02-20 21:56:29,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {66664#true} cx82310_driver_init_#t~ret167#1 := ldv_usb_register_driver_14_#res#1;assume { :end_inline_ldv_usb_register_driver_14 } true;assume -2147483648 <= cx82310_driver_init_#t~ret167#1 && cx82310_driver_init_#t~ret167#1 <= 2147483647;cx82310_driver_init_~tmp~8#1 := cx82310_driver_init_#t~ret167#1;havoc cx82310_driver_init_#t~ret167#1;cx82310_driver_init_#res#1 := cx82310_driver_init_~tmp~8#1; {66664#true} is VALID [2022-02-20 21:56:29,837 INFO L290 TraceCheckUtils]: 38: Hoare triple {66664#true} main_#t~ret186#1 := cx82310_driver_init_#res#1;assume { :end_inline_cx82310_driver_init } true;assume -2147483648 <= main_#t~ret186#1 && main_#t~ret186#1 <= 2147483647;~ldv_retval_4~0 := main_#t~ret186#1;havoc main_#t~ret186#1; {66664#true} is VALID [2022-02-20 21:56:29,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {66664#true} assume 0 == ~ldv_retval_4~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_2~0 := 1;assume { :begin_inline_ldv_initialize_driver_info_2 } true;havoc ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset, ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset, ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset, ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset, ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset, ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset;havoc ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset;havoc ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset;havoc ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,837 INFO L272 TraceCheckUtils]: 40: Hoare triple {66664#true} call ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset := ldv_zalloc(1472); {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,838 INFO L290 TraceCheckUtils]: 41: Hoare triple {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {66664#true} is VALID [2022-02-20 21:56:29,838 INFO L290 TraceCheckUtils]: 42: Hoare triple {66664#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,838 INFO L290 TraceCheckUtils]: 43: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,838 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {66664#true} {66664#true} #780#return; {66664#true} is VALID [2022-02-20 21:56:29,838 INFO L290 TraceCheckUtils]: 45: Hoare triple {66664#true} ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset := ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset;havoc ldv_initialize_driver_info_2_#t~ret168#1.base, ldv_initialize_driver_info_2_#t~ret168#1.offset;~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset := ldv_initialize_driver_info_2_~tmp~9#1.base, ldv_initialize_driver_info_2_~tmp~9#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,839 INFO L272 TraceCheckUtils]: 46: Hoare triple {66664#true} call ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset := ldv_zalloc(1560); {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,839 INFO L290 TraceCheckUtils]: 47: Hoare triple {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {66664#true} is VALID [2022-02-20 21:56:29,839 INFO L290 TraceCheckUtils]: 48: Hoare triple {66664#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,839 INFO L290 TraceCheckUtils]: 49: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,839 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {66664#true} {66664#true} #782#return; {66664#true} is VALID [2022-02-20 21:56:29,839 INFO L290 TraceCheckUtils]: 51: Hoare triple {66664#true} ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset := ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset;havoc ldv_initialize_driver_info_2_#t~ret169#1.base, ldv_initialize_driver_info_2_#t~ret169#1.offset;~cx82310_info_group1~0.base, ~cx82310_info_group1~0.offset := ldv_initialize_driver_info_2_~tmp___0~5#1.base, ldv_initialize_driver_info_2_~tmp___0~5#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,840 INFO L272 TraceCheckUtils]: 52: Hoare triple {66664#true} call ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset := ldv_zalloc(232); {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,840 INFO L290 TraceCheckUtils]: 53: Hoare triple {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {66664#true} is VALID [2022-02-20 21:56:29,840 INFO L290 TraceCheckUtils]: 54: Hoare triple {66664#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,840 INFO L290 TraceCheckUtils]: 55: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,840 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {66664#true} {66664#true} #784#return; {66664#true} is VALID [2022-02-20 21:56:29,840 INFO L290 TraceCheckUtils]: 57: Hoare triple {66664#true} ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset := ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset;havoc ldv_initialize_driver_info_2_#t~ret170#1.base, ldv_initialize_driver_info_2_#t~ret170#1.offset;~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset := ldv_initialize_driver_info_2_~tmp___1~2#1.base, ldv_initialize_driver_info_2_~tmp___1~2#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,840 INFO L290 TraceCheckUtils]: 58: Hoare triple {66664#true} assume { :end_inline_ldv_initialize_driver_info_2 } true; {66664#true} is VALID [2022-02-20 21:56:29,841 INFO L290 TraceCheckUtils]: 59: Hoare triple {66664#true} assume !(0 != ~ldv_retval_4~0); {66664#true} is VALID [2022-02-20 21:56:29,841 INFO L290 TraceCheckUtils]: 60: Hoare triple {66664#true} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {66664#true} is VALID [2022-02-20 21:56:29,841 INFO L290 TraceCheckUtils]: 61: Hoare triple {66664#true} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {66664#true} is VALID [2022-02-20 21:56:29,841 INFO L290 TraceCheckUtils]: 62: Hoare triple {66664#true} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 2 == main_~tmp___0~6#1; {66664#true} is VALID [2022-02-20 21:56:29,841 INFO L290 TraceCheckUtils]: 63: Hoare triple {66664#true} assume main_#t~switch176#1; {66664#true} is VALID [2022-02-20 21:56:29,841 INFO L290 TraceCheckUtils]: 64: Hoare triple {66664#true} assume 0 != ~ldv_state_variable_2~0;assume -2147483648 <= main_#t~nondet187#1 && main_#t~nondet187#1 <= 2147483647;main_~tmp___3~0#1 := main_#t~nondet187#1;havoc main_#t~nondet187#1;main_#t~switch188#1 := 0 == main_~tmp___3~0#1; {66664#true} is VALID [2022-02-20 21:56:29,841 INFO L290 TraceCheckUtils]: 65: Hoare triple {66664#true} assume main_#t~switch188#1; {66664#true} is VALID [2022-02-20 21:56:29,841 INFO L290 TraceCheckUtils]: 66: Hoare triple {66664#true} assume 1 == ~ldv_state_variable_2~0; {66664#true} is VALID [2022-02-20 21:56:29,842 INFO L272 TraceCheckUtils]: 67: Hoare triple {66664#true} call main_#t~ret189#1 := cx82310_rx_fixup(~cx82310_info_group0~0.base, ~cx82310_info_group0~0.offset, ~cx82310_info_group2~0.base, ~cx82310_info_group2~0.offset); {66757#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5838)| abs_5838) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:29,842 INFO L290 TraceCheckUtils]: 68: Hoare triple {66757#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5838)| abs_5838) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~dev#1.base, ~dev#1.offset := #in~dev#1.base, #in~dev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;havoc ~len~0#1;havoc ~skb2~0#1.base, ~skb2~0#1.offset;havoc ~__len~1#1;havoc ~__ret~1#1.base, ~__ret~1#1.offset;havoc ~__len___0~1#1;havoc ~__ret___0~1#1.base, ~__ret___0~1#1.offset;havoc ~__len___1~0#1;havoc ~__ret___1~0#1.base, ~__ret___1~0#1.offset;havoc ~__len___2~0#1;havoc ~__ret___2~0#1.base, ~__ret___2~0#1.offset;call #t~mem111#1 := read~int(~dev#1.base, 460 + ~dev#1.offset, 8); {66664#true} is VALID [2022-02-20 21:56:29,843 INFO L290 TraceCheckUtils]: 69: Hoare triple {66664#true} assume !(0 != #t~mem111#1 % 18446744073709551616);havoc #t~mem111#1; {66664#true} is VALID [2022-02-20 21:56:29,843 INFO L290 TraceCheckUtils]: 70: Hoare triple {66664#true} call #t~mem160#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {66664#true} is VALID [2022-02-20 21:56:29,843 INFO L290 TraceCheckUtils]: 71: Hoare triple {66664#true} assume #t~mem160#1 % 4294967296 > 1;havoc #t~mem160#1; {66664#true} is VALID [2022-02-20 21:56:29,843 INFO L290 TraceCheckUtils]: 72: Hoare triple {66664#true} call #t~mem132#1.base, #t~mem132#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem133#1 := read~int(#t~mem132#1.base, #t~mem132#1.offset, 1);call #t~mem134#1.base, #t~mem134#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem135#1 := read~int(#t~mem134#1.base, 1 + #t~mem134#1.offset, 1);call #t~mem136#1.base, #t~mem136#1.offset := read~$Pointer$(~skb#1.base, 232 + ~skb#1.offset, 8);call #t~mem137#1 := read~int(#t~mem136#1.base, 1 + #t~mem136#1.offset, 1); {66664#true} is VALID [2022-02-20 21:56:29,843 INFO L290 TraceCheckUtils]: 73: Hoare triple {66664#true} assume (1 == #t~mem133#1 % 256 && (0 == 256 * (#t~mem135#1 % 256) || 1 == 256 * (#t~mem135#1 % 256))) || ((0 == #t~mem133#1 % 256 || 1 == #t~mem133#1 % 256) && 1 == 256 * (#t~mem135#1 % 256));~len~0#1 := 1; {66664#true} is VALID [2022-02-20 21:56:29,843 INFO L290 TraceCheckUtils]: 74: Hoare triple {66664#true} havoc #t~mem132#1.base, #t~mem132#1.offset;havoc #t~mem133#1;havoc #t~mem134#1.base, #t~mem134#1.offset;havoc #t~mem135#1;havoc #t~mem136#1.base, #t~mem136#1.offset;havoc #t~mem137#1; {66664#true} is VALID [2022-02-20 21:56:29,844 INFO L272 TraceCheckUtils]: 75: Hoare triple {66664#true} call #t~ret139#1.base, #t~ret139#1.offset := skb_pull(~skb#1.base, ~skb#1.offset, 2); {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,844 INFO L290 TraceCheckUtils]: 76: Hoare triple {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {66664#true} is VALID [2022-02-20 21:56:29,844 INFO L272 TraceCheckUtils]: 77: Hoare triple {66664#true} call #t~ret214.base, #t~ret214.offset := ldv_malloc(1); {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,844 INFO L290 TraceCheckUtils]: 78: Hoare triple {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___0~0 := #t~nondet30;havoc #t~nondet30; {66664#true} is VALID [2022-02-20 21:56:29,845 INFO L290 TraceCheckUtils]: 79: Hoare triple {66664#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,845 INFO L290 TraceCheckUtils]: 80: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,845 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {66664#true} {66664#true} #738#return; {66664#true} is VALID [2022-02-20 21:56:29,845 INFO L290 TraceCheckUtils]: 82: Hoare triple {66664#true} #res.base, #res.offset := #t~ret214.base, #t~ret214.offset;havoc #t~ret214.base, #t~ret214.offset; {66664#true} is VALID [2022-02-20 21:56:29,845 INFO L290 TraceCheckUtils]: 83: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,845 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {66664#true} {66664#true} #826#return; {66664#true} is VALID [2022-02-20 21:56:29,845 INFO L290 TraceCheckUtils]: 85: Hoare triple {66664#true} havoc #t~ret139#1.base, #t~ret139#1.offset;call #t~mem140#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4);#t~short142#1 := ~len~0#1 % 4294967296 == #t~mem140#1 % 4294967296; {66664#true} is VALID [2022-02-20 21:56:29,846 INFO L290 TraceCheckUtils]: 86: Hoare triple {66664#true} assume #t~short142#1; {66767#|cx82310_rx_fixup_#t~short142#1|} is VALID [2022-02-20 21:56:29,846 INFO L290 TraceCheckUtils]: 87: Hoare triple {66767#|cx82310_rx_fixup_#t~short142#1|} assume !#t~short142#1;havoc #t~mem140#1;havoc #t~mem141#1;havoc #t~short142#1; {66665#false} is VALID [2022-02-20 21:56:29,846 INFO L290 TraceCheckUtils]: 88: Hoare triple {66665#false} assume !(~len~0#1 > 1514);call #t~mem145#1 := read~int(~skb#1.base, 104 + ~skb#1.offset, 4); {66665#false} is VALID [2022-02-20 21:56:29,846 INFO L290 TraceCheckUtils]: 89: Hoare triple {66665#false} assume !(~len~0#1 % 4294967296 > #t~mem145#1 % 4294967296);havoc #t~mem145#1; {66665#false} is VALID [2022-02-20 21:56:29,846 INFO L272 TraceCheckUtils]: 90: Hoare triple {66665#false} call #t~ret154#1.base, #t~ret154#1.offset := ldv_alloc_skb_12(~len~0#1, 32); {66807#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:29,846 INFO L290 TraceCheckUtils]: 91: Hoare triple {66807#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~size := #in~size;~priority := #in~priority;havoc ~tmp~12.base, ~tmp~12.offset; {66664#true} is VALID [2022-02-20 21:56:29,847 INFO L272 TraceCheckUtils]: 92: Hoare triple {66664#true} call #t~ret196.base, #t~ret196.offset := ldv_skb_alloc(); {66807#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:56:29,847 INFO L290 TraceCheckUtils]: 93: Hoare triple {66807#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} havoc ~skb~0#1.base, ~skb~0#1.offset;havoc ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,848 INFO L272 TraceCheckUtils]: 94: Hoare triple {66664#true} call #t~ret205#1.base, #t~ret205#1.offset := ldv_zalloc(248); {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,848 INFO L290 TraceCheckUtils]: 95: Hoare triple {66755#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~2#1.base, ~tmp~2#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet32#1 && #t~nondet32#1 <= 2147483647;~tmp___0~1#1 := #t~nondet32#1;havoc #t~nondet32#1; {66664#true} is VALID [2022-02-20 21:56:29,848 INFO L290 TraceCheckUtils]: 96: Hoare triple {66664#true} assume !(0 != ~tmp___0~1#1);call #t~malloc33#1.base, #t~malloc33#1.offset := #Ultimate.allocOnHeap(~size#1);assume { :begin_inline_#Ultimate.meminit } true;#Ultimate.meminit_#ptr#1.base, #Ultimate.meminit_#ptr#1.offset, #Ultimate.meminit_#amountOfFields#1, #Ultimate.meminit_#sizeOfFields#1, #Ultimate.meminit_#product#1 := #t~malloc33#1.base, #t~malloc33#1.offset, 1, ~size#1, ~size#1;#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #Ultimate.meminit_#ptr#1.base); {66664#true} is VALID [2022-02-20 21:56:29,848 INFO L290 TraceCheckUtils]: 97: Hoare triple {66664#true} assume { :end_inline_#Ultimate.meminit } true;~tmp~2#1.base, ~tmp~2#1.offset := #t~malloc33#1.base, #t~malloc33#1.offset;~p~1#1.base, ~p~1#1.offset := ~tmp~2#1.base, ~tmp~2#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,848 INFO L272 TraceCheckUtils]: 98: Hoare triple {66664#true} call assume_abort_if_not((if 0 != (~p~1#1.base + ~p~1#1.offset) % 18446744073709551616 then 1 else 0)); {66664#true} is VALID [2022-02-20 21:56:29,848 INFO L290 TraceCheckUtils]: 99: Hoare triple {66664#true} ~cond := #in~cond; {66664#true} is VALID [2022-02-20 21:56:29,848 INFO L290 TraceCheckUtils]: 100: Hoare triple {66664#true} assume !(0 == ~cond); {66664#true} is VALID [2022-02-20 21:56:29,848 INFO L290 TraceCheckUtils]: 101: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,849 INFO L284 TraceCheckUtils]: 102: Hoare quadruple {66664#true} {66664#true} #764#return; {66664#true} is VALID [2022-02-20 21:56:29,849 INFO L290 TraceCheckUtils]: 103: Hoare triple {66664#true} #res#1.base, #res#1.offset := ~p~1#1.base, ~p~1#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,849 INFO L290 TraceCheckUtils]: 104: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,849 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {66664#true} {66664#true} #736#return; {66664#true} is VALID [2022-02-20 21:56:29,849 INFO L290 TraceCheckUtils]: 106: Hoare triple {66664#true} ~tmp___7~1#1.base, ~tmp___7~1#1.offset := #t~ret205#1.base, #t~ret205#1.offset;havoc #t~ret205#1.base, #t~ret205#1.offset;~skb~0#1.base, ~skb~0#1.offset := ~tmp___7~1#1.base, ~tmp___7~1#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,849 INFO L290 TraceCheckUtils]: 107: Hoare triple {66664#true} assume !(~skb~0#1.base == 0 && ~skb~0#1.offset == 0);assume { :begin_inline_ldv_set_add } true;ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset, ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb~0#1.base, ~skb~0#1.offset;havoc ldv_set_add_#t~mem200#1.base, ldv_set_add_#t~mem200#1.offset, ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset, ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ldv_set_add_~i~0#1;ldv_set_add_~set#1.base, ldv_set_add_~set#1.offset := ldv_set_add_#in~set#1.base, ldv_set_add_#in~set#1.offset;ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset := ldv_set_add_#in~e#1.base, ldv_set_add_#in~e#1.offset;havoc ldv_set_add_~i~0#1;ldv_set_add_~i~0#1 := 0; {66664#true} is VALID [2022-02-20 21:56:29,849 INFO L290 TraceCheckUtils]: 108: Hoare triple {66664#true} assume !false; {66664#true} is VALID [2022-02-20 21:56:29,849 INFO L290 TraceCheckUtils]: 109: Hoare triple {66664#true} assume !(ldv_set_add_~i~0#1 < ~last_index~0); {66664#true} is VALID [2022-02-20 21:56:29,850 INFO L290 TraceCheckUtils]: 110: Hoare triple {66664#true} assume ~last_index~0 < 15;call write~$Pointer$(ldv_set_add_~e#1.base, ldv_set_add_~e#1.offset, ~#set_impl~0.base, ~#set_impl~0.offset + 8 * ~last_index~0, 8);~last_index~0 := 1 + ~last_index~0; {66664#true} is VALID [2022-02-20 21:56:29,850 INFO L290 TraceCheckUtils]: 111: Hoare triple {66664#true} assume { :end_inline_ldv_set_add } true;#res#1.base, #res#1.offset := ~skb~0#1.base, ~skb~0#1.offset; {66664#true} is VALID [2022-02-20 21:56:29,850 INFO L290 TraceCheckUtils]: 112: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,850 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {66664#true} {66664#true} #842#return; {66664#true} is VALID [2022-02-20 21:56:29,850 INFO L290 TraceCheckUtils]: 114: Hoare triple {66664#true} ~tmp~12.base, ~tmp~12.offset := #t~ret196.base, #t~ret196.offset;havoc #t~ret196.base, #t~ret196.offset; {66664#true} is VALID [2022-02-20 21:56:29,850 INFO L290 TraceCheckUtils]: 115: Hoare triple {66664#true} assume ~tmp~12.base != 0 || ~tmp~12.offset != 0; {66664#true} is VALID [2022-02-20 21:56:29,851 INFO L272 TraceCheckUtils]: 116: Hoare triple {66664#true} call #t~ret197.base, #t~ret197.offset := ldv_malloc(~size % 4294967296); {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:56:29,851 INFO L290 TraceCheckUtils]: 117: Hoare triple {66802#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~1.base, ~tmp~1.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647;~tmp___0~0 := #t~nondet30;havoc #t~nondet30; {66664#true} is VALID [2022-02-20 21:56:29,851 INFO L290 TraceCheckUtils]: 118: Hoare triple {66664#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {66664#true} is VALID [2022-02-20 21:56:29,851 INFO L290 TraceCheckUtils]: 119: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,851 INFO L284 TraceCheckUtils]: 120: Hoare quadruple {66664#true} {66664#true} #844#return; {66664#true} is VALID [2022-02-20 21:56:29,851 INFO L290 TraceCheckUtils]: 121: Hoare triple {66664#true} call write~$Pointer$(#t~ret197.base, #t~ret197.offset, ~tmp~12.base, 224 + ~tmp~12.offset, 8);havoc #t~ret197.base, #t~ret197.offset;call #t~mem198.base, #t~mem198.offset := read~$Pointer$(~tmp~12.base, 224 + ~tmp~12.offset, 8);call write~$Pointer$(#t~mem198.base, #t~mem198.offset, ~tmp~12.base, 232 + ~tmp~12.offset, 8);havoc #t~mem198.base, #t~mem198.offset; {66664#true} is VALID [2022-02-20 21:56:29,851 INFO L290 TraceCheckUtils]: 122: Hoare triple {66664#true} #res.base, #res.offset := ~tmp~12.base, ~tmp~12.offset; {66664#true} is VALID [2022-02-20 21:56:29,852 INFO L290 TraceCheckUtils]: 123: Hoare triple {66664#true} assume true; {66664#true} is VALID [2022-02-20 21:56:29,852 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {66664#true} {66665#false} #832#return; {66665#false} is VALID [2022-02-20 21:56:29,852 INFO L290 TraceCheckUtils]: 125: Hoare triple {66665#false} ~skb2~0#1.base, ~skb2~0#1.offset := #t~ret154#1.base, #t~ret154#1.offset;havoc #t~ret154#1.base, #t~ret154#1.offset; {66665#false} is VALID [2022-02-20 21:56:29,852 INFO L290 TraceCheckUtils]: 126: Hoare triple {66665#false} assume 0 == (~skb2~0#1.base + ~skb2~0#1.offset) % 18446744073709551616;#res#1 := 0; {66665#false} is VALID [2022-02-20 21:56:29,852 INFO L290 TraceCheckUtils]: 127: Hoare triple {66665#false} assume true; {66665#false} is VALID [2022-02-20 21:56:29,852 INFO L284 TraceCheckUtils]: 128: Hoare quadruple {66665#false} {66664#true} #788#return; {66665#false} is VALID [2022-02-20 21:56:29,852 INFO L290 TraceCheckUtils]: 129: Hoare triple {66665#false} assume -2147483648 <= main_#t~ret189#1 && main_#t~ret189#1 <= 2147483647;havoc main_#t~ret189#1;~ldv_state_variable_2~0 := 1; {66665#false} is VALID [2022-02-20 21:56:29,852 INFO L290 TraceCheckUtils]: 130: Hoare triple {66665#false} assume !(2 == ~ldv_state_variable_2~0); {66665#false} is VALID [2022-02-20 21:56:29,853 INFO L290 TraceCheckUtils]: 131: Hoare triple {66665#false} assume -2147483648 <= main_#t~nondet175#1 && main_#t~nondet175#1 <= 2147483647;main_~tmp___0~6#1 := main_#t~nondet175#1;havoc main_#t~nondet175#1;main_#t~switch176#1 := 0 == main_~tmp___0~6#1; {66665#false} is VALID [2022-02-20 21:56:29,853 INFO L290 TraceCheckUtils]: 132: Hoare triple {66665#false} assume !main_#t~switch176#1;main_#t~switch176#1 := main_#t~switch176#1 || 1 == main_~tmp___0~6#1; {66665#false} is VALID [2022-02-20 21:56:29,853 INFO L290 TraceCheckUtils]: 133: Hoare triple {66665#false} assume main_#t~switch176#1; {66665#false} is VALID [2022-02-20 21:56:29,853 INFO L290 TraceCheckUtils]: 134: Hoare triple {66665#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet184#1 && main_#t~nondet184#1 <= 2147483647;main_~tmp___2~1#1 := main_#t~nondet184#1;havoc main_#t~nondet184#1;main_#t~switch185#1 := 0 == main_~tmp___2~1#1; {66665#false} is VALID [2022-02-20 21:56:29,853 INFO L290 TraceCheckUtils]: 135: Hoare triple {66665#false} assume main_#t~switch185#1; {66665#false} is VALID [2022-02-20 21:56:29,853 INFO L290 TraceCheckUtils]: 136: Hoare triple {66665#false} assume 3 == ~ldv_state_variable_0~0 && 0 == ~ref_cnt~0;assume { :begin_inline_cx82310_driver_exit } true;assume { :begin_inline_ldv_usb_deregister_15 } true;ldv_usb_deregister_15_#in~arg#1.base, ldv_usb_deregister_15_#in~arg#1.offset := ~#cx82310_driver~0.base, ~#cx82310_driver~0.offset;havoc ldv_usb_deregister_15_~arg#1.base, ldv_usb_deregister_15_~arg#1.offset;ldv_usb_deregister_15_~arg#1.base, ldv_usb_deregister_15_~arg#1.offset := ldv_usb_deregister_15_#in~arg#1.base, ldv_usb_deregister_15_#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_15_~arg#1.base, ldv_usb_deregister_15_~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; {66665#false} is VALID [2022-02-20 21:56:29,853 INFO L290 TraceCheckUtils]: 137: Hoare triple {66665#false} assume { :end_inline_usb_deregister } true;~ldv_state_variable_1~0 := 0; {66665#false} is VALID [2022-02-20 21:56:29,853 INFO L290 TraceCheckUtils]: 138: Hoare triple {66665#false} assume { :end_inline_ldv_usb_deregister_15 } true; {66665#false} is VALID [2022-02-20 21:56:29,853 INFO L290 TraceCheckUtils]: 139: Hoare triple {66665#false} assume { :end_inline_cx82310_driver_exit } true;~ldv_state_variable_0~0 := 2; {66665#false} is VALID [2022-02-20 21:56:29,854 INFO L290 TraceCheckUtils]: 140: Hoare triple {66665#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret209#1, ldv_check_final_state_~tmp___7~5#1;havoc ldv_check_final_state_~tmp___7~5#1;assume { :begin_inline_ldv_set_is_empty } true;ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset := ~LDV_SKBS~0.base, ~LDV_SKBS~0.offset;havoc ldv_set_is_empty_#res#1;havoc ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset;ldv_set_is_empty_~set#1.base, ldv_set_is_empty_~set#1.offset := ldv_set_is_empty_#in~set#1.base, ldv_set_is_empty_#in~set#1.offset;ldv_set_is_empty_#res#1 := (if 0 == ~last_index~0 then 1 else 0); {66665#false} is VALID [2022-02-20 21:56:29,854 INFO L290 TraceCheckUtils]: 141: Hoare triple {66665#false} ldv_check_final_state_#t~ret209#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret209#1 && ldv_check_final_state_#t~ret209#1 <= 2147483647;ldv_check_final_state_~tmp___7~5#1 := ldv_check_final_state_#t~ret209#1;havoc ldv_check_final_state_#t~ret209#1; {66665#false} is VALID [2022-02-20 21:56:29,854 INFO L290 TraceCheckUtils]: 142: Hoare triple {66665#false} assume !(0 != ldv_check_final_state_~tmp___7~5#1); {66665#false} is VALID [2022-02-20 21:56:29,854 INFO L272 TraceCheckUtils]: 143: Hoare triple {66665#false} call ldv_error(); {66665#false} is VALID [2022-02-20 21:56:29,854 INFO L290 TraceCheckUtils]: 144: Hoare triple {66665#false} assume !false; {66665#false} is VALID [2022-02-20 21:56:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-02-20 21:56:29,855 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:56:29,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175907378] [2022-02-20 21:56:29,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175907378] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:56:29,855 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:56:29,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 21:56:29,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339385193] [2022-02-20 21:56:29,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:56:29,856 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 145 [2022-02-20 21:56:29,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:56:29,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 11.5) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-02-20 21:56:29,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:56:29,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 21:56:29,958 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:56:29,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 21:56:29,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-20 21:56:29,959 INFO L87 Difference]: Start difference. First operand 2412 states and 3439 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15)