./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--phy--dp83640.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--phy--dp83640.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 6985379bcc34be713545a774d70e5414e9690ba41356ad39bb00629a60c9ae14 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:54:40,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:54:40,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:54:40,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:54:40,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:54:40,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:54:40,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:54:40,277 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:54:40,279 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:54:40,283 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:54:40,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:54:40,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:54:40,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:54:40,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:54:40,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:54:40,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:54:40,291 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:54:40,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:54:40,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:54:40,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:54:40,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:54:40,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:54:40,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:54:40,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:54:40,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:54:40,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:54:40,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:54:40,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:54:40,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:54:40,307 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:54:40,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:54:40,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:54:40,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:54:40,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:54:40,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:54:40,311 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:54:40,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:54:40,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:54:40,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:54:40,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:54:40,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:54:40,314 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:54:40,343 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:54:40,344 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:54:40,344 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:54:40,344 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:54:40,345 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:54:40,345 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:54:40,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:54:40,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:54:40,346 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:54:40,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:54:40,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:54:40,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:54:40,347 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:54:40,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:54:40,347 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:54:40,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:54:40,347 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:54:40,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:54:40,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:54:40,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:54:40,348 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:54:40,348 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:54:40,348 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:54:40,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:54:40,349 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:54:40,349 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:54:40,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:54:40,350 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:54:40,350 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:54:40,350 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:54:40,350 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 -> 6985379bcc34be713545a774d70e5414e9690ba41356ad39bb00629a60c9ae14 [2022-02-20 21:54:40,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:54:40,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:54:40,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:54:40,597 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:54:40,598 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:54:40,600 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--phy--dp83640.ko-entry_point.cil.out.i [2022-02-20 21:54:40,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c8b8b95/4881b629352442018c988e450107c7cb/FLAG5e7fccc96 [2022-02-20 21:54:41,231 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:54:41,231 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--phy--dp83640.ko-entry_point.cil.out.i [2022-02-20 21:54:41,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c8b8b95/4881b629352442018c988e450107c7cb/FLAG5e7fccc96 [2022-02-20 21:54:41,440 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c8b8b95/4881b629352442018c988e450107c7cb [2022-02-20 21:54:41,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:54:41,444 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:54:41,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:54:41,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:54:41,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:54:41,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:54:41" (1/1) ... [2022-02-20 21:54:41,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@abf09e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:41, skipping insertion in model container [2022-02-20 21:54:41,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:54:41" (1/1) ... [2022-02-20 21:54:41,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:54:41,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:54:42,100 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--phy--dp83640.ko-entry_point.cil.out.i[160997,161010] [2022-02-20 21:54:42,463 WARN L611 FunctionHandler]: implicit declaration of function ldv_xmalloc [2022-02-20 21:54:42,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:54:42,479 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:54:42,573 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--phy--dp83640.ko-entry_point.cil.out.i[160997,161010] [2022-02-20 21:54:42,694 WARN L611 FunctionHandler]: implicit declaration of function ldv_xmalloc [2022-02-20 21:54:42,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:54:42,732 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:54:42,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:42 WrapperNode [2022-02-20 21:54:42,733 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:54:42,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:54:42,734 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:54:42,734 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:54:42,738 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:54:42" (1/1) ... [2022-02-20 21:54:42,802 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:54:42" (1/1) ... [2022-02-20 21:54:42,893 INFO L137 Inliner]: procedures = 184, calls = 840, calls flagged for inlining = 74, calls inlined = 63, statements flattened = 2136 [2022-02-20 21:54:42,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:54:42,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:54:42,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:54:42,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:54:42,900 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:42" (1/1) ... [2022-02-20 21:54:42,900 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:42" (1/1) ... [2022-02-20 21:54:42,916 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:42" (1/1) ... [2022-02-20 21:54:42,917 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:42" (1/1) ... [2022-02-20 21:54:43,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:42" (1/1) ... [2022-02-20 21:54:43,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:42" (1/1) ... [2022-02-20 21:54:43,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:42" (1/1) ... [2022-02-20 21:54:43,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:54:43,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:54:43,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:54:43,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:54:43,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:42" (1/1) ... [2022-02-20 21:54:43,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:54:43,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:54:43,091 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:54:43,098 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:54:43,123 INFO L130 BoogieDeclarations]: Found specification of procedure broadcast_write [2022-02-20 21:54:43,124 INFO L138 BoogieDeclarations]: Found implementation of procedure broadcast_write [2022-02-20 21:54:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-02-20 21:54:43,124 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-02-20 21:54:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure genphy_config_aneg [2022-02-20 21:54:43,124 INFO L138 BoogieDeclarations]: Found implementation of procedure genphy_config_aneg [2022-02-20 21:54:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-02-20 21:54:43,124 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-02-20 21:54:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_clock_put [2022-02-20 21:54:43,125 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_clock_put [2022-02-20 21:54:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 21:54:43,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 21:54:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:54:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_head_init [2022-02-20 21:54:43,125 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_head_init [2022-02-20 21:54:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure phy2txts [2022-02-20 21:54:43,125 INFO L138 BoogieDeclarations]: Found implementation of procedure phy2txts [2022-02-20 21:54:43,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-02-20 21:54:43,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-02-20 21:54:43,126 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_ts_info [2022-02-20 21:54:43,126 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_ts_info [2022-02-20 21:54:43,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:54:43,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:54:43,126 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_destroy [2022-02-20 21:54:43,126 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_destroy [2022-02-20 21:54:43,126 INFO L130 BoogieDeclarations]: Found specification of procedure mdiobus_write [2022-02-20 21:54:43,126 INFO L138 BoogieDeclarations]: Found implementation of procedure mdiobus_write [2022-02-20 21:54:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_config_intr [2022-02-20 21:54:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_config_intr [2022-02-20 21:54:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure tdr_write [2022-02-20 21:54:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure tdr_write [2022-02-20 21:54:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-02-20 21:54:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-02-20 21:54:43,127 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:54:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:54:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure exts_chan_to_edata [2022-02-20 21:54:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure exts_chan_to_edata [2022-02-20 21:54:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure skb_complete_tx_timestamp [2022-02-20 21:54:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_complete_tx_timestamp [2022-02-20 21:54:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure list_del_init [2022-02-20 21:54:43,128 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del_init [2022-02-20 21:54:43,128 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-02-20 21:54:43,129 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-02-20 21:54:43,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:54:43,129 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-02-20 21:54:43,129 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-02-20 21:54:43,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:54:43,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:54:43,129 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_rxtstamp [2022-02-20 21:54:43,130 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_rxtstamp [2022-02-20 21:54:43,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-02-20 21:54:43,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-02-20 21:54:43,130 INFO L130 BoogieDeclarations]: Found specification of procedure phy_read [2022-02-20 21:54:43,130 INFO L138 BoogieDeclarations]: Found implementation of procedure phy_read [2022-02-20 21:54:43,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 21:54:43,131 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 21:54:43,131 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 21:54:43,131 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 21:54:43,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:54:43,132 INFO L130 BoogieDeclarations]: Found specification of procedure prune_rx_ts [2022-02-20 21:54:43,132 INFO L138 BoogieDeclarations]: Found implementation of procedure prune_rx_ts [2022-02-20 21:54:43,132 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-02-20 21:54:43,132 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-02-20 21:54:43,132 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-02-20 21:54:43,132 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-02-20 21:54:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:54:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_config_init [2022-02-20 21:54:43,133 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_config_init [2022-02-20 21:54:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:54:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:54:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-02-20 21:54:43,133 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-02-20 21:54:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-02-20 21:54:43,133 INFO L130 BoogieDeclarations]: Found specification of procedure ns_to_ktime [2022-02-20 21:54:43,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ns_to_ktime [2022-02-20 21:54:43,134 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-02-20 21:54:43,134 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-02-20 21:54:43,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:54:43,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-02-20 21:54:43,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-02-20 21:54:43,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-02-20 21:54:43,134 INFO L130 BoogieDeclarations]: Found specification of procedure skb_end_pointer [2022-02-20 21:54:43,134 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_end_pointer [2022-02-20 21:54:43,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-02-20 21:54:43,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-02-20 21:54:43,135 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-02-20 21:54:43,135 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-02-20 21:54:43,135 INFO L130 BoogieDeclarations]: Found specification of procedure enable_status_frames [2022-02-20 21:54:43,135 INFO L138 BoogieDeclarations]: Found implementation of procedure enable_status_frames [2022-02-20 21:54:43,135 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_hwtstamp [2022-02-20 21:54:43,135 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_hwtstamp [2022-02-20 21:54:43,135 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-02-20 21:54:43,135 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-02-20 21:54:43,136 INFO L130 BoogieDeclarations]: Found specification of procedure phy_write [2022-02-20 21:54:43,136 INFO L138 BoogieDeclarations]: Found implementation of procedure phy_write [2022-02-20 21:54:43,136 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_work [2022-02-20 21:54:43,136 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_work [2022-02-20 21:54:43,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:54:43,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:54:43,136 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2022-02-20 21:54:43,136 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2022-02-20 21:54:43,136 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-02-20 21:54:43,137 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-02-20 21:54:43,137 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_clock_get [2022-02-20 21:54:43,137 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_clock_get [2022-02-20 21:54:43,137 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_ack_interrupt [2022-02-20 21:54:43,137 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_ack_interrupt [2022-02-20 21:54:43,137 INFO L130 BoogieDeclarations]: Found specification of procedure ext_read [2022-02-20 21:54:43,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ext_read [2022-02-20 21:54:43,137 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-02-20 21:54:43,137 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-02-20 21:54:43,138 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-02-20 21:54:43,138 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-02-20 21:54:43,138 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-02-20 21:54:43,138 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-02-20 21:54:43,138 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-02-20 21:54:43,138 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-02-20 21:54:43,138 INFO L130 BoogieDeclarations]: Found specification of procedure skb_mac_header [2022-02-20 21:54:43,138 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_mac_header [2022-02-20 21:54:43,138 INFO L130 BoogieDeclarations]: Found specification of procedure dp83640_txtstamp [2022-02-20 21:54:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure dp83640_txtstamp [2022-02-20 21:54:43,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:54:43,139 INFO L130 BoogieDeclarations]: Found specification of procedure enable_broadcast [2022-02-20 21:54:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure enable_broadcast [2022-02-20 21:54:43,139 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 21:54:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 21:54:43,139 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-02-20 21:54:43,139 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-02-20 21:54:43,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:54:43,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:54:43,140 INFO L130 BoogieDeclarations]: Found specification of procedure ns_to_timespec [2022-02-20 21:54:43,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ns_to_timespec [2022-02-20 21:54:43,140 INFO L130 BoogieDeclarations]: Found specification of procedure ext_write [2022-02-20 21:54:43,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ext_write [2022-02-20 21:54:43,140 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-02-20 21:54:43,140 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-02-20 21:54:43,498 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:54:43,499 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:54:44,075 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 21:54:45,546 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:54:45,565 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:54:45,566 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 21:54:45,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:54:45 BoogieIcfgContainer [2022-02-20 21:54:45,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:54:45,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:54:45,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:54:45,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:54:45,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:54:41" (1/3) ... [2022-02-20 21:54:45,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527b11ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:54:45, skipping insertion in model container [2022-02-20 21:54:45,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:54:42" (2/3) ... [2022-02-20 21:54:45,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527b11ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:54:45, skipping insertion in model container [2022-02-20 21:54:45,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:54:45" (3/3) ... [2022-02-20 21:54:45,574 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--phy--dp83640.ko-entry_point.cil.out.i [2022-02-20 21:54:45,578 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:54:45,579 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:54:45,622 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:54:45,630 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:54:45,630 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:54:45,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 883 states, 628 states have (on average 1.3678343949044587) internal successors, (859), 645 states have internal predecessors, (859), 193 states have call successors, (193), 61 states have call predecessors, (193), 60 states have return successors, (190), 189 states have call predecessors, (190), 190 states have call successors, (190) [2022-02-20 21:54:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 21:54:45,676 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:54:45,677 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] [2022-02-20 21:54:45,677 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:54:45,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:54:45,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1822953326, now seen corresponding path program 1 times [2022-02-20 21:54:45,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:54:45,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846459447] [2022-02-20 21:54:45,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:54:45,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:54:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:46,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:54:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:46,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {899#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {886#true} is VALID [2022-02-20 21:54:46,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {886#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {886#true} is VALID [2022-02-20 21:54:46,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {886#true} assume true; {886#true} is VALID [2022-02-20 21:54:46,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {886#true} {886#true} #2187#return; {886#true} is VALID [2022-02-20 21:54:46,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:54:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:54:46,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {899#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {886#true} is VALID [2022-02-20 21:54:46,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {886#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {886#true} is VALID [2022-02-20 21:54:46,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {886#true} assume true; {886#true} is VALID [2022-02-20 21:54:46,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {886#true} {886#true} #2189#return; {886#true} is VALID [2022-02-20 21:54:46,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {886#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(102, 2);call #Ultimate.allocInit(22, 3);call #Ultimate.allocInit(7, 4);call write~init~int(71, 4, 0, 1);call write~init~int(80, 4, 1, 1);call write~init~int(73, 4, 2, 1);call write~init~int(79, 4, 3, 1);call write~init~int(37, 4, 4, 1);call write~init~int(100, 4, 5, 1);call write~init~int(0, 4, 6, 1);call #Ultimate.allocInit(40, 5);call #Ultimate.allocInit(29, 6);call #Ultimate.allocInit(19, 7);call #Ultimate.allocInit(50, 8);call #Ultimate.allocInit(36, 9);call #Ultimate.allocInit(39, 10);call #Ultimate.allocInit(35, 11);call #Ultimate.allocInit(35, 12);call #Ultimate.allocInit(35, 13);call #Ultimate.allocInit(35, 14);call #Ultimate.allocInit(41, 15);call #Ultimate.allocInit(8, 16);call #Ultimate.allocInit(12, 17);call #Ultimate.allocInit(222, 18);call #Ultimate.allocInit(28, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(8, 21);call #Ultimate.allocInit(12, 22);call #Ultimate.allocInit(222, 23);call #Ultimate.allocInit(35, 24);call #Ultimate.allocInit(44, 25);call #Ultimate.allocInit(46, 26);call #Ultimate.allocInit(20, 27);call #Ultimate.allocInit(19, 28);call #Ultimate.allocInit(14, 29);call #Ultimate.allocInit(20, 30);call #Ultimate.allocInit(28, 31);call #Ultimate.allocInit(16, 32);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~dp83640_driver_group0~0.base, ~dp83640_driver_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~dp83640_driver_group1~0.base, ~dp83640_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~chosen_phy~0 := -1;~#gpio_tab~0.base, ~#gpio_tab~0.offset := 33, 0;call #Ultimate.allocInit(16, 33);call write~init~int(1, ~#gpio_tab~0.base, ~#gpio_tab~0.offset, 2);call write~init~int(2, ~#gpio_tab~0.base, 2 + ~#gpio_tab~0.offset, 2);call write~init~int(3, ~#gpio_tab~0.base, 4 + ~#gpio_tab~0.offset, 2);call write~init~int(4, ~#gpio_tab~0.base, 6 + ~#gpio_tab~0.offset, 2);call write~init~int(8, ~#gpio_tab~0.base, 8 + ~#gpio_tab~0.offset, 2);call write~init~int(9, ~#gpio_tab~0.base, 10 + ~#gpio_tab~0.offset, 2);call write~init~int(10, ~#gpio_tab~0.base, 12 + ~#gpio_tab~0.offset, 2);call write~init~int(11, ~#gpio_tab~0.base, 14 + ~#gpio_tab~0.offset, 2);~#phyter_clocks~0.base, ~#phyter_clocks~0.offset := 34, 0;call #Ultimate.allocInit(16, 34);call write~init~$Pointer$(~#phyter_clocks~0.base, ~#phyter_clocks~0.offset, ~#phyter_clocks~0.base, ~#phyter_clocks~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks~0.base, ~#phyter_clocks~0.offset, ~#phyter_clocks~0.base, 8 + ~#phyter_clocks~0.offset, 8);~#phyter_clocks_lock~0.base, ~#phyter_clocks_lock~0.offset := 35, 0;call #Ultimate.allocInit(156, 35);call write~init~int(1, ~#phyter_clocks_lock~0.base, ~#phyter_clocks_lock~0.offset, 4);call write~init~int(0, ~#phyter_clocks_lock~0.base, 4 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(3735899821, ~#phyter_clocks_lock~0.base, 8 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(4294967295, ~#phyter_clocks_lock~0.base, 12 + ~#phyter_clocks_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#phyter_clocks_lock~0.base, 16 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 24 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 32 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 40 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#phyter_clocks_lock~0.base, 48 + ~#phyter_clocks_lock~0.offset, 8);call write~init~int(0, ~#phyter_clocks_lock~0.base, 56 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(0, ~#phyter_clocks_lock~0.base, 60 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks_lock~0.base, 72 + ~#phyter_clocks_lock~0.offset, ~#phyter_clocks_lock~0.base, 72 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks_lock~0.base, 72 + ~#phyter_clocks_lock~0.offset, ~#phyter_clocks_lock~0.base, 80 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 88 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 96 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks_lock~0.base, ~#phyter_clocks_lock~0.offset, ~#phyter_clocks_lock~0.base, 104 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 112 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 120 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 128 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#phyter_clocks_lock~0.base, 136 + ~#phyter_clocks_lock~0.offset, 8);call write~init~int(0, ~#phyter_clocks_lock~0.base, 144 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(0, ~#phyter_clocks_lock~0.base, 148 + ~#phyter_clocks_lock~0.offset, 8);~#status_frame_dst~0.base, ~#status_frame_dst~0.offset := 36, 0;call #Ultimate.allocInit(6, 36);call write~init~int(1, ~#status_frame_dst~0.base, ~#status_frame_dst~0.offset, 1);call write~init~int(27, ~#status_frame_dst~0.base, 1 + ~#status_frame_dst~0.offset, 1);call write~init~int(25, ~#status_frame_dst~0.base, 2 + ~#status_frame_dst~0.offset, 1);call write~init~int(0, ~#status_frame_dst~0.base, 3 + ~#status_frame_dst~0.offset, 1);call write~init~int(0, ~#status_frame_dst~0.base, 4 + ~#status_frame_dst~0.offset, 1);call write~init~int(0, ~#status_frame_dst~0.base, 5 + ~#status_frame_dst~0.offset, 1);~#status_frame_src~0.base, ~#status_frame_src~0.offset := 37, 0;call #Ultimate.allocInit(6, 37);call write~init~int(8, ~#status_frame_src~0.base, ~#status_frame_src~0.offset, 1);call write~init~int(0, ~#status_frame_src~0.base, 1 + ~#status_frame_src~0.offset, 1);call write~init~int(23, ~#status_frame_src~0.base, 2 + ~#status_frame_src~0.offset, 1);call write~init~int(11, ~#status_frame_src~0.base, 3 + ~#status_frame_src~0.offset, 1);call write~init~int(107, ~#status_frame_src~0.base, 4 + ~#status_frame_src~0.offset, 1);call write~init~int(15, ~#status_frame_src~0.base, 5 + ~#status_frame_src~0.offset, 1);~#dp83640_driver~0.base, ~#dp83640_driver~0.offset := 38, 0;call #Ultimate.allocInit(289, 38);call write~init~int(536894689, ~#dp83640_driver~0.base, ~#dp83640_driver~0.offset, 4);call write~init~$Pointer$(32, 0, ~#dp83640_driver~0.base, 4 + ~#dp83640_driver~0.offset, 8);call write~init~int(4294967280, ~#dp83640_driver~0.base, 12 + ~#dp83640_driver~0.offset, 4);call write~init~int(719, ~#dp83640_driver~0.base, 16 + ~#dp83640_driver~0.offset, 4);call write~init~int(1, ~#dp83640_driver~0.base, 20 + ~#dp83640_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 24 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_config_init.base, #funAddr~dp83640_config_init.offset, ~#dp83640_driver~0.base, 32 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_probe.base, #funAddr~dp83640_probe.offset, ~#dp83640_driver~0.base, 40 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 48 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 56 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~genphy_config_aneg.base, #funAddr~genphy_config_aneg.offset, ~#dp83640_driver~0.base, 64 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 72 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~genphy_read_status.base, #funAddr~genphy_read_status.offset, ~#dp83640_driver~0.base, 80 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_ack_interrupt.base, #funAddr~dp83640_ack_interrupt.offset, ~#dp83640_driver~0.base, 88 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_config_intr.base, #funAddr~dp83640_config_intr.offset, ~#dp83640_driver~0.base, 96 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 104 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_remove.base, #funAddr~dp83640_remove.offset, ~#dp83640_driver~0.base, 112 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 120 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_ts_info.base, #funAddr~dp83640_ts_info.offset, ~#dp83640_driver~0.base, 128 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_hwtstamp.base, #funAddr~dp83640_hwtstamp.offset, ~#dp83640_driver~0.base, 136 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_rxtstamp.base, #funAddr~dp83640_rxtstamp.offset, ~#dp83640_driver~0.base, 144 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_txtstamp.base, #funAddr~dp83640_txtstamp.offset, ~#dp83640_driver~0.base, 152 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 160 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 168 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 176 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 184 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#dp83640_driver~0.base, 192 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 200 + ~#dp83640_driver~0.offset, 8);call write~init~int(0, ~#dp83640_driver~0.base, 208 + ~#dp83640_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 209 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 217 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 225 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 233 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 241 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 249 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 257 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 265 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 273 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 281 + ~#dp83640_driver~0.offset, 8);~__mod_mdio__dp83640_tbl_device_table~0.phy_id := 0;~__mod_mdio__dp83640_tbl_device_table~0.phy_id_mask := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 39, 0;call #Ultimate.allocInit(120, 39);#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; {886#true} is VALID [2022-02-20 21:54:46,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {886#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet457#1, main_#t~ret458#1.base, main_#t~ret458#1.offset, main_#t~ret459#1.base, main_#t~ret459#1.offset, main_#t~nondet460#1, main_#t~nondet461#1, main_#t~switch462#1, main_#t~nondet463#1, main_#t~switch464#1, main_#t~ret465#1, main_#t~ret466#1, main_#t~ret467#1, main_#t~ret468#1, main_#t~ret469#1, main_#t~ret470#1, main_#t~ret471#1, main_#t~ret472#1, main_#t~ret473#1, main_#t~ret474#1, main_#t~ret475#1, main_#t~ret476#1, main_#t~ret477#1, main_#t~ret478#1, main_#t~ret479#1, main_#t~ret480#1, main_#t~nondet481#1, main_#t~switch482#1, main_#t~ret483#1, main_~ldvarg1~0#1, main_~tmp~41#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset, main_~ldvarg2~0#1, main_~tmp___2~6#1, main_~tmp___3~1#1, main_~tmp___4~1#1, main_~tmp___5~1#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~41#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset;havoc main_~ldvarg2~0#1;havoc main_~tmp___2~6#1;havoc main_~tmp___3~1#1;havoc main_~tmp___4~1#1;havoc main_~tmp___5~1#1;assume -2147483648 <= main_#t~nondet457#1 && main_#t~nondet457#1 <= 2147483647;main_~tmp~41#1 := main_#t~nondet457#1;havoc main_#t~nondet457#1;main_~ldvarg1~0#1 := main_~tmp~41#1; {886#true} is VALID [2022-02-20 21:54:46,071 INFO L272 TraceCheckUtils]: 2: Hoare triple {886#true} call main_#t~ret458#1.base, main_#t~ret458#1.offset := ldv_zalloc(40); {899#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:46,071 INFO L290 TraceCheckUtils]: 3: Hoare triple {899#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {886#true} is VALID [2022-02-20 21:54:46,071 INFO L290 TraceCheckUtils]: 4: Hoare triple {886#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {886#true} is VALID [2022-02-20 21:54:46,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {886#true} assume true; {886#true} is VALID [2022-02-20 21:54:46,071 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {886#true} {886#true} #2187#return; {886#true} is VALID [2022-02-20 21:54:46,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {886#true} main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset := main_#t~ret458#1.base, main_#t~ret458#1.offset;havoc main_#t~ret458#1.base, main_#t~ret458#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset; {886#true} is VALID [2022-02-20 21:54:46,072 INFO L272 TraceCheckUtils]: 8: Hoare triple {886#true} call main_#t~ret459#1.base, main_#t~ret459#1.offset := ldv_zalloc(44); {899#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:54:46,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {899#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {886#true} is VALID [2022-02-20 21:54:46,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {886#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {886#true} is VALID [2022-02-20 21:54:46,073 INFO L290 TraceCheckUtils]: 11: Hoare triple {886#true} assume true; {886#true} is VALID [2022-02-20 21:54:46,073 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {886#true} {886#true} #2189#return; {886#true} is VALID [2022-02-20 21:54:46,074 INFO L290 TraceCheckUtils]: 13: Hoare triple {886#true} main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset := main_#t~ret459#1.base, main_#t~ret459#1.offset;havoc main_#t~ret459#1.base, main_#t~ret459#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset;assume -2147483648 <= main_#t~nondet460#1 && main_#t~nondet460#1 <= 2147483647;main_~tmp___2~6#1 := main_#t~nondet460#1;havoc main_#t~nondet460#1;main_~ldvarg2~0#1 := main_~tmp___2~6#1;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; {896#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:46,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {896#(= ~last_index~0 0)} assume { :end_inline_ldv_set_init } true; {896#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:46,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {896#(= ~last_index~0 0)} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {896#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:46,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {896#(= ~last_index~0 0)} assume -2147483648 <= main_#t~nondet461#1 && main_#t~nondet461#1 <= 2147483647;main_~tmp___3~1#1 := main_#t~nondet461#1;havoc main_#t~nondet461#1;main_#t~switch462#1 := 0 == main_~tmp___3~1#1; {896#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:46,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {896#(= ~last_index~0 0)} assume !main_#t~switch462#1;main_#t~switch462#1 := main_#t~switch462#1 || 1 == main_~tmp___3~1#1; {896#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:46,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {896#(= ~last_index~0 0)} assume main_#t~switch462#1; {896#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:46,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {896#(= ~last_index~0 0)} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet481#1 && main_#t~nondet481#1 <= 2147483647;main_~tmp___5~1#1 := main_#t~nondet481#1;havoc main_#t~nondet481#1;main_#t~switch482#1 := 0 == main_~tmp___5~1#1; {896#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:46,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {896#(= ~last_index~0 0)} assume !main_#t~switch482#1;main_#t~switch482#1 := main_#t~switch482#1 || 1 == main_~tmp___5~1#1; {896#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:46,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {896#(= ~last_index~0 0)} assume main_#t~switch482#1; {896#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:46,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {896#(= ~last_index~0 0)} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_dp83640_init } true;havoc dp83640_init_#res#1;havoc dp83640_init_#t~ret454#1, dp83640_init_~tmp~39#1;havoc dp83640_init_~tmp~39#1;assume { :begin_inline_phy_driver_register } true;phy_driver_register_#in~arg0#1.base, phy_driver_register_#in~arg0#1.offset := ~#dp83640_driver~0.base, ~#dp83640_driver~0.offset;havoc phy_driver_register_#res#1;havoc phy_driver_register_#t~nondet516#1, phy_driver_register_~arg0#1.base, phy_driver_register_~arg0#1.offset;phy_driver_register_~arg0#1.base, phy_driver_register_~arg0#1.offset := phy_driver_register_#in~arg0#1.base, phy_driver_register_#in~arg0#1.offset;assume -2147483648 <= phy_driver_register_#t~nondet516#1 && phy_driver_register_#t~nondet516#1 <= 2147483647;phy_driver_register_#res#1 := phy_driver_register_#t~nondet516#1;havoc phy_driver_register_#t~nondet516#1; {896#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:46,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {896#(= ~last_index~0 0)} dp83640_init_#t~ret454#1 := phy_driver_register_#res#1;assume { :end_inline_phy_driver_register } true;assume -2147483648 <= dp83640_init_#t~ret454#1 && dp83640_init_#t~ret454#1 <= 2147483647;dp83640_init_~tmp~39#1 := dp83640_init_#t~ret454#1;havoc dp83640_init_#t~ret454#1;dp83640_init_#res#1 := dp83640_init_~tmp~39#1; {896#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:46,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {896#(= ~last_index~0 0)} main_#t~ret483#1 := dp83640_init_#res#1;assume { :end_inline_dp83640_init } true;assume -2147483648 <= main_#t~ret483#1 && main_#t~ret483#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret483#1;havoc main_#t~ret483#1; {896#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:46,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {896#(= ~last_index~0 0)} assume !(0 == ~ldv_retval_1~0); {896#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:46,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {896#(= ~last_index~0 0)} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {896#(= ~last_index~0 0)} is VALID [2022-02-20 21:54:46,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {896#(= ~last_index~0 0)} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret500#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#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); {897#(not (= |ULTIMATE.start_ldv_set_is_empty_#res#1| 0))} is VALID [2022-02-20 21:54:46,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {897#(not (= |ULTIMATE.start_ldv_set_is_empty_#res#1| 0))} ldv_check_final_state_#t~ret500#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret500#1 && ldv_check_final_state_#t~ret500#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret500#1;havoc ldv_check_final_state_#t~ret500#1; {898#(not (= |ULTIMATE.start_ldv_check_final_state_~tmp___7~6#1| 0))} is VALID [2022-02-20 21:54:46,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {898#(not (= |ULTIMATE.start_ldv_check_final_state_~tmp___7~6#1| 0))} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {887#false} is VALID [2022-02-20 21:54:46,081 INFO L272 TraceCheckUtils]: 30: Hoare triple {887#false} call ldv_error(); {887#false} is VALID [2022-02-20 21:54:46,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {887#false} assume !false; {887#false} is VALID [2022-02-20 21:54:46,082 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:54:46,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:54:46,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846459447] [2022-02-20 21:54:46,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846459447] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:54:46,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:54:46,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:54:46,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313513489] [2022-02-20 21:54:46,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:54:46,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-02-20 21:54:46,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:54:46,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:54:46,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:54:46,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:54:46,120 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:54:46,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:54:46,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:54:46,137 INFO L87 Difference]: Start difference. First operand has 883 states, 628 states have (on average 1.3678343949044587) internal successors, (859), 645 states have internal predecessors, (859), 193 states have call successors, (193), 61 states have call predecessors, (193), 60 states have return successors, (190), 189 states have call predecessors, (190), 190 states have call successors, (190) Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:54:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:54:59,829 INFO L93 Difference]: Finished difference Result 2819 states and 4163 transitions. [2022-02-20 21:54:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 21:54:59,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-02-20 21:54:59,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:54:59,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:55:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 4163 transitions. [2022-02-20 21:55:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:55:00,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 4163 transitions. [2022-02-20 21:55:00,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 4163 transitions. [2022-02-20 21:55:03,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4163 edges. 4163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:03,723 INFO L225 Difference]: With dead ends: 2819 [2022-02-20 21:55:03,724 INFO L226 Difference]: Without dead ends: 1895 [2022-02-20 21:55:03,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:55:03,738 INFO L933 BasicCegarLoop]: 1294 mSDtfsCounter, 1782 mSDsluCounter, 2676 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1939 SdHoareTripleChecker+Valid, 3970 SdHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 587 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-02-20 21:55:03,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1939 Valid, 3970 Invalid, 3092 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [587 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-02-20 21:55:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2022-02-20 21:55:03,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1715. [2022-02-20 21:55:03,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:55:03,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1895 states. Second operand has 1715 states, 1225 states have (on average 1.3061224489795917) internal successors, (1600), 1250 states have internal predecessors, (1600), 370 states have call successors, (370), 118 states have call predecessors, (370), 119 states have return successors, (383), 368 states have call predecessors, (383), 369 states have call successors, (383) [2022-02-20 21:55:03,887 INFO L74 IsIncluded]: Start isIncluded. First operand 1895 states. Second operand has 1715 states, 1225 states have (on average 1.3061224489795917) internal successors, (1600), 1250 states have internal predecessors, (1600), 370 states have call successors, (370), 118 states have call predecessors, (370), 119 states have return successors, (383), 368 states have call predecessors, (383), 369 states have call successors, (383) [2022-02-20 21:55:03,892 INFO L87 Difference]: Start difference. First operand 1895 states. Second operand has 1715 states, 1225 states have (on average 1.3061224489795917) internal successors, (1600), 1250 states have internal predecessors, (1600), 370 states have call successors, (370), 118 states have call predecessors, (370), 119 states have return successors, (383), 368 states have call predecessors, (383), 369 states have call successors, (383) [2022-02-20 21:55:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:04,024 INFO L93 Difference]: Finished difference Result 1895 states and 2704 transitions. [2022-02-20 21:55:04,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2704 transitions. [2022-02-20 21:55:04,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:04,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:04,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 1715 states, 1225 states have (on average 1.3061224489795917) internal successors, (1600), 1250 states have internal predecessors, (1600), 370 states have call successors, (370), 118 states have call predecessors, (370), 119 states have return successors, (383), 368 states have call predecessors, (383), 369 states have call successors, (383) Second operand 1895 states. [2022-02-20 21:55:04,049 INFO L87 Difference]: Start difference. First operand has 1715 states, 1225 states have (on average 1.3061224489795917) internal successors, (1600), 1250 states have internal predecessors, (1600), 370 states have call successors, (370), 118 states have call predecessors, (370), 119 states have return successors, (383), 368 states have call predecessors, (383), 369 states have call successors, (383) Second operand 1895 states. [2022-02-20 21:55:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:04,175 INFO L93 Difference]: Finished difference Result 1895 states and 2704 transitions. [2022-02-20 21:55:04,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2704 transitions. [2022-02-20 21:55:04,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:04,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:04,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:55:04,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:55:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1225 states have (on average 1.3061224489795917) internal successors, (1600), 1250 states have internal predecessors, (1600), 370 states have call successors, (370), 118 states have call predecessors, (370), 119 states have return successors, (383), 368 states have call predecessors, (383), 369 states have call successors, (383) [2022-02-20 21:55:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2353 transitions. [2022-02-20 21:55:04,327 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2353 transitions. Word has length 32 [2022-02-20 21:55:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:55:04,327 INFO L470 AbstractCegarLoop]: Abstraction has 1715 states and 2353 transitions. [2022-02-20 21:55:04,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 21:55:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2353 transitions. [2022-02-20 21:55:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 21:55:04,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:04,335 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-02-20 21:55:04,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:55:04,335 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:04,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1119313245, now seen corresponding path program 1 times [2022-02-20 21:55:04,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:04,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674688995] [2022-02-20 21:55:04,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:04,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:04,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:04,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {11073#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {11031#true} is VALID [2022-02-20 21:55:04,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {11031#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {11031#true} is VALID [2022-02-20 21:55:04,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11031#true} {11031#true} #2187#return; {11031#true} is VALID [2022-02-20 21:55:04,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:55:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:04,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {11073#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {11031#true} is VALID [2022-02-20 21:55:04,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {11031#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {11031#true} is VALID [2022-02-20 21:55:04,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11031#true} {11031#true} #2189#return; {11031#true} is VALID [2022-02-20 21:55:04,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 21:55:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:04,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:04,530 INFO L290 TraceCheckUtils]: 0: Hoare triple {11031#true} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset;call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~skb.base, 224 + ~skb.offset, 8);call #t~mem84 := read~int(~skb.base, 214 + ~skb.offset, 2);#res.base, #res.offset := #t~mem83.base, #t~mem83.offset + (if #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 else #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {11031#true} is VALID [2022-02-20 21:55:04,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,533 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11031#true} {11031#true} #2113#return; {11031#true} is VALID [2022-02-20 21:55:04,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:55:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:04,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:04,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {11091#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~4;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~4 := 0; {11031#true} is VALID [2022-02-20 21:55:04,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {11031#true} assume !false; {11031#true} is VALID [2022-02-20 21:55:04,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {11031#true} assume !(~i~4 < ~last_index~0); {11031#true} is VALID [2022-02-20 21:55:04,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {11031#true} assume -1 != ~deleted_index~0;~i~4 := 1 + ~deleted_index~0; {11031#true} is VALID [2022-02-20 21:55:04,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {11031#true} assume !false; {11031#true} is VALID [2022-02-20 21:55:04,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {11031#true} assume !(~i~4 < ~last_index~0); {11031#true} is VALID [2022-02-20 21:55:04,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {11031#true} ~last_index~0 := ~last_index~0 - 1; {11031#true} is VALID [2022-02-20 21:55:04,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,571 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {11031#true} {11031#true} #2029#return; {11031#true} is VALID [2022-02-20 21:55:04,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {11091#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {11031#true} is VALID [2022-02-20 21:55:04,573 INFO L272 TraceCheckUtils]: 1: Hoare triple {11031#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {11091#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:04,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {11091#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~4;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~4 := 0; {11031#true} is VALID [2022-02-20 21:55:04,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {11031#true} assume !false; {11031#true} is VALID [2022-02-20 21:55:04,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {11031#true} assume !(~i~4 < ~last_index~0); {11031#true} is VALID [2022-02-20 21:55:04,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {11031#true} assume -1 != ~deleted_index~0;~i~4 := 1 + ~deleted_index~0; {11031#true} is VALID [2022-02-20 21:55:04,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {11031#true} assume !false; {11031#true} is VALID [2022-02-20 21:55:04,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {11031#true} assume !(~i~4 < ~last_index~0); {11031#true} is VALID [2022-02-20 21:55:04,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {11031#true} ~last_index~0 := ~last_index~0 - 1; {11031#true} is VALID [2022-02-20 21:55:04,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,575 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11031#true} {11031#true} #2029#return; {11031#true} is VALID [2022-02-20 21:55:04,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,576 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11031#true} {11031#true} #2149#return; {11031#true} is VALID [2022-02-20 21:55:04,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {11074#(and (= |old(abs_6365)| abs_6365) (= |old(#length)| |#length|) (= |old(abs_6497)| abs_6497) (= |#memory_int| |old(#memory_int)|) (= |old(abs_5837)| abs_5837) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5856)| abs_5856) (= |old(abs_6498)| abs_6498) (= |old(abs_5854)| abs_5854) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~phydev#1.base, ~phydev#1.offset := #in~phydev#1.base, #in~phydev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~type#1 := #in~type#1;havoc ~dp83640~8#1.base, ~dp83640~8#1.offset;havoc ~tmp~37#1;call #t~mem438#1.base, #t~mem438#1.offset := read~$Pointer$(~phydev#1.base, 1468 + ~phydev#1.offset, 8);~dp83640~8#1.base, ~dp83640~8#1.offset := #t~mem438#1.base, #t~mem438#1.offset;havoc #t~mem438#1.base, #t~mem438#1.offset;call #t~mem439#1 := read~int(~dp83640~8#1.base, 112 + ~dp83640~8#1.offset, 4); {11031#true} is VALID [2022-02-20 21:55:04,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {11031#true} assume !(0 == #t~mem439#1);havoc #t~mem439#1;assume { :begin_inline_is_status_frame } true;is_status_frame_#in~skb#1.base, is_status_frame_#in~skb#1.offset, is_status_frame_#in~type#1 := ~skb#1.base, ~skb#1.offset, ~type#1;havoc is_status_frame_#res#1;havoc is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset, is_status_frame_#t~ret226#1, is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset, is_status_frame_~type#1, is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset, is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset, is_status_frame_~tmp___0~7#1;is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset := is_status_frame_#in~skb#1.base, is_status_frame_#in~skb#1.offset;is_status_frame_~type#1 := is_status_frame_#in~type#1;havoc is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset;havoc is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset;havoc is_status_frame_~tmp___0~7#1;assume { :begin_inline_eth_hdr } true;eth_hdr_#in~skb#1.base, eth_hdr_#in~skb#1.offset := is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset;havoc eth_hdr_#res#1.base, eth_hdr_#res#1.offset;havoc eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset, eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset, eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset;eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset := eth_hdr_#in~skb#1.base, eth_hdr_#in~skb#1.offset;havoc eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset; {11031#true} is VALID [2022-02-20 21:55:04,577 INFO L272 TraceCheckUtils]: 2: Hoare triple {11031#true} call eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset := skb_mac_header(eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset); {11031#true} is VALID [2022-02-20 21:55:04,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {11031#true} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset;call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~skb.base, 224 + ~skb.offset, 8);call #t~mem84 := read~int(~skb.base, 214 + ~skb.offset, 2);#res.base, #res.offset := #t~mem83.base, #t~mem83.offset + (if #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 else #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {11031#true} is VALID [2022-02-20 21:55:04,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,577 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {11031#true} {11031#true} #2113#return; {11031#true} is VALID [2022-02-20 21:55:04,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {11031#true} eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset := eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset;havoc eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset;eth_hdr_#res#1.base, eth_hdr_#res#1.offset := eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset; {11031#true} is VALID [2022-02-20 21:55:04,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {11031#true} is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset := eth_hdr_#res#1.base, eth_hdr_#res#1.offset;assume { :end_inline_eth_hdr } true;is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset := is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset;havoc is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset;is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset := is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset; {11031#true} is VALID [2022-02-20 21:55:04,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {11031#true} assume !(50 == is_status_frame_~type#1);is_status_frame_#res#1 := 0; {11031#true} is VALID [2022-02-20 21:55:04,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {11031#true} #t~ret440#1 := is_status_frame_#res#1;assume { :end_inline_is_status_frame } true;~tmp~37#1 := #t~ret440#1;havoc #t~ret440#1; {11031#true} is VALID [2022-02-20 21:55:04,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {11031#true} assume 0 != ~tmp~37#1 % 256;assume { :begin_inline_decode_status_frame } true;decode_status_frame_#in~dp83640#1.base, decode_status_frame_#in~dp83640#1.offset, decode_status_frame_#in~skb#1.base, decode_status_frame_#in~skb#1.offset := ~dp83640~8#1.base, ~dp83640~8#1.offset, ~skb#1.base, ~skb#1.offset;havoc decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset, decode_status_frame_#t~ret316#1, decode_status_frame_#t~mem317#1, decode_status_frame_#t~ret320#1, decode_status_frame_#t~nondet318#1, decode_status_frame_#t~nondet319#1, decode_status_frame_~dp83640#1.base, decode_status_frame_~dp83640#1.offset, decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset, decode_status_frame_~phy_rxts~0#1.base, decode_status_frame_~phy_rxts~0#1.offset, decode_status_frame_~phy_txts~1#1.base, decode_status_frame_~phy_txts~1#1.offset, decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset, decode_status_frame_~len~0#1, decode_status_frame_~size~0#1, decode_status_frame_~ests~0#1, decode_status_frame_~type~0#1, decode_status_frame_~tmp~26#1;decode_status_frame_~dp83640#1.base, decode_status_frame_~dp83640#1.offset := decode_status_frame_#in~dp83640#1.base, decode_status_frame_#in~dp83640#1.offset;decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset := decode_status_frame_#in~skb#1.base, decode_status_frame_#in~skb#1.offset;havoc decode_status_frame_~phy_rxts~0#1.base, decode_status_frame_~phy_rxts~0#1.offset;havoc decode_status_frame_~phy_txts~1#1.base, decode_status_frame_~phy_txts~1#1.offset;havoc decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset;havoc decode_status_frame_~len~0#1;havoc decode_status_frame_~size~0#1;havoc decode_status_frame_~ests~0#1;havoc decode_status_frame_~type~0#1;havoc decode_status_frame_~tmp~26#1;call decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset := read~$Pointer$(decode_status_frame_~skb#1.base, 232 + decode_status_frame_~skb#1.offset, 8);decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset := decode_status_frame_#t~mem315#1.base, 2 + decode_status_frame_#t~mem315#1.offset;havoc decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset;assume { :begin_inline_skb_headlen } true;skb_headlen_#in~skb#1.base, skb_headlen_#in~skb#1.offset := decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset;havoc skb_headlen_#res#1;havoc skb_headlen_#t~mem81#1, skb_headlen_#t~mem82#1, skb_headlen_~skb#1.base, skb_headlen_~skb#1.offset;skb_headlen_~skb#1.base, skb_headlen_~skb#1.offset := skb_headlen_#in~skb#1.base, skb_headlen_#in~skb#1.offset;call skb_headlen_#t~mem81#1 := read~int(skb_headlen_~skb#1.base, 104 + skb_headlen_~skb#1.offset, 4);call skb_headlen_#t~mem82#1 := read~int(skb_headlen_~skb#1.base, 108 + skb_headlen_~skb#1.offset, 4);skb_headlen_#res#1 := skb_headlen_#t~mem81#1 - skb_headlen_#t~mem82#1;havoc skb_headlen_#t~mem81#1;havoc skb_headlen_#t~mem82#1; {11031#true} is VALID [2022-02-20 21:55:04,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {11031#true} decode_status_frame_#t~ret316#1 := skb_headlen_#res#1;assume { :end_inline_skb_headlen } true;decode_status_frame_~tmp~26#1 := decode_status_frame_#t~ret316#1;havoc decode_status_frame_#t~ret316#1;decode_status_frame_~len~0#1 := (if (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 <= 2147483647 then (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 else (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 - 4294967296); {11031#true} is VALID [2022-02-20 21:55:04,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {11031#true} assume !(decode_status_frame_~len~0#1 % 4294967296 > 2); {11031#true} is VALID [2022-02-20 21:55:04,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {11031#true} assume { :end_inline_decode_status_frame } true;assume { :begin_inline_ldv_kfree_skb_18 } true;ldv_kfree_skb_18_#in~ldv_func_arg1#1.base, ldv_kfree_skb_18_#in~ldv_func_arg1#1.offset := ~skb#1.base, ~skb#1.offset;havoc ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset;ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset := ldv_kfree_skb_18_#in~ldv_func_arg1#1.base, ldv_kfree_skb_18_#in~ldv_func_arg1#1.offset; {11031#true} is VALID [2022-02-20 21:55:04,586 INFO L272 TraceCheckUtils]: 14: Hoare triple {11031#true} call ldv_skb_free(ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset); {11091#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:04,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {11091#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {11031#true} is VALID [2022-02-20 21:55:04,587 INFO L272 TraceCheckUtils]: 16: Hoare triple {11031#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {11091#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:04,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {11091#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~4;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~4 := 0; {11031#true} is VALID [2022-02-20 21:55:04,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {11031#true} assume !false; {11031#true} is VALID [2022-02-20 21:55:04,588 INFO L290 TraceCheckUtils]: 19: Hoare triple {11031#true} assume !(~i~4 < ~last_index~0); {11031#true} is VALID [2022-02-20 21:55:04,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {11031#true} assume -1 != ~deleted_index~0;~i~4 := 1 + ~deleted_index~0; {11031#true} is VALID [2022-02-20 21:55:04,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {11031#true} assume !false; {11031#true} is VALID [2022-02-20 21:55:04,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {11031#true} assume !(~i~4 < ~last_index~0); {11031#true} is VALID [2022-02-20 21:55:04,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {11031#true} ~last_index~0 := ~last_index~0 - 1; {11031#true} is VALID [2022-02-20 21:55:04,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,589 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11031#true} {11031#true} #2029#return; {11031#true} is VALID [2022-02-20 21:55:04,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,589 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11031#true} {11031#true} #2149#return; {11031#true} is VALID [2022-02-20 21:55:04,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {11031#true} assume { :end_inline_ldv_kfree_skb_18 } true;#res#1 := 1; {11031#true} is VALID [2022-02-20 21:55:04,592 INFO L290 TraceCheckUtils]: 29: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,593 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {11031#true} {11032#false} #2267#return; {11032#false} is VALID [2022-02-20 21:55:04,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {11031#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(102, 2);call #Ultimate.allocInit(22, 3);call #Ultimate.allocInit(7, 4);call write~init~int(71, 4, 0, 1);call write~init~int(80, 4, 1, 1);call write~init~int(73, 4, 2, 1);call write~init~int(79, 4, 3, 1);call write~init~int(37, 4, 4, 1);call write~init~int(100, 4, 5, 1);call write~init~int(0, 4, 6, 1);call #Ultimate.allocInit(40, 5);call #Ultimate.allocInit(29, 6);call #Ultimate.allocInit(19, 7);call #Ultimate.allocInit(50, 8);call #Ultimate.allocInit(36, 9);call #Ultimate.allocInit(39, 10);call #Ultimate.allocInit(35, 11);call #Ultimate.allocInit(35, 12);call #Ultimate.allocInit(35, 13);call #Ultimate.allocInit(35, 14);call #Ultimate.allocInit(41, 15);call #Ultimate.allocInit(8, 16);call #Ultimate.allocInit(12, 17);call #Ultimate.allocInit(222, 18);call #Ultimate.allocInit(28, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(8, 21);call #Ultimate.allocInit(12, 22);call #Ultimate.allocInit(222, 23);call #Ultimate.allocInit(35, 24);call #Ultimate.allocInit(44, 25);call #Ultimate.allocInit(46, 26);call #Ultimate.allocInit(20, 27);call #Ultimate.allocInit(19, 28);call #Ultimate.allocInit(14, 29);call #Ultimate.allocInit(20, 30);call #Ultimate.allocInit(28, 31);call #Ultimate.allocInit(16, 32);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~dp83640_driver_group0~0.base, ~dp83640_driver_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~dp83640_driver_group1~0.base, ~dp83640_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~chosen_phy~0 := -1;~#gpio_tab~0.base, ~#gpio_tab~0.offset := 33, 0;call #Ultimate.allocInit(16, 33);call write~init~int(1, ~#gpio_tab~0.base, ~#gpio_tab~0.offset, 2);call write~init~int(2, ~#gpio_tab~0.base, 2 + ~#gpio_tab~0.offset, 2);call write~init~int(3, ~#gpio_tab~0.base, 4 + ~#gpio_tab~0.offset, 2);call write~init~int(4, ~#gpio_tab~0.base, 6 + ~#gpio_tab~0.offset, 2);call write~init~int(8, ~#gpio_tab~0.base, 8 + ~#gpio_tab~0.offset, 2);call write~init~int(9, ~#gpio_tab~0.base, 10 + ~#gpio_tab~0.offset, 2);call write~init~int(10, ~#gpio_tab~0.base, 12 + ~#gpio_tab~0.offset, 2);call write~init~int(11, ~#gpio_tab~0.base, 14 + ~#gpio_tab~0.offset, 2);~#phyter_clocks~0.base, ~#phyter_clocks~0.offset := 34, 0;call #Ultimate.allocInit(16, 34);call write~init~$Pointer$(~#phyter_clocks~0.base, ~#phyter_clocks~0.offset, ~#phyter_clocks~0.base, ~#phyter_clocks~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks~0.base, ~#phyter_clocks~0.offset, ~#phyter_clocks~0.base, 8 + ~#phyter_clocks~0.offset, 8);~#phyter_clocks_lock~0.base, ~#phyter_clocks_lock~0.offset := 35, 0;call #Ultimate.allocInit(156, 35);call write~init~int(1, ~#phyter_clocks_lock~0.base, ~#phyter_clocks_lock~0.offset, 4);call write~init~int(0, ~#phyter_clocks_lock~0.base, 4 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(3735899821, ~#phyter_clocks_lock~0.base, 8 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(4294967295, ~#phyter_clocks_lock~0.base, 12 + ~#phyter_clocks_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#phyter_clocks_lock~0.base, 16 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 24 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 32 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 40 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#phyter_clocks_lock~0.base, 48 + ~#phyter_clocks_lock~0.offset, 8);call write~init~int(0, ~#phyter_clocks_lock~0.base, 56 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(0, ~#phyter_clocks_lock~0.base, 60 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks_lock~0.base, 72 + ~#phyter_clocks_lock~0.offset, ~#phyter_clocks_lock~0.base, 72 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks_lock~0.base, 72 + ~#phyter_clocks_lock~0.offset, ~#phyter_clocks_lock~0.base, 80 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 88 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 96 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks_lock~0.base, ~#phyter_clocks_lock~0.offset, ~#phyter_clocks_lock~0.base, 104 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 112 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 120 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 128 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#phyter_clocks_lock~0.base, 136 + ~#phyter_clocks_lock~0.offset, 8);call write~init~int(0, ~#phyter_clocks_lock~0.base, 144 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(0, ~#phyter_clocks_lock~0.base, 148 + ~#phyter_clocks_lock~0.offset, 8);~#status_frame_dst~0.base, ~#status_frame_dst~0.offset := 36, 0;call #Ultimate.allocInit(6, 36);call write~init~int(1, ~#status_frame_dst~0.base, ~#status_frame_dst~0.offset, 1);call write~init~int(27, ~#status_frame_dst~0.base, 1 + ~#status_frame_dst~0.offset, 1);call write~init~int(25, ~#status_frame_dst~0.base, 2 + ~#status_frame_dst~0.offset, 1);call write~init~int(0, ~#status_frame_dst~0.base, 3 + ~#status_frame_dst~0.offset, 1);call write~init~int(0, ~#status_frame_dst~0.base, 4 + ~#status_frame_dst~0.offset, 1);call write~init~int(0, ~#status_frame_dst~0.base, 5 + ~#status_frame_dst~0.offset, 1);~#status_frame_src~0.base, ~#status_frame_src~0.offset := 37, 0;call #Ultimate.allocInit(6, 37);call write~init~int(8, ~#status_frame_src~0.base, ~#status_frame_src~0.offset, 1);call write~init~int(0, ~#status_frame_src~0.base, 1 + ~#status_frame_src~0.offset, 1);call write~init~int(23, ~#status_frame_src~0.base, 2 + ~#status_frame_src~0.offset, 1);call write~init~int(11, ~#status_frame_src~0.base, 3 + ~#status_frame_src~0.offset, 1);call write~init~int(107, ~#status_frame_src~0.base, 4 + ~#status_frame_src~0.offset, 1);call write~init~int(15, ~#status_frame_src~0.base, 5 + ~#status_frame_src~0.offset, 1);~#dp83640_driver~0.base, ~#dp83640_driver~0.offset := 38, 0;call #Ultimate.allocInit(289, 38);call write~init~int(536894689, ~#dp83640_driver~0.base, ~#dp83640_driver~0.offset, 4);call write~init~$Pointer$(32, 0, ~#dp83640_driver~0.base, 4 + ~#dp83640_driver~0.offset, 8);call write~init~int(4294967280, ~#dp83640_driver~0.base, 12 + ~#dp83640_driver~0.offset, 4);call write~init~int(719, ~#dp83640_driver~0.base, 16 + ~#dp83640_driver~0.offset, 4);call write~init~int(1, ~#dp83640_driver~0.base, 20 + ~#dp83640_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 24 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_config_init.base, #funAddr~dp83640_config_init.offset, ~#dp83640_driver~0.base, 32 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_probe.base, #funAddr~dp83640_probe.offset, ~#dp83640_driver~0.base, 40 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 48 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 56 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~genphy_config_aneg.base, #funAddr~genphy_config_aneg.offset, ~#dp83640_driver~0.base, 64 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 72 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~genphy_read_status.base, #funAddr~genphy_read_status.offset, ~#dp83640_driver~0.base, 80 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_ack_interrupt.base, #funAddr~dp83640_ack_interrupt.offset, ~#dp83640_driver~0.base, 88 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_config_intr.base, #funAddr~dp83640_config_intr.offset, ~#dp83640_driver~0.base, 96 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 104 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_remove.base, #funAddr~dp83640_remove.offset, ~#dp83640_driver~0.base, 112 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 120 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_ts_info.base, #funAddr~dp83640_ts_info.offset, ~#dp83640_driver~0.base, 128 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_hwtstamp.base, #funAddr~dp83640_hwtstamp.offset, ~#dp83640_driver~0.base, 136 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_rxtstamp.base, #funAddr~dp83640_rxtstamp.offset, ~#dp83640_driver~0.base, 144 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_txtstamp.base, #funAddr~dp83640_txtstamp.offset, ~#dp83640_driver~0.base, 152 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 160 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 168 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 176 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 184 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#dp83640_driver~0.base, 192 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 200 + ~#dp83640_driver~0.offset, 8);call write~init~int(0, ~#dp83640_driver~0.base, 208 + ~#dp83640_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 209 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 217 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 225 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 233 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 241 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 249 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 257 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 265 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 273 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 281 + ~#dp83640_driver~0.offset, 8);~__mod_mdio__dp83640_tbl_device_table~0.phy_id := 0;~__mod_mdio__dp83640_tbl_device_table~0.phy_id_mask := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 39, 0;call #Ultimate.allocInit(120, 39);#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; {11031#true} is VALID [2022-02-20 21:55:04,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {11031#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet457#1, main_#t~ret458#1.base, main_#t~ret458#1.offset, main_#t~ret459#1.base, main_#t~ret459#1.offset, main_#t~nondet460#1, main_#t~nondet461#1, main_#t~switch462#1, main_#t~nondet463#1, main_#t~switch464#1, main_#t~ret465#1, main_#t~ret466#1, main_#t~ret467#1, main_#t~ret468#1, main_#t~ret469#1, main_#t~ret470#1, main_#t~ret471#1, main_#t~ret472#1, main_#t~ret473#1, main_#t~ret474#1, main_#t~ret475#1, main_#t~ret476#1, main_#t~ret477#1, main_#t~ret478#1, main_#t~ret479#1, main_#t~ret480#1, main_#t~nondet481#1, main_#t~switch482#1, main_#t~ret483#1, main_~ldvarg1~0#1, main_~tmp~41#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset, main_~ldvarg2~0#1, main_~tmp___2~6#1, main_~tmp___3~1#1, main_~tmp___4~1#1, main_~tmp___5~1#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~41#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset;havoc main_~ldvarg2~0#1;havoc main_~tmp___2~6#1;havoc main_~tmp___3~1#1;havoc main_~tmp___4~1#1;havoc main_~tmp___5~1#1;assume -2147483648 <= main_#t~nondet457#1 && main_#t~nondet457#1 <= 2147483647;main_~tmp~41#1 := main_#t~nondet457#1;havoc main_#t~nondet457#1;main_~ldvarg1~0#1 := main_~tmp~41#1; {11031#true} is VALID [2022-02-20 21:55:04,595 INFO L272 TraceCheckUtils]: 2: Hoare triple {11031#true} call main_#t~ret458#1.base, main_#t~ret458#1.offset := ldv_zalloc(40); {11073#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:04,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {11073#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {11031#true} is VALID [2022-02-20 21:55:04,595 INFO L290 TraceCheckUtils]: 4: Hoare triple {11031#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {11031#true} is VALID [2022-02-20 21:55:04,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,595 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {11031#true} {11031#true} #2187#return; {11031#true} is VALID [2022-02-20 21:55:04,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {11031#true} main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset := main_#t~ret458#1.base, main_#t~ret458#1.offset;havoc main_#t~ret458#1.base, main_#t~ret458#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset; {11031#true} is VALID [2022-02-20 21:55:04,596 INFO L272 TraceCheckUtils]: 8: Hoare triple {11031#true} call main_#t~ret459#1.base, main_#t~ret459#1.offset := ldv_zalloc(44); {11073#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:04,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {11073#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {11031#true} is VALID [2022-02-20 21:55:04,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {11031#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {11031#true} is VALID [2022-02-20 21:55:04,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,599 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {11031#true} {11031#true} #2189#return; {11031#true} is VALID [2022-02-20 21:55:04,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {11031#true} main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset := main_#t~ret459#1.base, main_#t~ret459#1.offset;havoc main_#t~ret459#1.base, main_#t~ret459#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset;assume -2147483648 <= main_#t~nondet460#1 && main_#t~nondet460#1 <= 2147483647;main_~tmp___2~6#1 := main_#t~nondet460#1;havoc main_#t~nondet460#1;main_~ldvarg2~0#1 := main_~tmp___2~6#1;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; {11031#true} is VALID [2022-02-20 21:55:04,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {11031#true} assume { :end_inline_ldv_set_init } true; {11031#true} is VALID [2022-02-20 21:55:04,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {11031#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {11041#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 21:55:04,601 INFO L290 TraceCheckUtils]: 16: Hoare triple {11041#(= ~ldv_state_variable_1~0 0)} assume -2147483648 <= main_#t~nondet461#1 && main_#t~nondet461#1 <= 2147483647;main_~tmp___3~1#1 := main_#t~nondet461#1;havoc main_#t~nondet461#1;main_#t~switch462#1 := 0 == main_~tmp___3~1#1; {11041#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 21:55:04,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {11041#(= ~ldv_state_variable_1~0 0)} assume main_#t~switch462#1; {11041#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 21:55:04,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {11041#(= ~ldv_state_variable_1~0 0)} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet463#1 && main_#t~nondet463#1 <= 2147483647;main_~tmp___4~1#1 := main_#t~nondet463#1;havoc main_#t~nondet463#1;main_#t~switch464#1 := 0 == main_~tmp___4~1#1; {11032#false} is VALID [2022-02-20 21:55:04,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {11032#false} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 1 == main_~tmp___4~1#1; {11032#false} is VALID [2022-02-20 21:55:04,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {11032#false} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 2 == main_~tmp___4~1#1; {11032#false} is VALID [2022-02-20 21:55:04,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {11032#false} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 3 == main_~tmp___4~1#1; {11032#false} is VALID [2022-02-20 21:55:04,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {11032#false} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 4 == main_~tmp___4~1#1; {11032#false} is VALID [2022-02-20 21:55:04,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {11032#false} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 5 == main_~tmp___4~1#1; {11032#false} is VALID [2022-02-20 21:55:04,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {11032#false} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 6 == main_~tmp___4~1#1; {11032#false} is VALID [2022-02-20 21:55:04,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {11032#false} assume main_#t~switch464#1; {11032#false} is VALID [2022-02-20 21:55:04,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {11032#false} assume !(1 == ~ldv_state_variable_1~0); {11032#false} is VALID [2022-02-20 21:55:04,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {11032#false} assume 2 == ~ldv_state_variable_1~0; {11032#false} is VALID [2022-02-20 21:55:04,616 INFO L272 TraceCheckUtils]: 28: Hoare triple {11032#false} call main_#t~ret475#1 := dp83640_rxtstamp(~dp83640_driver_group0~0.base, ~dp83640_driver_group0~0.offset, ~dp83640_driver_group1~0.base, ~dp83640_driver_group1~0.offset, main_~ldvarg1~0#1); {11074#(and (= |old(abs_6365)| abs_6365) (= |old(#length)| |#length|) (= |old(abs_6497)| abs_6497) (= |#memory_int| |old(#memory_int)|) (= |old(abs_5837)| abs_5837) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5856)| abs_5856) (= |old(abs_6498)| abs_6498) (= |old(abs_5854)| abs_5854) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:04,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {11074#(and (= |old(abs_6365)| abs_6365) (= |old(#length)| |#length|) (= |old(abs_6497)| abs_6497) (= |#memory_int| |old(#memory_int)|) (= |old(abs_5837)| abs_5837) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5856)| abs_5856) (= |old(abs_6498)| abs_6498) (= |old(abs_5854)| abs_5854) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~phydev#1.base, ~phydev#1.offset := #in~phydev#1.base, #in~phydev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~type#1 := #in~type#1;havoc ~dp83640~8#1.base, ~dp83640~8#1.offset;havoc ~tmp~37#1;call #t~mem438#1.base, #t~mem438#1.offset := read~$Pointer$(~phydev#1.base, 1468 + ~phydev#1.offset, 8);~dp83640~8#1.base, ~dp83640~8#1.offset := #t~mem438#1.base, #t~mem438#1.offset;havoc #t~mem438#1.base, #t~mem438#1.offset;call #t~mem439#1 := read~int(~dp83640~8#1.base, 112 + ~dp83640~8#1.offset, 4); {11031#true} is VALID [2022-02-20 21:55:04,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {11031#true} assume !(0 == #t~mem439#1);havoc #t~mem439#1;assume { :begin_inline_is_status_frame } true;is_status_frame_#in~skb#1.base, is_status_frame_#in~skb#1.offset, is_status_frame_#in~type#1 := ~skb#1.base, ~skb#1.offset, ~type#1;havoc is_status_frame_#res#1;havoc is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset, is_status_frame_#t~ret226#1, is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset, is_status_frame_~type#1, is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset, is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset, is_status_frame_~tmp___0~7#1;is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset := is_status_frame_#in~skb#1.base, is_status_frame_#in~skb#1.offset;is_status_frame_~type#1 := is_status_frame_#in~type#1;havoc is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset;havoc is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset;havoc is_status_frame_~tmp___0~7#1;assume { :begin_inline_eth_hdr } true;eth_hdr_#in~skb#1.base, eth_hdr_#in~skb#1.offset := is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset;havoc eth_hdr_#res#1.base, eth_hdr_#res#1.offset;havoc eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset, eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset, eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset;eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset := eth_hdr_#in~skb#1.base, eth_hdr_#in~skb#1.offset;havoc eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset; {11031#true} is VALID [2022-02-20 21:55:04,616 INFO L272 TraceCheckUtils]: 31: Hoare triple {11031#true} call eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset := skb_mac_header(eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset); {11031#true} is VALID [2022-02-20 21:55:04,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {11031#true} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset;call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~skb.base, 224 + ~skb.offset, 8);call #t~mem84 := read~int(~skb.base, 214 + ~skb.offset, 2);#res.base, #res.offset := #t~mem83.base, #t~mem83.offset + (if #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 else #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {11031#true} is VALID [2022-02-20 21:55:04,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,617 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11031#true} {11031#true} #2113#return; {11031#true} is VALID [2022-02-20 21:55:04,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {11031#true} eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset := eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset;havoc eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset;eth_hdr_#res#1.base, eth_hdr_#res#1.offset := eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset; {11031#true} is VALID [2022-02-20 21:55:04,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {11031#true} is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset := eth_hdr_#res#1.base, eth_hdr_#res#1.offset;assume { :end_inline_eth_hdr } true;is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset := is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset;havoc is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset;is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset := is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset; {11031#true} is VALID [2022-02-20 21:55:04,617 INFO L290 TraceCheckUtils]: 37: Hoare triple {11031#true} assume !(50 == is_status_frame_~type#1);is_status_frame_#res#1 := 0; {11031#true} is VALID [2022-02-20 21:55:04,617 INFO L290 TraceCheckUtils]: 38: Hoare triple {11031#true} #t~ret440#1 := is_status_frame_#res#1;assume { :end_inline_is_status_frame } true;~tmp~37#1 := #t~ret440#1;havoc #t~ret440#1; {11031#true} is VALID [2022-02-20 21:55:04,617 INFO L290 TraceCheckUtils]: 39: Hoare triple {11031#true} assume 0 != ~tmp~37#1 % 256;assume { :begin_inline_decode_status_frame } true;decode_status_frame_#in~dp83640#1.base, decode_status_frame_#in~dp83640#1.offset, decode_status_frame_#in~skb#1.base, decode_status_frame_#in~skb#1.offset := ~dp83640~8#1.base, ~dp83640~8#1.offset, ~skb#1.base, ~skb#1.offset;havoc decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset, decode_status_frame_#t~ret316#1, decode_status_frame_#t~mem317#1, decode_status_frame_#t~ret320#1, decode_status_frame_#t~nondet318#1, decode_status_frame_#t~nondet319#1, decode_status_frame_~dp83640#1.base, decode_status_frame_~dp83640#1.offset, decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset, decode_status_frame_~phy_rxts~0#1.base, decode_status_frame_~phy_rxts~0#1.offset, decode_status_frame_~phy_txts~1#1.base, decode_status_frame_~phy_txts~1#1.offset, decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset, decode_status_frame_~len~0#1, decode_status_frame_~size~0#1, decode_status_frame_~ests~0#1, decode_status_frame_~type~0#1, decode_status_frame_~tmp~26#1;decode_status_frame_~dp83640#1.base, decode_status_frame_~dp83640#1.offset := decode_status_frame_#in~dp83640#1.base, decode_status_frame_#in~dp83640#1.offset;decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset := decode_status_frame_#in~skb#1.base, decode_status_frame_#in~skb#1.offset;havoc decode_status_frame_~phy_rxts~0#1.base, decode_status_frame_~phy_rxts~0#1.offset;havoc decode_status_frame_~phy_txts~1#1.base, decode_status_frame_~phy_txts~1#1.offset;havoc decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset;havoc decode_status_frame_~len~0#1;havoc decode_status_frame_~size~0#1;havoc decode_status_frame_~ests~0#1;havoc decode_status_frame_~type~0#1;havoc decode_status_frame_~tmp~26#1;call decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset := read~$Pointer$(decode_status_frame_~skb#1.base, 232 + decode_status_frame_~skb#1.offset, 8);decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset := decode_status_frame_#t~mem315#1.base, 2 + decode_status_frame_#t~mem315#1.offset;havoc decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset;assume { :begin_inline_skb_headlen } true;skb_headlen_#in~skb#1.base, skb_headlen_#in~skb#1.offset := decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset;havoc skb_headlen_#res#1;havoc skb_headlen_#t~mem81#1, skb_headlen_#t~mem82#1, skb_headlen_~skb#1.base, skb_headlen_~skb#1.offset;skb_headlen_~skb#1.base, skb_headlen_~skb#1.offset := skb_headlen_#in~skb#1.base, skb_headlen_#in~skb#1.offset;call skb_headlen_#t~mem81#1 := read~int(skb_headlen_~skb#1.base, 104 + skb_headlen_~skb#1.offset, 4);call skb_headlen_#t~mem82#1 := read~int(skb_headlen_~skb#1.base, 108 + skb_headlen_~skb#1.offset, 4);skb_headlen_#res#1 := skb_headlen_#t~mem81#1 - skb_headlen_#t~mem82#1;havoc skb_headlen_#t~mem81#1;havoc skb_headlen_#t~mem82#1; {11031#true} is VALID [2022-02-20 21:55:04,618 INFO L290 TraceCheckUtils]: 40: Hoare triple {11031#true} decode_status_frame_#t~ret316#1 := skb_headlen_#res#1;assume { :end_inline_skb_headlen } true;decode_status_frame_~tmp~26#1 := decode_status_frame_#t~ret316#1;havoc decode_status_frame_#t~ret316#1;decode_status_frame_~len~0#1 := (if (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 <= 2147483647 then (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 else (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 - 4294967296); {11031#true} is VALID [2022-02-20 21:55:04,618 INFO L290 TraceCheckUtils]: 41: Hoare triple {11031#true} assume !(decode_status_frame_~len~0#1 % 4294967296 > 2); {11031#true} is VALID [2022-02-20 21:55:04,618 INFO L290 TraceCheckUtils]: 42: Hoare triple {11031#true} assume { :end_inline_decode_status_frame } true;assume { :begin_inline_ldv_kfree_skb_18 } true;ldv_kfree_skb_18_#in~ldv_func_arg1#1.base, ldv_kfree_skb_18_#in~ldv_func_arg1#1.offset := ~skb#1.base, ~skb#1.offset;havoc ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset;ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset := ldv_kfree_skb_18_#in~ldv_func_arg1#1.base, ldv_kfree_skb_18_#in~ldv_func_arg1#1.offset; {11031#true} is VALID [2022-02-20 21:55:04,619 INFO L272 TraceCheckUtils]: 43: Hoare triple {11031#true} call ldv_skb_free(ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset); {11091#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:04,619 INFO L290 TraceCheckUtils]: 44: Hoare triple {11091#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {11031#true} is VALID [2022-02-20 21:55:04,620 INFO L272 TraceCheckUtils]: 45: Hoare triple {11031#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {11091#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:04,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {11091#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~4;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~4 := 0; {11031#true} is VALID [2022-02-20 21:55:04,620 INFO L290 TraceCheckUtils]: 47: Hoare triple {11031#true} assume !false; {11031#true} is VALID [2022-02-20 21:55:04,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {11031#true} assume !(~i~4 < ~last_index~0); {11031#true} is VALID [2022-02-20 21:55:04,620 INFO L290 TraceCheckUtils]: 49: Hoare triple {11031#true} assume -1 != ~deleted_index~0;~i~4 := 1 + ~deleted_index~0; {11031#true} is VALID [2022-02-20 21:55:04,621 INFO L290 TraceCheckUtils]: 50: Hoare triple {11031#true} assume !false; {11031#true} is VALID [2022-02-20 21:55:04,621 INFO L290 TraceCheckUtils]: 51: Hoare triple {11031#true} assume !(~i~4 < ~last_index~0); {11031#true} is VALID [2022-02-20 21:55:04,621 INFO L290 TraceCheckUtils]: 52: Hoare triple {11031#true} ~last_index~0 := ~last_index~0 - 1; {11031#true} is VALID [2022-02-20 21:55:04,621 INFO L290 TraceCheckUtils]: 53: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,621 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11031#true} {11031#true} #2029#return; {11031#true} is VALID [2022-02-20 21:55:04,621 INFO L290 TraceCheckUtils]: 55: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,621 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {11031#true} {11031#true} #2149#return; {11031#true} is VALID [2022-02-20 21:55:04,622 INFO L290 TraceCheckUtils]: 57: Hoare triple {11031#true} assume { :end_inline_ldv_kfree_skb_18 } true;#res#1 := 1; {11031#true} is VALID [2022-02-20 21:55:04,622 INFO L290 TraceCheckUtils]: 58: Hoare triple {11031#true} assume true; {11031#true} is VALID [2022-02-20 21:55:04,622 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11031#true} {11032#false} #2267#return; {11032#false} is VALID [2022-02-20 21:55:04,622 INFO L290 TraceCheckUtils]: 60: Hoare triple {11032#false} havoc main_#t~ret475#1;~ldv_state_variable_1~0 := 2; {11032#false} is VALID [2022-02-20 21:55:04,622 INFO L290 TraceCheckUtils]: 61: Hoare triple {11032#false} assume -2147483648 <= main_#t~nondet461#1 && main_#t~nondet461#1 <= 2147483647;main_~tmp___3~1#1 := main_#t~nondet461#1;havoc main_#t~nondet461#1;main_#t~switch462#1 := 0 == main_~tmp___3~1#1; {11032#false} is VALID [2022-02-20 21:55:04,622 INFO L290 TraceCheckUtils]: 62: Hoare triple {11032#false} assume !main_#t~switch462#1;main_#t~switch462#1 := main_#t~switch462#1 || 1 == main_~tmp___3~1#1; {11032#false} is VALID [2022-02-20 21:55:04,622 INFO L290 TraceCheckUtils]: 63: Hoare triple {11032#false} assume main_#t~switch462#1; {11032#false} is VALID [2022-02-20 21:55:04,623 INFO L290 TraceCheckUtils]: 64: Hoare triple {11032#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet481#1 && main_#t~nondet481#1 <= 2147483647;main_~tmp___5~1#1 := main_#t~nondet481#1;havoc main_#t~nondet481#1;main_#t~switch482#1 := 0 == main_~tmp___5~1#1; {11032#false} is VALID [2022-02-20 21:55:04,623 INFO L290 TraceCheckUtils]: 65: Hoare triple {11032#false} assume !main_#t~switch482#1;main_#t~switch482#1 := main_#t~switch482#1 || 1 == main_~tmp___5~1#1; {11032#false} is VALID [2022-02-20 21:55:04,623 INFO L290 TraceCheckUtils]: 66: Hoare triple {11032#false} assume main_#t~switch482#1; {11032#false} is VALID [2022-02-20 21:55:04,623 INFO L290 TraceCheckUtils]: 67: Hoare triple {11032#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_dp83640_init } true;havoc dp83640_init_#res#1;havoc dp83640_init_#t~ret454#1, dp83640_init_~tmp~39#1;havoc dp83640_init_~tmp~39#1;assume { :begin_inline_phy_driver_register } true;phy_driver_register_#in~arg0#1.base, phy_driver_register_#in~arg0#1.offset := ~#dp83640_driver~0.base, ~#dp83640_driver~0.offset;havoc phy_driver_register_#res#1;havoc phy_driver_register_#t~nondet516#1, phy_driver_register_~arg0#1.base, phy_driver_register_~arg0#1.offset;phy_driver_register_~arg0#1.base, phy_driver_register_~arg0#1.offset := phy_driver_register_#in~arg0#1.base, phy_driver_register_#in~arg0#1.offset;assume -2147483648 <= phy_driver_register_#t~nondet516#1 && phy_driver_register_#t~nondet516#1 <= 2147483647;phy_driver_register_#res#1 := phy_driver_register_#t~nondet516#1;havoc phy_driver_register_#t~nondet516#1; {11032#false} is VALID [2022-02-20 21:55:04,623 INFO L290 TraceCheckUtils]: 68: Hoare triple {11032#false} dp83640_init_#t~ret454#1 := phy_driver_register_#res#1;assume { :end_inline_phy_driver_register } true;assume -2147483648 <= dp83640_init_#t~ret454#1 && dp83640_init_#t~ret454#1 <= 2147483647;dp83640_init_~tmp~39#1 := dp83640_init_#t~ret454#1;havoc dp83640_init_#t~ret454#1;dp83640_init_#res#1 := dp83640_init_~tmp~39#1; {11032#false} is VALID [2022-02-20 21:55:04,623 INFO L290 TraceCheckUtils]: 69: Hoare triple {11032#false} main_#t~ret483#1 := dp83640_init_#res#1;assume { :end_inline_dp83640_init } true;assume -2147483648 <= main_#t~ret483#1 && main_#t~ret483#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret483#1;havoc main_#t~ret483#1; {11032#false} is VALID [2022-02-20 21:55:04,624 INFO L290 TraceCheckUtils]: 70: Hoare triple {11032#false} assume !(0 == ~ldv_retval_1~0); {11032#false} is VALID [2022-02-20 21:55:04,624 INFO L290 TraceCheckUtils]: 71: Hoare triple {11032#false} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {11032#false} is VALID [2022-02-20 21:55:04,624 INFO L290 TraceCheckUtils]: 72: Hoare triple {11032#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret500#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#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); {11032#false} is VALID [2022-02-20 21:55:04,624 INFO L290 TraceCheckUtils]: 73: Hoare triple {11032#false} ldv_check_final_state_#t~ret500#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret500#1 && ldv_check_final_state_#t~ret500#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret500#1;havoc ldv_check_final_state_#t~ret500#1; {11032#false} is VALID [2022-02-20 21:55:04,624 INFO L290 TraceCheckUtils]: 74: Hoare triple {11032#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {11032#false} is VALID [2022-02-20 21:55:04,624 INFO L272 TraceCheckUtils]: 75: Hoare triple {11032#false} call ldv_error(); {11032#false} is VALID [2022-02-20 21:55:04,624 INFO L290 TraceCheckUtils]: 76: Hoare triple {11032#false} assume !false; {11032#false} is VALID [2022-02-20 21:55:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 21:55:04,625 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:04,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674688995] [2022-02-20 21:55:04,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674688995] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:04,625 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:04,626 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:55:04,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879304003] [2022-02-20 21:55:04,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:04,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 77 [2022-02-20 21:55:04,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:04,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:55:04,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:04,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:55:04,704 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:04,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:55:04,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:55:04,705 INFO L87 Difference]: Start difference. First operand 1715 states and 2353 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:55:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:17,535 INFO L93 Difference]: Finished difference Result 3891 states and 5498 transitions. [2022-02-20 21:55:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 21:55:17,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 77 [2022-02-20 21:55:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:55:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:55:17,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2821 transitions. [2022-02-20 21:55:17,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:55:17,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2821 transitions. [2022-02-20 21:55:17,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 2821 transitions. [2022-02-20 21:55:19,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2821 edges. 2821 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:19,917 INFO L225 Difference]: With dead ends: 3891 [2022-02-20 21:55:19,918 INFO L226 Difference]: Without dead ends: 2184 [2022-02-20 21:55:19,923 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 21:55:19,924 INFO L933 BasicCegarLoop]: 1151 mSDtfsCounter, 902 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 1739 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 1739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-02-20 21:55:19,924 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [966 Valid, 2434 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 1739 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-02-20 21:55:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2022-02-20 21:55:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 1825. [2022-02-20 21:55:20,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:55:20,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2184 states. Second operand has 1825 states, 1311 states have (on average 1.3043478260869565) internal successors, (1710), 1339 states have internal predecessors, (1710), 382 states have call successors, (382), 127 states have call predecessors, (382), 131 states have return successors, (401), 380 states have call predecessors, (401), 381 states have call successors, (401) [2022-02-20 21:55:20,012 INFO L74 IsIncluded]: Start isIncluded. First operand 2184 states. Second operand has 1825 states, 1311 states have (on average 1.3043478260869565) internal successors, (1710), 1339 states have internal predecessors, (1710), 382 states have call successors, (382), 127 states have call predecessors, (382), 131 states have return successors, (401), 380 states have call predecessors, (401), 381 states have call successors, (401) [2022-02-20 21:55:20,015 INFO L87 Difference]: Start difference. First operand 2184 states. Second operand has 1825 states, 1311 states have (on average 1.3043478260869565) internal successors, (1710), 1339 states have internal predecessors, (1710), 382 states have call successors, (382), 127 states have call predecessors, (382), 131 states have return successors, (401), 380 states have call predecessors, (401), 381 states have call successors, (401) [2022-02-20 21:55:20,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:20,158 INFO L93 Difference]: Finished difference Result 2184 states and 3153 transitions. [2022-02-20 21:55:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3153 transitions. [2022-02-20 21:55:20,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:20,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:20,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 1825 states, 1311 states have (on average 1.3043478260869565) internal successors, (1710), 1339 states have internal predecessors, (1710), 382 states have call successors, (382), 127 states have call predecessors, (382), 131 states have return successors, (401), 380 states have call predecessors, (401), 381 states have call successors, (401) Second operand 2184 states. [2022-02-20 21:55:20,188 INFO L87 Difference]: Start difference. First operand has 1825 states, 1311 states have (on average 1.3043478260869565) internal successors, (1710), 1339 states have internal predecessors, (1710), 382 states have call successors, (382), 127 states have call predecessors, (382), 131 states have return successors, (401), 380 states have call predecessors, (401), 381 states have call successors, (401) Second operand 2184 states. [2022-02-20 21:55:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:20,346 INFO L93 Difference]: Finished difference Result 2184 states and 3153 transitions. [2022-02-20 21:55:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3153 transitions. [2022-02-20 21:55:20,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:20,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:20,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:55:20,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:55:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1311 states have (on average 1.3043478260869565) internal successors, (1710), 1339 states have internal predecessors, (1710), 382 states have call successors, (382), 127 states have call predecessors, (382), 131 states have return successors, (401), 380 states have call predecessors, (401), 381 states have call successors, (401) [2022-02-20 21:55:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2493 transitions. [2022-02-20 21:55:20,517 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2493 transitions. Word has length 77 [2022-02-20 21:55:20,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:55:20,519 INFO L470 AbstractCegarLoop]: Abstraction has 1825 states and 2493 transitions. [2022-02-20 21:55:20,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 5 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 21:55:20,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2493 transitions. [2022-02-20 21:55:20,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 21:55:20,523 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:20,524 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-02-20 21:55:20,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:55:20,524 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:20,524 INFO L85 PathProgramCache]: Analyzing trace with hash 549574912, now seen corresponding path program 1 times [2022-02-20 21:55:20,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:20,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973844921] [2022-02-20 21:55:20,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:20,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:20,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:20,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {23467#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {23417#true} is VALID [2022-02-20 21:55:20,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {23417#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {23417#true} is VALID [2022-02-20 21:55:20,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23417#true} {23417#true} #2187#return; {23417#true} is VALID [2022-02-20 21:55:20,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:55:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:20,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {23467#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {23417#true} is VALID [2022-02-20 21:55:20,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {23417#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {23417#true} is VALID [2022-02-20 21:55:20,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23417#true} {23417#true} #2189#return; {23417#true} is VALID [2022-02-20 21:55:20,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:55:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:20,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {23467#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {23417#true} is VALID [2022-02-20 21:55:20,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {23417#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {23417#true} is VALID [2022-02-20 21:55:20,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23417#true} {23427#(= ~ldv_state_variable_1~0 1)} #2311#return; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 21:55:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:20,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {23467#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {23417#true} is VALID [2022-02-20 21:55:20,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {23417#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {23417#true} is VALID [2022-02-20 21:55:20,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23417#true} {23427#(= ~ldv_state_variable_1~0 1)} #2313#return; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-02-20 21:55:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:20,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:20,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {23417#true} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset;call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~skb.base, 224 + ~skb.offset, 8);call #t~mem84 := read~int(~skb.base, 214 + ~skb.offset, 2);#res.base, #res.offset := #t~mem83.base, #t~mem83.offset + (if #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 else #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {23417#true} is VALID [2022-02-20 21:55:20,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,738 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23417#true} {23417#true} #2113#return; {23417#true} is VALID [2022-02-20 21:55:20,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:55:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:20,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:20,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {23485#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~4;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~4 := 0; {23417#true} is VALID [2022-02-20 21:55:20,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {23417#true} assume !false; {23417#true} is VALID [2022-02-20 21:55:20,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {23417#true} assume !(~i~4 < ~last_index~0); {23417#true} is VALID [2022-02-20 21:55:20,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {23417#true} assume -1 != ~deleted_index~0;~i~4 := 1 + ~deleted_index~0; {23417#true} is VALID [2022-02-20 21:55:20,764 INFO L290 TraceCheckUtils]: 4: Hoare triple {23417#true} assume !false; {23417#true} is VALID [2022-02-20 21:55:20,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {23417#true} assume !(~i~4 < ~last_index~0); {23417#true} is VALID [2022-02-20 21:55:20,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {23417#true} ~last_index~0 := ~last_index~0 - 1; {23417#true} is VALID [2022-02-20 21:55:20,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,765 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {23417#true} {23417#true} #2029#return; {23417#true} is VALID [2022-02-20 21:55:20,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {23485#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {23417#true} is VALID [2022-02-20 21:55:20,766 INFO L272 TraceCheckUtils]: 1: Hoare triple {23417#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {23485#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:20,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {23485#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~4;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~4 := 0; {23417#true} is VALID [2022-02-20 21:55:20,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {23417#true} assume !false; {23417#true} is VALID [2022-02-20 21:55:20,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {23417#true} assume !(~i~4 < ~last_index~0); {23417#true} is VALID [2022-02-20 21:55:20,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {23417#true} assume -1 != ~deleted_index~0;~i~4 := 1 + ~deleted_index~0; {23417#true} is VALID [2022-02-20 21:55:20,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {23417#true} assume !false; {23417#true} is VALID [2022-02-20 21:55:20,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {23417#true} assume !(~i~4 < ~last_index~0); {23417#true} is VALID [2022-02-20 21:55:20,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {23417#true} ~last_index~0 := ~last_index~0 - 1; {23417#true} is VALID [2022-02-20 21:55:20,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,767 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23417#true} {23417#true} #2029#return; {23417#true} is VALID [2022-02-20 21:55:20,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,767 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {23417#true} {23417#true} #2149#return; {23417#true} is VALID [2022-02-20 21:55:20,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {23468#(and (= |old(abs_6365)| abs_6365) (= |old(#length)| |#length|) (= |old(abs_6497)| abs_6497) (= |#memory_int| |old(#memory_int)|) (= |old(abs_5837)| abs_5837) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5856)| abs_5856) (= |old(abs_6498)| abs_6498) (= |old(abs_5854)| abs_5854) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~phydev#1.base, ~phydev#1.offset := #in~phydev#1.base, #in~phydev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~type#1 := #in~type#1;havoc ~dp83640~8#1.base, ~dp83640~8#1.offset;havoc ~tmp~37#1;call #t~mem438#1.base, #t~mem438#1.offset := read~$Pointer$(~phydev#1.base, 1468 + ~phydev#1.offset, 8);~dp83640~8#1.base, ~dp83640~8#1.offset := #t~mem438#1.base, #t~mem438#1.offset;havoc #t~mem438#1.base, #t~mem438#1.offset;call #t~mem439#1 := read~int(~dp83640~8#1.base, 112 + ~dp83640~8#1.offset, 4); {23417#true} is VALID [2022-02-20 21:55:20,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {23417#true} assume !(0 == #t~mem439#1);havoc #t~mem439#1;assume { :begin_inline_is_status_frame } true;is_status_frame_#in~skb#1.base, is_status_frame_#in~skb#1.offset, is_status_frame_#in~type#1 := ~skb#1.base, ~skb#1.offset, ~type#1;havoc is_status_frame_#res#1;havoc is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset, is_status_frame_#t~ret226#1, is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset, is_status_frame_~type#1, is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset, is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset, is_status_frame_~tmp___0~7#1;is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset := is_status_frame_#in~skb#1.base, is_status_frame_#in~skb#1.offset;is_status_frame_~type#1 := is_status_frame_#in~type#1;havoc is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset;havoc is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset;havoc is_status_frame_~tmp___0~7#1;assume { :begin_inline_eth_hdr } true;eth_hdr_#in~skb#1.base, eth_hdr_#in~skb#1.offset := is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset;havoc eth_hdr_#res#1.base, eth_hdr_#res#1.offset;havoc eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset, eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset, eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset;eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset := eth_hdr_#in~skb#1.base, eth_hdr_#in~skb#1.offset;havoc eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset; {23417#true} is VALID [2022-02-20 21:55:20,768 INFO L272 TraceCheckUtils]: 2: Hoare triple {23417#true} call eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset := skb_mac_header(eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset); {23417#true} is VALID [2022-02-20 21:55:20,768 INFO L290 TraceCheckUtils]: 3: Hoare triple {23417#true} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset;call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~skb.base, 224 + ~skb.offset, 8);call #t~mem84 := read~int(~skb.base, 214 + ~skb.offset, 2);#res.base, #res.offset := #t~mem83.base, #t~mem83.offset + (if #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 else #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {23417#true} is VALID [2022-02-20 21:55:20,768 INFO L290 TraceCheckUtils]: 4: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,768 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {23417#true} {23417#true} #2113#return; {23417#true} is VALID [2022-02-20 21:55:20,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {23417#true} eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset := eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset;havoc eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset;eth_hdr_#res#1.base, eth_hdr_#res#1.offset := eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset; {23417#true} is VALID [2022-02-20 21:55:20,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {23417#true} is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset := eth_hdr_#res#1.base, eth_hdr_#res#1.offset;assume { :end_inline_eth_hdr } true;is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset := is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset;havoc is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset;is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset := is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset; {23417#true} is VALID [2022-02-20 21:55:20,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {23417#true} assume !(50 == is_status_frame_~type#1);is_status_frame_#res#1 := 0; {23417#true} is VALID [2022-02-20 21:55:20,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {23417#true} #t~ret440#1 := is_status_frame_#res#1;assume { :end_inline_is_status_frame } true;~tmp~37#1 := #t~ret440#1;havoc #t~ret440#1; {23417#true} is VALID [2022-02-20 21:55:20,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {23417#true} assume 0 != ~tmp~37#1 % 256;assume { :begin_inline_decode_status_frame } true;decode_status_frame_#in~dp83640#1.base, decode_status_frame_#in~dp83640#1.offset, decode_status_frame_#in~skb#1.base, decode_status_frame_#in~skb#1.offset := ~dp83640~8#1.base, ~dp83640~8#1.offset, ~skb#1.base, ~skb#1.offset;havoc decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset, decode_status_frame_#t~ret316#1, decode_status_frame_#t~mem317#1, decode_status_frame_#t~ret320#1, decode_status_frame_#t~nondet318#1, decode_status_frame_#t~nondet319#1, decode_status_frame_~dp83640#1.base, decode_status_frame_~dp83640#1.offset, decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset, decode_status_frame_~phy_rxts~0#1.base, decode_status_frame_~phy_rxts~0#1.offset, decode_status_frame_~phy_txts~1#1.base, decode_status_frame_~phy_txts~1#1.offset, decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset, decode_status_frame_~len~0#1, decode_status_frame_~size~0#1, decode_status_frame_~ests~0#1, decode_status_frame_~type~0#1, decode_status_frame_~tmp~26#1;decode_status_frame_~dp83640#1.base, decode_status_frame_~dp83640#1.offset := decode_status_frame_#in~dp83640#1.base, decode_status_frame_#in~dp83640#1.offset;decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset := decode_status_frame_#in~skb#1.base, decode_status_frame_#in~skb#1.offset;havoc decode_status_frame_~phy_rxts~0#1.base, decode_status_frame_~phy_rxts~0#1.offset;havoc decode_status_frame_~phy_txts~1#1.base, decode_status_frame_~phy_txts~1#1.offset;havoc decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset;havoc decode_status_frame_~len~0#1;havoc decode_status_frame_~size~0#1;havoc decode_status_frame_~ests~0#1;havoc decode_status_frame_~type~0#1;havoc decode_status_frame_~tmp~26#1;call decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset := read~$Pointer$(decode_status_frame_~skb#1.base, 232 + decode_status_frame_~skb#1.offset, 8);decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset := decode_status_frame_#t~mem315#1.base, 2 + decode_status_frame_#t~mem315#1.offset;havoc decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset;assume { :begin_inline_skb_headlen } true;skb_headlen_#in~skb#1.base, skb_headlen_#in~skb#1.offset := decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset;havoc skb_headlen_#res#1;havoc skb_headlen_#t~mem81#1, skb_headlen_#t~mem82#1, skb_headlen_~skb#1.base, skb_headlen_~skb#1.offset;skb_headlen_~skb#1.base, skb_headlen_~skb#1.offset := skb_headlen_#in~skb#1.base, skb_headlen_#in~skb#1.offset;call skb_headlen_#t~mem81#1 := read~int(skb_headlen_~skb#1.base, 104 + skb_headlen_~skb#1.offset, 4);call skb_headlen_#t~mem82#1 := read~int(skb_headlen_~skb#1.base, 108 + skb_headlen_~skb#1.offset, 4);skb_headlen_#res#1 := skb_headlen_#t~mem81#1 - skb_headlen_#t~mem82#1;havoc skb_headlen_#t~mem81#1;havoc skb_headlen_#t~mem82#1; {23417#true} is VALID [2022-02-20 21:55:20,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {23417#true} decode_status_frame_#t~ret316#1 := skb_headlen_#res#1;assume { :end_inline_skb_headlen } true;decode_status_frame_~tmp~26#1 := decode_status_frame_#t~ret316#1;havoc decode_status_frame_#t~ret316#1;decode_status_frame_~len~0#1 := (if (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 <= 2147483647 then (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 else (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 - 4294967296); {23417#true} is VALID [2022-02-20 21:55:20,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {23417#true} assume !(decode_status_frame_~len~0#1 % 4294967296 > 2); {23417#true} is VALID [2022-02-20 21:55:20,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {23417#true} assume { :end_inline_decode_status_frame } true;assume { :begin_inline_ldv_kfree_skb_18 } true;ldv_kfree_skb_18_#in~ldv_func_arg1#1.base, ldv_kfree_skb_18_#in~ldv_func_arg1#1.offset := ~skb#1.base, ~skb#1.offset;havoc ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset;ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset := ldv_kfree_skb_18_#in~ldv_func_arg1#1.base, ldv_kfree_skb_18_#in~ldv_func_arg1#1.offset; {23417#true} is VALID [2022-02-20 21:55:20,771 INFO L272 TraceCheckUtils]: 14: Hoare triple {23417#true} call ldv_skb_free(ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset); {23485#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:20,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {23485#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {23417#true} is VALID [2022-02-20 21:55:20,772 INFO L272 TraceCheckUtils]: 16: Hoare triple {23417#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {23485#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:20,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {23485#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~4;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~4 := 0; {23417#true} is VALID [2022-02-20 21:55:20,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {23417#true} assume !false; {23417#true} is VALID [2022-02-20 21:55:20,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {23417#true} assume !(~i~4 < ~last_index~0); {23417#true} is VALID [2022-02-20 21:55:20,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {23417#true} assume -1 != ~deleted_index~0;~i~4 := 1 + ~deleted_index~0; {23417#true} is VALID [2022-02-20 21:55:20,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {23417#true} assume !false; {23417#true} is VALID [2022-02-20 21:55:20,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {23417#true} assume !(~i~4 < ~last_index~0); {23417#true} is VALID [2022-02-20 21:55:20,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {23417#true} ~last_index~0 := ~last_index~0 - 1; {23417#true} is VALID [2022-02-20 21:55:20,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,773 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {23417#true} {23417#true} #2029#return; {23417#true} is VALID [2022-02-20 21:55:20,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,776 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {23417#true} {23417#true} #2149#return; {23417#true} is VALID [2022-02-20 21:55:20,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {23417#true} assume { :end_inline_ldv_kfree_skb_18 } true;#res#1 := 1; {23417#true} is VALID [2022-02-20 21:55:20,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,784 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {23417#true} {23418#false} #2267#return; {23418#false} is VALID [2022-02-20 21:55:20,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {23417#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(102, 2);call #Ultimate.allocInit(22, 3);call #Ultimate.allocInit(7, 4);call write~init~int(71, 4, 0, 1);call write~init~int(80, 4, 1, 1);call write~init~int(73, 4, 2, 1);call write~init~int(79, 4, 3, 1);call write~init~int(37, 4, 4, 1);call write~init~int(100, 4, 5, 1);call write~init~int(0, 4, 6, 1);call #Ultimate.allocInit(40, 5);call #Ultimate.allocInit(29, 6);call #Ultimate.allocInit(19, 7);call #Ultimate.allocInit(50, 8);call #Ultimate.allocInit(36, 9);call #Ultimate.allocInit(39, 10);call #Ultimate.allocInit(35, 11);call #Ultimate.allocInit(35, 12);call #Ultimate.allocInit(35, 13);call #Ultimate.allocInit(35, 14);call #Ultimate.allocInit(41, 15);call #Ultimate.allocInit(8, 16);call #Ultimate.allocInit(12, 17);call #Ultimate.allocInit(222, 18);call #Ultimate.allocInit(28, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(8, 21);call #Ultimate.allocInit(12, 22);call #Ultimate.allocInit(222, 23);call #Ultimate.allocInit(35, 24);call #Ultimate.allocInit(44, 25);call #Ultimate.allocInit(46, 26);call #Ultimate.allocInit(20, 27);call #Ultimate.allocInit(19, 28);call #Ultimate.allocInit(14, 29);call #Ultimate.allocInit(20, 30);call #Ultimate.allocInit(28, 31);call #Ultimate.allocInit(16, 32);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~dp83640_driver_group0~0.base, ~dp83640_driver_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~dp83640_driver_group1~0.base, ~dp83640_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~chosen_phy~0 := -1;~#gpio_tab~0.base, ~#gpio_tab~0.offset := 33, 0;call #Ultimate.allocInit(16, 33);call write~init~int(1, ~#gpio_tab~0.base, ~#gpio_tab~0.offset, 2);call write~init~int(2, ~#gpio_tab~0.base, 2 + ~#gpio_tab~0.offset, 2);call write~init~int(3, ~#gpio_tab~0.base, 4 + ~#gpio_tab~0.offset, 2);call write~init~int(4, ~#gpio_tab~0.base, 6 + ~#gpio_tab~0.offset, 2);call write~init~int(8, ~#gpio_tab~0.base, 8 + ~#gpio_tab~0.offset, 2);call write~init~int(9, ~#gpio_tab~0.base, 10 + ~#gpio_tab~0.offset, 2);call write~init~int(10, ~#gpio_tab~0.base, 12 + ~#gpio_tab~0.offset, 2);call write~init~int(11, ~#gpio_tab~0.base, 14 + ~#gpio_tab~0.offset, 2);~#phyter_clocks~0.base, ~#phyter_clocks~0.offset := 34, 0;call #Ultimate.allocInit(16, 34);call write~init~$Pointer$(~#phyter_clocks~0.base, ~#phyter_clocks~0.offset, ~#phyter_clocks~0.base, ~#phyter_clocks~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks~0.base, ~#phyter_clocks~0.offset, ~#phyter_clocks~0.base, 8 + ~#phyter_clocks~0.offset, 8);~#phyter_clocks_lock~0.base, ~#phyter_clocks_lock~0.offset := 35, 0;call #Ultimate.allocInit(156, 35);call write~init~int(1, ~#phyter_clocks_lock~0.base, ~#phyter_clocks_lock~0.offset, 4);call write~init~int(0, ~#phyter_clocks_lock~0.base, 4 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(3735899821, ~#phyter_clocks_lock~0.base, 8 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(4294967295, ~#phyter_clocks_lock~0.base, 12 + ~#phyter_clocks_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#phyter_clocks_lock~0.base, 16 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 24 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 32 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 40 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#phyter_clocks_lock~0.base, 48 + ~#phyter_clocks_lock~0.offset, 8);call write~init~int(0, ~#phyter_clocks_lock~0.base, 56 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(0, ~#phyter_clocks_lock~0.base, 60 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks_lock~0.base, 72 + ~#phyter_clocks_lock~0.offset, ~#phyter_clocks_lock~0.base, 72 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks_lock~0.base, 72 + ~#phyter_clocks_lock~0.offset, ~#phyter_clocks_lock~0.base, 80 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 88 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 96 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks_lock~0.base, ~#phyter_clocks_lock~0.offset, ~#phyter_clocks_lock~0.base, 104 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 112 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 120 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 128 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#phyter_clocks_lock~0.base, 136 + ~#phyter_clocks_lock~0.offset, 8);call write~init~int(0, ~#phyter_clocks_lock~0.base, 144 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(0, ~#phyter_clocks_lock~0.base, 148 + ~#phyter_clocks_lock~0.offset, 8);~#status_frame_dst~0.base, ~#status_frame_dst~0.offset := 36, 0;call #Ultimate.allocInit(6, 36);call write~init~int(1, ~#status_frame_dst~0.base, ~#status_frame_dst~0.offset, 1);call write~init~int(27, ~#status_frame_dst~0.base, 1 + ~#status_frame_dst~0.offset, 1);call write~init~int(25, ~#status_frame_dst~0.base, 2 + ~#status_frame_dst~0.offset, 1);call write~init~int(0, ~#status_frame_dst~0.base, 3 + ~#status_frame_dst~0.offset, 1);call write~init~int(0, ~#status_frame_dst~0.base, 4 + ~#status_frame_dst~0.offset, 1);call write~init~int(0, ~#status_frame_dst~0.base, 5 + ~#status_frame_dst~0.offset, 1);~#status_frame_src~0.base, ~#status_frame_src~0.offset := 37, 0;call #Ultimate.allocInit(6, 37);call write~init~int(8, ~#status_frame_src~0.base, ~#status_frame_src~0.offset, 1);call write~init~int(0, ~#status_frame_src~0.base, 1 + ~#status_frame_src~0.offset, 1);call write~init~int(23, ~#status_frame_src~0.base, 2 + ~#status_frame_src~0.offset, 1);call write~init~int(11, ~#status_frame_src~0.base, 3 + ~#status_frame_src~0.offset, 1);call write~init~int(107, ~#status_frame_src~0.base, 4 + ~#status_frame_src~0.offset, 1);call write~init~int(15, ~#status_frame_src~0.base, 5 + ~#status_frame_src~0.offset, 1);~#dp83640_driver~0.base, ~#dp83640_driver~0.offset := 38, 0;call #Ultimate.allocInit(289, 38);call write~init~int(536894689, ~#dp83640_driver~0.base, ~#dp83640_driver~0.offset, 4);call write~init~$Pointer$(32, 0, ~#dp83640_driver~0.base, 4 + ~#dp83640_driver~0.offset, 8);call write~init~int(4294967280, ~#dp83640_driver~0.base, 12 + ~#dp83640_driver~0.offset, 4);call write~init~int(719, ~#dp83640_driver~0.base, 16 + ~#dp83640_driver~0.offset, 4);call write~init~int(1, ~#dp83640_driver~0.base, 20 + ~#dp83640_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 24 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_config_init.base, #funAddr~dp83640_config_init.offset, ~#dp83640_driver~0.base, 32 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_probe.base, #funAddr~dp83640_probe.offset, ~#dp83640_driver~0.base, 40 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 48 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 56 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~genphy_config_aneg.base, #funAddr~genphy_config_aneg.offset, ~#dp83640_driver~0.base, 64 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 72 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~genphy_read_status.base, #funAddr~genphy_read_status.offset, ~#dp83640_driver~0.base, 80 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_ack_interrupt.base, #funAddr~dp83640_ack_interrupt.offset, ~#dp83640_driver~0.base, 88 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_config_intr.base, #funAddr~dp83640_config_intr.offset, ~#dp83640_driver~0.base, 96 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 104 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_remove.base, #funAddr~dp83640_remove.offset, ~#dp83640_driver~0.base, 112 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 120 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_ts_info.base, #funAddr~dp83640_ts_info.offset, ~#dp83640_driver~0.base, 128 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_hwtstamp.base, #funAddr~dp83640_hwtstamp.offset, ~#dp83640_driver~0.base, 136 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_rxtstamp.base, #funAddr~dp83640_rxtstamp.offset, ~#dp83640_driver~0.base, 144 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_txtstamp.base, #funAddr~dp83640_txtstamp.offset, ~#dp83640_driver~0.base, 152 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 160 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 168 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 176 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 184 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#dp83640_driver~0.base, 192 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 200 + ~#dp83640_driver~0.offset, 8);call write~init~int(0, ~#dp83640_driver~0.base, 208 + ~#dp83640_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 209 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 217 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 225 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 233 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 241 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 249 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 257 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 265 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 273 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 281 + ~#dp83640_driver~0.offset, 8);~__mod_mdio__dp83640_tbl_device_table~0.phy_id := 0;~__mod_mdio__dp83640_tbl_device_table~0.phy_id_mask := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 39, 0;call #Ultimate.allocInit(120, 39);#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; {23417#true} is VALID [2022-02-20 21:55:20,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {23417#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet457#1, main_#t~ret458#1.base, main_#t~ret458#1.offset, main_#t~ret459#1.base, main_#t~ret459#1.offset, main_#t~nondet460#1, main_#t~nondet461#1, main_#t~switch462#1, main_#t~nondet463#1, main_#t~switch464#1, main_#t~ret465#1, main_#t~ret466#1, main_#t~ret467#1, main_#t~ret468#1, main_#t~ret469#1, main_#t~ret470#1, main_#t~ret471#1, main_#t~ret472#1, main_#t~ret473#1, main_#t~ret474#1, main_#t~ret475#1, main_#t~ret476#1, main_#t~ret477#1, main_#t~ret478#1, main_#t~ret479#1, main_#t~ret480#1, main_#t~nondet481#1, main_#t~switch482#1, main_#t~ret483#1, main_~ldvarg1~0#1, main_~tmp~41#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset, main_~ldvarg2~0#1, main_~tmp___2~6#1, main_~tmp___3~1#1, main_~tmp___4~1#1, main_~tmp___5~1#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~41#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset;havoc main_~ldvarg2~0#1;havoc main_~tmp___2~6#1;havoc main_~tmp___3~1#1;havoc main_~tmp___4~1#1;havoc main_~tmp___5~1#1;assume -2147483648 <= main_#t~nondet457#1 && main_#t~nondet457#1 <= 2147483647;main_~tmp~41#1 := main_#t~nondet457#1;havoc main_#t~nondet457#1;main_~ldvarg1~0#1 := main_~tmp~41#1; {23417#true} is VALID [2022-02-20 21:55:20,788 INFO L272 TraceCheckUtils]: 2: Hoare triple {23417#true} call main_#t~ret458#1.base, main_#t~ret458#1.offset := ldv_zalloc(40); {23467#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:20,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {23467#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {23417#true} is VALID [2022-02-20 21:55:20,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {23417#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {23417#true} is VALID [2022-02-20 21:55:20,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,789 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {23417#true} {23417#true} #2187#return; {23417#true} is VALID [2022-02-20 21:55:20,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {23417#true} main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset := main_#t~ret458#1.base, main_#t~ret458#1.offset;havoc main_#t~ret458#1.base, main_#t~ret458#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset; {23417#true} is VALID [2022-02-20 21:55:20,790 INFO L272 TraceCheckUtils]: 8: Hoare triple {23417#true} call main_#t~ret459#1.base, main_#t~ret459#1.offset := ldv_zalloc(44); {23467#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:20,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {23467#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {23417#true} is VALID [2022-02-20 21:55:20,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {23417#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {23417#true} is VALID [2022-02-20 21:55:20,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,791 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {23417#true} {23417#true} #2189#return; {23417#true} is VALID [2022-02-20 21:55:20,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {23417#true} main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset := main_#t~ret459#1.base, main_#t~ret459#1.offset;havoc main_#t~ret459#1.base, main_#t~ret459#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset;assume -2147483648 <= main_#t~nondet460#1 && main_#t~nondet460#1 <= 2147483647;main_~tmp___2~6#1 := main_#t~nondet460#1;havoc main_#t~nondet460#1;main_~ldvarg2~0#1 := main_~tmp___2~6#1;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; {23417#true} is VALID [2022-02-20 21:55:20,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {23417#true} assume { :end_inline_ldv_set_init } true; {23417#true} is VALID [2022-02-20 21:55:20,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {23417#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {23417#true} is VALID [2022-02-20 21:55:20,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {23417#true} assume -2147483648 <= main_#t~nondet461#1 && main_#t~nondet461#1 <= 2147483647;main_~tmp___3~1#1 := main_#t~nondet461#1;havoc main_#t~nondet461#1;main_#t~switch462#1 := 0 == main_~tmp___3~1#1; {23417#true} is VALID [2022-02-20 21:55:20,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {23417#true} assume !main_#t~switch462#1;main_#t~switch462#1 := main_#t~switch462#1 || 1 == main_~tmp___3~1#1; {23417#true} is VALID [2022-02-20 21:55:20,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {23417#true} assume main_#t~switch462#1; {23417#true} is VALID [2022-02-20 21:55:20,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {23417#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet481#1 && main_#t~nondet481#1 <= 2147483647;main_~tmp___5~1#1 := main_#t~nondet481#1;havoc main_#t~nondet481#1;main_#t~switch482#1 := 0 == main_~tmp___5~1#1; {23417#true} is VALID [2022-02-20 21:55:20,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {23417#true} assume !main_#t~switch482#1;main_#t~switch482#1 := main_#t~switch482#1 || 1 == main_~tmp___5~1#1; {23417#true} is VALID [2022-02-20 21:55:20,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {23417#true} assume main_#t~switch482#1; {23417#true} is VALID [2022-02-20 21:55:20,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {23417#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_dp83640_init } true;havoc dp83640_init_#res#1;havoc dp83640_init_#t~ret454#1, dp83640_init_~tmp~39#1;havoc dp83640_init_~tmp~39#1;assume { :begin_inline_phy_driver_register } true;phy_driver_register_#in~arg0#1.base, phy_driver_register_#in~arg0#1.offset := ~#dp83640_driver~0.base, ~#dp83640_driver~0.offset;havoc phy_driver_register_#res#1;havoc phy_driver_register_#t~nondet516#1, phy_driver_register_~arg0#1.base, phy_driver_register_~arg0#1.offset;phy_driver_register_~arg0#1.base, phy_driver_register_~arg0#1.offset := phy_driver_register_#in~arg0#1.base, phy_driver_register_#in~arg0#1.offset;assume -2147483648 <= phy_driver_register_#t~nondet516#1 && phy_driver_register_#t~nondet516#1 <= 2147483647;phy_driver_register_#res#1 := phy_driver_register_#t~nondet516#1;havoc phy_driver_register_#t~nondet516#1; {23417#true} is VALID [2022-02-20 21:55:20,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {23417#true} dp83640_init_#t~ret454#1 := phy_driver_register_#res#1;assume { :end_inline_phy_driver_register } true;assume -2147483648 <= dp83640_init_#t~ret454#1 && dp83640_init_#t~ret454#1 <= 2147483647;dp83640_init_~tmp~39#1 := dp83640_init_#t~ret454#1;havoc dp83640_init_#t~ret454#1;dp83640_init_#res#1 := dp83640_init_~tmp~39#1; {23417#true} is VALID [2022-02-20 21:55:20,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {23417#true} main_#t~ret483#1 := dp83640_init_#res#1;assume { :end_inline_dp83640_init } true;assume -2147483648 <= main_#t~ret483#1 && main_#t~ret483#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret483#1;havoc main_#t~ret483#1; {23417#true} is VALID [2022-02-20 21:55:20,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {23417#true} assume 0 == ~ldv_retval_1~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_phy_driver_1 } true;havoc ldv_initialize_phy_driver_1_#t~ret455#1.base, ldv_initialize_phy_driver_1_#t~ret455#1.offset, ldv_initialize_phy_driver_1_#t~ret456#1.base, ldv_initialize_phy_driver_1_#t~ret456#1.offset, ldv_initialize_phy_driver_1_~tmp~40#1.base, ldv_initialize_phy_driver_1_~tmp~40#1.offset, ldv_initialize_phy_driver_1_~tmp___0~17#1.base, ldv_initialize_phy_driver_1_~tmp___0~17#1.offset;havoc ldv_initialize_phy_driver_1_~tmp~40#1.base, ldv_initialize_phy_driver_1_~tmp~40#1.offset;havoc ldv_initialize_phy_driver_1_~tmp___0~17#1.base, ldv_initialize_phy_driver_1_~tmp___0~17#1.offset; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,794 INFO L272 TraceCheckUtils]: 26: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} call ldv_initialize_phy_driver_1_#t~ret455#1.base, ldv_initialize_phy_driver_1_#t~ret455#1.offset := ldv_zalloc(2048); {23467#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:20,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {23467#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {23417#true} is VALID [2022-02-20 21:55:20,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {23417#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {23417#true} is VALID [2022-02-20 21:55:20,795 INFO L290 TraceCheckUtils]: 29: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,796 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {23417#true} {23427#(= ~ldv_state_variable_1~0 1)} #2311#return; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} ldv_initialize_phy_driver_1_~tmp~40#1.base, ldv_initialize_phy_driver_1_~tmp~40#1.offset := ldv_initialize_phy_driver_1_#t~ret455#1.base, ldv_initialize_phy_driver_1_#t~ret455#1.offset;havoc ldv_initialize_phy_driver_1_#t~ret455#1.base, ldv_initialize_phy_driver_1_#t~ret455#1.offset;~dp83640_driver_group0~0.base, ~dp83640_driver_group0~0.offset := ldv_initialize_phy_driver_1_~tmp~40#1.base, ldv_initialize_phy_driver_1_~tmp~40#1.offset; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,797 INFO L272 TraceCheckUtils]: 32: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} call ldv_initialize_phy_driver_1_#t~ret456#1.base, ldv_initialize_phy_driver_1_#t~ret456#1.offset := ldv_zalloc(232); {23467#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:20,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {23467#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {23417#true} is VALID [2022-02-20 21:55:20,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {23417#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {23417#true} is VALID [2022-02-20 21:55:20,798 INFO L290 TraceCheckUtils]: 35: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,798 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {23417#true} {23427#(= ~ldv_state_variable_1~0 1)} #2313#return; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,799 INFO L290 TraceCheckUtils]: 37: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} ldv_initialize_phy_driver_1_~tmp___0~17#1.base, ldv_initialize_phy_driver_1_~tmp___0~17#1.offset := ldv_initialize_phy_driver_1_#t~ret456#1.base, ldv_initialize_phy_driver_1_#t~ret456#1.offset;havoc ldv_initialize_phy_driver_1_#t~ret456#1.base, ldv_initialize_phy_driver_1_#t~ret456#1.offset;~dp83640_driver_group1~0.base, ~dp83640_driver_group1~0.offset := ldv_initialize_phy_driver_1_~tmp___0~17#1.base, ldv_initialize_phy_driver_1_~tmp___0~17#1.offset; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,799 INFO L290 TraceCheckUtils]: 38: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} assume { :end_inline_ldv_initialize_phy_driver_1 } true; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,799 INFO L290 TraceCheckUtils]: 39: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} assume !(0 != ~ldv_retval_1~0); {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,800 INFO L290 TraceCheckUtils]: 40: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} assume -2147483648 <= main_#t~nondet461#1 && main_#t~nondet461#1 <= 2147483647;main_~tmp___3~1#1 := main_#t~nondet461#1;havoc main_#t~nondet461#1;main_#t~switch462#1 := 0 == main_~tmp___3~1#1; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,800 INFO L290 TraceCheckUtils]: 41: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} assume main_#t~switch462#1; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,800 INFO L290 TraceCheckUtils]: 42: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet463#1 && main_#t~nondet463#1 <= 2147483647;main_~tmp___4~1#1 := main_#t~nondet463#1;havoc main_#t~nondet463#1;main_#t~switch464#1 := 0 == main_~tmp___4~1#1; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,801 INFO L290 TraceCheckUtils]: 43: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 1 == main_~tmp___4~1#1; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,801 INFO L290 TraceCheckUtils]: 44: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 2 == main_~tmp___4~1#1; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,802 INFO L290 TraceCheckUtils]: 45: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 3 == main_~tmp___4~1#1; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,802 INFO L290 TraceCheckUtils]: 46: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 4 == main_~tmp___4~1#1; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 5 == main_~tmp___4~1#1; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,803 INFO L290 TraceCheckUtils]: 48: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 6 == main_~tmp___4~1#1; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,803 INFO L290 TraceCheckUtils]: 49: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} assume main_#t~switch464#1; {23427#(= ~ldv_state_variable_1~0 1)} is VALID [2022-02-20 21:55:20,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {23427#(= ~ldv_state_variable_1~0 1)} assume !(1 == ~ldv_state_variable_1~0); {23418#false} is VALID [2022-02-20 21:55:20,805 INFO L290 TraceCheckUtils]: 51: Hoare triple {23418#false} assume 2 == ~ldv_state_variable_1~0; {23418#false} is VALID [2022-02-20 21:55:20,805 INFO L272 TraceCheckUtils]: 52: Hoare triple {23418#false} call main_#t~ret475#1 := dp83640_rxtstamp(~dp83640_driver_group0~0.base, ~dp83640_driver_group0~0.offset, ~dp83640_driver_group1~0.base, ~dp83640_driver_group1~0.offset, main_~ldvarg1~0#1); {23468#(and (= |old(abs_6365)| abs_6365) (= |old(#length)| |#length|) (= |old(abs_6497)| abs_6497) (= |#memory_int| |old(#memory_int)|) (= |old(abs_5837)| abs_5837) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5856)| abs_5856) (= |old(abs_6498)| abs_6498) (= |old(abs_5854)| abs_5854) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:20,805 INFO L290 TraceCheckUtils]: 53: Hoare triple {23468#(and (= |old(abs_6365)| abs_6365) (= |old(#length)| |#length|) (= |old(abs_6497)| abs_6497) (= |#memory_int| |old(#memory_int)|) (= |old(abs_5837)| abs_5837) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5856)| abs_5856) (= |old(abs_6498)| abs_6498) (= |old(abs_5854)| abs_5854) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~phydev#1.base, ~phydev#1.offset := #in~phydev#1.base, #in~phydev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~type#1 := #in~type#1;havoc ~dp83640~8#1.base, ~dp83640~8#1.offset;havoc ~tmp~37#1;call #t~mem438#1.base, #t~mem438#1.offset := read~$Pointer$(~phydev#1.base, 1468 + ~phydev#1.offset, 8);~dp83640~8#1.base, ~dp83640~8#1.offset := #t~mem438#1.base, #t~mem438#1.offset;havoc #t~mem438#1.base, #t~mem438#1.offset;call #t~mem439#1 := read~int(~dp83640~8#1.base, 112 + ~dp83640~8#1.offset, 4); {23417#true} is VALID [2022-02-20 21:55:20,805 INFO L290 TraceCheckUtils]: 54: Hoare triple {23417#true} assume !(0 == #t~mem439#1);havoc #t~mem439#1;assume { :begin_inline_is_status_frame } true;is_status_frame_#in~skb#1.base, is_status_frame_#in~skb#1.offset, is_status_frame_#in~type#1 := ~skb#1.base, ~skb#1.offset, ~type#1;havoc is_status_frame_#res#1;havoc is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset, is_status_frame_#t~ret226#1, is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset, is_status_frame_~type#1, is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset, is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset, is_status_frame_~tmp___0~7#1;is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset := is_status_frame_#in~skb#1.base, is_status_frame_#in~skb#1.offset;is_status_frame_~type#1 := is_status_frame_#in~type#1;havoc is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset;havoc is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset;havoc is_status_frame_~tmp___0~7#1;assume { :begin_inline_eth_hdr } true;eth_hdr_#in~skb#1.base, eth_hdr_#in~skb#1.offset := is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset;havoc eth_hdr_#res#1.base, eth_hdr_#res#1.offset;havoc eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset, eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset, eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset;eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset := eth_hdr_#in~skb#1.base, eth_hdr_#in~skb#1.offset;havoc eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset; {23417#true} is VALID [2022-02-20 21:55:20,805 INFO L272 TraceCheckUtils]: 55: Hoare triple {23417#true} call eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset := skb_mac_header(eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset); {23417#true} is VALID [2022-02-20 21:55:20,806 INFO L290 TraceCheckUtils]: 56: Hoare triple {23417#true} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset;call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~skb.base, 224 + ~skb.offset, 8);call #t~mem84 := read~int(~skb.base, 214 + ~skb.offset, 2);#res.base, #res.offset := #t~mem83.base, #t~mem83.offset + (if #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 else #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {23417#true} is VALID [2022-02-20 21:55:20,806 INFO L290 TraceCheckUtils]: 57: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,806 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {23417#true} {23417#true} #2113#return; {23417#true} is VALID [2022-02-20 21:55:20,806 INFO L290 TraceCheckUtils]: 59: Hoare triple {23417#true} eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset := eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset;havoc eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset;eth_hdr_#res#1.base, eth_hdr_#res#1.offset := eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset; {23417#true} is VALID [2022-02-20 21:55:20,806 INFO L290 TraceCheckUtils]: 60: Hoare triple {23417#true} is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset := eth_hdr_#res#1.base, eth_hdr_#res#1.offset;assume { :end_inline_eth_hdr } true;is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset := is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset;havoc is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset;is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset := is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset; {23417#true} is VALID [2022-02-20 21:55:20,806 INFO L290 TraceCheckUtils]: 61: Hoare triple {23417#true} assume !(50 == is_status_frame_~type#1);is_status_frame_#res#1 := 0; {23417#true} is VALID [2022-02-20 21:55:20,807 INFO L290 TraceCheckUtils]: 62: Hoare triple {23417#true} #t~ret440#1 := is_status_frame_#res#1;assume { :end_inline_is_status_frame } true;~tmp~37#1 := #t~ret440#1;havoc #t~ret440#1; {23417#true} is VALID [2022-02-20 21:55:20,807 INFO L290 TraceCheckUtils]: 63: Hoare triple {23417#true} assume 0 != ~tmp~37#1 % 256;assume { :begin_inline_decode_status_frame } true;decode_status_frame_#in~dp83640#1.base, decode_status_frame_#in~dp83640#1.offset, decode_status_frame_#in~skb#1.base, decode_status_frame_#in~skb#1.offset := ~dp83640~8#1.base, ~dp83640~8#1.offset, ~skb#1.base, ~skb#1.offset;havoc decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset, decode_status_frame_#t~ret316#1, decode_status_frame_#t~mem317#1, decode_status_frame_#t~ret320#1, decode_status_frame_#t~nondet318#1, decode_status_frame_#t~nondet319#1, decode_status_frame_~dp83640#1.base, decode_status_frame_~dp83640#1.offset, decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset, decode_status_frame_~phy_rxts~0#1.base, decode_status_frame_~phy_rxts~0#1.offset, decode_status_frame_~phy_txts~1#1.base, decode_status_frame_~phy_txts~1#1.offset, decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset, decode_status_frame_~len~0#1, decode_status_frame_~size~0#1, decode_status_frame_~ests~0#1, decode_status_frame_~type~0#1, decode_status_frame_~tmp~26#1;decode_status_frame_~dp83640#1.base, decode_status_frame_~dp83640#1.offset := decode_status_frame_#in~dp83640#1.base, decode_status_frame_#in~dp83640#1.offset;decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset := decode_status_frame_#in~skb#1.base, decode_status_frame_#in~skb#1.offset;havoc decode_status_frame_~phy_rxts~0#1.base, decode_status_frame_~phy_rxts~0#1.offset;havoc decode_status_frame_~phy_txts~1#1.base, decode_status_frame_~phy_txts~1#1.offset;havoc decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset;havoc decode_status_frame_~len~0#1;havoc decode_status_frame_~size~0#1;havoc decode_status_frame_~ests~0#1;havoc decode_status_frame_~type~0#1;havoc decode_status_frame_~tmp~26#1;call decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset := read~$Pointer$(decode_status_frame_~skb#1.base, 232 + decode_status_frame_~skb#1.offset, 8);decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset := decode_status_frame_#t~mem315#1.base, 2 + decode_status_frame_#t~mem315#1.offset;havoc decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset;assume { :begin_inline_skb_headlen } true;skb_headlen_#in~skb#1.base, skb_headlen_#in~skb#1.offset := decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset;havoc skb_headlen_#res#1;havoc skb_headlen_#t~mem81#1, skb_headlen_#t~mem82#1, skb_headlen_~skb#1.base, skb_headlen_~skb#1.offset;skb_headlen_~skb#1.base, skb_headlen_~skb#1.offset := skb_headlen_#in~skb#1.base, skb_headlen_#in~skb#1.offset;call skb_headlen_#t~mem81#1 := read~int(skb_headlen_~skb#1.base, 104 + skb_headlen_~skb#1.offset, 4);call skb_headlen_#t~mem82#1 := read~int(skb_headlen_~skb#1.base, 108 + skb_headlen_~skb#1.offset, 4);skb_headlen_#res#1 := skb_headlen_#t~mem81#1 - skb_headlen_#t~mem82#1;havoc skb_headlen_#t~mem81#1;havoc skb_headlen_#t~mem82#1; {23417#true} is VALID [2022-02-20 21:55:20,807 INFO L290 TraceCheckUtils]: 64: Hoare triple {23417#true} decode_status_frame_#t~ret316#1 := skb_headlen_#res#1;assume { :end_inline_skb_headlen } true;decode_status_frame_~tmp~26#1 := decode_status_frame_#t~ret316#1;havoc decode_status_frame_#t~ret316#1;decode_status_frame_~len~0#1 := (if (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 <= 2147483647 then (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 else (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 - 4294967296); {23417#true} is VALID [2022-02-20 21:55:20,807 INFO L290 TraceCheckUtils]: 65: Hoare triple {23417#true} assume !(decode_status_frame_~len~0#1 % 4294967296 > 2); {23417#true} is VALID [2022-02-20 21:55:20,808 INFO L290 TraceCheckUtils]: 66: Hoare triple {23417#true} assume { :end_inline_decode_status_frame } true;assume { :begin_inline_ldv_kfree_skb_18 } true;ldv_kfree_skb_18_#in~ldv_func_arg1#1.base, ldv_kfree_skb_18_#in~ldv_func_arg1#1.offset := ~skb#1.base, ~skb#1.offset;havoc ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset;ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset := ldv_kfree_skb_18_#in~ldv_func_arg1#1.base, ldv_kfree_skb_18_#in~ldv_func_arg1#1.offset; {23417#true} is VALID [2022-02-20 21:55:20,808 INFO L272 TraceCheckUtils]: 67: Hoare triple {23417#true} call ldv_skb_free(ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset); {23485#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:20,809 INFO L290 TraceCheckUtils]: 68: Hoare triple {23485#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {23417#true} is VALID [2022-02-20 21:55:20,809 INFO L272 TraceCheckUtils]: 69: Hoare triple {23417#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {23485#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:20,810 INFO L290 TraceCheckUtils]: 70: Hoare triple {23485#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~4;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~4 := 0; {23417#true} is VALID [2022-02-20 21:55:20,810 INFO L290 TraceCheckUtils]: 71: Hoare triple {23417#true} assume !false; {23417#true} is VALID [2022-02-20 21:55:20,810 INFO L290 TraceCheckUtils]: 72: Hoare triple {23417#true} assume !(~i~4 < ~last_index~0); {23417#true} is VALID [2022-02-20 21:55:20,810 INFO L290 TraceCheckUtils]: 73: Hoare triple {23417#true} assume -1 != ~deleted_index~0;~i~4 := 1 + ~deleted_index~0; {23417#true} is VALID [2022-02-20 21:55:20,810 INFO L290 TraceCheckUtils]: 74: Hoare triple {23417#true} assume !false; {23417#true} is VALID [2022-02-20 21:55:20,810 INFO L290 TraceCheckUtils]: 75: Hoare triple {23417#true} assume !(~i~4 < ~last_index~0); {23417#true} is VALID [2022-02-20 21:55:20,811 INFO L290 TraceCheckUtils]: 76: Hoare triple {23417#true} ~last_index~0 := ~last_index~0 - 1; {23417#true} is VALID [2022-02-20 21:55:20,811 INFO L290 TraceCheckUtils]: 77: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,811 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {23417#true} {23417#true} #2029#return; {23417#true} is VALID [2022-02-20 21:55:20,811 INFO L290 TraceCheckUtils]: 79: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,811 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {23417#true} {23417#true} #2149#return; {23417#true} is VALID [2022-02-20 21:55:20,811 INFO L290 TraceCheckUtils]: 81: Hoare triple {23417#true} assume { :end_inline_ldv_kfree_skb_18 } true;#res#1 := 1; {23417#true} is VALID [2022-02-20 21:55:20,811 INFO L290 TraceCheckUtils]: 82: Hoare triple {23417#true} assume true; {23417#true} is VALID [2022-02-20 21:55:20,811 INFO L284 TraceCheckUtils]: 83: Hoare quadruple {23417#true} {23418#false} #2267#return; {23418#false} is VALID [2022-02-20 21:55:20,812 INFO L290 TraceCheckUtils]: 84: Hoare triple {23418#false} havoc main_#t~ret475#1;~ldv_state_variable_1~0 := 2; {23418#false} is VALID [2022-02-20 21:55:20,812 INFO L290 TraceCheckUtils]: 85: Hoare triple {23418#false} assume -2147483648 <= main_#t~nondet461#1 && main_#t~nondet461#1 <= 2147483647;main_~tmp___3~1#1 := main_#t~nondet461#1;havoc main_#t~nondet461#1;main_#t~switch462#1 := 0 == main_~tmp___3~1#1; {23418#false} is VALID [2022-02-20 21:55:20,812 INFO L290 TraceCheckUtils]: 86: Hoare triple {23418#false} assume !main_#t~switch462#1;main_#t~switch462#1 := main_#t~switch462#1 || 1 == main_~tmp___3~1#1; {23418#false} is VALID [2022-02-20 21:55:20,812 INFO L290 TraceCheckUtils]: 87: Hoare triple {23418#false} assume main_#t~switch462#1; {23418#false} is VALID [2022-02-20 21:55:20,812 INFO L290 TraceCheckUtils]: 88: Hoare triple {23418#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet481#1 && main_#t~nondet481#1 <= 2147483647;main_~tmp___5~1#1 := main_#t~nondet481#1;havoc main_#t~nondet481#1;main_#t~switch482#1 := 0 == main_~tmp___5~1#1; {23418#false} is VALID [2022-02-20 21:55:20,812 INFO L290 TraceCheckUtils]: 89: Hoare triple {23418#false} assume !main_#t~switch482#1;main_#t~switch482#1 := main_#t~switch482#1 || 1 == main_~tmp___5~1#1; {23418#false} is VALID [2022-02-20 21:55:20,812 INFO L290 TraceCheckUtils]: 90: Hoare triple {23418#false} assume main_#t~switch482#1; {23418#false} is VALID [2022-02-20 21:55:20,813 INFO L290 TraceCheckUtils]: 91: Hoare triple {23418#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_dp83640_init } true;havoc dp83640_init_#res#1;havoc dp83640_init_#t~ret454#1, dp83640_init_~tmp~39#1;havoc dp83640_init_~tmp~39#1;assume { :begin_inline_phy_driver_register } true;phy_driver_register_#in~arg0#1.base, phy_driver_register_#in~arg0#1.offset := ~#dp83640_driver~0.base, ~#dp83640_driver~0.offset;havoc phy_driver_register_#res#1;havoc phy_driver_register_#t~nondet516#1, phy_driver_register_~arg0#1.base, phy_driver_register_~arg0#1.offset;phy_driver_register_~arg0#1.base, phy_driver_register_~arg0#1.offset := phy_driver_register_#in~arg0#1.base, phy_driver_register_#in~arg0#1.offset;assume -2147483648 <= phy_driver_register_#t~nondet516#1 && phy_driver_register_#t~nondet516#1 <= 2147483647;phy_driver_register_#res#1 := phy_driver_register_#t~nondet516#1;havoc phy_driver_register_#t~nondet516#1; {23418#false} is VALID [2022-02-20 21:55:20,813 INFO L290 TraceCheckUtils]: 92: Hoare triple {23418#false} dp83640_init_#t~ret454#1 := phy_driver_register_#res#1;assume { :end_inline_phy_driver_register } true;assume -2147483648 <= dp83640_init_#t~ret454#1 && dp83640_init_#t~ret454#1 <= 2147483647;dp83640_init_~tmp~39#1 := dp83640_init_#t~ret454#1;havoc dp83640_init_#t~ret454#1;dp83640_init_#res#1 := dp83640_init_~tmp~39#1; {23418#false} is VALID [2022-02-20 21:55:20,813 INFO L290 TraceCheckUtils]: 93: Hoare triple {23418#false} main_#t~ret483#1 := dp83640_init_#res#1;assume { :end_inline_dp83640_init } true;assume -2147483648 <= main_#t~ret483#1 && main_#t~ret483#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret483#1;havoc main_#t~ret483#1; {23418#false} is VALID [2022-02-20 21:55:20,813 INFO L290 TraceCheckUtils]: 94: Hoare triple {23418#false} assume !(0 == ~ldv_retval_1~0); {23418#false} is VALID [2022-02-20 21:55:20,813 INFO L290 TraceCheckUtils]: 95: Hoare triple {23418#false} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {23418#false} is VALID [2022-02-20 21:55:20,813 INFO L290 TraceCheckUtils]: 96: Hoare triple {23418#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret500#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#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); {23418#false} is VALID [2022-02-20 21:55:20,813 INFO L290 TraceCheckUtils]: 97: Hoare triple {23418#false} ldv_check_final_state_#t~ret500#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret500#1 && ldv_check_final_state_#t~ret500#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret500#1;havoc ldv_check_final_state_#t~ret500#1; {23418#false} is VALID [2022-02-20 21:55:20,814 INFO L290 TraceCheckUtils]: 98: Hoare triple {23418#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {23418#false} is VALID [2022-02-20 21:55:20,814 INFO L272 TraceCheckUtils]: 99: Hoare triple {23418#false} call ldv_error(); {23418#false} is VALID [2022-02-20 21:55:20,814 INFO L290 TraceCheckUtils]: 100: Hoare triple {23418#false} assume !false; {23418#false} is VALID [2022-02-20 21:55:20,816 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 21:55:20,816 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:20,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973844921] [2022-02-20 21:55:20,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973844921] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:20,817 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:20,817 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:55:20,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143205853] [2022-02-20 21:55:20,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:20,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 101 [2022-02-20 21:55:20,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:20,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 21:55:20,873 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:55:20,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:55:20,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:20,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:55:20,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:55:20,875 INFO L87 Difference]: Start difference. First operand 1825 states and 2493 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 21:55:29,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 21:55:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:37,395 INFO L93 Difference]: Finished difference Result 5681 states and 8049 transitions. [2022-02-20 21:55:37,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 21:55:37,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 101 [2022-02-20 21:55:37,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:55:37,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 21:55:37,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3976 transitions. [2022-02-20 21:55:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 21:55:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3976 transitions. [2022-02-20 21:55:37,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 3976 transitions. [2022-02-20 21:55:40,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3976 edges. 3976 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:41,547 INFO L225 Difference]: With dead ends: 5681 [2022-02-20 21:55:41,547 INFO L226 Difference]: Without dead ends: 3885 [2022-02-20 21:55:41,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-02-20 21:55:41,553 INFO L933 BasicCegarLoop]: 1249 mSDtfsCounter, 3109 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 1643 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3273 SdHoareTripleChecker+Valid, 2411 SdHoareTripleChecker+Invalid, 3738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1643 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-02-20 21:55:41,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3273 Valid, 2411 Invalid, 3738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1643 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-02-20 21:55:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3885 states. [2022-02-20 21:55:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3885 to 3192. [2022-02-20 21:55:41,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:55:41,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3885 states. Second operand has 3192 states, 2318 states have (on average 1.2959447799827437) internal successors, (3004), 2360 states have internal predecessors, (3004), 630 states have call successors, (630), 234 states have call predecessors, (630), 243 states have return successors, (657), 627 states have call predecessors, (657), 629 states have call successors, (657) [2022-02-20 21:55:41,656 INFO L74 IsIncluded]: Start isIncluded. First operand 3885 states. Second operand has 3192 states, 2318 states have (on average 1.2959447799827437) internal successors, (3004), 2360 states have internal predecessors, (3004), 630 states have call successors, (630), 234 states have call predecessors, (630), 243 states have return successors, (657), 627 states have call predecessors, (657), 629 states have call successors, (657) [2022-02-20 21:55:41,661 INFO L87 Difference]: Start difference. First operand 3885 states. Second operand has 3192 states, 2318 states have (on average 1.2959447799827437) internal successors, (3004), 2360 states have internal predecessors, (3004), 630 states have call successors, (630), 234 states have call predecessors, (630), 243 states have return successors, (657), 627 states have call predecessors, (657), 629 states have call successors, (657) [2022-02-20 21:55:42,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:42,105 INFO L93 Difference]: Finished difference Result 3885 states and 5548 transitions. [2022-02-20 21:55:42,106 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 5548 transitions. [2022-02-20 21:55:42,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:42,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:42,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 3192 states, 2318 states have (on average 1.2959447799827437) internal successors, (3004), 2360 states have internal predecessors, (3004), 630 states have call successors, (630), 234 states have call predecessors, (630), 243 states have return successors, (657), 627 states have call predecessors, (657), 629 states have call successors, (657) Second operand 3885 states. [2022-02-20 21:55:42,133 INFO L87 Difference]: Start difference. First operand has 3192 states, 2318 states have (on average 1.2959447799827437) internal successors, (3004), 2360 states have internal predecessors, (3004), 630 states have call successors, (630), 234 states have call predecessors, (630), 243 states have return successors, (657), 627 states have call predecessors, (657), 629 states have call successors, (657) Second operand 3885 states. [2022-02-20 21:55:42,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:55:42,571 INFO L93 Difference]: Finished difference Result 3885 states and 5548 transitions. [2022-02-20 21:55:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 5548 transitions. [2022-02-20 21:55:42,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:55:42,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:55:42,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:55:42,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:55:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3192 states, 2318 states have (on average 1.2959447799827437) internal successors, (3004), 2360 states have internal predecessors, (3004), 630 states have call successors, (630), 234 states have call predecessors, (630), 243 states have return successors, (657), 627 states have call predecessors, (657), 629 states have call successors, (657) [2022-02-20 21:55:43,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3192 states to 3192 states and 4291 transitions. [2022-02-20 21:55:43,070 INFO L78 Accepts]: Start accepts. Automaton has 3192 states and 4291 transitions. Word has length 101 [2022-02-20 21:55:43,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:55:43,070 INFO L470 AbstractCegarLoop]: Abstraction has 3192 states and 4291 transitions. [2022-02-20 21:55:43,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 5 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 21:55:43,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3192 states and 4291 transitions. [2022-02-20 21:55:43,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 21:55:43,074 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:55:43,074 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-02-20 21:55:43,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:55:43,075 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:55:43,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:55:43,075 INFO L85 PathProgramCache]: Analyzing trace with hash 614230688, now seen corresponding path program 1 times [2022-02-20 21:55:43,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:55:43,076 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960477762] [2022-02-20 21:55:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:55:43,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:55:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:43,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:43,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {43490#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {43441#true} is VALID [2022-02-20 21:55:43,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {43441#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {43441#true} is VALID [2022-02-20 21:55:43,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {43441#true} assume true; {43441#true} is VALID [2022-02-20 21:55:43,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43441#true} {43441#true} #2187#return; {43441#true} is VALID [2022-02-20 21:55:43,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 21:55:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:43,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {43490#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {43441#true} is VALID [2022-02-20 21:55:43,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {43441#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {43441#true} is VALID [2022-02-20 21:55:43,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {43441#true} assume true; {43441#true} is VALID [2022-02-20 21:55:43,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43441#true} {43441#true} #2189#return; {43441#true} is VALID [2022-02-20 21:55:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-20 21:55:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:43,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {43490#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {43441#true} is VALID [2022-02-20 21:55:43,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {43441#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {43441#true} is VALID [2022-02-20 21:55:43,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {43441#true} assume true; {43441#true} is VALID [2022-02-20 21:55:43,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43441#true} {43441#true} #2311#return; {43441#true} is VALID [2022-02-20 21:55:43,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 21:55:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:43,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {43490#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {43441#true} is VALID [2022-02-20 21:55:43,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {43441#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {43441#true} is VALID [2022-02-20 21:55:43,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {43441#true} assume true; {43441#true} is VALID [2022-02-20 21:55:43,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43441#true} {43441#true} #2313#return; {43441#true} is VALID [2022-02-20 21:55:43,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-02-20 21:55:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:43,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:55:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:43,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {43441#true} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset;call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~skb.base, 224 + ~skb.offset, 8);call #t~mem84 := read~int(~skb.base, 214 + ~skb.offset, 2);#res.base, #res.offset := #t~mem83.base, #t~mem83.offset + (if #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 else #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {43441#true} is VALID [2022-02-20 21:55:43,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {43441#true} assume true; {43441#true} is VALID [2022-02-20 21:55:43,211 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43441#true} {43441#true} #2113#return; {43441#true} is VALID [2022-02-20 21:55:43,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 21:55:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:43,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:55:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:55:43,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {43508#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~4;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~4 := 0; {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:43,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !false; {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:43,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !(~i~4 < ~last_index~0); {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:43,240 INFO L290 TraceCheckUtils]: 3: Hoare triple {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume -1 != ~deleted_index~0;~i~4 := 1 + ~deleted_index~0; {43442#false} is VALID [2022-02-20 21:55:43,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {43442#false} assume !false; {43442#false} is VALID [2022-02-20 21:55:43,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {43442#false} assume !(~i~4 < ~last_index~0); {43442#false} is VALID [2022-02-20 21:55:43,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {43442#false} ~last_index~0 := ~last_index~0 - 1; {43442#false} is VALID [2022-02-20 21:55:43,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {43442#false} assume true; {43442#false} is VALID [2022-02-20 21:55:43,240 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {43442#false} {43441#true} #2029#return; {43442#false} is VALID [2022-02-20 21:55:43,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {43508#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {43441#true} is VALID [2022-02-20 21:55:43,241 INFO L272 TraceCheckUtils]: 1: Hoare triple {43441#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {43508#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:43,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {43508#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~4;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~4 := 0; {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:43,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !false; {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:43,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !(~i~4 < ~last_index~0); {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:43,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume -1 != ~deleted_index~0;~i~4 := 1 + ~deleted_index~0; {43442#false} is VALID [2022-02-20 21:55:43,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {43442#false} assume !false; {43442#false} is VALID [2022-02-20 21:55:43,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {43442#false} assume !(~i~4 < ~last_index~0); {43442#false} is VALID [2022-02-20 21:55:43,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {43442#false} ~last_index~0 := ~last_index~0 - 1; {43442#false} is VALID [2022-02-20 21:55:43,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {43442#false} assume true; {43442#false} is VALID [2022-02-20 21:55:43,243 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43442#false} {43441#true} #2029#return; {43442#false} is VALID [2022-02-20 21:55:43,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {43442#false} assume true; {43442#false} is VALID [2022-02-20 21:55:43,244 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {43442#false} {43441#true} #2149#return; {43442#false} is VALID [2022-02-20 21:55:43,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {43491#(and (= |old(abs_6365)| abs_6365) (= |old(#length)| |#length|) (= |old(abs_6497)| abs_6497) (= |#memory_int| |old(#memory_int)|) (= |old(abs_5837)| abs_5837) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5856)| abs_5856) (= |old(abs_6498)| abs_6498) (= |old(abs_5854)| abs_5854) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~phydev#1.base, ~phydev#1.offset := #in~phydev#1.base, #in~phydev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~type#1 := #in~type#1;havoc ~dp83640~8#1.base, ~dp83640~8#1.offset;havoc ~tmp~37#1;call #t~mem438#1.base, #t~mem438#1.offset := read~$Pointer$(~phydev#1.base, 1468 + ~phydev#1.offset, 8);~dp83640~8#1.base, ~dp83640~8#1.offset := #t~mem438#1.base, #t~mem438#1.offset;havoc #t~mem438#1.base, #t~mem438#1.offset;call #t~mem439#1 := read~int(~dp83640~8#1.base, 112 + ~dp83640~8#1.offset, 4); {43441#true} is VALID [2022-02-20 21:55:43,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {43441#true} assume !(0 == #t~mem439#1);havoc #t~mem439#1;assume { :begin_inline_is_status_frame } true;is_status_frame_#in~skb#1.base, is_status_frame_#in~skb#1.offset, is_status_frame_#in~type#1 := ~skb#1.base, ~skb#1.offset, ~type#1;havoc is_status_frame_#res#1;havoc is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset, is_status_frame_#t~ret226#1, is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset, is_status_frame_~type#1, is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset, is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset, is_status_frame_~tmp___0~7#1;is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset := is_status_frame_#in~skb#1.base, is_status_frame_#in~skb#1.offset;is_status_frame_~type#1 := is_status_frame_#in~type#1;havoc is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset;havoc is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset;havoc is_status_frame_~tmp___0~7#1;assume { :begin_inline_eth_hdr } true;eth_hdr_#in~skb#1.base, eth_hdr_#in~skb#1.offset := is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset;havoc eth_hdr_#res#1.base, eth_hdr_#res#1.offset;havoc eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset, eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset, eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset;eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset := eth_hdr_#in~skb#1.base, eth_hdr_#in~skb#1.offset;havoc eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset; {43441#true} is VALID [2022-02-20 21:55:43,244 INFO L272 TraceCheckUtils]: 2: Hoare triple {43441#true} call eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset := skb_mac_header(eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset); {43441#true} is VALID [2022-02-20 21:55:43,244 INFO L290 TraceCheckUtils]: 3: Hoare triple {43441#true} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset;call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~skb.base, 224 + ~skb.offset, 8);call #t~mem84 := read~int(~skb.base, 214 + ~skb.offset, 2);#res.base, #res.offset := #t~mem83.base, #t~mem83.offset + (if #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 else #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {43441#true} is VALID [2022-02-20 21:55:43,244 INFO L290 TraceCheckUtils]: 4: Hoare triple {43441#true} assume true; {43441#true} is VALID [2022-02-20 21:55:43,244 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {43441#true} {43441#true} #2113#return; {43441#true} is VALID [2022-02-20 21:55:43,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {43441#true} eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset := eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset;havoc eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset;eth_hdr_#res#1.base, eth_hdr_#res#1.offset := eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset; {43441#true} is VALID [2022-02-20 21:55:43,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {43441#true} is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset := eth_hdr_#res#1.base, eth_hdr_#res#1.offset;assume { :end_inline_eth_hdr } true;is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset := is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset;havoc is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset;is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset := is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset; {43441#true} is VALID [2022-02-20 21:55:43,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {43441#true} assume !(50 == is_status_frame_~type#1);is_status_frame_#res#1 := 0; {43441#true} is VALID [2022-02-20 21:55:43,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {43441#true} #t~ret440#1 := is_status_frame_#res#1;assume { :end_inline_is_status_frame } true;~tmp~37#1 := #t~ret440#1;havoc #t~ret440#1; {43441#true} is VALID [2022-02-20 21:55:43,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {43441#true} assume 0 != ~tmp~37#1 % 256;assume { :begin_inline_decode_status_frame } true;decode_status_frame_#in~dp83640#1.base, decode_status_frame_#in~dp83640#1.offset, decode_status_frame_#in~skb#1.base, decode_status_frame_#in~skb#1.offset := ~dp83640~8#1.base, ~dp83640~8#1.offset, ~skb#1.base, ~skb#1.offset;havoc decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset, decode_status_frame_#t~ret316#1, decode_status_frame_#t~mem317#1, decode_status_frame_#t~ret320#1, decode_status_frame_#t~nondet318#1, decode_status_frame_#t~nondet319#1, decode_status_frame_~dp83640#1.base, decode_status_frame_~dp83640#1.offset, decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset, decode_status_frame_~phy_rxts~0#1.base, decode_status_frame_~phy_rxts~0#1.offset, decode_status_frame_~phy_txts~1#1.base, decode_status_frame_~phy_txts~1#1.offset, decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset, decode_status_frame_~len~0#1, decode_status_frame_~size~0#1, decode_status_frame_~ests~0#1, decode_status_frame_~type~0#1, decode_status_frame_~tmp~26#1;decode_status_frame_~dp83640#1.base, decode_status_frame_~dp83640#1.offset := decode_status_frame_#in~dp83640#1.base, decode_status_frame_#in~dp83640#1.offset;decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset := decode_status_frame_#in~skb#1.base, decode_status_frame_#in~skb#1.offset;havoc decode_status_frame_~phy_rxts~0#1.base, decode_status_frame_~phy_rxts~0#1.offset;havoc decode_status_frame_~phy_txts~1#1.base, decode_status_frame_~phy_txts~1#1.offset;havoc decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset;havoc decode_status_frame_~len~0#1;havoc decode_status_frame_~size~0#1;havoc decode_status_frame_~ests~0#1;havoc decode_status_frame_~type~0#1;havoc decode_status_frame_~tmp~26#1;call decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset := read~$Pointer$(decode_status_frame_~skb#1.base, 232 + decode_status_frame_~skb#1.offset, 8);decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset := decode_status_frame_#t~mem315#1.base, 2 + decode_status_frame_#t~mem315#1.offset;havoc decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset;assume { :begin_inline_skb_headlen } true;skb_headlen_#in~skb#1.base, skb_headlen_#in~skb#1.offset := decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset;havoc skb_headlen_#res#1;havoc skb_headlen_#t~mem81#1, skb_headlen_#t~mem82#1, skb_headlen_~skb#1.base, skb_headlen_~skb#1.offset;skb_headlen_~skb#1.base, skb_headlen_~skb#1.offset := skb_headlen_#in~skb#1.base, skb_headlen_#in~skb#1.offset;call skb_headlen_#t~mem81#1 := read~int(skb_headlen_~skb#1.base, 104 + skb_headlen_~skb#1.offset, 4);call skb_headlen_#t~mem82#1 := read~int(skb_headlen_~skb#1.base, 108 + skb_headlen_~skb#1.offset, 4);skb_headlen_#res#1 := skb_headlen_#t~mem81#1 - skb_headlen_#t~mem82#1;havoc skb_headlen_#t~mem81#1;havoc skb_headlen_#t~mem82#1; {43441#true} is VALID [2022-02-20 21:55:43,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {43441#true} decode_status_frame_#t~ret316#1 := skb_headlen_#res#1;assume { :end_inline_skb_headlen } true;decode_status_frame_~tmp~26#1 := decode_status_frame_#t~ret316#1;havoc decode_status_frame_#t~ret316#1;decode_status_frame_~len~0#1 := (if (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 <= 2147483647 then (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 else (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 - 4294967296); {43441#true} is VALID [2022-02-20 21:55:43,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {43441#true} assume !(decode_status_frame_~len~0#1 % 4294967296 > 2); {43441#true} is VALID [2022-02-20 21:55:43,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {43441#true} assume { :end_inline_decode_status_frame } true;assume { :begin_inline_ldv_kfree_skb_18 } true;ldv_kfree_skb_18_#in~ldv_func_arg1#1.base, ldv_kfree_skb_18_#in~ldv_func_arg1#1.offset := ~skb#1.base, ~skb#1.offset;havoc ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset;ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset := ldv_kfree_skb_18_#in~ldv_func_arg1#1.base, ldv_kfree_skb_18_#in~ldv_func_arg1#1.offset; {43441#true} is VALID [2022-02-20 21:55:43,246 INFO L272 TraceCheckUtils]: 14: Hoare triple {43441#true} call ldv_skb_free(ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset); {43508#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:43,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {43508#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {43441#true} is VALID [2022-02-20 21:55:43,247 INFO L272 TraceCheckUtils]: 16: Hoare triple {43441#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {43508#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:43,248 INFO L290 TraceCheckUtils]: 17: Hoare triple {43508#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~4;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~4 := 0; {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:43,248 INFO L290 TraceCheckUtils]: 18: Hoare triple {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !false; {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:43,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !(~i~4 < ~last_index~0); {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:43,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume -1 != ~deleted_index~0;~i~4 := 1 + ~deleted_index~0; {43442#false} is VALID [2022-02-20 21:55:43,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {43442#false} assume !false; {43442#false} is VALID [2022-02-20 21:55:43,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {43442#false} assume !(~i~4 < ~last_index~0); {43442#false} is VALID [2022-02-20 21:55:43,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {43442#false} ~last_index~0 := ~last_index~0 - 1; {43442#false} is VALID [2022-02-20 21:55:43,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {43442#false} assume true; {43442#false} is VALID [2022-02-20 21:55:43,249 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {43442#false} {43441#true} #2029#return; {43442#false} is VALID [2022-02-20 21:55:43,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {43442#false} assume true; {43442#false} is VALID [2022-02-20 21:55:43,249 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {43442#false} {43441#true} #2149#return; {43442#false} is VALID [2022-02-20 21:55:43,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {43442#false} assume { :end_inline_ldv_kfree_skb_18 } true;#res#1 := 1; {43442#false} is VALID [2022-02-20 21:55:43,250 INFO L290 TraceCheckUtils]: 29: Hoare triple {43442#false} assume true; {43442#false} is VALID [2022-02-20 21:55:43,250 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {43442#false} {43441#true} #2265#return; {43442#false} is VALID [2022-02-20 21:55:43,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {43441#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(102, 2);call #Ultimate.allocInit(22, 3);call #Ultimate.allocInit(7, 4);call write~init~int(71, 4, 0, 1);call write~init~int(80, 4, 1, 1);call write~init~int(73, 4, 2, 1);call write~init~int(79, 4, 3, 1);call write~init~int(37, 4, 4, 1);call write~init~int(100, 4, 5, 1);call write~init~int(0, 4, 6, 1);call #Ultimate.allocInit(40, 5);call #Ultimate.allocInit(29, 6);call #Ultimate.allocInit(19, 7);call #Ultimate.allocInit(50, 8);call #Ultimate.allocInit(36, 9);call #Ultimate.allocInit(39, 10);call #Ultimate.allocInit(35, 11);call #Ultimate.allocInit(35, 12);call #Ultimate.allocInit(35, 13);call #Ultimate.allocInit(35, 14);call #Ultimate.allocInit(41, 15);call #Ultimate.allocInit(8, 16);call #Ultimate.allocInit(12, 17);call #Ultimate.allocInit(222, 18);call #Ultimate.allocInit(28, 19);call #Ultimate.allocInit(37, 20);call #Ultimate.allocInit(8, 21);call #Ultimate.allocInit(12, 22);call #Ultimate.allocInit(222, 23);call #Ultimate.allocInit(35, 24);call #Ultimate.allocInit(44, 25);call #Ultimate.allocInit(46, 26);call #Ultimate.allocInit(20, 27);call #Ultimate.allocInit(19, 28);call #Ultimate.allocInit(14, 29);call #Ultimate.allocInit(20, 30);call #Ultimate.allocInit(28, 31);call #Ultimate.allocInit(16, 32);~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~dp83640_driver_group0~0.base, ~dp83640_driver_group0~0.offset := 0, 0;~ldv_state_variable_1~0 := 0;~dp83640_driver_group1~0.base, ~dp83640_driver_group1~0.offset := 0, 0;~ldv_state_variable_0~0 := 0;~chosen_phy~0 := -1;~#gpio_tab~0.base, ~#gpio_tab~0.offset := 33, 0;call #Ultimate.allocInit(16, 33);call write~init~int(1, ~#gpio_tab~0.base, ~#gpio_tab~0.offset, 2);call write~init~int(2, ~#gpio_tab~0.base, 2 + ~#gpio_tab~0.offset, 2);call write~init~int(3, ~#gpio_tab~0.base, 4 + ~#gpio_tab~0.offset, 2);call write~init~int(4, ~#gpio_tab~0.base, 6 + ~#gpio_tab~0.offset, 2);call write~init~int(8, ~#gpio_tab~0.base, 8 + ~#gpio_tab~0.offset, 2);call write~init~int(9, ~#gpio_tab~0.base, 10 + ~#gpio_tab~0.offset, 2);call write~init~int(10, ~#gpio_tab~0.base, 12 + ~#gpio_tab~0.offset, 2);call write~init~int(11, ~#gpio_tab~0.base, 14 + ~#gpio_tab~0.offset, 2);~#phyter_clocks~0.base, ~#phyter_clocks~0.offset := 34, 0;call #Ultimate.allocInit(16, 34);call write~init~$Pointer$(~#phyter_clocks~0.base, ~#phyter_clocks~0.offset, ~#phyter_clocks~0.base, ~#phyter_clocks~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks~0.base, ~#phyter_clocks~0.offset, ~#phyter_clocks~0.base, 8 + ~#phyter_clocks~0.offset, 8);~#phyter_clocks_lock~0.base, ~#phyter_clocks_lock~0.offset := 35, 0;call #Ultimate.allocInit(156, 35);call write~init~int(1, ~#phyter_clocks_lock~0.base, ~#phyter_clocks_lock~0.offset, 4);call write~init~int(0, ~#phyter_clocks_lock~0.base, 4 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(3735899821, ~#phyter_clocks_lock~0.base, 8 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(4294967295, ~#phyter_clocks_lock~0.base, 12 + ~#phyter_clocks_lock~0.offset, 4);call write~init~$Pointer$(0, -1, ~#phyter_clocks_lock~0.base, 16 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 24 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 32 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 40 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(6, 0, ~#phyter_clocks_lock~0.base, 48 + ~#phyter_clocks_lock~0.offset, 8);call write~init~int(0, ~#phyter_clocks_lock~0.base, 56 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(0, ~#phyter_clocks_lock~0.base, 60 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks_lock~0.base, 72 + ~#phyter_clocks_lock~0.offset, ~#phyter_clocks_lock~0.base, 72 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks_lock~0.base, 72 + ~#phyter_clocks_lock~0.offset, ~#phyter_clocks_lock~0.base, 80 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 88 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 96 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(~#phyter_clocks_lock~0.base, ~#phyter_clocks_lock~0.offset, ~#phyter_clocks_lock~0.base, 104 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 112 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 120 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(0, 0, ~#phyter_clocks_lock~0.base, 128 + ~#phyter_clocks_lock~0.offset, 8);call write~init~$Pointer$(7, 0, ~#phyter_clocks_lock~0.base, 136 + ~#phyter_clocks_lock~0.offset, 8);call write~init~int(0, ~#phyter_clocks_lock~0.base, 144 + ~#phyter_clocks_lock~0.offset, 4);call write~init~int(0, ~#phyter_clocks_lock~0.base, 148 + ~#phyter_clocks_lock~0.offset, 8);~#status_frame_dst~0.base, ~#status_frame_dst~0.offset := 36, 0;call #Ultimate.allocInit(6, 36);call write~init~int(1, ~#status_frame_dst~0.base, ~#status_frame_dst~0.offset, 1);call write~init~int(27, ~#status_frame_dst~0.base, 1 + ~#status_frame_dst~0.offset, 1);call write~init~int(25, ~#status_frame_dst~0.base, 2 + ~#status_frame_dst~0.offset, 1);call write~init~int(0, ~#status_frame_dst~0.base, 3 + ~#status_frame_dst~0.offset, 1);call write~init~int(0, ~#status_frame_dst~0.base, 4 + ~#status_frame_dst~0.offset, 1);call write~init~int(0, ~#status_frame_dst~0.base, 5 + ~#status_frame_dst~0.offset, 1);~#status_frame_src~0.base, ~#status_frame_src~0.offset := 37, 0;call #Ultimate.allocInit(6, 37);call write~init~int(8, ~#status_frame_src~0.base, ~#status_frame_src~0.offset, 1);call write~init~int(0, ~#status_frame_src~0.base, 1 + ~#status_frame_src~0.offset, 1);call write~init~int(23, ~#status_frame_src~0.base, 2 + ~#status_frame_src~0.offset, 1);call write~init~int(11, ~#status_frame_src~0.base, 3 + ~#status_frame_src~0.offset, 1);call write~init~int(107, ~#status_frame_src~0.base, 4 + ~#status_frame_src~0.offset, 1);call write~init~int(15, ~#status_frame_src~0.base, 5 + ~#status_frame_src~0.offset, 1);~#dp83640_driver~0.base, ~#dp83640_driver~0.offset := 38, 0;call #Ultimate.allocInit(289, 38);call write~init~int(536894689, ~#dp83640_driver~0.base, ~#dp83640_driver~0.offset, 4);call write~init~$Pointer$(32, 0, ~#dp83640_driver~0.base, 4 + ~#dp83640_driver~0.offset, 8);call write~init~int(4294967280, ~#dp83640_driver~0.base, 12 + ~#dp83640_driver~0.offset, 4);call write~init~int(719, ~#dp83640_driver~0.base, 16 + ~#dp83640_driver~0.offset, 4);call write~init~int(1, ~#dp83640_driver~0.base, 20 + ~#dp83640_driver~0.offset, 4);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 24 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_config_init.base, #funAddr~dp83640_config_init.offset, ~#dp83640_driver~0.base, 32 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_probe.base, #funAddr~dp83640_probe.offset, ~#dp83640_driver~0.base, 40 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 48 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 56 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~genphy_config_aneg.base, #funAddr~genphy_config_aneg.offset, ~#dp83640_driver~0.base, 64 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 72 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~genphy_read_status.base, #funAddr~genphy_read_status.offset, ~#dp83640_driver~0.base, 80 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_ack_interrupt.base, #funAddr~dp83640_ack_interrupt.offset, ~#dp83640_driver~0.base, 88 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_config_intr.base, #funAddr~dp83640_config_intr.offset, ~#dp83640_driver~0.base, 96 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 104 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_remove.base, #funAddr~dp83640_remove.offset, ~#dp83640_driver~0.base, 112 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 120 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_ts_info.base, #funAddr~dp83640_ts_info.offset, ~#dp83640_driver~0.base, 128 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_hwtstamp.base, #funAddr~dp83640_hwtstamp.offset, ~#dp83640_driver~0.base, 136 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_rxtstamp.base, #funAddr~dp83640_rxtstamp.offset, ~#dp83640_driver~0.base, 144 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~dp83640_txtstamp.base, #funAddr~dp83640_txtstamp.offset, ~#dp83640_driver~0.base, 152 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 160 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 168 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 176 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 184 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#dp83640_driver~0.base, 192 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 200 + ~#dp83640_driver~0.offset, 8);call write~init~int(0, ~#dp83640_driver~0.base, 208 + ~#dp83640_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 209 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 217 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 225 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 233 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 241 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 249 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 257 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 265 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 273 + ~#dp83640_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#dp83640_driver~0.base, 281 + ~#dp83640_driver~0.offset, 8);~__mod_mdio__dp83640_tbl_device_table~0.phy_id := 0;~__mod_mdio__dp83640_tbl_device_table~0.phy_id_mask := 0;~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~#set_impl~0.base, ~#set_impl~0.offset := 39, 0;call #Ultimate.allocInit(120, 39);#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; {43441#true} is VALID [2022-02-20 21:55:43,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {43441#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet457#1, main_#t~ret458#1.base, main_#t~ret458#1.offset, main_#t~ret459#1.base, main_#t~ret459#1.offset, main_#t~nondet460#1, main_#t~nondet461#1, main_#t~switch462#1, main_#t~nondet463#1, main_#t~switch464#1, main_#t~ret465#1, main_#t~ret466#1, main_#t~ret467#1, main_#t~ret468#1, main_#t~ret469#1, main_#t~ret470#1, main_#t~ret471#1, main_#t~ret472#1, main_#t~ret473#1, main_#t~ret474#1, main_#t~ret475#1, main_#t~ret476#1, main_#t~ret477#1, main_#t~ret478#1, main_#t~ret479#1, main_#t~ret480#1, main_#t~nondet481#1, main_#t~switch482#1, main_#t~ret483#1, main_~ldvarg1~0#1, main_~tmp~41#1, main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset, main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset, main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset, main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset, main_~ldvarg2~0#1, main_~tmp___2~6#1, main_~tmp___3~1#1, main_~tmp___4~1#1, main_~tmp___5~1#1;havoc main_~ldvarg1~0#1;havoc main_~tmp~41#1;havoc main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset;havoc main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset;havoc main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset;havoc main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset;havoc main_~ldvarg2~0#1;havoc main_~tmp___2~6#1;havoc main_~tmp___3~1#1;havoc main_~tmp___4~1#1;havoc main_~tmp___5~1#1;assume -2147483648 <= main_#t~nondet457#1 && main_#t~nondet457#1 <= 2147483647;main_~tmp~41#1 := main_#t~nondet457#1;havoc main_#t~nondet457#1;main_~ldvarg1~0#1 := main_~tmp~41#1; {43441#true} is VALID [2022-02-20 21:55:43,251 INFO L272 TraceCheckUtils]: 2: Hoare triple {43441#true} call main_#t~ret458#1.base, main_#t~ret458#1.offset := ldv_zalloc(40); {43490#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {43490#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {43441#true} is VALID [2022-02-20 21:55:43,251 INFO L290 TraceCheckUtils]: 4: Hoare triple {43441#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {43441#true} is VALID [2022-02-20 21:55:43,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {43441#true} assume true; {43441#true} is VALID [2022-02-20 21:55:43,251 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {43441#true} {43441#true} #2187#return; {43441#true} is VALID [2022-02-20 21:55:43,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {43441#true} main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset := main_#t~ret458#1.base, main_#t~ret458#1.offset;havoc main_#t~ret458#1.base, main_#t~ret458#1.offset;main_~ldvarg3~0#1.base, main_~ldvarg3~0#1.offset := main_~tmp___0~18#1.base, main_~tmp___0~18#1.offset; {43441#true} is VALID [2022-02-20 21:55:43,252 INFO L272 TraceCheckUtils]: 8: Hoare triple {43441#true} call main_#t~ret459#1.base, main_#t~ret459#1.offset := ldv_zalloc(44); {43490#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {43490#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {43441#true} is VALID [2022-02-20 21:55:43,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {43441#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {43441#true} is VALID [2022-02-20 21:55:43,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {43441#true} assume true; {43441#true} is VALID [2022-02-20 21:55:43,252 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {43441#true} {43441#true} #2189#return; {43441#true} is VALID [2022-02-20 21:55:43,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {43441#true} main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset := main_#t~ret459#1.base, main_#t~ret459#1.offset;havoc main_#t~ret459#1.base, main_#t~ret459#1.offset;main_~ldvarg0~0#1.base, main_~ldvarg0~0#1.offset := main_~tmp___1~10#1.base, main_~tmp___1~10#1.offset;assume -2147483648 <= main_#t~nondet460#1 && main_#t~nondet460#1 <= 2147483647;main_~tmp___2~6#1 := main_#t~nondet460#1;havoc main_#t~nondet460#1;main_~ldvarg2~0#1 := main_~tmp___2~6#1;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; {43441#true} is VALID [2022-02-20 21:55:43,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {43441#true} assume { :end_inline_ldv_set_init } true; {43441#true} is VALID [2022-02-20 21:55:43,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {43441#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {43441#true} is VALID [2022-02-20 21:55:43,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {43441#true} assume -2147483648 <= main_#t~nondet461#1 && main_#t~nondet461#1 <= 2147483647;main_~tmp___3~1#1 := main_#t~nondet461#1;havoc main_#t~nondet461#1;main_#t~switch462#1 := 0 == main_~tmp___3~1#1; {43441#true} is VALID [2022-02-20 21:55:43,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {43441#true} assume !main_#t~switch462#1;main_#t~switch462#1 := main_#t~switch462#1 || 1 == main_~tmp___3~1#1; {43441#true} is VALID [2022-02-20 21:55:43,253 INFO L290 TraceCheckUtils]: 18: Hoare triple {43441#true} assume main_#t~switch462#1; {43441#true} is VALID [2022-02-20 21:55:43,253 INFO L290 TraceCheckUtils]: 19: Hoare triple {43441#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet481#1 && main_#t~nondet481#1 <= 2147483647;main_~tmp___5~1#1 := main_#t~nondet481#1;havoc main_#t~nondet481#1;main_#t~switch482#1 := 0 == main_~tmp___5~1#1; {43441#true} is VALID [2022-02-20 21:55:43,253 INFO L290 TraceCheckUtils]: 20: Hoare triple {43441#true} assume !main_#t~switch482#1;main_#t~switch482#1 := main_#t~switch482#1 || 1 == main_~tmp___5~1#1; {43441#true} is VALID [2022-02-20 21:55:43,253 INFO L290 TraceCheckUtils]: 21: Hoare triple {43441#true} assume main_#t~switch482#1; {43441#true} is VALID [2022-02-20 21:55:43,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {43441#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_dp83640_init } true;havoc dp83640_init_#res#1;havoc dp83640_init_#t~ret454#1, dp83640_init_~tmp~39#1;havoc dp83640_init_~tmp~39#1;assume { :begin_inline_phy_driver_register } true;phy_driver_register_#in~arg0#1.base, phy_driver_register_#in~arg0#1.offset := ~#dp83640_driver~0.base, ~#dp83640_driver~0.offset;havoc phy_driver_register_#res#1;havoc phy_driver_register_#t~nondet516#1, phy_driver_register_~arg0#1.base, phy_driver_register_~arg0#1.offset;phy_driver_register_~arg0#1.base, phy_driver_register_~arg0#1.offset := phy_driver_register_#in~arg0#1.base, phy_driver_register_#in~arg0#1.offset;assume -2147483648 <= phy_driver_register_#t~nondet516#1 && phy_driver_register_#t~nondet516#1 <= 2147483647;phy_driver_register_#res#1 := phy_driver_register_#t~nondet516#1;havoc phy_driver_register_#t~nondet516#1; {43441#true} is VALID [2022-02-20 21:55:43,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {43441#true} dp83640_init_#t~ret454#1 := phy_driver_register_#res#1;assume { :end_inline_phy_driver_register } true;assume -2147483648 <= dp83640_init_#t~ret454#1 && dp83640_init_#t~ret454#1 <= 2147483647;dp83640_init_~tmp~39#1 := dp83640_init_#t~ret454#1;havoc dp83640_init_#t~ret454#1;dp83640_init_#res#1 := dp83640_init_~tmp~39#1; {43441#true} is VALID [2022-02-20 21:55:43,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {43441#true} main_#t~ret483#1 := dp83640_init_#res#1;assume { :end_inline_dp83640_init } true;assume -2147483648 <= main_#t~ret483#1 && main_#t~ret483#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret483#1;havoc main_#t~ret483#1; {43441#true} is VALID [2022-02-20 21:55:43,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {43441#true} assume 0 == ~ldv_retval_1~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_phy_driver_1 } true;havoc ldv_initialize_phy_driver_1_#t~ret455#1.base, ldv_initialize_phy_driver_1_#t~ret455#1.offset, ldv_initialize_phy_driver_1_#t~ret456#1.base, ldv_initialize_phy_driver_1_#t~ret456#1.offset, ldv_initialize_phy_driver_1_~tmp~40#1.base, ldv_initialize_phy_driver_1_~tmp~40#1.offset, ldv_initialize_phy_driver_1_~tmp___0~17#1.base, ldv_initialize_phy_driver_1_~tmp___0~17#1.offset;havoc ldv_initialize_phy_driver_1_~tmp~40#1.base, ldv_initialize_phy_driver_1_~tmp~40#1.offset;havoc ldv_initialize_phy_driver_1_~tmp___0~17#1.base, ldv_initialize_phy_driver_1_~tmp___0~17#1.offset; {43441#true} is VALID [2022-02-20 21:55:43,254 INFO L272 TraceCheckUtils]: 26: Hoare triple {43441#true} call ldv_initialize_phy_driver_1_#t~ret455#1.base, ldv_initialize_phy_driver_1_#t~ret455#1.offset := ldv_zalloc(2048); {43490#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {43490#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {43441#true} is VALID [2022-02-20 21:55:43,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {43441#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {43441#true} is VALID [2022-02-20 21:55:43,255 INFO L290 TraceCheckUtils]: 29: Hoare triple {43441#true} assume true; {43441#true} is VALID [2022-02-20 21:55:43,255 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {43441#true} {43441#true} #2311#return; {43441#true} is VALID [2022-02-20 21:55:43,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {43441#true} ldv_initialize_phy_driver_1_~tmp~40#1.base, ldv_initialize_phy_driver_1_~tmp~40#1.offset := ldv_initialize_phy_driver_1_#t~ret455#1.base, ldv_initialize_phy_driver_1_#t~ret455#1.offset;havoc ldv_initialize_phy_driver_1_#t~ret455#1.base, ldv_initialize_phy_driver_1_#t~ret455#1.offset;~dp83640_driver_group0~0.base, ~dp83640_driver_group0~0.offset := ldv_initialize_phy_driver_1_~tmp~40#1.base, ldv_initialize_phy_driver_1_~tmp~40#1.offset; {43441#true} is VALID [2022-02-20 21:55:43,255 INFO L272 TraceCheckUtils]: 32: Hoare triple {43441#true} call ldv_initialize_phy_driver_1_#t~ret456#1.base, ldv_initialize_phy_driver_1_#t~ret456#1.offset := ldv_zalloc(232); {43490#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:55:43,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {43490#(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~9#1.base, ~tmp~9#1.offset;havoc ~tmp___0~3#1;assume -2147483648 <= #t~nondet92#1 && #t~nondet92#1 <= 2147483647;~tmp___0~3#1 := #t~nondet92#1;havoc #t~nondet92#1; {43441#true} is VALID [2022-02-20 21:55:43,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {43441#true} assume 0 != ~tmp___0~3#1;#res#1.base, #res#1.offset := 0, 0; {43441#true} is VALID [2022-02-20 21:55:43,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {43441#true} assume true; {43441#true} is VALID [2022-02-20 21:55:43,256 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {43441#true} {43441#true} #2313#return; {43441#true} is VALID [2022-02-20 21:55:43,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {43441#true} ldv_initialize_phy_driver_1_~tmp___0~17#1.base, ldv_initialize_phy_driver_1_~tmp___0~17#1.offset := ldv_initialize_phy_driver_1_#t~ret456#1.base, ldv_initialize_phy_driver_1_#t~ret456#1.offset;havoc ldv_initialize_phy_driver_1_#t~ret456#1.base, ldv_initialize_phy_driver_1_#t~ret456#1.offset;~dp83640_driver_group1~0.base, ~dp83640_driver_group1~0.offset := ldv_initialize_phy_driver_1_~tmp___0~17#1.base, ldv_initialize_phy_driver_1_~tmp___0~17#1.offset; {43441#true} is VALID [2022-02-20 21:55:43,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {43441#true} assume { :end_inline_ldv_initialize_phy_driver_1 } true; {43441#true} is VALID [2022-02-20 21:55:43,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {43441#true} assume !(0 != ~ldv_retval_1~0); {43441#true} is VALID [2022-02-20 21:55:43,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {43441#true} assume -2147483648 <= main_#t~nondet461#1 && main_#t~nondet461#1 <= 2147483647;main_~tmp___3~1#1 := main_#t~nondet461#1;havoc main_#t~nondet461#1;main_#t~switch462#1 := 0 == main_~tmp___3~1#1; {43441#true} is VALID [2022-02-20 21:55:43,256 INFO L290 TraceCheckUtils]: 41: Hoare triple {43441#true} assume main_#t~switch462#1; {43441#true} is VALID [2022-02-20 21:55:43,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {43441#true} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet463#1 && main_#t~nondet463#1 <= 2147483647;main_~tmp___4~1#1 := main_#t~nondet463#1;havoc main_#t~nondet463#1;main_#t~switch464#1 := 0 == main_~tmp___4~1#1; {43441#true} is VALID [2022-02-20 21:55:43,257 INFO L290 TraceCheckUtils]: 43: Hoare triple {43441#true} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 1 == main_~tmp___4~1#1; {43441#true} is VALID [2022-02-20 21:55:43,257 INFO L290 TraceCheckUtils]: 44: Hoare triple {43441#true} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 2 == main_~tmp___4~1#1; {43441#true} is VALID [2022-02-20 21:55:43,257 INFO L290 TraceCheckUtils]: 45: Hoare triple {43441#true} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 3 == main_~tmp___4~1#1; {43441#true} is VALID [2022-02-20 21:55:43,257 INFO L290 TraceCheckUtils]: 46: Hoare triple {43441#true} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 4 == main_~tmp___4~1#1; {43441#true} is VALID [2022-02-20 21:55:43,257 INFO L290 TraceCheckUtils]: 47: Hoare triple {43441#true} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 5 == main_~tmp___4~1#1; {43441#true} is VALID [2022-02-20 21:55:43,257 INFO L290 TraceCheckUtils]: 48: Hoare triple {43441#true} assume !main_#t~switch464#1;main_#t~switch464#1 := main_#t~switch464#1 || 6 == main_~tmp___4~1#1; {43441#true} is VALID [2022-02-20 21:55:43,257 INFO L290 TraceCheckUtils]: 49: Hoare triple {43441#true} assume main_#t~switch464#1; {43441#true} is VALID [2022-02-20 21:55:43,257 INFO L290 TraceCheckUtils]: 50: Hoare triple {43441#true} assume 1 == ~ldv_state_variable_1~0; {43441#true} is VALID [2022-02-20 21:55:43,259 INFO L272 TraceCheckUtils]: 51: Hoare triple {43441#true} call main_#t~ret474#1 := dp83640_rxtstamp(~dp83640_driver_group0~0.base, ~dp83640_driver_group0~0.offset, ~dp83640_driver_group1~0.base, ~dp83640_driver_group1~0.offset, main_~ldvarg1~0#1); {43491#(and (= |old(abs_6365)| abs_6365) (= |old(#length)| |#length|) (= |old(abs_6497)| abs_6497) (= |#memory_int| |old(#memory_int)|) (= |old(abs_5837)| abs_5837) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5856)| abs_5856) (= |old(abs_6498)| abs_6498) (= |old(abs_5854)| abs_5854) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:43,259 INFO L290 TraceCheckUtils]: 52: Hoare triple {43491#(and (= |old(abs_6365)| abs_6365) (= |old(#length)| |#length|) (= |old(abs_6497)| abs_6497) (= |#memory_int| |old(#memory_int)|) (= |old(abs_5837)| abs_5837) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(abs_5856)| abs_5856) (= |old(abs_6498)| abs_6498) (= |old(abs_5854)| abs_5854) (= |old(#valid)| |#valid|) (= |old(~last_index~0)| ~last_index~0))} ~phydev#1.base, ~phydev#1.offset := #in~phydev#1.base, #in~phydev#1.offset;~skb#1.base, ~skb#1.offset := #in~skb#1.base, #in~skb#1.offset;~type#1 := #in~type#1;havoc ~dp83640~8#1.base, ~dp83640~8#1.offset;havoc ~tmp~37#1;call #t~mem438#1.base, #t~mem438#1.offset := read~$Pointer$(~phydev#1.base, 1468 + ~phydev#1.offset, 8);~dp83640~8#1.base, ~dp83640~8#1.offset := #t~mem438#1.base, #t~mem438#1.offset;havoc #t~mem438#1.base, #t~mem438#1.offset;call #t~mem439#1 := read~int(~dp83640~8#1.base, 112 + ~dp83640~8#1.offset, 4); {43441#true} is VALID [2022-02-20 21:55:43,259 INFO L290 TraceCheckUtils]: 53: Hoare triple {43441#true} assume !(0 == #t~mem439#1);havoc #t~mem439#1;assume { :begin_inline_is_status_frame } true;is_status_frame_#in~skb#1.base, is_status_frame_#in~skb#1.offset, is_status_frame_#in~type#1 := ~skb#1.base, ~skb#1.offset, ~type#1;havoc is_status_frame_#res#1;havoc is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset, is_status_frame_#t~ret226#1, is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset, is_status_frame_~type#1, is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset, is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset, is_status_frame_~tmp___0~7#1;is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset := is_status_frame_#in~skb#1.base, is_status_frame_#in~skb#1.offset;is_status_frame_~type#1 := is_status_frame_#in~type#1;havoc is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset;havoc is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset;havoc is_status_frame_~tmp___0~7#1;assume { :begin_inline_eth_hdr } true;eth_hdr_#in~skb#1.base, eth_hdr_#in~skb#1.offset := is_status_frame_~skb#1.base, is_status_frame_~skb#1.offset;havoc eth_hdr_#res#1.base, eth_hdr_#res#1.offset;havoc eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset, eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset, eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset;eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset := eth_hdr_#in~skb#1.base, eth_hdr_#in~skb#1.offset;havoc eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset; {43441#true} is VALID [2022-02-20 21:55:43,259 INFO L272 TraceCheckUtils]: 54: Hoare triple {43441#true} call eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset := skb_mac_header(eth_hdr_~skb#1.base, eth_hdr_~skb#1.offset); {43441#true} is VALID [2022-02-20 21:55:43,259 INFO L290 TraceCheckUtils]: 55: Hoare triple {43441#true} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset;call #t~mem83.base, #t~mem83.offset := read~$Pointer$(~skb.base, 224 + ~skb.offset, 8);call #t~mem84 := read~int(~skb.base, 214 + ~skb.offset, 2);#res.base, #res.offset := #t~mem83.base, #t~mem83.offset + (if #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 <= 9223372036854775807 then #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 else #t~mem84 % 65536 % 18446744073709551616 % 18446744073709551616 - 18446744073709551616);havoc #t~mem83.base, #t~mem83.offset;havoc #t~mem84; {43441#true} is VALID [2022-02-20 21:55:43,260 INFO L290 TraceCheckUtils]: 56: Hoare triple {43441#true} assume true; {43441#true} is VALID [2022-02-20 21:55:43,260 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {43441#true} {43441#true} #2113#return; {43441#true} is VALID [2022-02-20 21:55:43,260 INFO L290 TraceCheckUtils]: 58: Hoare triple {43441#true} eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset := eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset;havoc eth_hdr_#t~ret97#1.base, eth_hdr_#t~ret97#1.offset;eth_hdr_#res#1.base, eth_hdr_#res#1.offset := eth_hdr_~tmp~12#1.base, eth_hdr_~tmp~12#1.offset; {43441#true} is VALID [2022-02-20 21:55:43,260 INFO L290 TraceCheckUtils]: 59: Hoare triple {43441#true} is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset := eth_hdr_#res#1.base, eth_hdr_#res#1.offset;assume { :end_inline_eth_hdr } true;is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset := is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset;havoc is_status_frame_#t~ret225#1.base, is_status_frame_#t~ret225#1.offset;is_status_frame_~h~0#1.base, is_status_frame_~h~0#1.offset := is_status_frame_~tmp~20#1.base, is_status_frame_~tmp~20#1.offset; {43441#true} is VALID [2022-02-20 21:55:43,260 INFO L290 TraceCheckUtils]: 60: Hoare triple {43441#true} assume !(50 == is_status_frame_~type#1);is_status_frame_#res#1 := 0; {43441#true} is VALID [2022-02-20 21:55:43,260 INFO L290 TraceCheckUtils]: 61: Hoare triple {43441#true} #t~ret440#1 := is_status_frame_#res#1;assume { :end_inline_is_status_frame } true;~tmp~37#1 := #t~ret440#1;havoc #t~ret440#1; {43441#true} is VALID [2022-02-20 21:55:43,260 INFO L290 TraceCheckUtils]: 62: Hoare triple {43441#true} assume 0 != ~tmp~37#1 % 256;assume { :begin_inline_decode_status_frame } true;decode_status_frame_#in~dp83640#1.base, decode_status_frame_#in~dp83640#1.offset, decode_status_frame_#in~skb#1.base, decode_status_frame_#in~skb#1.offset := ~dp83640~8#1.base, ~dp83640~8#1.offset, ~skb#1.base, ~skb#1.offset;havoc decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset, decode_status_frame_#t~ret316#1, decode_status_frame_#t~mem317#1, decode_status_frame_#t~ret320#1, decode_status_frame_#t~nondet318#1, decode_status_frame_#t~nondet319#1, decode_status_frame_~dp83640#1.base, decode_status_frame_~dp83640#1.offset, decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset, decode_status_frame_~phy_rxts~0#1.base, decode_status_frame_~phy_rxts~0#1.offset, decode_status_frame_~phy_txts~1#1.base, decode_status_frame_~phy_txts~1#1.offset, decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset, decode_status_frame_~len~0#1, decode_status_frame_~size~0#1, decode_status_frame_~ests~0#1, decode_status_frame_~type~0#1, decode_status_frame_~tmp~26#1;decode_status_frame_~dp83640#1.base, decode_status_frame_~dp83640#1.offset := decode_status_frame_#in~dp83640#1.base, decode_status_frame_#in~dp83640#1.offset;decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset := decode_status_frame_#in~skb#1.base, decode_status_frame_#in~skb#1.offset;havoc decode_status_frame_~phy_rxts~0#1.base, decode_status_frame_~phy_rxts~0#1.offset;havoc decode_status_frame_~phy_txts~1#1.base, decode_status_frame_~phy_txts~1#1.offset;havoc decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset;havoc decode_status_frame_~len~0#1;havoc decode_status_frame_~size~0#1;havoc decode_status_frame_~ests~0#1;havoc decode_status_frame_~type~0#1;havoc decode_status_frame_~tmp~26#1;call decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset := read~$Pointer$(decode_status_frame_~skb#1.base, 232 + decode_status_frame_~skb#1.offset, 8);decode_status_frame_~ptr~0#1.base, decode_status_frame_~ptr~0#1.offset := decode_status_frame_#t~mem315#1.base, 2 + decode_status_frame_#t~mem315#1.offset;havoc decode_status_frame_#t~mem315#1.base, decode_status_frame_#t~mem315#1.offset;assume { :begin_inline_skb_headlen } true;skb_headlen_#in~skb#1.base, skb_headlen_#in~skb#1.offset := decode_status_frame_~skb#1.base, decode_status_frame_~skb#1.offset;havoc skb_headlen_#res#1;havoc skb_headlen_#t~mem81#1, skb_headlen_#t~mem82#1, skb_headlen_~skb#1.base, skb_headlen_~skb#1.offset;skb_headlen_~skb#1.base, skb_headlen_~skb#1.offset := skb_headlen_#in~skb#1.base, skb_headlen_#in~skb#1.offset;call skb_headlen_#t~mem81#1 := read~int(skb_headlen_~skb#1.base, 104 + skb_headlen_~skb#1.offset, 4);call skb_headlen_#t~mem82#1 := read~int(skb_headlen_~skb#1.base, 108 + skb_headlen_~skb#1.offset, 4);skb_headlen_#res#1 := skb_headlen_#t~mem81#1 - skb_headlen_#t~mem82#1;havoc skb_headlen_#t~mem81#1;havoc skb_headlen_#t~mem82#1; {43441#true} is VALID [2022-02-20 21:55:43,260 INFO L290 TraceCheckUtils]: 63: Hoare triple {43441#true} decode_status_frame_#t~ret316#1 := skb_headlen_#res#1;assume { :end_inline_skb_headlen } true;decode_status_frame_~tmp~26#1 := decode_status_frame_#t~ret316#1;havoc decode_status_frame_#t~ret316#1;decode_status_frame_~len~0#1 := (if (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 <= 2147483647 then (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 else (decode_status_frame_~tmp~26#1 - 2) % 4294967296 % 4294967296 - 4294967296); {43441#true} is VALID [2022-02-20 21:55:43,260 INFO L290 TraceCheckUtils]: 64: Hoare triple {43441#true} assume !(decode_status_frame_~len~0#1 % 4294967296 > 2); {43441#true} is VALID [2022-02-20 21:55:43,261 INFO L290 TraceCheckUtils]: 65: Hoare triple {43441#true} assume { :end_inline_decode_status_frame } true;assume { :begin_inline_ldv_kfree_skb_18 } true;ldv_kfree_skb_18_#in~ldv_func_arg1#1.base, ldv_kfree_skb_18_#in~ldv_func_arg1#1.offset := ~skb#1.base, ~skb#1.offset;havoc ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset;ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset := ldv_kfree_skb_18_#in~ldv_func_arg1#1.base, ldv_kfree_skb_18_#in~ldv_func_arg1#1.offset; {43441#true} is VALID [2022-02-20 21:55:43,261 INFO L272 TraceCheckUtils]: 66: Hoare triple {43441#true} call ldv_skb_free(ldv_kfree_skb_18_~ldv_func_arg1#1.base, ldv_kfree_skb_18_~ldv_func_arg1#1.offset); {43508#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:43,261 INFO L290 TraceCheckUtils]: 67: Hoare triple {43508#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~skb.base, ~skb.offset := #in~skb.base, #in~skb.offset; {43441#true} is VALID [2022-02-20 21:55:43,262 INFO L272 TraceCheckUtils]: 68: Hoare triple {43441#true} call ldv_set_remove(~LDV_SKBS~0.base, ~LDV_SKBS~0.offset, ~skb.base, ~skb.offset); {43508#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} is VALID [2022-02-20 21:55:43,263 INFO L290 TraceCheckUtils]: 69: Hoare triple {43508#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~last_index~0)| ~last_index~0))} ~set.base, ~set.offset := #in~set.base, #in~set.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;havoc ~i~4;havoc ~deleted_index~0;~deleted_index~0 := -1;~i~4 := 0; {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:43,263 INFO L290 TraceCheckUtils]: 70: Hoare triple {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !false; {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:43,263 INFO L290 TraceCheckUtils]: 71: Hoare triple {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume !(~i~4 < ~last_index~0); {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} is VALID [2022-02-20 21:55:43,264 INFO L290 TraceCheckUtils]: 72: Hoare triple {43518#(= 0 (+ ldv_set_remove_~deleted_index~0 1))} assume -1 != ~deleted_index~0;~i~4 := 1 + ~deleted_index~0; {43442#false} is VALID [2022-02-20 21:55:43,264 INFO L290 TraceCheckUtils]: 73: Hoare triple {43442#false} assume !false; {43442#false} is VALID [2022-02-20 21:55:43,264 INFO L290 TraceCheckUtils]: 74: Hoare triple {43442#false} assume !(~i~4 < ~last_index~0); {43442#false} is VALID [2022-02-20 21:55:43,264 INFO L290 TraceCheckUtils]: 75: Hoare triple {43442#false} ~last_index~0 := ~last_index~0 - 1; {43442#false} is VALID [2022-02-20 21:55:43,264 INFO L290 TraceCheckUtils]: 76: Hoare triple {43442#false} assume true; {43442#false} is VALID [2022-02-20 21:55:43,264 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {43442#false} {43441#true} #2029#return; {43442#false} is VALID [2022-02-20 21:55:43,264 INFO L290 TraceCheckUtils]: 78: Hoare triple {43442#false} assume true; {43442#false} is VALID [2022-02-20 21:55:43,264 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {43442#false} {43441#true} #2149#return; {43442#false} is VALID [2022-02-20 21:55:43,264 INFO L290 TraceCheckUtils]: 80: Hoare triple {43442#false} assume { :end_inline_ldv_kfree_skb_18 } true;#res#1 := 1; {43442#false} is VALID [2022-02-20 21:55:43,265 INFO L290 TraceCheckUtils]: 81: Hoare triple {43442#false} assume true; {43442#false} is VALID [2022-02-20 21:55:43,265 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {43442#false} {43441#true} #2265#return; {43442#false} is VALID [2022-02-20 21:55:43,265 INFO L290 TraceCheckUtils]: 83: Hoare triple {43442#false} havoc main_#t~ret474#1;~ldv_state_variable_1~0 := 1; {43442#false} is VALID [2022-02-20 21:55:43,265 INFO L290 TraceCheckUtils]: 84: Hoare triple {43442#false} assume !(2 == ~ldv_state_variable_1~0); {43442#false} is VALID [2022-02-20 21:55:43,265 INFO L290 TraceCheckUtils]: 85: Hoare triple {43442#false} assume -2147483648 <= main_#t~nondet461#1 && main_#t~nondet461#1 <= 2147483647;main_~tmp___3~1#1 := main_#t~nondet461#1;havoc main_#t~nondet461#1;main_#t~switch462#1 := 0 == main_~tmp___3~1#1; {43442#false} is VALID [2022-02-20 21:55:43,265 INFO L290 TraceCheckUtils]: 86: Hoare triple {43442#false} assume !main_#t~switch462#1;main_#t~switch462#1 := main_#t~switch462#1 || 1 == main_~tmp___3~1#1; {43442#false} is VALID [2022-02-20 21:55:43,265 INFO L290 TraceCheckUtils]: 87: Hoare triple {43442#false} assume main_#t~switch462#1; {43442#false} is VALID [2022-02-20 21:55:43,265 INFO L290 TraceCheckUtils]: 88: Hoare triple {43442#false} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet481#1 && main_#t~nondet481#1 <= 2147483647;main_~tmp___5~1#1 := main_#t~nondet481#1;havoc main_#t~nondet481#1;main_#t~switch482#1 := 0 == main_~tmp___5~1#1; {43442#false} is VALID [2022-02-20 21:55:43,266 INFO L290 TraceCheckUtils]: 89: Hoare triple {43442#false} assume !main_#t~switch482#1;main_#t~switch482#1 := main_#t~switch482#1 || 1 == main_~tmp___5~1#1; {43442#false} is VALID [2022-02-20 21:55:43,266 INFO L290 TraceCheckUtils]: 90: Hoare triple {43442#false} assume main_#t~switch482#1; {43442#false} is VALID [2022-02-20 21:55:43,266 INFO L290 TraceCheckUtils]: 91: Hoare triple {43442#false} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_dp83640_init } true;havoc dp83640_init_#res#1;havoc dp83640_init_#t~ret454#1, dp83640_init_~tmp~39#1;havoc dp83640_init_~tmp~39#1;assume { :begin_inline_phy_driver_register } true;phy_driver_register_#in~arg0#1.base, phy_driver_register_#in~arg0#1.offset := ~#dp83640_driver~0.base, ~#dp83640_driver~0.offset;havoc phy_driver_register_#res#1;havoc phy_driver_register_#t~nondet516#1, phy_driver_register_~arg0#1.base, phy_driver_register_~arg0#1.offset;phy_driver_register_~arg0#1.base, phy_driver_register_~arg0#1.offset := phy_driver_register_#in~arg0#1.base, phy_driver_register_#in~arg0#1.offset;assume -2147483648 <= phy_driver_register_#t~nondet516#1 && phy_driver_register_#t~nondet516#1 <= 2147483647;phy_driver_register_#res#1 := phy_driver_register_#t~nondet516#1;havoc phy_driver_register_#t~nondet516#1; {43442#false} is VALID [2022-02-20 21:55:43,266 INFO L290 TraceCheckUtils]: 92: Hoare triple {43442#false} dp83640_init_#t~ret454#1 := phy_driver_register_#res#1;assume { :end_inline_phy_driver_register } true;assume -2147483648 <= dp83640_init_#t~ret454#1 && dp83640_init_#t~ret454#1 <= 2147483647;dp83640_init_~tmp~39#1 := dp83640_init_#t~ret454#1;havoc dp83640_init_#t~ret454#1;dp83640_init_#res#1 := dp83640_init_~tmp~39#1; {43442#false} is VALID [2022-02-20 21:55:43,266 INFO L290 TraceCheckUtils]: 93: Hoare triple {43442#false} main_#t~ret483#1 := dp83640_init_#res#1;assume { :end_inline_dp83640_init } true;assume -2147483648 <= main_#t~ret483#1 && main_#t~ret483#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret483#1;havoc main_#t~ret483#1; {43442#false} is VALID [2022-02-20 21:55:43,266 INFO L290 TraceCheckUtils]: 94: Hoare triple {43442#false} assume !(0 == ~ldv_retval_1~0); {43442#false} is VALID [2022-02-20 21:55:43,266 INFO L290 TraceCheckUtils]: 95: Hoare triple {43442#false} assume 0 != ~ldv_retval_1~0;~ldv_state_variable_0~0 := 2; {43442#false} is VALID [2022-02-20 21:55:43,266 INFO L290 TraceCheckUtils]: 96: Hoare triple {43442#false} assume { :begin_inline_ldv_check_final_state } true;havoc ldv_check_final_state_#t~ret500#1, ldv_check_final_state_~tmp___7~6#1;havoc ldv_check_final_state_~tmp___7~6#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); {43442#false} is VALID [2022-02-20 21:55:43,267 INFO L290 TraceCheckUtils]: 97: Hoare triple {43442#false} ldv_check_final_state_#t~ret500#1 := ldv_set_is_empty_#res#1;assume { :end_inline_ldv_set_is_empty } true;assume -2147483648 <= ldv_check_final_state_#t~ret500#1 && ldv_check_final_state_#t~ret500#1 <= 2147483647;ldv_check_final_state_~tmp___7~6#1 := ldv_check_final_state_#t~ret500#1;havoc ldv_check_final_state_#t~ret500#1; {43442#false} is VALID [2022-02-20 21:55:43,267 INFO L290 TraceCheckUtils]: 98: Hoare triple {43442#false} assume !(0 != ldv_check_final_state_~tmp___7~6#1); {43442#false} is VALID [2022-02-20 21:55:43,267 INFO L272 TraceCheckUtils]: 99: Hoare triple {43442#false} call ldv_error(); {43442#false} is VALID [2022-02-20 21:55:43,267 INFO L290 TraceCheckUtils]: 100: Hoare triple {43442#false} assume !false; {43442#false} is VALID [2022-02-20 21:55:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-20 21:55:43,267 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:55:43,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960477762] [2022-02-20 21:55:43,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960477762] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:55:43,268 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:55:43,268 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 21:55:43,268 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465461491] [2022-02-20 21:55:43,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:55:43,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 101 [2022-02-20 21:55:43,269 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:55:43,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-02-20 21:55:43,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:55:43,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 21:55:43,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:55:43,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 21:55:43,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:55:43,337 INFO L87 Difference]: Start difference. First operand 3192 states and 4291 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8)