./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.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.0/module_get_put-drivers-block-loop.ko.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 f25e8d9a29012500b38126aa22b2b7d181aad99a845cece264158253e2ec92e3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:13:55,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:13:55,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:13:55,777 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:13:55,778 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:13:55,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:13:55,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:13:55,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:13:55,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:13:55,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:13:55,790 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:13:55,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:13:55,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:13:55,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:13:55,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:13:55,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:13:55,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:13:55,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:13:55,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:13:55,803 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:13:55,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:13:55,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:13:55,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:13:55,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:13:55,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:13:55,811 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:13:55,811 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:13:55,812 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:13:55,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:13:55,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:13:55,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:13:55,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:13:55,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:13:55,816 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:13:55,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:13:55,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:13:55,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:13:55,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:13:55,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:13:55,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:13:55,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:13:55,819 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:13:55,844 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:13:55,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:13:55,845 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:13:55,845 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:13:55,846 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:13:55,846 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:13:55,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:13:55,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:13:55,847 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:13:55,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:13:55,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:13:55,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:13:55,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:13:55,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:13:55,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:13:55,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:13:55,848 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:13:55,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:13:55,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:13:55,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:13:55,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:13:55,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:13:55,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:13:55,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:13:55,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:13:55,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:13:55,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:13:55,851 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:13:55,851 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:13:55,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:13:55,852 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 -> f25e8d9a29012500b38126aa22b2b7d181aad99a845cece264158253e2ec92e3 [2022-02-20 21:13:56,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:13:56,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:13:56,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:13:56,026 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:13:56,026 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:13:56,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i [2022-02-20 21:13:56,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72929f8a8/e0b1085179ab4ce18f8350603662b32d/FLAG77d992fb9 [2022-02-20 21:13:56,643 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:13:56,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-loop.ko.cil.out.i [2022-02-20 21:13:56,681 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72929f8a8/e0b1085179ab4ce18f8350603662b32d/FLAG77d992fb9 [2022-02-20 21:13:57,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72929f8a8/e0b1085179ab4ce18f8350603662b32d [2022-02-20 21:13:57,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:13:57,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:13:57,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:13:57,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:13:57,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:13:57,105 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:13:57" (1/1) ... [2022-02-20 21:13:57,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d77d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:57, skipping insertion in model container [2022-02-20 21:13:57,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:13:57" (1/1) ... [2022-02-20 21:13:57,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:13:57,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:13:58,050 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.0/module_get_put-drivers-block-loop.ko.cil.out.i[192897,192910] [2022-02-20 21:13:58,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:13:58,096 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:13:58,395 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.0/module_get_put-drivers-block-loop.ko.cil.out.i[192897,192910] [2022-02-20 21:13:58,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:13:58,463 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:13:58,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:58 WrapperNode [2022-02-20 21:13:58,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:13:58,466 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:13:58,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:13:58,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:13:58,471 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:13:58" (1/1) ... [2022-02-20 21:13:58,540 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:13:58" (1/1) ... [2022-02-20 21:13:58,696 INFO L137 Inliner]: procedures = 236, calls = 1201, calls flagged for inlining = 124, calls inlined = 121, statements flattened = 3745 [2022-02-20 21:13:58,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:13:58,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:13:58,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:13:58,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:13:58,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:58" (1/1) ... [2022-02-20 21:13:58,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:58" (1/1) ... [2022-02-20 21:13:58,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:58" (1/1) ... [2022-02-20 21:13:58,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:58" (1/1) ... [2022-02-20 21:13:58,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:58" (1/1) ... [2022-02-20 21:13:58,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:58" (1/1) ... [2022-02-20 21:13:58,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:58" (1/1) ... [2022-02-20 21:13:58,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:13:58,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:13:58,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:13:58,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:13:58,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:58" (1/1) ... [2022-02-20 21:13:58,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:13:58,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:13:58,923 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:13:58,937 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:13:58,948 INFO L130 BoogieDeclarations]: Found specification of procedure bio_endio [2022-02-20 21:13:58,949 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_endio [2022-02-20 21:13:58,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-02-20 21:13:58,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-02-20 21:13:58,950 INFO L130 BoogieDeclarations]: Found specification of procedure vfs_fsync [2022-02-20 21:13:58,950 INFO L138 BoogieDeclarations]: Found implementation of procedure vfs_fsync [2022-02-20 21:13:58,950 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2022-02-20 21:13:58,950 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2022-02-20 21:13:58,950 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-02-20 21:13:58,950 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-02-20 21:13:58,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:13:58,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:13:58,951 INFO L130 BoogieDeclarations]: Found specification of procedure add_disk [2022-02-20 21:13:58,951 INFO L138 BoogieDeclarations]: Found implementation of procedure add_disk [2022-02-20 21:13:58,951 INFO L130 BoogieDeclarations]: Found specification of procedure kobject_uevent [2022-02-20 21:13:58,951 INFO L138 BoogieDeclarations]: Found implementation of procedure kobject_uevent [2022-02-20 21:13:58,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-02-20 21:13:58,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-02-20 21:13:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure transfer_xor [2022-02-20 21:13:58,952 INFO L138 BoogieDeclarations]: Found implementation of procedure transfer_xor [2022-02-20 21:13:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure invalidate_bdev [2022-02-20 21:13:58,952 INFO L138 BoogieDeclarations]: Found implementation of procedure invalidate_bdev [2022-02-20 21:13:58,952 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-02-20 21:13:58,952 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-02-20 21:13:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-02-20 21:13:58,953 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-02-20 21:13:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure huge_encode_dev [2022-02-20 21:13:58,953 INFO L138 BoogieDeclarations]: Found implementation of procedure huge_encode_dev [2022-02-20 21:13:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure lo_do_transfer [2022-02-20 21:13:58,954 INFO L138 BoogieDeclarations]: Found implementation of procedure lo_do_transfer [2022-02-20 21:13:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure loop_sysfs_exit [2022-02-20 21:13:58,954 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_sysfs_exit [2022-02-20 21:13:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2022-02-20 21:13:58,954 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2022-02-20 21:13:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure kthread_should_stop [2022-02-20 21:13:58,954 INFO L138 BoogieDeclarations]: Found implementation of procedure kthread_should_stop [2022-02-20 21:13:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-02-20 21:13:58,955 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-02-20 21:13:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure loop_alloc [2022-02-20 21:13:58,955 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_alloc [2022-02-20 21:13:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure loop_make_request [2022-02-20 21:13:58,955 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_make_request [2022-02-20 21:13:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure __do_lo_send_write [2022-02-20 21:13:58,956 INFO L138 BoogieDeclarations]: Found implementation of procedure __do_lo_send_write [2022-02-20 21:13:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure loop_get_status [2022-02-20 21:13:58,956 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_get_status [2022-02-20 21:13:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure loop_clr_fd [2022-02-20 21:13:58,956 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_clr_fd [2022-02-20 21:13:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 21:13:58,957 INFO L130 BoogieDeclarations]: Found specification of procedure figure_loop_size [2022-02-20 21:13:58,957 INFO L138 BoogieDeclarations]: Found implementation of procedure figure_loop_size [2022-02-20 21:13:58,957 INFO L130 BoogieDeclarations]: Found specification of procedure ioctl_by_bdev [2022-02-20 21:13:58,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ioctl_by_bdev [2022-02-20 21:13:58,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 21:13:58,957 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-02-20 21:13:58,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-02-20 21:13:58,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 21:13:58,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:13:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-02-20 21:13:58,959 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-02-20 21:13:58,959 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-02-20 21:13:58,959 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-02-20 21:13:58,960 INFO L130 BoogieDeclarations]: Found specification of procedure fput [2022-02-20 21:13:58,960 INFO L138 BoogieDeclarations]: Found implementation of procedure fput [2022-02-20 21:13:58,960 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-02-20 21:13:58,960 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-02-20 21:13:58,960 INFO L130 BoogieDeclarations]: Found specification of procedure loop_set_capacity [2022-02-20 21:13:58,960 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_set_capacity [2022-02-20 21:13:58,960 INFO L130 BoogieDeclarations]: Found specification of procedure bio_list_empty [2022-02-20 21:13:58,960 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_list_empty [2022-02-20 21:13:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-02-20 21:13:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-02-20 21:13:58,961 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-02-20 21:13:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure loop_free [2022-02-20 21:13:58,961 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_free [2022-02-20 21:13:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure transfer_none [2022-02-20 21:13:58,961 INFO L138 BoogieDeclarations]: Found implementation of procedure transfer_none [2022-02-20 21:13:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 21:13:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure bd_set_size [2022-02-20 21:13:58,962 INFO L138 BoogieDeclarations]: Found implementation of procedure bd_set_size [2022-02-20 21:13:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:13:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure fget [2022-02-20 21:13:58,962 INFO L138 BoogieDeclarations]: Found implementation of procedure fget [2022-02-20 21:13:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure mapping_set_gfp_mask [2022-02-20 21:13:58,962 INFO L138 BoogieDeclarations]: Found implementation of procedure mapping_set_gfp_mask [2022-02-20 21:13:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure xor_init [2022-02-20 21:13:58,963 INFO L138 BoogieDeclarations]: Found implementation of procedure xor_init [2022-02-20 21:13:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure kmap [2022-02-20 21:13:58,963 INFO L138 BoogieDeclarations]: Found implementation of procedure kmap [2022-02-20 21:13:58,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-02-20 21:13:58,963 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-02-20 21:13:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-02-20 21:13:58,964 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-02-20 21:13:58,964 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2022-02-20 21:13:58,964 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2022-02-20 21:13:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-02-20 21:13:58,965 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-02-20 21:13:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:13:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-02-20 21:13:58,965 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-02-20 21:13:58,965 INFO L130 BoogieDeclarations]: Found specification of procedure __kmap_atomic [2022-02-20 21:13:58,966 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmap_atomic [2022-02-20 21:13:58,966 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2022-02-20 21:13:58,966 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2022-02-20 21:13:58,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:13:58,966 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-02-20 21:13:58,966 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-02-20 21:13:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:13:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure get_loop_size [2022-02-20 21:13:58,967 INFO L138 BoogieDeclarations]: Found implementation of procedure get_loop_size [2022-02-20 21:13:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 21:13:58,967 INFO L130 BoogieDeclarations]: Found specification of procedure blk_cleanup_queue [2022-02-20 21:13:58,967 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_cleanup_queue [2022-02-20 21:13:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure loop_set_status [2022-02-20 21:13:58,968 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_set_status [2022-02-20 21:13:58,968 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-02-20 21:13:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure lo_ioctl [2022-02-20 21:13:59,012 INFO L138 BoogieDeclarations]: Found implementation of procedure lo_ioctl [2022-02-20 21:13:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2022-02-20 21:13:59,012 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2022-02-20 21:13:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure current_thread_info [2022-02-20 21:13:59,012 INFO L138 BoogieDeclarations]: Found implementation of procedure current_thread_info [2022-02-20 21:13:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure loop_release_xfer [2022-02-20 21:13:59,012 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_release_xfer [2022-02-20 21:13:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure _cond_resched [2022-02-20 21:13:59,013 INFO L138 BoogieDeclarations]: Found implementation of procedure _cond_resched [2022-02-20 21:13:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure kunmap [2022-02-20 21:13:59,013 INFO L138 BoogieDeclarations]: Found implementation of procedure kunmap [2022-02-20 21:13:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-02-20 21:13:59,013 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-02-20 21:13:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure loop_switch [2022-02-20 21:13:59,013 INFO L138 BoogieDeclarations]: Found implementation of procedure loop_switch [2022-02-20 21:13:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure mapping_gfp_mask [2022-02-20 21:13:59,013 INFO L138 BoogieDeclarations]: Found implementation of procedure mapping_gfp_mask [2022-02-20 21:13:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-02-20 21:13:59,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-02-20 21:13:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-02-20 21:13:59,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-02-20 21:13:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure __kunmap_atomic [2022-02-20 21:13:59,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __kunmap_atomic [2022-02-20 21:13:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:13:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:13:59,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:13:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-02-20 21:13:59,014 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-02-20 21:13:59,498 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:13:59,501 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:14:00,081 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 21:14:01,522 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-02-20 21:14:01,522 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-02-20 21:14:01,537 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-20 21:14:01,537 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-20 21:14:02,064 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-20 21:14:02,065 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-20 21:14:02,485 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 21:14:02,487 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-20 21:14:04,243 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##72: assume !false; [2022-02-20 21:14:04,243 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##71: assume false; [2022-02-20 21:14:04,243 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-02-20 21:14:04,243 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-02-20 21:14:04,281 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:14:04,299 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:14:04,299 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 21:14:04,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:14:04 BoogieIcfgContainer [2022-02-20 21:14:04,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:14:04,302 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:14:04,302 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:14:04,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:14:04,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:13:57" (1/3) ... [2022-02-20 21:14:04,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16987202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:14:04, skipping insertion in model container [2022-02-20 21:14:04,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:13:58" (2/3) ... [2022-02-20 21:14:04,306 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16987202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:14:04, skipping insertion in model container [2022-02-20 21:14:04,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:14:04" (3/3) ... [2022-02-20 21:14:04,308 INFO L111 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-block-loop.ko.cil.out.i [2022-02-20 21:14:04,312 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:14:04,313 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:14:04,353 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:14:04,358 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:14:04,358 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:14:04,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 1134 states, 846 states have (on average 1.3416075650118204) internal successors, (1135), 859 states have internal predecessors, (1135), 222 states have call successors, (222), 64 states have call predecessors, (222), 64 states have return successors, (222), 221 states have call predecessors, (222), 222 states have call successors, (222) [2022-02-20 21:14:04,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 21:14:04,398 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:14:04,398 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:14:04,398 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:14:04,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:14:04,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1638152850, now seen corresponding path program 1 times [2022-02-20 21:14:04,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:14:04,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370414295] [2022-02-20 21:14:04,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:14:04,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:14:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:14:04,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {1137#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(47, 2);call #Ultimate.allocInit(102, 3);call #Ultimate.allocInit(27, 4);call #Ultimate.allocInit(24, 5);call #Ultimate.allocInit(29, 6);call #Ultimate.allocInit(19, 7);call #Ultimate.allocInit(173, 8);call #Ultimate.allocInit(173, 9);call #Ultimate.allocInit(54, 10);call #Ultimate.allocInit(173, 11);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(55, 13);call #Ultimate.allocInit(35, 14);call #Ultimate.allocInit(6, 15);call write~init~int(37, 15, 0, 1);call write~init~int(108, 15, 1, 1);call write~init~int(108, 15, 2, 1);call write~init~int(117, 15, 3, 1);call write~init~int(10, 15, 4, 1);call write~init~int(0, 15, 5, 1);call #Ultimate.allocInit(6, 16);call write~init~int(37, 16, 0, 1);call write~init~int(108, 16, 1, 1);call write~init~int(108, 16, 2, 1);call write~init~int(117, 16, 3, 1);call write~init~int(10, 16, 4, 1);call write~init~int(0, 16, 5, 1);call #Ultimate.allocInit(2, 17);call write~init~int(49, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(2, 18);call write~init~int(48, 18, 0, 1);call write~init~int(0, 18, 1, 1);call #Ultimate.allocInit(4, 19);call write~init~int(37, 19, 0, 1);call write~init~int(115, 19, 1, 1);call write~init~int(10, 19, 2, 1);call write~init~int(0, 19, 3, 1);call #Ultimate.allocInit(13, 20);call #Ultimate.allocInit(7, 21);call write~init~int(111, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(115, 21, 3, 1);call write~init~int(101, 21, 4, 1);call write~init~int(116, 21, 5, 1);call write~init~int(0, 21, 6, 1);call #Ultimate.allocInit(10, 22);call #Ultimate.allocInit(10, 23);call #Ultimate.allocInit(5, 24);call write~init~int(108, 24, 0, 1);call write~init~int(111, 24, 1, 1);call write~init~int(111, 24, 2, 1);call write~init~int(112, 24, 3, 1);call write~init~int(0, 24, 4, 1);call #Ultimate.allocInit(7, 25);call write~init~int(108, 25, 0, 1);call write~init~int(111, 25, 1, 1);call write~init~int(111, 25, 2, 1);call write~init~int(112, 25, 3, 1);call write~init~int(37, 25, 4, 1);call write~init~int(100, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(18, 26);call #Ultimate.allocInit(23, 27);call #Ultimate.allocInit(7, 28);call write~init~int(108, 28, 0, 1);call write~init~int(111, 28, 1, 1);call write~init~int(111, 28, 2, 1);call write~init~int(112, 28, 3, 1);call write~init~int(37, 28, 4, 1);call write~init~int(100, 28, 5, 1);call write~init~int(0, 28, 6, 1);call #Ultimate.allocInit(5, 29);call write~init~int(108, 29, 0, 1);call write~init~int(111, 29, 1, 1);call write~init~int(111, 29, 2, 1);call write~init~int(112, 29, 3, 1);call write~init~int(0, 29, 4, 1);call #Ultimate.allocInit(24, 30);call #Ultimate.allocInit(24, 31);call #Ultimate.allocInit(5, 32);call write~init~int(108, 32, 0, 1);call write~init~int(111, 32, 1, 1);call write~init~int(111, 32, 2, 1);call write~init~int(112, 32, 3, 1);call write~init~int(0, 32, 4, 1);call #Ultimate.allocInit(5, 33);call write~init~int(108, 33, 0, 1);call write~init~int(111, 33, 1, 1);call write~init~int(111, 33, 2, 1);call write~init~int(112, 33, 3, 1);call write~init~int(0, 33, 4, 1);~#loop_devices~0.base, ~#loop_devices~0.offset := 34, 0;call #Ultimate.allocInit(16, 34);call write~init~$Pointer$(~#loop_devices~0.base, ~#loop_devices~0.offset, ~#loop_devices~0.base, ~#loop_devices~0.offset, 8);call write~init~$Pointer$(~#loop_devices~0.base, ~#loop_devices~0.offset, ~#loop_devices~0.base, 8 + ~#loop_devices~0.offset, 8);~#loop_devices_mutex~0.base, ~#loop_devices_mutex~0.offset := 35, 0;call #Ultimate.allocInit(156, 35);call write~init~int(1, ~#loop_devices_mutex~0.base, ~#loop_devices_mutex~0.offset, 4);call write~init~int(0, ~#loop_devices_mutex~0.base, 4 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(3735899821, ~#loop_devices_mutex~0.base, 8 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(4294967295, ~#loop_devices_mutex~0.base, 12 + ~#loop_devices_mutex~0.offset, 4);call write~init~$Pointer$(0, 1152921504606846975, ~#loop_devices_mutex~0.base, 16 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 24 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 32 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 40 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(6, 0, ~#loop_devices_mutex~0.base, 48 + ~#loop_devices_mutex~0.offset, 8);call write~init~int(0, ~#loop_devices_mutex~0.base, 56 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(0, ~#loop_devices_mutex~0.base, 60 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(~#loop_devices_mutex~0.base, 72 + ~#loop_devices_mutex~0.offset, ~#loop_devices_mutex~0.base, 72 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(~#loop_devices_mutex~0.base, 72 + ~#loop_devices_mutex~0.offset, ~#loop_devices_mutex~0.base, 80 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 88 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 96 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(~#loop_devices_mutex~0.base, ~#loop_devices_mutex~0.offset, ~#loop_devices_mutex~0.base, 104 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 112 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 120 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 128 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(7, 0, ~#loop_devices_mutex~0.base, 136 + ~#loop_devices_mutex~0.offset, 8);call write~init~int(0, ~#loop_devices_mutex~0.base, 144 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(0, ~#loop_devices_mutex~0.base, 148 + ~#loop_devices_mutex~0.offset, 8);~max_part~0 := 0;~part_shift~0 := 0;~#none_funcs~0.base, ~#none_funcs~0.offset := 36, 0;call #Ultimate.allocInit(44, 36);call write~init~int(0, ~#none_funcs~0.base, ~#none_funcs~0.offset, 4);call write~init~$Pointer$(#funAddr~transfer_none.base, #funAddr~transfer_none.offset, ~#none_funcs~0.base, 4 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 12 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 20 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 28 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 36 + ~#none_funcs~0.offset, 8);~#xor_funcs~0.base, ~#xor_funcs~0.offset := 37, 0;call #Ultimate.allocInit(44, 37);call write~init~int(1, ~#xor_funcs~0.base, ~#xor_funcs~0.offset, 4);call write~init~$Pointer$(#funAddr~transfer_xor.base, #funAddr~transfer_xor.offset, ~#xor_funcs~0.base, 4 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(#funAddr~xor_init.base, #funAddr~xor_init.offset, ~#xor_funcs~0.base, 12 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xor_funcs~0.base, 20 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xor_funcs~0.base, 28 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xor_funcs~0.base, 36 + ~#xor_funcs~0.offset, 8);~#xfer_funcs~0.base, ~#xfer_funcs~0.offset := 38, 0;call #Ultimate.allocInit(160, 38);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#xfer_funcs~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#xfer_funcs~0.base);call write~unchecked~$Pointer$(~#none_funcs~0.base, ~#none_funcs~0.offset, ~#xfer_funcs~0.base, ~#xfer_funcs~0.offset, 8);call write~unchecked~$Pointer$(~#xor_funcs~0.base, ~#xor_funcs~0.offset, ~#xfer_funcs~0.base, 8 + ~#xfer_funcs~0.offset, 8);~#loop_attr_backing_file~0.base, ~#loop_attr_backing_file~0.offset := 39, 0;call #Ultimate.allocInit(44, 39);call write~init~$Pointer$(20, 0, ~#loop_attr_backing_file~0.base, ~#loop_attr_backing_file~0.offset, 8);call write~init~int(292, ~#loop_attr_backing_file~0.base, 8 + ~#loop_attr_backing_file~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_backing_file~0.base, 12 + ~#loop_attr_backing_file~0.offset, 8);call write~init~int(0, ~#loop_attr_backing_file~0.base, 20 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 21 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 22 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 23 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 24 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 25 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 26 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 27 + ~#loop_attr_backing_file~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_backing_file.base, #funAddr~loop_attr_do_show_backing_file.offset, ~#loop_attr_backing_file~0.base, 28 + ~#loop_attr_backing_file~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_backing_file~0.base, 36 + ~#loop_attr_backing_file~0.offset, 8);~#loop_attr_offset~0.base, ~#loop_attr_offset~0.offset := 40, 0;call #Ultimate.allocInit(44, 40);call write~init~$Pointer$(21, 0, ~#loop_attr_offset~0.base, ~#loop_attr_offset~0.offset, 8);call write~init~int(292, ~#loop_attr_offset~0.base, 8 + ~#loop_attr_offset~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_offset~0.base, 12 + ~#loop_attr_offset~0.offset, 8);call write~init~int(0, ~#loop_attr_offset~0.base, 20 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 21 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 22 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 23 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 24 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 25 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 26 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 27 + ~#loop_attr_offset~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_offset.base, #funAddr~loop_attr_do_show_offset.offset, ~#loop_attr_offset~0.base, 28 + ~#loop_attr_offset~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_offset~0.base, 36 + ~#loop_attr_offset~0.offset, 8);~#loop_attr_sizelimit~0.base, ~#loop_attr_sizelimit~0.offset := 41, 0;call #Ultimate.allocInit(44, 41);call write~init~$Pointer$(22, 0, ~#loop_attr_sizelimit~0.base, ~#loop_attr_sizelimit~0.offset, 8);call write~init~int(292, ~#loop_attr_sizelimit~0.base, 8 + ~#loop_attr_sizelimit~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_sizelimit~0.base, 12 + ~#loop_attr_sizelimit~0.offset, 8);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 20 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 21 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 22 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 23 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 24 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 25 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 26 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 27 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_sizelimit.base, #funAddr~loop_attr_do_show_sizelimit.offset, ~#loop_attr_sizelimit~0.base, 28 + ~#loop_attr_sizelimit~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_sizelimit~0.base, 36 + ~#loop_attr_sizelimit~0.offset, 8);~#loop_attr_autoclear~0.base, ~#loop_attr_autoclear~0.offset := 42, 0;call #Ultimate.allocInit(44, 42);call write~init~$Pointer$(23, 0, ~#loop_attr_autoclear~0.base, ~#loop_attr_autoclear~0.offset, 8);call write~init~int(292, ~#loop_attr_autoclear~0.base, 8 + ~#loop_attr_autoclear~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_autoclear~0.base, 12 + ~#loop_attr_autoclear~0.offset, 8);call write~init~int(0, ~#loop_attr_autoclear~0.base, 20 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 21 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 22 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 23 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 24 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 25 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 26 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 27 + ~#loop_attr_autoclear~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_autoclear.base, #funAddr~loop_attr_do_show_autoclear.offset, ~#loop_attr_autoclear~0.base, 28 + ~#loop_attr_autoclear~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_autoclear~0.base, 36 + ~#loop_attr_autoclear~0.offset, 8);~#loop_attrs~0.base, ~#loop_attrs~0.offset := 43, 0;call #Ultimate.allocInit(40, 43);call write~init~$Pointer$(~#loop_attr_backing_file~0.base, ~#loop_attr_backing_file~0.offset, ~#loop_attrs~0.base, ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(~#loop_attr_offset~0.base, ~#loop_attr_offset~0.offset, ~#loop_attrs~0.base, 8 + ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(~#loop_attr_sizelimit~0.base, ~#loop_attr_sizelimit~0.offset, ~#loop_attrs~0.base, 16 + ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(~#loop_attr_autoclear~0.base, ~#loop_attr_autoclear~0.offset, ~#loop_attrs~0.base, 24 + ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attrs~0.base, 32 + ~#loop_attrs~0.offset, 8);~#loop_attribute_group~0.base, ~#loop_attribute_group~0.offset := 44, 0;call #Ultimate.allocInit(24, 44);call write~init~$Pointer$(24, 0, ~#loop_attribute_group~0.base, ~#loop_attribute_group~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attribute_group~0.base, 8 + ~#loop_attribute_group~0.offset, 8);call write~init~$Pointer$(~#loop_attrs~0.base, ~#loop_attrs~0.offset, ~#loop_attribute_group~0.base, 16 + ~#loop_attribute_group~0.offset, 8);~#lo_fops~0.base, ~#lo_fops~0.offset := 45, 0;call #Ultimate.allocInit(96, 45);call write~init~$Pointer$(#funAddr~lo_open.base, #funAddr~lo_open.offset, ~#lo_fops~0.base, ~#lo_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~lo_release.base, #funAddr~lo_release.offset, ~#lo_fops~0.base, 8 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~lo_ioctl.base, #funAddr~lo_ioctl.offset, ~#lo_fops~0.base, 16 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~lo_compat_ioctl.base, #funAddr~lo_compat_ioctl.offset, ~#lo_fops~0.base, 24 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 32 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 40 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 48 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 56 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 64 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 72 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 80 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#lo_fops~0.base, 88 + ~#lo_fops~0.offset, 8);~max_loop~0 := 0;~LDV_IN_INTERRUPT~0 := 0;~ldv_module_refcounter~0 := 1; {1139#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 21:14:04,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {1139#(= ~ldv_module_refcounter~0 1)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret737#1, main_#t~nondet738#1, main_#t~ret739#1, main_#t~ret740#1, main_#t~ret741#1, main_#t~ret742#1, main_#t~ret743#1, main_#t~ret744#1, main_#t~ret745#1, main_#t~nondet746#1, main_~var_group1~0#1.base, main_~var_group1~0#1.offset, main_~var_transfer_none_0_p1~0#1, main_~var_transfer_none_0_p2~0#1.base, main_~var_transfer_none_0_p2~0#1.offset, main_~var_transfer_none_0_p3~0#1, main_~var_transfer_none_0_p4~0#1.base, main_~var_transfer_none_0_p4~0#1.offset, main_~var_transfer_none_0_p5~0#1, main_~var_transfer_none_0_p6~0#1, main_~var_transfer_none_0_p7~0#1, main_~var_transfer_xor_1_p1~0#1, main_~var_transfer_xor_1_p2~0#1.base, main_~var_transfer_xor_1_p2~0#1.offset, main_~var_transfer_xor_1_p3~0#1, main_~var_transfer_xor_1_p4~0#1.base, main_~var_transfer_xor_1_p4~0#1.offset, main_~var_transfer_xor_1_p5~0#1, main_~var_transfer_xor_1_p6~0#1, main_~var_transfer_xor_1_p7~0#1, main_~var_xor_init_2_p1~0#1.base, main_~var_xor_init_2_p1~0#1.offset, main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~var_lo_open_51_p1~0#1, main_~res_lo_open_51~0#1, main_~var_group3~0#1.base, main_~var_group3~0#1.offset, main_~var_lo_release_52_p1~0#1, main_~var_lo_ioctl_45_p1~0#1, main_~var_lo_ioctl_45_p2~0#1, main_~var_lo_ioctl_45_p3~0#1, main_~var_lo_compat_ioctl_50_p1~0#1, main_~var_lo_compat_ioctl_50_p2~0#1, main_~var_lo_compat_ioctl_50_p3~0#1, main_~ldv_s_lo_fops_block_device_operations~0#1, main_~tmp~63#1, main_~tmp___0~28#1, main_~tmp___1~10#1;havoc main_~var_group1~0#1.base, main_~var_group1~0#1.offset;havoc main_~var_transfer_none_0_p1~0#1;havoc main_~var_transfer_none_0_p2~0#1.base, main_~var_transfer_none_0_p2~0#1.offset;havoc main_~var_transfer_none_0_p3~0#1;havoc main_~var_transfer_none_0_p4~0#1.base, main_~var_transfer_none_0_p4~0#1.offset;havoc main_~var_transfer_none_0_p5~0#1;havoc main_~var_transfer_none_0_p6~0#1;havoc main_~var_transfer_none_0_p7~0#1;havoc main_~var_transfer_xor_1_p1~0#1;havoc main_~var_transfer_xor_1_p2~0#1.base, main_~var_transfer_xor_1_p2~0#1.offset;havoc main_~var_transfer_xor_1_p3~0#1;havoc main_~var_transfer_xor_1_p4~0#1.base, main_~var_transfer_xor_1_p4~0#1.offset;havoc main_~var_transfer_xor_1_p5~0#1;havoc main_~var_transfer_xor_1_p6~0#1;havoc main_~var_transfer_xor_1_p7~0#1;havoc main_~var_xor_init_2_p1~0#1.base, main_~var_xor_init_2_p1~0#1.offset;havoc main_~var_group2~0#1.base, main_~var_group2~0#1.offset;havoc main_~var_lo_open_51_p1~0#1;havoc main_~res_lo_open_51~0#1;havoc main_~var_group3~0#1.base, main_~var_group3~0#1.offset;havoc main_~var_lo_release_52_p1~0#1;havoc main_~var_lo_ioctl_45_p1~0#1;havoc main_~var_lo_ioctl_45_p2~0#1;havoc main_~var_lo_ioctl_45_p3~0#1;havoc main_~var_lo_compat_ioctl_50_p1~0#1;havoc main_~var_lo_compat_ioctl_50_p2~0#1;havoc main_~var_lo_compat_ioctl_50_p3~0#1;havoc main_~ldv_s_lo_fops_block_device_operations~0#1;havoc main_~tmp~63#1;havoc main_~tmp___0~28#1;havoc main_~tmp___1~10#1;main_~ldv_s_lo_fops_block_device_operations~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true; {1139#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 21:14:04,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {1139#(= ~ldv_module_refcounter~0 1)} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_loop_init } true;havoc loop_init_#res#1;havoc loop_init_#t~ret722#1, loop_init_#t~ret723#1, loop_init_#t~ret724#1.base, loop_init_#t~ret724#1.offset, loop_init_#t~mem725#1.base, loop_init_#t~mem725#1.offset, loop_init_#t~mem726#1.base, loop_init_#t~mem726#1.offset, loop_init_#t~mem727#1.base, loop_init_#t~mem727#1.offset, loop_init_#t~nondet728#1, loop_init_#t~nondet729#1, loop_init_#t~mem730#1.base, loop_init_#t~mem730#1.offset, loop_init_#t~mem731#1.base, loop_init_#t~mem731#1.offset, loop_init_#t~mem732#1.base, loop_init_#t~mem732#1.offset, loop_init_~i~4#1, loop_init_~nr~0#1, loop_init_~range~0#1, loop_init_~lo~12#1.base, loop_init_~lo~12#1.offset, loop_init_~next~0#1.base, loop_init_~next~0#1.offset, loop_init_~tmp~62#1, loop_init_~__mptr~3#1.base, loop_init_~__mptr~3#1.offset, loop_init_~__mptr___0~3#1.base, loop_init_~__mptr___0~3#1.offset, loop_init_~__mptr___1~0#1.base, loop_init_~__mptr___1~0#1.offset, loop_init_~__mptr___2~0#1.base, loop_init_~__mptr___2~0#1.offset, loop_init_~__mptr___3~0#1.base, loop_init_~__mptr___3~0#1.offset;havoc loop_init_~i~4#1;havoc loop_init_~nr~0#1;havoc loop_init_~range~0#1;havoc loop_init_~lo~12#1.base, loop_init_~lo~12#1.offset;havoc loop_init_~next~0#1.base, loop_init_~next~0#1.offset;havoc loop_init_~tmp~62#1;havoc loop_init_~__mptr~3#1.base, loop_init_~__mptr~3#1.offset;havoc loop_init_~__mptr___0~3#1.base, loop_init_~__mptr___0~3#1.offset;havoc loop_init_~__mptr___1~0#1.base, loop_init_~__mptr___1~0#1.offset;havoc loop_init_~__mptr___2~0#1.base, loop_init_~__mptr___2~0#1.offset;havoc loop_init_~__mptr___3~0#1.base, loop_init_~__mptr___3~0#1.offset;~part_shift~0 := 0; {1139#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 21:14:04,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {1139#(= ~ldv_module_refcounter~0 1)} assume !(~max_part~0 > 0); {1139#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 21:14:04,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {1139#(= ~ldv_module_refcounter~0 1)} assume ~shiftLeft(1, ~part_shift~0) % 18446744073709551616 > 256;loop_init_#res#1 := -22; {1139#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 21:14:04,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {1139#(= ~ldv_module_refcounter~0 1)} main_#t~ret737#1 := loop_init_#res#1;assume { :end_inline_loop_init } true;assume -2147483648 <= main_#t~ret737#1 && main_#t~ret737#1 <= 2147483647;main_~tmp~63#1 := main_#t~ret737#1;havoc main_#t~ret737#1; {1139#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 21:14:04,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {1139#(= ~ldv_module_refcounter~0 1)} assume 0 != main_~tmp~63#1; {1139#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 21:14:04,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {1139#(= ~ldv_module_refcounter~0 1)} assume { :begin_inline_ldv_check_final_state } true; {1139#(= ~ldv_module_refcounter~0 1)} is VALID [2022-02-20 21:14:04,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {1139#(= ~ldv_module_refcounter~0 1)} assume 1 != ~ldv_module_refcounter~0; {1138#false} is VALID [2022-02-20 21:14:04,746 INFO L272 TraceCheckUtils]: 9: Hoare triple {1138#false} call ldv_blast_assert(); {1138#false} is VALID [2022-02-20 21:14:04,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-02-20 21:14:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:14:04,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:14:04,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370414295] [2022-02-20 21:14:04,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370414295] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:14:04,748 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:14:04,748 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 21:14:04,749 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491525052] [2022-02-20 21:14:04,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:14:04,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 21:14:04,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:14:04,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:14:04,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:14:04,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 21:14:04,777 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:14:04,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 21:14:04,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:14:04,797 INFO L87 Difference]: Start difference. First operand has 1134 states, 846 states have (on average 1.3416075650118204) internal successors, (1135), 859 states have internal predecessors, (1135), 222 states have call successors, (222), 64 states have call predecessors, (222), 64 states have return successors, (222), 221 states have call predecessors, (222), 222 states have call successors, (222) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:14:11,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:14:11,282 INFO L93 Difference]: Finished difference Result 3311 states and 4739 transitions. [2022-02-20 21:14:11,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 21:14:11,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 21:14:11,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:14:11,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:14:11,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4739 transitions. [2022-02-20 21:14:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:14:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4739 transitions. [2022-02-20 21:14:11,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4739 transitions. [2022-02-20 21:14:15,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4739 edges. 4739 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:14:15,340 INFO L225 Difference]: With dead ends: 3311 [2022-02-20 21:14:15,340 INFO L226 Difference]: Without dead ends: 2166 [2022-02-20 21:14:15,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 21:14:15,357 INFO L933 BasicCegarLoop]: 1914 mSDtfsCounter, 1542 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 3378 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:14:15,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1542 Valid, 3378 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 21:14:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2166 states. [2022-02-20 21:14:15,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2166 to 2163. [2022-02-20 21:14:15,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:14:15,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2166 states. Second operand has 2163 states, 1610 states have (on average 1.3198757763975155) internal successors, (2125), 1630 states have internal predecessors, (2125), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-02-20 21:14:15,507 INFO L74 IsIncluded]: Start isIncluded. First operand 2166 states. Second operand has 2163 states, 1610 states have (on average 1.3198757763975155) internal successors, (2125), 1630 states have internal predecessors, (2125), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-02-20 21:14:15,513 INFO L87 Difference]: Start difference. First operand 2166 states. Second operand has 2163 states, 1610 states have (on average 1.3198757763975155) internal successors, (2125), 1630 states have internal predecessors, (2125), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-02-20 21:14:15,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:14:15,666 INFO L93 Difference]: Finished difference Result 2166 states and 2988 transitions. [2022-02-20 21:14:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2988 transitions. [2022-02-20 21:14:15,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:14:15,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:14:15,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 2163 states, 1610 states have (on average 1.3198757763975155) internal successors, (2125), 1630 states have internal predecessors, (2125), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) Second operand 2166 states. [2022-02-20 21:14:15,689 INFO L87 Difference]: Start difference. First operand has 2163 states, 1610 states have (on average 1.3198757763975155) internal successors, (2125), 1630 states have internal predecessors, (2125), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) Second operand 2166 states. [2022-02-20 21:14:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:14:15,838 INFO L93 Difference]: Finished difference Result 2166 states and 2988 transitions. [2022-02-20 21:14:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2166 states and 2988 transitions. [2022-02-20 21:14:15,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:14:15,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:14:15,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:14:15,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:14:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1610 states have (on average 1.3198757763975155) internal successors, (2125), 1630 states have internal predecessors, (2125), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-02-20 21:14:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2986 transitions. [2022-02-20 21:14:16,104 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2986 transitions. Word has length 11 [2022-02-20 21:14:16,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:14:16,104 INFO L470 AbstractCegarLoop]: Abstraction has 2163 states and 2986 transitions. [2022-02-20 21:14:16,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:14:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2986 transitions. [2022-02-20 21:14:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 21:14:16,107 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:14:16,107 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:16,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:14:16,108 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:14:16,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:14:16,109 INFO L85 PathProgramCache]: Analyzing trace with hash -780115607, now seen corresponding path program 1 times [2022-02-20 21:14:16,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:14:16,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054674599] [2022-02-20 21:14:16,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:14:16,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:14:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:14:16,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-20 21:14:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:14:16,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {13218#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {13218#true} is VALID [2022-02-20 21:14:16,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {13218#true} assume true; {13218#true} is VALID [2022-02-20 21:14:16,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13218#true} {13219#false} #2635#return; {13219#false} is VALID [2022-02-20 21:14:16,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 21:14:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:14:16,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:14:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:14:16,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {13234#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1; {13218#true} is VALID [2022-02-20 21:14:16,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {13218#true} assume 0 != #t~nondet750#1 % 256;havoc #t~nondet750#1;#res#1.base, #res#1.offset := 0, 0; {13218#true} is VALID [2022-02-20 21:14:16,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {13218#true} assume true; {13218#true} is VALID [2022-02-20 21:14:16,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13218#true} {13218#true} #2811#return; {13218#true} is VALID [2022-02-20 21:14:16,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {13234#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {13218#true} is VALID [2022-02-20 21:14:16,264 INFO L272 TraceCheckUtils]: 1: Hoare triple {13218#true} call #t~ret764.base, #t~ret764.offset := ldv_malloc(320); {13234#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:14:16,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {13234#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1; {13218#true} is VALID [2022-02-20 21:14:16,264 INFO L290 TraceCheckUtils]: 3: Hoare triple {13218#true} assume 0 != #t~nondet750#1 % 256;havoc #t~nondet750#1;#res#1.base, #res#1.offset := 0, 0; {13218#true} is VALID [2022-02-20 21:14:16,265 INFO L290 TraceCheckUtils]: 4: Hoare triple {13218#true} assume true; {13218#true} is VALID [2022-02-20 21:14:16,265 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {13218#true} {13218#true} #2811#return; {13218#true} is VALID [2022-02-20 21:14:16,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {13218#true} #res.base, #res.offset := #t~ret764.base, #t~ret764.offset;havoc #t~ret764.base, #t~ret764.offset; {13218#true} is VALID [2022-02-20 21:14:16,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {13218#true} assume true; {13218#true} is VALID [2022-02-20 21:14:16,265 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {13218#true} {13219#false} #2637#return; {13219#false} is VALID [2022-02-20 21:14:16,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {13218#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(47, 2);call #Ultimate.allocInit(102, 3);call #Ultimate.allocInit(27, 4);call #Ultimate.allocInit(24, 5);call #Ultimate.allocInit(29, 6);call #Ultimate.allocInit(19, 7);call #Ultimate.allocInit(173, 8);call #Ultimate.allocInit(173, 9);call #Ultimate.allocInit(54, 10);call #Ultimate.allocInit(173, 11);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(55, 13);call #Ultimate.allocInit(35, 14);call #Ultimate.allocInit(6, 15);call write~init~int(37, 15, 0, 1);call write~init~int(108, 15, 1, 1);call write~init~int(108, 15, 2, 1);call write~init~int(117, 15, 3, 1);call write~init~int(10, 15, 4, 1);call write~init~int(0, 15, 5, 1);call #Ultimate.allocInit(6, 16);call write~init~int(37, 16, 0, 1);call write~init~int(108, 16, 1, 1);call write~init~int(108, 16, 2, 1);call write~init~int(117, 16, 3, 1);call write~init~int(10, 16, 4, 1);call write~init~int(0, 16, 5, 1);call #Ultimate.allocInit(2, 17);call write~init~int(49, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(2, 18);call write~init~int(48, 18, 0, 1);call write~init~int(0, 18, 1, 1);call #Ultimate.allocInit(4, 19);call write~init~int(37, 19, 0, 1);call write~init~int(115, 19, 1, 1);call write~init~int(10, 19, 2, 1);call write~init~int(0, 19, 3, 1);call #Ultimate.allocInit(13, 20);call #Ultimate.allocInit(7, 21);call write~init~int(111, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(115, 21, 3, 1);call write~init~int(101, 21, 4, 1);call write~init~int(116, 21, 5, 1);call write~init~int(0, 21, 6, 1);call #Ultimate.allocInit(10, 22);call #Ultimate.allocInit(10, 23);call #Ultimate.allocInit(5, 24);call write~init~int(108, 24, 0, 1);call write~init~int(111, 24, 1, 1);call write~init~int(111, 24, 2, 1);call write~init~int(112, 24, 3, 1);call write~init~int(0, 24, 4, 1);call #Ultimate.allocInit(7, 25);call write~init~int(108, 25, 0, 1);call write~init~int(111, 25, 1, 1);call write~init~int(111, 25, 2, 1);call write~init~int(112, 25, 3, 1);call write~init~int(37, 25, 4, 1);call write~init~int(100, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(18, 26);call #Ultimate.allocInit(23, 27);call #Ultimate.allocInit(7, 28);call write~init~int(108, 28, 0, 1);call write~init~int(111, 28, 1, 1);call write~init~int(111, 28, 2, 1);call write~init~int(112, 28, 3, 1);call write~init~int(37, 28, 4, 1);call write~init~int(100, 28, 5, 1);call write~init~int(0, 28, 6, 1);call #Ultimate.allocInit(5, 29);call write~init~int(108, 29, 0, 1);call write~init~int(111, 29, 1, 1);call write~init~int(111, 29, 2, 1);call write~init~int(112, 29, 3, 1);call write~init~int(0, 29, 4, 1);call #Ultimate.allocInit(24, 30);call #Ultimate.allocInit(24, 31);call #Ultimate.allocInit(5, 32);call write~init~int(108, 32, 0, 1);call write~init~int(111, 32, 1, 1);call write~init~int(111, 32, 2, 1);call write~init~int(112, 32, 3, 1);call write~init~int(0, 32, 4, 1);call #Ultimate.allocInit(5, 33);call write~init~int(108, 33, 0, 1);call write~init~int(111, 33, 1, 1);call write~init~int(111, 33, 2, 1);call write~init~int(112, 33, 3, 1);call write~init~int(0, 33, 4, 1);~#loop_devices~0.base, ~#loop_devices~0.offset := 34, 0;call #Ultimate.allocInit(16, 34);call write~init~$Pointer$(~#loop_devices~0.base, ~#loop_devices~0.offset, ~#loop_devices~0.base, ~#loop_devices~0.offset, 8);call write~init~$Pointer$(~#loop_devices~0.base, ~#loop_devices~0.offset, ~#loop_devices~0.base, 8 + ~#loop_devices~0.offset, 8);~#loop_devices_mutex~0.base, ~#loop_devices_mutex~0.offset := 35, 0;call #Ultimate.allocInit(156, 35);call write~init~int(1, ~#loop_devices_mutex~0.base, ~#loop_devices_mutex~0.offset, 4);call write~init~int(0, ~#loop_devices_mutex~0.base, 4 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(3735899821, ~#loop_devices_mutex~0.base, 8 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(4294967295, ~#loop_devices_mutex~0.base, 12 + ~#loop_devices_mutex~0.offset, 4);call write~init~$Pointer$(0, 1152921504606846975, ~#loop_devices_mutex~0.base, 16 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 24 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 32 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 40 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(6, 0, ~#loop_devices_mutex~0.base, 48 + ~#loop_devices_mutex~0.offset, 8);call write~init~int(0, ~#loop_devices_mutex~0.base, 56 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(0, ~#loop_devices_mutex~0.base, 60 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(~#loop_devices_mutex~0.base, 72 + ~#loop_devices_mutex~0.offset, ~#loop_devices_mutex~0.base, 72 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(~#loop_devices_mutex~0.base, 72 + ~#loop_devices_mutex~0.offset, ~#loop_devices_mutex~0.base, 80 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 88 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 96 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(~#loop_devices_mutex~0.base, ~#loop_devices_mutex~0.offset, ~#loop_devices_mutex~0.base, 104 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 112 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 120 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 128 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(7, 0, ~#loop_devices_mutex~0.base, 136 + ~#loop_devices_mutex~0.offset, 8);call write~init~int(0, ~#loop_devices_mutex~0.base, 144 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(0, ~#loop_devices_mutex~0.base, 148 + ~#loop_devices_mutex~0.offset, 8);~max_part~0 := 0;~part_shift~0 := 0;~#none_funcs~0.base, ~#none_funcs~0.offset := 36, 0;call #Ultimate.allocInit(44, 36);call write~init~int(0, ~#none_funcs~0.base, ~#none_funcs~0.offset, 4);call write~init~$Pointer$(#funAddr~transfer_none.base, #funAddr~transfer_none.offset, ~#none_funcs~0.base, 4 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 12 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 20 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 28 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 36 + ~#none_funcs~0.offset, 8);~#xor_funcs~0.base, ~#xor_funcs~0.offset := 37, 0;call #Ultimate.allocInit(44, 37);call write~init~int(1, ~#xor_funcs~0.base, ~#xor_funcs~0.offset, 4);call write~init~$Pointer$(#funAddr~transfer_xor.base, #funAddr~transfer_xor.offset, ~#xor_funcs~0.base, 4 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(#funAddr~xor_init.base, #funAddr~xor_init.offset, ~#xor_funcs~0.base, 12 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xor_funcs~0.base, 20 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xor_funcs~0.base, 28 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xor_funcs~0.base, 36 + ~#xor_funcs~0.offset, 8);~#xfer_funcs~0.base, ~#xfer_funcs~0.offset := 38, 0;call #Ultimate.allocInit(160, 38);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#xfer_funcs~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#xfer_funcs~0.base);call write~unchecked~$Pointer$(~#none_funcs~0.base, ~#none_funcs~0.offset, ~#xfer_funcs~0.base, ~#xfer_funcs~0.offset, 8);call write~unchecked~$Pointer$(~#xor_funcs~0.base, ~#xor_funcs~0.offset, ~#xfer_funcs~0.base, 8 + ~#xfer_funcs~0.offset, 8);~#loop_attr_backing_file~0.base, ~#loop_attr_backing_file~0.offset := 39, 0;call #Ultimate.allocInit(44, 39);call write~init~$Pointer$(20, 0, ~#loop_attr_backing_file~0.base, ~#loop_attr_backing_file~0.offset, 8);call write~init~int(292, ~#loop_attr_backing_file~0.base, 8 + ~#loop_attr_backing_file~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_backing_file~0.base, 12 + ~#loop_attr_backing_file~0.offset, 8);call write~init~int(0, ~#loop_attr_backing_file~0.base, 20 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 21 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 22 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 23 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 24 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 25 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 26 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 27 + ~#loop_attr_backing_file~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_backing_file.base, #funAddr~loop_attr_do_show_backing_file.offset, ~#loop_attr_backing_file~0.base, 28 + ~#loop_attr_backing_file~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_backing_file~0.base, 36 + ~#loop_attr_backing_file~0.offset, 8);~#loop_attr_offset~0.base, ~#loop_attr_offset~0.offset := 40, 0;call #Ultimate.allocInit(44, 40);call write~init~$Pointer$(21, 0, ~#loop_attr_offset~0.base, ~#loop_attr_offset~0.offset, 8);call write~init~int(292, ~#loop_attr_offset~0.base, 8 + ~#loop_attr_offset~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_offset~0.base, 12 + ~#loop_attr_offset~0.offset, 8);call write~init~int(0, ~#loop_attr_offset~0.base, 20 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 21 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 22 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 23 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 24 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 25 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 26 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 27 + ~#loop_attr_offset~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_offset.base, #funAddr~loop_attr_do_show_offset.offset, ~#loop_attr_offset~0.base, 28 + ~#loop_attr_offset~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_offset~0.base, 36 + ~#loop_attr_offset~0.offset, 8);~#loop_attr_sizelimit~0.base, ~#loop_attr_sizelimit~0.offset := 41, 0;call #Ultimate.allocInit(44, 41);call write~init~$Pointer$(22, 0, ~#loop_attr_sizelimit~0.base, ~#loop_attr_sizelimit~0.offset, 8);call write~init~int(292, ~#loop_attr_sizelimit~0.base, 8 + ~#loop_attr_sizelimit~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_sizelimit~0.base, 12 + ~#loop_attr_sizelimit~0.offset, 8);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 20 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 21 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 22 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 23 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 24 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 25 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 26 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 27 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_sizelimit.base, #funAddr~loop_attr_do_show_sizelimit.offset, ~#loop_attr_sizelimit~0.base, 28 + ~#loop_attr_sizelimit~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_sizelimit~0.base, 36 + ~#loop_attr_sizelimit~0.offset, 8);~#loop_attr_autoclear~0.base, ~#loop_attr_autoclear~0.offset := 42, 0;call #Ultimate.allocInit(44, 42);call write~init~$Pointer$(23, 0, ~#loop_attr_autoclear~0.base, ~#loop_attr_autoclear~0.offset, 8);call write~init~int(292, ~#loop_attr_autoclear~0.base, 8 + ~#loop_attr_autoclear~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_autoclear~0.base, 12 + ~#loop_attr_autoclear~0.offset, 8);call write~init~int(0, ~#loop_attr_autoclear~0.base, 20 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 21 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 22 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 23 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 24 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 25 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 26 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 27 + ~#loop_attr_autoclear~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_autoclear.base, #funAddr~loop_attr_do_show_autoclear.offset, ~#loop_attr_autoclear~0.base, 28 + ~#loop_attr_autoclear~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_autoclear~0.base, 36 + ~#loop_attr_autoclear~0.offset, 8);~#loop_attrs~0.base, ~#loop_attrs~0.offset := 43, 0;call #Ultimate.allocInit(40, 43);call write~init~$Pointer$(~#loop_attr_backing_file~0.base, ~#loop_attr_backing_file~0.offset, ~#loop_attrs~0.base, ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(~#loop_attr_offset~0.base, ~#loop_attr_offset~0.offset, ~#loop_attrs~0.base, 8 + ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(~#loop_attr_sizelimit~0.base, ~#loop_attr_sizelimit~0.offset, ~#loop_attrs~0.base, 16 + ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(~#loop_attr_autoclear~0.base, ~#loop_attr_autoclear~0.offset, ~#loop_attrs~0.base, 24 + ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attrs~0.base, 32 + ~#loop_attrs~0.offset, 8);~#loop_attribute_group~0.base, ~#loop_attribute_group~0.offset := 44, 0;call #Ultimate.allocInit(24, 44);call write~init~$Pointer$(24, 0, ~#loop_attribute_group~0.base, ~#loop_attribute_group~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attribute_group~0.base, 8 + ~#loop_attribute_group~0.offset, 8);call write~init~$Pointer$(~#loop_attrs~0.base, ~#loop_attrs~0.offset, ~#loop_attribute_group~0.base, 16 + ~#loop_attribute_group~0.offset, 8);~#lo_fops~0.base, ~#lo_fops~0.offset := 45, 0;call #Ultimate.allocInit(96, 45);call write~init~$Pointer$(#funAddr~lo_open.base, #funAddr~lo_open.offset, ~#lo_fops~0.base, ~#lo_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~lo_release.base, #funAddr~lo_release.offset, ~#lo_fops~0.base, 8 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~lo_ioctl.base, #funAddr~lo_ioctl.offset, ~#lo_fops~0.base, 16 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~lo_compat_ioctl.base, #funAddr~lo_compat_ioctl.offset, ~#lo_fops~0.base, 24 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 32 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 40 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 48 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 56 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 64 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 72 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 80 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#lo_fops~0.base, 88 + ~#lo_fops~0.offset, 8);~max_loop~0 := 0;~LDV_IN_INTERRUPT~0 := 0;~ldv_module_refcounter~0 := 1; {13218#true} is VALID [2022-02-20 21:14:16,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {13218#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret737#1, main_#t~nondet738#1, main_#t~ret739#1, main_#t~ret740#1, main_#t~ret741#1, main_#t~ret742#1, main_#t~ret743#1, main_#t~ret744#1, main_#t~ret745#1, main_#t~nondet746#1, main_~var_group1~0#1.base, main_~var_group1~0#1.offset, main_~var_transfer_none_0_p1~0#1, main_~var_transfer_none_0_p2~0#1.base, main_~var_transfer_none_0_p2~0#1.offset, main_~var_transfer_none_0_p3~0#1, main_~var_transfer_none_0_p4~0#1.base, main_~var_transfer_none_0_p4~0#1.offset, main_~var_transfer_none_0_p5~0#1, main_~var_transfer_none_0_p6~0#1, main_~var_transfer_none_0_p7~0#1, main_~var_transfer_xor_1_p1~0#1, main_~var_transfer_xor_1_p2~0#1.base, main_~var_transfer_xor_1_p2~0#1.offset, main_~var_transfer_xor_1_p3~0#1, main_~var_transfer_xor_1_p4~0#1.base, main_~var_transfer_xor_1_p4~0#1.offset, main_~var_transfer_xor_1_p5~0#1, main_~var_transfer_xor_1_p6~0#1, main_~var_transfer_xor_1_p7~0#1, main_~var_xor_init_2_p1~0#1.base, main_~var_xor_init_2_p1~0#1.offset, main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~var_lo_open_51_p1~0#1, main_~res_lo_open_51~0#1, main_~var_group3~0#1.base, main_~var_group3~0#1.offset, main_~var_lo_release_52_p1~0#1, main_~var_lo_ioctl_45_p1~0#1, main_~var_lo_ioctl_45_p2~0#1, main_~var_lo_ioctl_45_p3~0#1, main_~var_lo_compat_ioctl_50_p1~0#1, main_~var_lo_compat_ioctl_50_p2~0#1, main_~var_lo_compat_ioctl_50_p3~0#1, main_~ldv_s_lo_fops_block_device_operations~0#1, main_~tmp~63#1, main_~tmp___0~28#1, main_~tmp___1~10#1;havoc main_~var_group1~0#1.base, main_~var_group1~0#1.offset;havoc main_~var_transfer_none_0_p1~0#1;havoc main_~var_transfer_none_0_p2~0#1.base, main_~var_transfer_none_0_p2~0#1.offset;havoc main_~var_transfer_none_0_p3~0#1;havoc main_~var_transfer_none_0_p4~0#1.base, main_~var_transfer_none_0_p4~0#1.offset;havoc main_~var_transfer_none_0_p5~0#1;havoc main_~var_transfer_none_0_p6~0#1;havoc main_~var_transfer_none_0_p7~0#1;havoc main_~var_transfer_xor_1_p1~0#1;havoc main_~var_transfer_xor_1_p2~0#1.base, main_~var_transfer_xor_1_p2~0#1.offset;havoc main_~var_transfer_xor_1_p3~0#1;havoc main_~var_transfer_xor_1_p4~0#1.base, main_~var_transfer_xor_1_p4~0#1.offset;havoc main_~var_transfer_xor_1_p5~0#1;havoc main_~var_transfer_xor_1_p6~0#1;havoc main_~var_transfer_xor_1_p7~0#1;havoc main_~var_xor_init_2_p1~0#1.base, main_~var_xor_init_2_p1~0#1.offset;havoc main_~var_group2~0#1.base, main_~var_group2~0#1.offset;havoc main_~var_lo_open_51_p1~0#1;havoc main_~res_lo_open_51~0#1;havoc main_~var_group3~0#1.base, main_~var_group3~0#1.offset;havoc main_~var_lo_release_52_p1~0#1;havoc main_~var_lo_ioctl_45_p1~0#1;havoc main_~var_lo_ioctl_45_p2~0#1;havoc main_~var_lo_ioctl_45_p3~0#1;havoc main_~var_lo_compat_ioctl_50_p1~0#1;havoc main_~var_lo_compat_ioctl_50_p2~0#1;havoc main_~var_lo_compat_ioctl_50_p3~0#1;havoc main_~ldv_s_lo_fops_block_device_operations~0#1;havoc main_~tmp~63#1;havoc main_~tmp___0~28#1;havoc main_~tmp___1~10#1;main_~ldv_s_lo_fops_block_device_operations~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true; {13218#true} is VALID [2022-02-20 21:14:16,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {13218#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_loop_init } true;havoc loop_init_#res#1;havoc loop_init_#t~ret722#1, loop_init_#t~ret723#1, loop_init_#t~ret724#1.base, loop_init_#t~ret724#1.offset, loop_init_#t~mem725#1.base, loop_init_#t~mem725#1.offset, loop_init_#t~mem726#1.base, loop_init_#t~mem726#1.offset, loop_init_#t~mem727#1.base, loop_init_#t~mem727#1.offset, loop_init_#t~nondet728#1, loop_init_#t~nondet729#1, loop_init_#t~mem730#1.base, loop_init_#t~mem730#1.offset, loop_init_#t~mem731#1.base, loop_init_#t~mem731#1.offset, loop_init_#t~mem732#1.base, loop_init_#t~mem732#1.offset, loop_init_~i~4#1, loop_init_~nr~0#1, loop_init_~range~0#1, loop_init_~lo~12#1.base, loop_init_~lo~12#1.offset, loop_init_~next~0#1.base, loop_init_~next~0#1.offset, loop_init_~tmp~62#1, loop_init_~__mptr~3#1.base, loop_init_~__mptr~3#1.offset, loop_init_~__mptr___0~3#1.base, loop_init_~__mptr___0~3#1.offset, loop_init_~__mptr___1~0#1.base, loop_init_~__mptr___1~0#1.offset, loop_init_~__mptr___2~0#1.base, loop_init_~__mptr___2~0#1.offset, loop_init_~__mptr___3~0#1.base, loop_init_~__mptr___3~0#1.offset;havoc loop_init_~i~4#1;havoc loop_init_~nr~0#1;havoc loop_init_~range~0#1;havoc loop_init_~lo~12#1.base, loop_init_~lo~12#1.offset;havoc loop_init_~next~0#1.base, loop_init_~next~0#1.offset;havoc loop_init_~tmp~62#1;havoc loop_init_~__mptr~3#1.base, loop_init_~__mptr~3#1.offset;havoc loop_init_~__mptr___0~3#1.base, loop_init_~__mptr___0~3#1.offset;havoc loop_init_~__mptr___1~0#1.base, loop_init_~__mptr___1~0#1.offset;havoc loop_init_~__mptr___2~0#1.base, loop_init_~__mptr___2~0#1.offset;havoc loop_init_~__mptr___3~0#1.base, loop_init_~__mptr___3~0#1.offset;~part_shift~0 := 0; {13218#true} is VALID [2022-02-20 21:14:16,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {13218#true} assume !(~max_part~0 > 0); {13218#true} is VALID [2022-02-20 21:14:16,267 INFO L290 TraceCheckUtils]: 4: Hoare triple {13218#true} assume ~shiftLeft(1, ~part_shift~0) % 18446744073709551616 > 256;loop_init_#res#1 := -22; {13220#(<= (+ 22 |ULTIMATE.start_loop_init_#res#1|) 0)} is VALID [2022-02-20 21:14:16,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {13220#(<= (+ 22 |ULTIMATE.start_loop_init_#res#1|) 0)} main_#t~ret737#1 := loop_init_#res#1;assume { :end_inline_loop_init } true;assume -2147483648 <= main_#t~ret737#1 && main_#t~ret737#1 <= 2147483647;main_~tmp~63#1 := main_#t~ret737#1;havoc main_#t~ret737#1; {13221#(<= (+ 22 |ULTIMATE.start_main_~tmp~63#1|) 0)} is VALID [2022-02-20 21:14:16,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {13221#(<= (+ 22 |ULTIMATE.start_main_~tmp~63#1|) 0)} assume !(0 != main_~tmp~63#1); {13219#false} is VALID [2022-02-20 21:14:16,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {13219#false} assume -2147483648 <= main_#t~nondet746#1 && main_#t~nondet746#1 <= 2147483647;main_~tmp___1~10#1 := main_#t~nondet746#1;havoc main_#t~nondet746#1; {13219#false} is VALID [2022-02-20 21:14:16,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {13219#false} assume 0 != main_~tmp___1~10#1; {13219#false} is VALID [2022-02-20 21:14:16,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {13219#false} assume -2147483648 <= main_#t~nondet738#1 && main_#t~nondet738#1 <= 2147483647;main_~tmp___0~28#1 := main_#t~nondet738#1;havoc main_#t~nondet738#1; {13219#false} is VALID [2022-02-20 21:14:16,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {13219#false} assume !(0 == main_~tmp___0~28#1); {13219#false} is VALID [2022-02-20 21:14:16,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {13219#false} assume !(1 == main_~tmp___0~28#1); {13219#false} is VALID [2022-02-20 21:14:16,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {13219#false} assume !(2 == main_~tmp___0~28#1); {13219#false} is VALID [2022-02-20 21:14:16,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {13219#false} assume !(3 == main_~tmp___0~28#1); {13219#false} is VALID [2022-02-20 21:14:16,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {13219#false} assume !(4 == main_~tmp___0~28#1); {13219#false} is VALID [2022-02-20 21:14:16,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {13219#false} assume 5 == main_~tmp___0~28#1; {13219#false} is VALID [2022-02-20 21:14:16,270 INFO L272 TraceCheckUtils]: 16: Hoare triple {13219#false} call main_#t~ret744#1 := lo_ioctl(main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~var_lo_ioctl_45_p1~0#1, main_~var_lo_ioctl_45_p2~0#1, main_~var_lo_ioctl_45_p3~0#1); {13219#false} is VALID [2022-02-20 21:14:16,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {13219#false} ~bdev#1.base, ~bdev#1.offset := #in~bdev#1.base, #in~bdev#1.offset;~mode#1 := #in~mode#1;~cmd#1 := #in~cmd#1;~arg#1 := #in~arg#1;havoc ~lo~4#1.base, ~lo~4#1.offset;havoc ~err~6#1;havoc ~tmp~55#1;havoc ~tmp___0~25#1;call #t~mem607#1.base, #t~mem607#1.offset := read~$Pointer$(~bdev#1.base, 261 + ~bdev#1.offset, 8);call #t~mem608#1.base, #t~mem608#1.offset := read~$Pointer$(#t~mem607#1.base, 1248 + #t~mem607#1.offset, 8);~lo~4#1.base, ~lo~4#1.offset := #t~mem608#1.base, #t~mem608#1.offset;havoc #t~mem607#1.base, #t~mem607#1.offset;havoc #t~mem608#1.base, #t~mem608#1.offset; {13219#false} is VALID [2022-02-20 21:14:16,271 INFO L272 TraceCheckUtils]: 18: Hoare triple {13219#false} call mutex_lock_nested(~lo~4#1.base, 348 + ~lo~4#1.offset, 1); {13218#true} is VALID [2022-02-20 21:14:16,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {13218#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {13218#true} is VALID [2022-02-20 21:14:16,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {13218#true} assume true; {13218#true} is VALID [2022-02-20 21:14:16,273 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {13218#true} {13219#false} #2635#return; {13219#false} is VALID [2022-02-20 21:14:16,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {13219#false} assume 19456 == (if ~cmd#1 % 4294967296 % 4294967296 <= 2147483647 then ~cmd#1 % 4294967296 % 4294967296 else ~cmd#1 % 4294967296 % 4294967296 - 4294967296); {13219#false} is VALID [2022-02-20 21:14:16,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {13219#false} assume { :begin_inline_loop_set_fd } true;loop_set_fd_#in~lo#1.base, loop_set_fd_#in~lo#1.offset, loop_set_fd_#in~mode#1, loop_set_fd_#in~bdev#1.base, loop_set_fd_#in~bdev#1.offset, loop_set_fd_#in~arg#1 := ~lo~4#1.base, ~lo~4#1.offset, ~mode#1, ~bdev#1.base, ~bdev#1.offset, ~arg#1;havoc loop_set_fd_#res#1;havoc loop_set_fd_#t~ret399#1.base, loop_set_fd_#t~ret399#1.offset, loop_set_fd_#t~mem400#1, loop_set_fd_#t~mem401#1.base, loop_set_fd_#t~mem401#1.offset, loop_set_fd_#t~mem402#1.base, loop_set_fd_#t~mem402#1.offset, loop_set_fd_#t~mem403#1.base, loop_set_fd_#t~mem403#1.offset, loop_set_fd_#t~mem404#1.base, loop_set_fd_#t~mem404#1.offset, loop_set_fd_#t~mem405#1.base, loop_set_fd_#t~mem405#1.offset, loop_set_fd_#t~mem406#1.base, loop_set_fd_#t~mem406#1.offset, loop_set_fd_#t~mem407#1.base, loop_set_fd_#t~mem407#1.offset, loop_set_fd_#t~mem408#1.base, loop_set_fd_#t~mem408#1.offset, loop_set_fd_#t~mem409#1, loop_set_fd_#t~mem410#1.base, loop_set_fd_#t~mem410#1.offset, loop_set_fd_#t~ret411#1, loop_set_fd_#t~mem412#1.base, loop_set_fd_#t~mem412#1.offset, loop_set_fd_#t~mem413#1.base, loop_set_fd_#t~mem413#1.offset, loop_set_fd_#t~mem414#1, loop_set_fd_#t~nondet415#1, loop_set_fd_#t~mem416#1, loop_set_fd_#t~mem417#1, loop_set_fd_#t~mem418#1.base, loop_set_fd_#t~mem418#1.offset, loop_set_fd_#t~mem419#1.base, loop_set_fd_#t~mem419#1.offset, loop_set_fd_#t~nondet420#1, loop_set_fd_#t~mem421#1.base, loop_set_fd_#t~mem421#1.offset, loop_set_fd_#t~mem422#1.base, loop_set_fd_#t~mem422#1.offset, loop_set_fd_#t~nondet423#1, loop_set_fd_#t~mem424#1, loop_set_fd_#t~mem425#1.base, loop_set_fd_#t~mem425#1.offset, loop_set_fd_#t~mem426#1, loop_set_fd_#t~ret427#1, loop_set_fd_#t~nondet428#1, loop_set_fd_#t~ret429#1, loop_set_fd_#t~mem430#1, loop_set_fd_#t~mem431#1.base, loop_set_fd_#t~mem431#1.offset, loop_set_fd_#t~mem432#1.base, loop_set_fd_#t~mem432#1.offset, loop_set_fd_#t~mem433#1.base, loop_set_fd_#t~mem433#1.offset, loop_set_fd_#t~mem434#1.base, loop_set_fd_#t~mem434#1.offset, loop_set_fd_#t~mem435#1.base, loop_set_fd_#t~mem435#1.offset, loop_set_fd_#t~mem436#1.base, loop_set_fd_#t~mem436#1.offset, loop_set_fd_#t~ret437#1, loop_set_fd_#t~mem438#1.base, loop_set_fd_#t~mem438#1.offset, loop_set_fd_#t~ret439#1, loop_set_fd_#t~ret440#1, loop_set_fd_#t~nondet441#1.base, loop_set_fd_#t~nondet441#1.offset, loop_set_fd_#t~mem442#1, loop_set_fd_#t~mem443#1.base, loop_set_fd_#t~mem443#1.offset, loop_set_fd_#t~ret444#1, loop_set_fd_#t~mem445#1.base, loop_set_fd_#t~mem445#1.offset, loop_set_fd_#t~ret446#1, loop_set_fd_#t~mem447#1.base, loop_set_fd_#t~mem447#1.offset, loop_set_fd_#t~ret448#1, loop_set_fd_#t~ret449#1, loop_set_fd_#t~mem450#1.base, loop_set_fd_#t~mem450#1.offset, loop_set_fd_#t~mem451#1.base, loop_set_fd_#t~mem451#1.offset, loop_set_fd_#t~ret452#1, loop_set_fd_#t~mem453#1, loop_set_fd_~lo#1.base, loop_set_fd_~lo#1.offset, loop_set_fd_~mode#1, loop_set_fd_~bdev#1.base, loop_set_fd_~bdev#1.offset, loop_set_fd_~arg#1, loop_set_fd_~file~5#1.base, loop_set_fd_~file~5#1.offset, loop_set_fd_~f~0#1.base, loop_set_fd_~f~0#1.offset, loop_set_fd_~inode~1#1.base, loop_set_fd_~inode~1#1.offset, loop_set_fd_~mapping~2#1.base, loop_set_fd_~mapping~2#1.offset, loop_set_fd_~lo_blocksize~0#1, loop_set_fd_~lo_flags~0#1, loop_set_fd_~error~1#1, loop_set_fd_~size~4#1, loop_set_fd_~l~1#1.base, loop_set_fd_~l~1#1.offset, loop_set_fd_~tmp~46#1, loop_set_fd_~aops~0#1.base, loop_set_fd_~aops~0#1.offset, loop_set_fd_~tmp___0~19#1, loop_set_fd_~tmp___1~8#1;loop_set_fd_~lo#1.base, loop_set_fd_~lo#1.offset := loop_set_fd_#in~lo#1.base, loop_set_fd_#in~lo#1.offset;loop_set_fd_~mode#1 := loop_set_fd_#in~mode#1;loop_set_fd_~bdev#1.base, loop_set_fd_~bdev#1.offset := loop_set_fd_#in~bdev#1.base, loop_set_fd_#in~bdev#1.offset;loop_set_fd_~arg#1 := loop_set_fd_#in~arg#1;havoc loop_set_fd_~file~5#1.base, loop_set_fd_~file~5#1.offset;havoc loop_set_fd_~f~0#1.base, loop_set_fd_~f~0#1.offset;havoc loop_set_fd_~inode~1#1.base, loop_set_fd_~inode~1#1.offset;havoc loop_set_fd_~mapping~2#1.base, loop_set_fd_~mapping~2#1.offset;havoc loop_set_fd_~lo_blocksize~0#1;havoc loop_set_fd_~lo_flags~0#1;havoc loop_set_fd_~error~1#1;havoc loop_set_fd_~size~4#1;havoc loop_set_fd_~l~1#1.base, loop_set_fd_~l~1#1.offset;havoc loop_set_fd_~tmp~46#1;havoc loop_set_fd_~aops~0#1.base, loop_set_fd_~aops~0#1.offset;havoc loop_set_fd_~tmp___0~19#1;havoc loop_set_fd_~tmp___1~8#1;loop_set_fd_~lo_flags~0#1 := 0;assume { :begin_inline_ldv___module_get_1 } true;ldv___module_get_1_#in~module#1.base, ldv___module_get_1_#in~module#1.offset := ~#__this_module~0.base, ~#__this_module~0.offset;havoc ldv___module_get_1_~module#1.base, ldv___module_get_1_~module#1.offset;ldv___module_get_1_~module#1.base, ldv___module_get_1_~module#1.offset := ldv___module_get_1_#in~module#1.base, ldv___module_get_1_#in~module#1.offset;assume { :begin_inline_ldv_module_get } true;ldv_module_get_#in~module#1.base, ldv_module_get_#in~module#1.offset := ldv___module_get_1_~module#1.base, ldv___module_get_1_~module#1.offset;havoc ldv_module_get_~module#1.base, ldv_module_get_~module#1.offset;ldv_module_get_~module#1.base, ldv_module_get_~module#1.offset := ldv_module_get_#in~module#1.base, ldv_module_get_#in~module#1.offset; {13219#false} is VALID [2022-02-20 21:14:16,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {13219#false} assume !(0 != (ldv_module_get_~module#1.base + ldv_module_get_~module#1.offset) % 18446744073709551616); {13219#false} is VALID [2022-02-20 21:14:16,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {13219#false} assume { :end_inline_ldv_module_get } true; {13219#false} is VALID [2022-02-20 21:14:16,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {13219#false} assume { :end_inline_ldv___module_get_1 } true;loop_set_fd_~error~1#1 := -9; {13219#false} is VALID [2022-02-20 21:14:16,276 INFO L272 TraceCheckUtils]: 27: Hoare triple {13219#false} call loop_set_fd_#t~ret399#1.base, loop_set_fd_#t~ret399#1.offset := fget(loop_set_fd_~arg#1); {13234#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:14:16,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {13234#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {13218#true} is VALID [2022-02-20 21:14:16,277 INFO L272 TraceCheckUtils]: 29: Hoare triple {13218#true} call #t~ret764.base, #t~ret764.offset := ldv_malloc(320); {13234#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:14:16,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {13234#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1; {13218#true} is VALID [2022-02-20 21:14:16,277 INFO L290 TraceCheckUtils]: 31: Hoare triple {13218#true} assume 0 != #t~nondet750#1 % 256;havoc #t~nondet750#1;#res#1.base, #res#1.offset := 0, 0; {13218#true} is VALID [2022-02-20 21:14:16,278 INFO L290 TraceCheckUtils]: 32: Hoare triple {13218#true} assume true; {13218#true} is VALID [2022-02-20 21:14:16,278 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {13218#true} {13218#true} #2811#return; {13218#true} is VALID [2022-02-20 21:14:16,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {13218#true} #res.base, #res.offset := #t~ret764.base, #t~ret764.offset;havoc #t~ret764.base, #t~ret764.offset; {13218#true} is VALID [2022-02-20 21:14:16,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {13218#true} assume true; {13218#true} is VALID [2022-02-20 21:14:16,279 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13218#true} {13219#false} #2637#return; {13219#false} is VALID [2022-02-20 21:14:16,279 INFO L290 TraceCheckUtils]: 37: Hoare triple {13219#false} loop_set_fd_~file~5#1.base, loop_set_fd_~file~5#1.offset := loop_set_fd_#t~ret399#1.base, loop_set_fd_#t~ret399#1.offset;havoc loop_set_fd_#t~ret399#1.base, loop_set_fd_#t~ret399#1.offset; {13219#false} is VALID [2022-02-20 21:14:16,279 INFO L290 TraceCheckUtils]: 38: Hoare triple {13219#false} assume 0 == (loop_set_fd_~file~5#1.base + loop_set_fd_~file~5#1.offset) % 18446744073709551616; {13219#false} is VALID [2022-02-20 21:14:16,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {13219#false} assume { :begin_inline_ldv_module_put_2 } true;ldv_module_put_2_#in~ldv_func_arg1#1.base, ldv_module_put_2_#in~ldv_func_arg1#1.offset := ~#__this_module~0.base, ~#__this_module~0.offset;havoc ldv_module_put_2_~ldv_func_arg1#1.base, ldv_module_put_2_~ldv_func_arg1#1.offset;ldv_module_put_2_~ldv_func_arg1#1.base, ldv_module_put_2_~ldv_func_arg1#1.offset := ldv_module_put_2_#in~ldv_func_arg1#1.base, ldv_module_put_2_#in~ldv_func_arg1#1.offset; {13219#false} is VALID [2022-02-20 21:14:16,279 INFO L272 TraceCheckUtils]: 40: Hoare triple {13219#false} call ldv_module_put(ldv_module_put_2_~ldv_func_arg1#1.base, ldv_module_put_2_~ldv_func_arg1#1.offset); {13219#false} is VALID [2022-02-20 21:14:16,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {13219#false} ~module.base, ~module.offset := #in~module.base, #in~module.offset; {13219#false} is VALID [2022-02-20 21:14:16,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {13219#false} assume 0 != (~module.base + ~module.offset) % 18446744073709551616; {13219#false} is VALID [2022-02-20 21:14:16,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {13219#false} assume ~ldv_module_refcounter~0 <= 1; {13219#false} is VALID [2022-02-20 21:14:16,280 INFO L272 TraceCheckUtils]: 44: Hoare triple {13219#false} call ldv_blast_assert(); {13219#false} is VALID [2022-02-20 21:14:16,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {13219#false} assume !false; {13219#false} is VALID [2022-02-20 21:14:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:14:16,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:14:16,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054674599] [2022-02-20 21:14:16,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054674599] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:14:16,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:14:16,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:14:16,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119841116] [2022-02-20 21:14:16,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:14:16,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2022-02-20 21:14:16,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:14:16,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:14:16,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:14:16,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:14:16,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:14:16,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:14:16,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:14:16,327 INFO L87 Difference]: Start difference. First operand 2163 states and 2986 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:14:32,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:14:32,259 INFO L93 Difference]: Finished difference Result 4691 states and 6565 transitions. [2022-02-20 21:14:32,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:14:32,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2022-02-20 21:14:32,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:14:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:14:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3353 transitions. [2022-02-20 21:14:32,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:14:32,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3353 transitions. [2022-02-20 21:14:32,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 3353 transitions. [2022-02-20 21:14:34,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3353 edges. 3353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:14:35,267 INFO L225 Difference]: With dead ends: 4691 [2022-02-20 21:14:35,267 INFO L226 Difference]: Without dead ends: 2609 [2022-02-20 21:14:35,273 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 21:14:35,274 INFO L933 BasicCegarLoop]: 1480 mSDtfsCounter, 565 mSDsluCounter, 2868 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 4348 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 21:14:35,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [657 Valid, 4348 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 21:14:35,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2022-02-20 21:14:35,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2163. [2022-02-20 21:14:35,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:14:35,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2609 states. Second operand has 2163 states, 1610 states have (on average 1.3186335403726708) internal successors, (2123), 1630 states have internal predecessors, (2123), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-02-20 21:14:35,328 INFO L74 IsIncluded]: Start isIncluded. First operand 2609 states. Second operand has 2163 states, 1610 states have (on average 1.3186335403726708) internal successors, (2123), 1630 states have internal predecessors, (2123), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-02-20 21:14:35,331 INFO L87 Difference]: Start difference. First operand 2609 states. Second operand has 2163 states, 1610 states have (on average 1.3186335403726708) internal successors, (2123), 1630 states have internal predecessors, (2123), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-02-20 21:14:35,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:14:35,520 INFO L93 Difference]: Finished difference Result 2609 states and 3676 transitions. [2022-02-20 21:14:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 3676 transitions. [2022-02-20 21:14:35,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:14:35,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:14:35,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 2163 states, 1610 states have (on average 1.3186335403726708) internal successors, (2123), 1630 states have internal predecessors, (2123), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) Second operand 2609 states. [2022-02-20 21:14:35,555 INFO L87 Difference]: Start difference. First operand has 2163 states, 1610 states have (on average 1.3186335403726708) internal successors, (2123), 1630 states have internal predecessors, (2123), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) Second operand 2609 states. [2022-02-20 21:14:35,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:14:35,821 INFO L93 Difference]: Finished difference Result 2609 states and 3676 transitions. [2022-02-20 21:14:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 3676 transitions. [2022-02-20 21:14:35,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:14:35,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:14:35,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:14:35,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:14:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1610 states have (on average 1.3186335403726708) internal successors, (2123), 1630 states have internal predecessors, (2123), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-02-20 21:14:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2984 transitions. [2022-02-20 21:14:36,037 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2984 transitions. Word has length 46 [2022-02-20 21:14:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:14:36,037 INFO L470 AbstractCegarLoop]: Abstraction has 2163 states and 2984 transitions. [2022-02-20 21:14:36,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:14:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2984 transitions. [2022-02-20 21:14:36,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 21:14:36,041 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:14:36,041 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:36,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:14:36,042 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:14:36,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:14:36,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1866792812, now seen corresponding path program 1 times [2022-02-20 21:14:36,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:14:36,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239487818] [2022-02-20 21:14:36,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:14:36,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:14:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:14:36,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 21:14:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:14:36,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {28094#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {28094#true} is VALID [2022-02-20 21:14:36,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {28094#true} assume true; {28094#true} is VALID [2022-02-20 21:14:36,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28094#true} {28095#false} #2635#return; {28095#false} is VALID [2022-02-20 21:14:36,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 21:14:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:14:36,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:14:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:14:36,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {28109#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1; {28094#true} is VALID [2022-02-20 21:14:36,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {28094#true} assume 0 != #t~nondet750#1 % 256;havoc #t~nondet750#1;#res#1.base, #res#1.offset := 0, 0; {28094#true} is VALID [2022-02-20 21:14:36,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {28094#true} assume true; {28094#true} is VALID [2022-02-20 21:14:36,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28094#true} {28094#true} #2811#return; {28094#true} is VALID [2022-02-20 21:14:36,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {28109#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {28094#true} is VALID [2022-02-20 21:14:36,140 INFO L272 TraceCheckUtils]: 1: Hoare triple {28094#true} call #t~ret764.base, #t~ret764.offset := ldv_malloc(320); {28109#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:14:36,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {28109#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1; {28094#true} is VALID [2022-02-20 21:14:36,140 INFO L290 TraceCheckUtils]: 3: Hoare triple {28094#true} assume 0 != #t~nondet750#1 % 256;havoc #t~nondet750#1;#res#1.base, #res#1.offset := 0, 0; {28094#true} is VALID [2022-02-20 21:14:36,140 INFO L290 TraceCheckUtils]: 4: Hoare triple {28094#true} assume true; {28094#true} is VALID [2022-02-20 21:14:36,141 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {28094#true} {28094#true} #2811#return; {28094#true} is VALID [2022-02-20 21:14:36,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {28094#true} #res.base, #res.offset := #t~ret764.base, #t~ret764.offset;havoc #t~ret764.base, #t~ret764.offset; {28094#true} is VALID [2022-02-20 21:14:36,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {28094#true} assume true; {28094#true} is VALID [2022-02-20 21:14:36,141 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {28094#true} {28095#false} #2637#return; {28095#false} is VALID [2022-02-20 21:14:36,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {28094#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(47, 2);call #Ultimate.allocInit(102, 3);call #Ultimate.allocInit(27, 4);call #Ultimate.allocInit(24, 5);call #Ultimate.allocInit(29, 6);call #Ultimate.allocInit(19, 7);call #Ultimate.allocInit(173, 8);call #Ultimate.allocInit(173, 9);call #Ultimate.allocInit(54, 10);call #Ultimate.allocInit(173, 11);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(55, 13);call #Ultimate.allocInit(35, 14);call #Ultimate.allocInit(6, 15);call write~init~int(37, 15, 0, 1);call write~init~int(108, 15, 1, 1);call write~init~int(108, 15, 2, 1);call write~init~int(117, 15, 3, 1);call write~init~int(10, 15, 4, 1);call write~init~int(0, 15, 5, 1);call #Ultimate.allocInit(6, 16);call write~init~int(37, 16, 0, 1);call write~init~int(108, 16, 1, 1);call write~init~int(108, 16, 2, 1);call write~init~int(117, 16, 3, 1);call write~init~int(10, 16, 4, 1);call write~init~int(0, 16, 5, 1);call #Ultimate.allocInit(2, 17);call write~init~int(49, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(2, 18);call write~init~int(48, 18, 0, 1);call write~init~int(0, 18, 1, 1);call #Ultimate.allocInit(4, 19);call write~init~int(37, 19, 0, 1);call write~init~int(115, 19, 1, 1);call write~init~int(10, 19, 2, 1);call write~init~int(0, 19, 3, 1);call #Ultimate.allocInit(13, 20);call #Ultimate.allocInit(7, 21);call write~init~int(111, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(115, 21, 3, 1);call write~init~int(101, 21, 4, 1);call write~init~int(116, 21, 5, 1);call write~init~int(0, 21, 6, 1);call #Ultimate.allocInit(10, 22);call #Ultimate.allocInit(10, 23);call #Ultimate.allocInit(5, 24);call write~init~int(108, 24, 0, 1);call write~init~int(111, 24, 1, 1);call write~init~int(111, 24, 2, 1);call write~init~int(112, 24, 3, 1);call write~init~int(0, 24, 4, 1);call #Ultimate.allocInit(7, 25);call write~init~int(108, 25, 0, 1);call write~init~int(111, 25, 1, 1);call write~init~int(111, 25, 2, 1);call write~init~int(112, 25, 3, 1);call write~init~int(37, 25, 4, 1);call write~init~int(100, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(18, 26);call #Ultimate.allocInit(23, 27);call #Ultimate.allocInit(7, 28);call write~init~int(108, 28, 0, 1);call write~init~int(111, 28, 1, 1);call write~init~int(111, 28, 2, 1);call write~init~int(112, 28, 3, 1);call write~init~int(37, 28, 4, 1);call write~init~int(100, 28, 5, 1);call write~init~int(0, 28, 6, 1);call #Ultimate.allocInit(5, 29);call write~init~int(108, 29, 0, 1);call write~init~int(111, 29, 1, 1);call write~init~int(111, 29, 2, 1);call write~init~int(112, 29, 3, 1);call write~init~int(0, 29, 4, 1);call #Ultimate.allocInit(24, 30);call #Ultimate.allocInit(24, 31);call #Ultimate.allocInit(5, 32);call write~init~int(108, 32, 0, 1);call write~init~int(111, 32, 1, 1);call write~init~int(111, 32, 2, 1);call write~init~int(112, 32, 3, 1);call write~init~int(0, 32, 4, 1);call #Ultimate.allocInit(5, 33);call write~init~int(108, 33, 0, 1);call write~init~int(111, 33, 1, 1);call write~init~int(111, 33, 2, 1);call write~init~int(112, 33, 3, 1);call write~init~int(0, 33, 4, 1);~#loop_devices~0.base, ~#loop_devices~0.offset := 34, 0;call #Ultimate.allocInit(16, 34);call write~init~$Pointer$(~#loop_devices~0.base, ~#loop_devices~0.offset, ~#loop_devices~0.base, ~#loop_devices~0.offset, 8);call write~init~$Pointer$(~#loop_devices~0.base, ~#loop_devices~0.offset, ~#loop_devices~0.base, 8 + ~#loop_devices~0.offset, 8);~#loop_devices_mutex~0.base, ~#loop_devices_mutex~0.offset := 35, 0;call #Ultimate.allocInit(156, 35);call write~init~int(1, ~#loop_devices_mutex~0.base, ~#loop_devices_mutex~0.offset, 4);call write~init~int(0, ~#loop_devices_mutex~0.base, 4 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(3735899821, ~#loop_devices_mutex~0.base, 8 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(4294967295, ~#loop_devices_mutex~0.base, 12 + ~#loop_devices_mutex~0.offset, 4);call write~init~$Pointer$(0, 1152921504606846975, ~#loop_devices_mutex~0.base, 16 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 24 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 32 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 40 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(6, 0, ~#loop_devices_mutex~0.base, 48 + ~#loop_devices_mutex~0.offset, 8);call write~init~int(0, ~#loop_devices_mutex~0.base, 56 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(0, ~#loop_devices_mutex~0.base, 60 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(~#loop_devices_mutex~0.base, 72 + ~#loop_devices_mutex~0.offset, ~#loop_devices_mutex~0.base, 72 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(~#loop_devices_mutex~0.base, 72 + ~#loop_devices_mutex~0.offset, ~#loop_devices_mutex~0.base, 80 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 88 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 96 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(~#loop_devices_mutex~0.base, ~#loop_devices_mutex~0.offset, ~#loop_devices_mutex~0.base, 104 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 112 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 120 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 128 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(7, 0, ~#loop_devices_mutex~0.base, 136 + ~#loop_devices_mutex~0.offset, 8);call write~init~int(0, ~#loop_devices_mutex~0.base, 144 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(0, ~#loop_devices_mutex~0.base, 148 + ~#loop_devices_mutex~0.offset, 8);~max_part~0 := 0;~part_shift~0 := 0;~#none_funcs~0.base, ~#none_funcs~0.offset := 36, 0;call #Ultimate.allocInit(44, 36);call write~init~int(0, ~#none_funcs~0.base, ~#none_funcs~0.offset, 4);call write~init~$Pointer$(#funAddr~transfer_none.base, #funAddr~transfer_none.offset, ~#none_funcs~0.base, 4 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 12 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 20 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 28 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 36 + ~#none_funcs~0.offset, 8);~#xor_funcs~0.base, ~#xor_funcs~0.offset := 37, 0;call #Ultimate.allocInit(44, 37);call write~init~int(1, ~#xor_funcs~0.base, ~#xor_funcs~0.offset, 4);call write~init~$Pointer$(#funAddr~transfer_xor.base, #funAddr~transfer_xor.offset, ~#xor_funcs~0.base, 4 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(#funAddr~xor_init.base, #funAddr~xor_init.offset, ~#xor_funcs~0.base, 12 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xor_funcs~0.base, 20 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xor_funcs~0.base, 28 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xor_funcs~0.base, 36 + ~#xor_funcs~0.offset, 8);~#xfer_funcs~0.base, ~#xfer_funcs~0.offset := 38, 0;call #Ultimate.allocInit(160, 38);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#xfer_funcs~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#xfer_funcs~0.base);call write~unchecked~$Pointer$(~#none_funcs~0.base, ~#none_funcs~0.offset, ~#xfer_funcs~0.base, ~#xfer_funcs~0.offset, 8);call write~unchecked~$Pointer$(~#xor_funcs~0.base, ~#xor_funcs~0.offset, ~#xfer_funcs~0.base, 8 + ~#xfer_funcs~0.offset, 8);~#loop_attr_backing_file~0.base, ~#loop_attr_backing_file~0.offset := 39, 0;call #Ultimate.allocInit(44, 39);call write~init~$Pointer$(20, 0, ~#loop_attr_backing_file~0.base, ~#loop_attr_backing_file~0.offset, 8);call write~init~int(292, ~#loop_attr_backing_file~0.base, 8 + ~#loop_attr_backing_file~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_backing_file~0.base, 12 + ~#loop_attr_backing_file~0.offset, 8);call write~init~int(0, ~#loop_attr_backing_file~0.base, 20 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 21 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 22 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 23 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 24 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 25 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 26 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 27 + ~#loop_attr_backing_file~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_backing_file.base, #funAddr~loop_attr_do_show_backing_file.offset, ~#loop_attr_backing_file~0.base, 28 + ~#loop_attr_backing_file~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_backing_file~0.base, 36 + ~#loop_attr_backing_file~0.offset, 8);~#loop_attr_offset~0.base, ~#loop_attr_offset~0.offset := 40, 0;call #Ultimate.allocInit(44, 40);call write~init~$Pointer$(21, 0, ~#loop_attr_offset~0.base, ~#loop_attr_offset~0.offset, 8);call write~init~int(292, ~#loop_attr_offset~0.base, 8 + ~#loop_attr_offset~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_offset~0.base, 12 + ~#loop_attr_offset~0.offset, 8);call write~init~int(0, ~#loop_attr_offset~0.base, 20 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 21 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 22 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 23 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 24 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 25 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 26 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 27 + ~#loop_attr_offset~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_offset.base, #funAddr~loop_attr_do_show_offset.offset, ~#loop_attr_offset~0.base, 28 + ~#loop_attr_offset~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_offset~0.base, 36 + ~#loop_attr_offset~0.offset, 8);~#loop_attr_sizelimit~0.base, ~#loop_attr_sizelimit~0.offset := 41, 0;call #Ultimate.allocInit(44, 41);call write~init~$Pointer$(22, 0, ~#loop_attr_sizelimit~0.base, ~#loop_attr_sizelimit~0.offset, 8);call write~init~int(292, ~#loop_attr_sizelimit~0.base, 8 + ~#loop_attr_sizelimit~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_sizelimit~0.base, 12 + ~#loop_attr_sizelimit~0.offset, 8);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 20 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 21 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 22 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 23 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 24 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 25 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 26 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 27 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_sizelimit.base, #funAddr~loop_attr_do_show_sizelimit.offset, ~#loop_attr_sizelimit~0.base, 28 + ~#loop_attr_sizelimit~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_sizelimit~0.base, 36 + ~#loop_attr_sizelimit~0.offset, 8);~#loop_attr_autoclear~0.base, ~#loop_attr_autoclear~0.offset := 42, 0;call #Ultimate.allocInit(44, 42);call write~init~$Pointer$(23, 0, ~#loop_attr_autoclear~0.base, ~#loop_attr_autoclear~0.offset, 8);call write~init~int(292, ~#loop_attr_autoclear~0.base, 8 + ~#loop_attr_autoclear~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_autoclear~0.base, 12 + ~#loop_attr_autoclear~0.offset, 8);call write~init~int(0, ~#loop_attr_autoclear~0.base, 20 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 21 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 22 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 23 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 24 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 25 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 26 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 27 + ~#loop_attr_autoclear~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_autoclear.base, #funAddr~loop_attr_do_show_autoclear.offset, ~#loop_attr_autoclear~0.base, 28 + ~#loop_attr_autoclear~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_autoclear~0.base, 36 + ~#loop_attr_autoclear~0.offset, 8);~#loop_attrs~0.base, ~#loop_attrs~0.offset := 43, 0;call #Ultimate.allocInit(40, 43);call write~init~$Pointer$(~#loop_attr_backing_file~0.base, ~#loop_attr_backing_file~0.offset, ~#loop_attrs~0.base, ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(~#loop_attr_offset~0.base, ~#loop_attr_offset~0.offset, ~#loop_attrs~0.base, 8 + ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(~#loop_attr_sizelimit~0.base, ~#loop_attr_sizelimit~0.offset, ~#loop_attrs~0.base, 16 + ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(~#loop_attr_autoclear~0.base, ~#loop_attr_autoclear~0.offset, ~#loop_attrs~0.base, 24 + ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attrs~0.base, 32 + ~#loop_attrs~0.offset, 8);~#loop_attribute_group~0.base, ~#loop_attribute_group~0.offset := 44, 0;call #Ultimate.allocInit(24, 44);call write~init~$Pointer$(24, 0, ~#loop_attribute_group~0.base, ~#loop_attribute_group~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attribute_group~0.base, 8 + ~#loop_attribute_group~0.offset, 8);call write~init~$Pointer$(~#loop_attrs~0.base, ~#loop_attrs~0.offset, ~#loop_attribute_group~0.base, 16 + ~#loop_attribute_group~0.offset, 8);~#lo_fops~0.base, ~#lo_fops~0.offset := 45, 0;call #Ultimate.allocInit(96, 45);call write~init~$Pointer$(#funAddr~lo_open.base, #funAddr~lo_open.offset, ~#lo_fops~0.base, ~#lo_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~lo_release.base, #funAddr~lo_release.offset, ~#lo_fops~0.base, 8 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~lo_ioctl.base, #funAddr~lo_ioctl.offset, ~#lo_fops~0.base, 16 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~lo_compat_ioctl.base, #funAddr~lo_compat_ioctl.offset, ~#lo_fops~0.base, 24 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 32 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 40 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 48 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 56 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 64 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 72 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 80 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#lo_fops~0.base, 88 + ~#lo_fops~0.offset, 8);~max_loop~0 := 0;~LDV_IN_INTERRUPT~0 := 0;~ldv_module_refcounter~0 := 1; {28096#(= ~max_loop~0 0)} is VALID [2022-02-20 21:14:36,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {28096#(= ~max_loop~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret737#1, main_#t~nondet738#1, main_#t~ret739#1, main_#t~ret740#1, main_#t~ret741#1, main_#t~ret742#1, main_#t~ret743#1, main_#t~ret744#1, main_#t~ret745#1, main_#t~nondet746#1, main_~var_group1~0#1.base, main_~var_group1~0#1.offset, main_~var_transfer_none_0_p1~0#1, main_~var_transfer_none_0_p2~0#1.base, main_~var_transfer_none_0_p2~0#1.offset, main_~var_transfer_none_0_p3~0#1, main_~var_transfer_none_0_p4~0#1.base, main_~var_transfer_none_0_p4~0#1.offset, main_~var_transfer_none_0_p5~0#1, main_~var_transfer_none_0_p6~0#1, main_~var_transfer_none_0_p7~0#1, main_~var_transfer_xor_1_p1~0#1, main_~var_transfer_xor_1_p2~0#1.base, main_~var_transfer_xor_1_p2~0#1.offset, main_~var_transfer_xor_1_p3~0#1, main_~var_transfer_xor_1_p4~0#1.base, main_~var_transfer_xor_1_p4~0#1.offset, main_~var_transfer_xor_1_p5~0#1, main_~var_transfer_xor_1_p6~0#1, main_~var_transfer_xor_1_p7~0#1, main_~var_xor_init_2_p1~0#1.base, main_~var_xor_init_2_p1~0#1.offset, main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~var_lo_open_51_p1~0#1, main_~res_lo_open_51~0#1, main_~var_group3~0#1.base, main_~var_group3~0#1.offset, main_~var_lo_release_52_p1~0#1, main_~var_lo_ioctl_45_p1~0#1, main_~var_lo_ioctl_45_p2~0#1, main_~var_lo_ioctl_45_p3~0#1, main_~var_lo_compat_ioctl_50_p1~0#1, main_~var_lo_compat_ioctl_50_p2~0#1, main_~var_lo_compat_ioctl_50_p3~0#1, main_~ldv_s_lo_fops_block_device_operations~0#1, main_~tmp~63#1, main_~tmp___0~28#1, main_~tmp___1~10#1;havoc main_~var_group1~0#1.base, main_~var_group1~0#1.offset;havoc main_~var_transfer_none_0_p1~0#1;havoc main_~var_transfer_none_0_p2~0#1.base, main_~var_transfer_none_0_p2~0#1.offset;havoc main_~var_transfer_none_0_p3~0#1;havoc main_~var_transfer_none_0_p4~0#1.base, main_~var_transfer_none_0_p4~0#1.offset;havoc main_~var_transfer_none_0_p5~0#1;havoc main_~var_transfer_none_0_p6~0#1;havoc main_~var_transfer_none_0_p7~0#1;havoc main_~var_transfer_xor_1_p1~0#1;havoc main_~var_transfer_xor_1_p2~0#1.base, main_~var_transfer_xor_1_p2~0#1.offset;havoc main_~var_transfer_xor_1_p3~0#1;havoc main_~var_transfer_xor_1_p4~0#1.base, main_~var_transfer_xor_1_p4~0#1.offset;havoc main_~var_transfer_xor_1_p5~0#1;havoc main_~var_transfer_xor_1_p6~0#1;havoc main_~var_transfer_xor_1_p7~0#1;havoc main_~var_xor_init_2_p1~0#1.base, main_~var_xor_init_2_p1~0#1.offset;havoc main_~var_group2~0#1.base, main_~var_group2~0#1.offset;havoc main_~var_lo_open_51_p1~0#1;havoc main_~res_lo_open_51~0#1;havoc main_~var_group3~0#1.base, main_~var_group3~0#1.offset;havoc main_~var_lo_release_52_p1~0#1;havoc main_~var_lo_ioctl_45_p1~0#1;havoc main_~var_lo_ioctl_45_p2~0#1;havoc main_~var_lo_ioctl_45_p3~0#1;havoc main_~var_lo_compat_ioctl_50_p1~0#1;havoc main_~var_lo_compat_ioctl_50_p2~0#1;havoc main_~var_lo_compat_ioctl_50_p3~0#1;havoc main_~ldv_s_lo_fops_block_device_operations~0#1;havoc main_~tmp~63#1;havoc main_~tmp___0~28#1;havoc main_~tmp___1~10#1;main_~ldv_s_lo_fops_block_device_operations~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true; {28096#(= ~max_loop~0 0)} is VALID [2022-02-20 21:14:36,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {28096#(= ~max_loop~0 0)} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_loop_init } true;havoc loop_init_#res#1;havoc loop_init_#t~ret722#1, loop_init_#t~ret723#1, loop_init_#t~ret724#1.base, loop_init_#t~ret724#1.offset, loop_init_#t~mem725#1.base, loop_init_#t~mem725#1.offset, loop_init_#t~mem726#1.base, loop_init_#t~mem726#1.offset, loop_init_#t~mem727#1.base, loop_init_#t~mem727#1.offset, loop_init_#t~nondet728#1, loop_init_#t~nondet729#1, loop_init_#t~mem730#1.base, loop_init_#t~mem730#1.offset, loop_init_#t~mem731#1.base, loop_init_#t~mem731#1.offset, loop_init_#t~mem732#1.base, loop_init_#t~mem732#1.offset, loop_init_~i~4#1, loop_init_~nr~0#1, loop_init_~range~0#1, loop_init_~lo~12#1.base, loop_init_~lo~12#1.offset, loop_init_~next~0#1.base, loop_init_~next~0#1.offset, loop_init_~tmp~62#1, loop_init_~__mptr~3#1.base, loop_init_~__mptr~3#1.offset, loop_init_~__mptr___0~3#1.base, loop_init_~__mptr___0~3#1.offset, loop_init_~__mptr___1~0#1.base, loop_init_~__mptr___1~0#1.offset, loop_init_~__mptr___2~0#1.base, loop_init_~__mptr___2~0#1.offset, loop_init_~__mptr___3~0#1.base, loop_init_~__mptr___3~0#1.offset;havoc loop_init_~i~4#1;havoc loop_init_~nr~0#1;havoc loop_init_~range~0#1;havoc loop_init_~lo~12#1.base, loop_init_~lo~12#1.offset;havoc loop_init_~next~0#1.base, loop_init_~next~0#1.offset;havoc loop_init_~tmp~62#1;havoc loop_init_~__mptr~3#1.base, loop_init_~__mptr~3#1.offset;havoc loop_init_~__mptr___0~3#1.base, loop_init_~__mptr___0~3#1.offset;havoc loop_init_~__mptr___1~0#1.base, loop_init_~__mptr___1~0#1.offset;havoc loop_init_~__mptr___2~0#1.base, loop_init_~__mptr___2~0#1.offset;havoc loop_init_~__mptr___3~0#1.base, loop_init_~__mptr___3~0#1.offset;~part_shift~0 := 0; {28096#(= ~max_loop~0 0)} is VALID [2022-02-20 21:14:36,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {28096#(= ~max_loop~0 0)} assume !(~max_part~0 > 0); {28096#(= ~max_loop~0 0)} is VALID [2022-02-20 21:14:36,143 INFO L290 TraceCheckUtils]: 4: Hoare triple {28096#(= ~max_loop~0 0)} assume !(~shiftLeft(1, ~part_shift~0) % 18446744073709551616 > 256); {28096#(= ~max_loop~0 0)} is VALID [2022-02-20 21:14:36,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {28096#(= ~max_loop~0 0)} assume !(~max_loop~0 % 18446744073709551616 > ~shiftLeft(1, 20 - ~part_shift~0) % 18446744073709551616); {28096#(= ~max_loop~0 0)} is VALID [2022-02-20 21:14:36,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {28096#(= ~max_loop~0 0)} assume 0 != ~max_loop~0;loop_init_~nr~0#1 := ~max_loop~0;loop_init_~range~0#1 := ~shiftLeft(~max_loop~0, ~part_shift~0); {28095#false} is VALID [2022-02-20 21:14:36,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {28095#false} assume { :begin_inline_register_blkdev } true;register_blkdev_#in~arg0#1, register_blkdev_#in~arg1#1.base, register_blkdev_#in~arg1#1.offset := 7, 29, 0;havoc register_blkdev_#res#1;havoc register_blkdev_#t~nondet775#1, register_blkdev_~arg0#1, register_blkdev_~arg1#1.base, register_blkdev_~arg1#1.offset;register_blkdev_~arg0#1 := register_blkdev_#in~arg0#1;register_blkdev_~arg1#1.base, register_blkdev_~arg1#1.offset := register_blkdev_#in~arg1#1.base, register_blkdev_#in~arg1#1.offset;assume -2147483648 <= register_blkdev_#t~nondet775#1 && register_blkdev_#t~nondet775#1 <= 2147483647;register_blkdev_#res#1 := register_blkdev_#t~nondet775#1;havoc register_blkdev_#t~nondet775#1; {28095#false} is VALID [2022-02-20 21:14:36,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {28095#false} loop_init_#t~ret723#1 := register_blkdev_#res#1;assume { :end_inline_register_blkdev } true;assume -2147483648 <= loop_init_#t~ret723#1 && loop_init_#t~ret723#1 <= 2147483647;loop_init_~tmp~62#1 := loop_init_#t~ret723#1;havoc loop_init_#t~ret723#1; {28095#false} is VALID [2022-02-20 21:14:36,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {28095#false} assume 0 != loop_init_~tmp~62#1;loop_init_#res#1 := -5; {28095#false} is VALID [2022-02-20 21:14:36,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {28095#false} main_#t~ret737#1 := loop_init_#res#1;assume { :end_inline_loop_init } true;assume -2147483648 <= main_#t~ret737#1 && main_#t~ret737#1 <= 2147483647;main_~tmp~63#1 := main_#t~ret737#1;havoc main_#t~ret737#1; {28095#false} is VALID [2022-02-20 21:14:36,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {28095#false} assume !(0 != main_~tmp~63#1); {28095#false} is VALID [2022-02-20 21:14:36,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {28095#false} assume -2147483648 <= main_#t~nondet746#1 && main_#t~nondet746#1 <= 2147483647;main_~tmp___1~10#1 := main_#t~nondet746#1;havoc main_#t~nondet746#1; {28095#false} is VALID [2022-02-20 21:14:36,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {28095#false} assume 0 != main_~tmp___1~10#1; {28095#false} is VALID [2022-02-20 21:14:36,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {28095#false} assume -2147483648 <= main_#t~nondet738#1 && main_#t~nondet738#1 <= 2147483647;main_~tmp___0~28#1 := main_#t~nondet738#1;havoc main_#t~nondet738#1; {28095#false} is VALID [2022-02-20 21:14:36,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {28095#false} assume !(0 == main_~tmp___0~28#1); {28095#false} is VALID [2022-02-20 21:14:36,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {28095#false} assume !(1 == main_~tmp___0~28#1); {28095#false} is VALID [2022-02-20 21:14:36,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {28095#false} assume !(2 == main_~tmp___0~28#1); {28095#false} is VALID [2022-02-20 21:14:36,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {28095#false} assume !(3 == main_~tmp___0~28#1); {28095#false} is VALID [2022-02-20 21:14:36,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {28095#false} assume !(4 == main_~tmp___0~28#1); {28095#false} is VALID [2022-02-20 21:14:36,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {28095#false} assume 5 == main_~tmp___0~28#1; {28095#false} is VALID [2022-02-20 21:14:36,149 INFO L272 TraceCheckUtils]: 21: Hoare triple {28095#false} call main_#t~ret744#1 := lo_ioctl(main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~var_lo_ioctl_45_p1~0#1, main_~var_lo_ioctl_45_p2~0#1, main_~var_lo_ioctl_45_p3~0#1); {28095#false} is VALID [2022-02-20 21:14:36,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {28095#false} ~bdev#1.base, ~bdev#1.offset := #in~bdev#1.base, #in~bdev#1.offset;~mode#1 := #in~mode#1;~cmd#1 := #in~cmd#1;~arg#1 := #in~arg#1;havoc ~lo~4#1.base, ~lo~4#1.offset;havoc ~err~6#1;havoc ~tmp~55#1;havoc ~tmp___0~25#1;call #t~mem607#1.base, #t~mem607#1.offset := read~$Pointer$(~bdev#1.base, 261 + ~bdev#1.offset, 8);call #t~mem608#1.base, #t~mem608#1.offset := read~$Pointer$(#t~mem607#1.base, 1248 + #t~mem607#1.offset, 8);~lo~4#1.base, ~lo~4#1.offset := #t~mem608#1.base, #t~mem608#1.offset;havoc #t~mem607#1.base, #t~mem607#1.offset;havoc #t~mem608#1.base, #t~mem608#1.offset; {28095#false} is VALID [2022-02-20 21:14:36,151 INFO L272 TraceCheckUtils]: 23: Hoare triple {28095#false} call mutex_lock_nested(~lo~4#1.base, 348 + ~lo~4#1.offset, 1); {28094#true} is VALID [2022-02-20 21:14:36,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {28094#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {28094#true} is VALID [2022-02-20 21:14:36,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {28094#true} assume true; {28094#true} is VALID [2022-02-20 21:14:36,163 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {28094#true} {28095#false} #2635#return; {28095#false} is VALID [2022-02-20 21:14:36,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {28095#false} assume 19456 == (if ~cmd#1 % 4294967296 % 4294967296 <= 2147483647 then ~cmd#1 % 4294967296 % 4294967296 else ~cmd#1 % 4294967296 % 4294967296 - 4294967296); {28095#false} is VALID [2022-02-20 21:14:36,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {28095#false} assume { :begin_inline_loop_set_fd } true;loop_set_fd_#in~lo#1.base, loop_set_fd_#in~lo#1.offset, loop_set_fd_#in~mode#1, loop_set_fd_#in~bdev#1.base, loop_set_fd_#in~bdev#1.offset, loop_set_fd_#in~arg#1 := ~lo~4#1.base, ~lo~4#1.offset, ~mode#1, ~bdev#1.base, ~bdev#1.offset, ~arg#1;havoc loop_set_fd_#res#1;havoc loop_set_fd_#t~ret399#1.base, loop_set_fd_#t~ret399#1.offset, loop_set_fd_#t~mem400#1, loop_set_fd_#t~mem401#1.base, loop_set_fd_#t~mem401#1.offset, loop_set_fd_#t~mem402#1.base, loop_set_fd_#t~mem402#1.offset, loop_set_fd_#t~mem403#1.base, loop_set_fd_#t~mem403#1.offset, loop_set_fd_#t~mem404#1.base, loop_set_fd_#t~mem404#1.offset, loop_set_fd_#t~mem405#1.base, loop_set_fd_#t~mem405#1.offset, loop_set_fd_#t~mem406#1.base, loop_set_fd_#t~mem406#1.offset, loop_set_fd_#t~mem407#1.base, loop_set_fd_#t~mem407#1.offset, loop_set_fd_#t~mem408#1.base, loop_set_fd_#t~mem408#1.offset, loop_set_fd_#t~mem409#1, loop_set_fd_#t~mem410#1.base, loop_set_fd_#t~mem410#1.offset, loop_set_fd_#t~ret411#1, loop_set_fd_#t~mem412#1.base, loop_set_fd_#t~mem412#1.offset, loop_set_fd_#t~mem413#1.base, loop_set_fd_#t~mem413#1.offset, loop_set_fd_#t~mem414#1, loop_set_fd_#t~nondet415#1, loop_set_fd_#t~mem416#1, loop_set_fd_#t~mem417#1, loop_set_fd_#t~mem418#1.base, loop_set_fd_#t~mem418#1.offset, loop_set_fd_#t~mem419#1.base, loop_set_fd_#t~mem419#1.offset, loop_set_fd_#t~nondet420#1, loop_set_fd_#t~mem421#1.base, loop_set_fd_#t~mem421#1.offset, loop_set_fd_#t~mem422#1.base, loop_set_fd_#t~mem422#1.offset, loop_set_fd_#t~nondet423#1, loop_set_fd_#t~mem424#1, loop_set_fd_#t~mem425#1.base, loop_set_fd_#t~mem425#1.offset, loop_set_fd_#t~mem426#1, loop_set_fd_#t~ret427#1, loop_set_fd_#t~nondet428#1, loop_set_fd_#t~ret429#1, loop_set_fd_#t~mem430#1, loop_set_fd_#t~mem431#1.base, loop_set_fd_#t~mem431#1.offset, loop_set_fd_#t~mem432#1.base, loop_set_fd_#t~mem432#1.offset, loop_set_fd_#t~mem433#1.base, loop_set_fd_#t~mem433#1.offset, loop_set_fd_#t~mem434#1.base, loop_set_fd_#t~mem434#1.offset, loop_set_fd_#t~mem435#1.base, loop_set_fd_#t~mem435#1.offset, loop_set_fd_#t~mem436#1.base, loop_set_fd_#t~mem436#1.offset, loop_set_fd_#t~ret437#1, loop_set_fd_#t~mem438#1.base, loop_set_fd_#t~mem438#1.offset, loop_set_fd_#t~ret439#1, loop_set_fd_#t~ret440#1, loop_set_fd_#t~nondet441#1.base, loop_set_fd_#t~nondet441#1.offset, loop_set_fd_#t~mem442#1, loop_set_fd_#t~mem443#1.base, loop_set_fd_#t~mem443#1.offset, loop_set_fd_#t~ret444#1, loop_set_fd_#t~mem445#1.base, loop_set_fd_#t~mem445#1.offset, loop_set_fd_#t~ret446#1, loop_set_fd_#t~mem447#1.base, loop_set_fd_#t~mem447#1.offset, loop_set_fd_#t~ret448#1, loop_set_fd_#t~ret449#1, loop_set_fd_#t~mem450#1.base, loop_set_fd_#t~mem450#1.offset, loop_set_fd_#t~mem451#1.base, loop_set_fd_#t~mem451#1.offset, loop_set_fd_#t~ret452#1, loop_set_fd_#t~mem453#1, loop_set_fd_~lo#1.base, loop_set_fd_~lo#1.offset, loop_set_fd_~mode#1, loop_set_fd_~bdev#1.base, loop_set_fd_~bdev#1.offset, loop_set_fd_~arg#1, loop_set_fd_~file~5#1.base, loop_set_fd_~file~5#1.offset, loop_set_fd_~f~0#1.base, loop_set_fd_~f~0#1.offset, loop_set_fd_~inode~1#1.base, loop_set_fd_~inode~1#1.offset, loop_set_fd_~mapping~2#1.base, loop_set_fd_~mapping~2#1.offset, loop_set_fd_~lo_blocksize~0#1, loop_set_fd_~lo_flags~0#1, loop_set_fd_~error~1#1, loop_set_fd_~size~4#1, loop_set_fd_~l~1#1.base, loop_set_fd_~l~1#1.offset, loop_set_fd_~tmp~46#1, loop_set_fd_~aops~0#1.base, loop_set_fd_~aops~0#1.offset, loop_set_fd_~tmp___0~19#1, loop_set_fd_~tmp___1~8#1;loop_set_fd_~lo#1.base, loop_set_fd_~lo#1.offset := loop_set_fd_#in~lo#1.base, loop_set_fd_#in~lo#1.offset;loop_set_fd_~mode#1 := loop_set_fd_#in~mode#1;loop_set_fd_~bdev#1.base, loop_set_fd_~bdev#1.offset := loop_set_fd_#in~bdev#1.base, loop_set_fd_#in~bdev#1.offset;loop_set_fd_~arg#1 := loop_set_fd_#in~arg#1;havoc loop_set_fd_~file~5#1.base, loop_set_fd_~file~5#1.offset;havoc loop_set_fd_~f~0#1.base, loop_set_fd_~f~0#1.offset;havoc loop_set_fd_~inode~1#1.base, loop_set_fd_~inode~1#1.offset;havoc loop_set_fd_~mapping~2#1.base, loop_set_fd_~mapping~2#1.offset;havoc loop_set_fd_~lo_blocksize~0#1;havoc loop_set_fd_~lo_flags~0#1;havoc loop_set_fd_~error~1#1;havoc loop_set_fd_~size~4#1;havoc loop_set_fd_~l~1#1.base, loop_set_fd_~l~1#1.offset;havoc loop_set_fd_~tmp~46#1;havoc loop_set_fd_~aops~0#1.base, loop_set_fd_~aops~0#1.offset;havoc loop_set_fd_~tmp___0~19#1;havoc loop_set_fd_~tmp___1~8#1;loop_set_fd_~lo_flags~0#1 := 0;assume { :begin_inline_ldv___module_get_1 } true;ldv___module_get_1_#in~module#1.base, ldv___module_get_1_#in~module#1.offset := ~#__this_module~0.base, ~#__this_module~0.offset;havoc ldv___module_get_1_~module#1.base, ldv___module_get_1_~module#1.offset;ldv___module_get_1_~module#1.base, ldv___module_get_1_~module#1.offset := ldv___module_get_1_#in~module#1.base, ldv___module_get_1_#in~module#1.offset;assume { :begin_inline_ldv_module_get } true;ldv_module_get_#in~module#1.base, ldv_module_get_#in~module#1.offset := ldv___module_get_1_~module#1.base, ldv___module_get_1_~module#1.offset;havoc ldv_module_get_~module#1.base, ldv_module_get_~module#1.offset;ldv_module_get_~module#1.base, ldv_module_get_~module#1.offset := ldv_module_get_#in~module#1.base, ldv_module_get_#in~module#1.offset; {28095#false} is VALID [2022-02-20 21:14:36,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {28095#false} assume !(0 != (ldv_module_get_~module#1.base + ldv_module_get_~module#1.offset) % 18446744073709551616); {28095#false} is VALID [2022-02-20 21:14:36,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {28095#false} assume { :end_inline_ldv_module_get } true; {28095#false} is VALID [2022-02-20 21:14:36,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {28095#false} assume { :end_inline_ldv___module_get_1 } true;loop_set_fd_~error~1#1 := -9; {28095#false} is VALID [2022-02-20 21:14:36,164 INFO L272 TraceCheckUtils]: 32: Hoare triple {28095#false} call loop_set_fd_#t~ret399#1.base, loop_set_fd_#t~ret399#1.offset := fget(loop_set_fd_~arg#1); {28109#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:14:36,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {28109#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {28094#true} is VALID [2022-02-20 21:14:36,166 INFO L272 TraceCheckUtils]: 34: Hoare triple {28094#true} call #t~ret764.base, #t~ret764.offset := ldv_malloc(320); {28109#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:14:36,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {28109#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1; {28094#true} is VALID [2022-02-20 21:14:36,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {28094#true} assume 0 != #t~nondet750#1 % 256;havoc #t~nondet750#1;#res#1.base, #res#1.offset := 0, 0; {28094#true} is VALID [2022-02-20 21:14:36,166 INFO L290 TraceCheckUtils]: 37: Hoare triple {28094#true} assume true; {28094#true} is VALID [2022-02-20 21:14:36,166 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {28094#true} {28094#true} #2811#return; {28094#true} is VALID [2022-02-20 21:14:36,166 INFO L290 TraceCheckUtils]: 39: Hoare triple {28094#true} #res.base, #res.offset := #t~ret764.base, #t~ret764.offset;havoc #t~ret764.base, #t~ret764.offset; {28094#true} is VALID [2022-02-20 21:14:36,166 INFO L290 TraceCheckUtils]: 40: Hoare triple {28094#true} assume true; {28094#true} is VALID [2022-02-20 21:14:36,167 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {28094#true} {28095#false} #2637#return; {28095#false} is VALID [2022-02-20 21:14:36,167 INFO L290 TraceCheckUtils]: 42: Hoare triple {28095#false} loop_set_fd_~file~5#1.base, loop_set_fd_~file~5#1.offset := loop_set_fd_#t~ret399#1.base, loop_set_fd_#t~ret399#1.offset;havoc loop_set_fd_#t~ret399#1.base, loop_set_fd_#t~ret399#1.offset; {28095#false} is VALID [2022-02-20 21:14:36,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {28095#false} assume 0 == (loop_set_fd_~file~5#1.base + loop_set_fd_~file~5#1.offset) % 18446744073709551616; {28095#false} is VALID [2022-02-20 21:14:36,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {28095#false} assume { :begin_inline_ldv_module_put_2 } true;ldv_module_put_2_#in~ldv_func_arg1#1.base, ldv_module_put_2_#in~ldv_func_arg1#1.offset := ~#__this_module~0.base, ~#__this_module~0.offset;havoc ldv_module_put_2_~ldv_func_arg1#1.base, ldv_module_put_2_~ldv_func_arg1#1.offset;ldv_module_put_2_~ldv_func_arg1#1.base, ldv_module_put_2_~ldv_func_arg1#1.offset := ldv_module_put_2_#in~ldv_func_arg1#1.base, ldv_module_put_2_#in~ldv_func_arg1#1.offset; {28095#false} is VALID [2022-02-20 21:14:36,167 INFO L272 TraceCheckUtils]: 45: Hoare triple {28095#false} call ldv_module_put(ldv_module_put_2_~ldv_func_arg1#1.base, ldv_module_put_2_~ldv_func_arg1#1.offset); {28095#false} is VALID [2022-02-20 21:14:36,167 INFO L290 TraceCheckUtils]: 46: Hoare triple {28095#false} ~module.base, ~module.offset := #in~module.base, #in~module.offset; {28095#false} is VALID [2022-02-20 21:14:36,167 INFO L290 TraceCheckUtils]: 47: Hoare triple {28095#false} assume 0 != (~module.base + ~module.offset) % 18446744073709551616; {28095#false} is VALID [2022-02-20 21:14:36,168 INFO L290 TraceCheckUtils]: 48: Hoare triple {28095#false} assume ~ldv_module_refcounter~0 <= 1; {28095#false} is VALID [2022-02-20 21:14:36,168 INFO L272 TraceCheckUtils]: 49: Hoare triple {28095#false} call ldv_blast_assert(); {28095#false} is VALID [2022-02-20 21:14:36,168 INFO L290 TraceCheckUtils]: 50: Hoare triple {28095#false} assume !false; {28095#false} is VALID [2022-02-20 21:14:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:14:36,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:14:36,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239487818] [2022-02-20 21:14:36,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239487818] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:14:36,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:14:36,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:14:36,171 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654821548] [2022-02-20 21:14:36,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:14:36,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-02-20 21:14:36,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:14:36,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:14:36,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:14:36,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:14:36,223 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:14:36,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:14:36,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:14:36,224 INFO L87 Difference]: Start difference. First operand 2163 states and 2984 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:14:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:14:45,409 INFO L93 Difference]: Finished difference Result 4764 states and 6650 transitions. [2022-02-20 21:14:45,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 21:14:45,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-02-20 21:14:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:14:45,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:14:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3423 transitions. [2022-02-20 21:14:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:14:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3423 transitions. [2022-02-20 21:14:45,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 3423 transitions. [2022-02-20 21:14:48,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3423 edges. 3423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:14:48,431 INFO L225 Difference]: With dead ends: 4764 [2022-02-20 21:14:48,432 INFO L226 Difference]: Without dead ends: 2609 [2022-02-20 21:14:48,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:14:48,437 INFO L933 BasicCegarLoop]: 1472 mSDtfsCounter, 2078 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 582 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2231 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 582 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 21:14:48,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2231 Valid, 2196 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [582 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 21:14:48,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2022-02-20 21:14:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 2163. [2022-02-20 21:14:48,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:14:48,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2609 states. Second operand has 2163 states, 1610 states have (on average 1.317391304347826) internal successors, (2121), 1630 states have internal predecessors, (2121), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-02-20 21:14:48,490 INFO L74 IsIncluded]: Start isIncluded. First operand 2609 states. Second operand has 2163 states, 1610 states have (on average 1.317391304347826) internal successors, (2121), 1630 states have internal predecessors, (2121), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-02-20 21:14:48,492 INFO L87 Difference]: Start difference. First operand 2609 states. Second operand has 2163 states, 1610 states have (on average 1.317391304347826) internal successors, (2121), 1630 states have internal predecessors, (2121), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-02-20 21:14:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:14:48,681 INFO L93 Difference]: Finished difference Result 2609 states and 3674 transitions. [2022-02-20 21:14:48,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 3674 transitions. [2022-02-20 21:14:48,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:14:48,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:14:48,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 2163 states, 1610 states have (on average 1.317391304347826) internal successors, (2121), 1630 states have internal predecessors, (2121), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) Second operand 2609 states. [2022-02-20 21:14:48,697 INFO L87 Difference]: Start difference. First operand has 2163 states, 1610 states have (on average 1.317391304347826) internal successors, (2121), 1630 states have internal predecessors, (2121), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) Second operand 2609 states. [2022-02-20 21:14:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:14:48,890 INFO L93 Difference]: Finished difference Result 2609 states and 3674 transitions. [2022-02-20 21:14:48,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 3674 transitions. [2022-02-20 21:14:48,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:14:48,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:14:48,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:14:48,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:14:48,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 1610 states have (on average 1.317391304347826) internal successors, (2121), 1630 states have internal predecessors, (2121), 429 states have call successors, (429), 124 states have call predecessors, (429), 123 states have return successors, (432), 425 states have call predecessors, (432), 427 states have call successors, (432) [2022-02-20 21:14:49,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 2982 transitions. [2022-02-20 21:14:49,119 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 2982 transitions. Word has length 51 [2022-02-20 21:14:49,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:14:49,120 INFO L470 AbstractCegarLoop]: Abstraction has 2163 states and 2982 transitions. [2022-02-20 21:14:49,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:14:49,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 2982 transitions. [2022-02-20 21:14:49,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 21:14:49,122 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:14:49,122 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:49,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 21:14:49,122 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:14:49,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:14:49,123 INFO L85 PathProgramCache]: Analyzing trace with hash -973306474, now seen corresponding path program 1 times [2022-02-20 21:14:49,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:14:49,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039960889] [2022-02-20 21:14:49,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:14:49,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:14:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:14:49,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 21:14:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:14:49,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {43085#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {43085#true} is VALID [2022-02-20 21:14:49,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {43085#true} assume true; {43085#true} is VALID [2022-02-20 21:14:49,212 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43085#true} {43086#false} #2635#return; {43086#false} is VALID [2022-02-20 21:14:49,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-20 21:14:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:14:49,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 21:14:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:14:49,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {43101#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1; {43085#true} is VALID [2022-02-20 21:14:49,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {43085#true} assume 0 != #t~nondet750#1 % 256;havoc #t~nondet750#1;#res#1.base, #res#1.offset := 0, 0; {43085#true} is VALID [2022-02-20 21:14:49,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {43085#true} assume true; {43085#true} is VALID [2022-02-20 21:14:49,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43085#true} {43085#true} #2811#return; {43085#true} is VALID [2022-02-20 21:14:49,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {43101#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {43085#true} is VALID [2022-02-20 21:14:49,233 INFO L272 TraceCheckUtils]: 1: Hoare triple {43085#true} call #t~ret764.base, #t~ret764.offset := ldv_malloc(320); {43101#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:14:49,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {43101#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1; {43085#true} is VALID [2022-02-20 21:14:49,233 INFO L290 TraceCheckUtils]: 3: Hoare triple {43085#true} assume 0 != #t~nondet750#1 % 256;havoc #t~nondet750#1;#res#1.base, #res#1.offset := 0, 0; {43085#true} is VALID [2022-02-20 21:14:49,233 INFO L290 TraceCheckUtils]: 4: Hoare triple {43085#true} assume true; {43085#true} is VALID [2022-02-20 21:14:49,233 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {43085#true} {43085#true} #2811#return; {43085#true} is VALID [2022-02-20 21:14:49,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {43085#true} #res.base, #res.offset := #t~ret764.base, #t~ret764.offset;havoc #t~ret764.base, #t~ret764.offset; {43085#true} is VALID [2022-02-20 21:14:49,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {43085#true} assume true; {43085#true} is VALID [2022-02-20 21:14:49,234 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {43085#true} {43086#false} #2637#return; {43086#false} is VALID [2022-02-20 21:14:49,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {43085#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(47, 2);call #Ultimate.allocInit(102, 3);call #Ultimate.allocInit(27, 4);call #Ultimate.allocInit(24, 5);call #Ultimate.allocInit(29, 6);call #Ultimate.allocInit(19, 7);call #Ultimate.allocInit(173, 8);call #Ultimate.allocInit(173, 9);call #Ultimate.allocInit(54, 10);call #Ultimate.allocInit(173, 11);call #Ultimate.allocInit(57, 12);call #Ultimate.allocInit(55, 13);call #Ultimate.allocInit(35, 14);call #Ultimate.allocInit(6, 15);call write~init~int(37, 15, 0, 1);call write~init~int(108, 15, 1, 1);call write~init~int(108, 15, 2, 1);call write~init~int(117, 15, 3, 1);call write~init~int(10, 15, 4, 1);call write~init~int(0, 15, 5, 1);call #Ultimate.allocInit(6, 16);call write~init~int(37, 16, 0, 1);call write~init~int(108, 16, 1, 1);call write~init~int(108, 16, 2, 1);call write~init~int(117, 16, 3, 1);call write~init~int(10, 16, 4, 1);call write~init~int(0, 16, 5, 1);call #Ultimate.allocInit(2, 17);call write~init~int(49, 17, 0, 1);call write~init~int(0, 17, 1, 1);call #Ultimate.allocInit(2, 18);call write~init~int(48, 18, 0, 1);call write~init~int(0, 18, 1, 1);call #Ultimate.allocInit(4, 19);call write~init~int(37, 19, 0, 1);call write~init~int(115, 19, 1, 1);call write~init~int(10, 19, 2, 1);call write~init~int(0, 19, 3, 1);call #Ultimate.allocInit(13, 20);call #Ultimate.allocInit(7, 21);call write~init~int(111, 21, 0, 1);call write~init~int(102, 21, 1, 1);call write~init~int(102, 21, 2, 1);call write~init~int(115, 21, 3, 1);call write~init~int(101, 21, 4, 1);call write~init~int(116, 21, 5, 1);call write~init~int(0, 21, 6, 1);call #Ultimate.allocInit(10, 22);call #Ultimate.allocInit(10, 23);call #Ultimate.allocInit(5, 24);call write~init~int(108, 24, 0, 1);call write~init~int(111, 24, 1, 1);call write~init~int(111, 24, 2, 1);call write~init~int(112, 24, 3, 1);call write~init~int(0, 24, 4, 1);call #Ultimate.allocInit(7, 25);call write~init~int(108, 25, 0, 1);call write~init~int(111, 25, 1, 1);call write~init~int(111, 25, 2, 1);call write~init~int(112, 25, 3, 1);call write~init~int(37, 25, 4, 1);call write~init~int(100, 25, 5, 1);call write~init~int(0, 25, 6, 1);call #Ultimate.allocInit(18, 26);call #Ultimate.allocInit(23, 27);call #Ultimate.allocInit(7, 28);call write~init~int(108, 28, 0, 1);call write~init~int(111, 28, 1, 1);call write~init~int(111, 28, 2, 1);call write~init~int(112, 28, 3, 1);call write~init~int(37, 28, 4, 1);call write~init~int(100, 28, 5, 1);call write~init~int(0, 28, 6, 1);call #Ultimate.allocInit(5, 29);call write~init~int(108, 29, 0, 1);call write~init~int(111, 29, 1, 1);call write~init~int(111, 29, 2, 1);call write~init~int(112, 29, 3, 1);call write~init~int(0, 29, 4, 1);call #Ultimate.allocInit(24, 30);call #Ultimate.allocInit(24, 31);call #Ultimate.allocInit(5, 32);call write~init~int(108, 32, 0, 1);call write~init~int(111, 32, 1, 1);call write~init~int(111, 32, 2, 1);call write~init~int(112, 32, 3, 1);call write~init~int(0, 32, 4, 1);call #Ultimate.allocInit(5, 33);call write~init~int(108, 33, 0, 1);call write~init~int(111, 33, 1, 1);call write~init~int(111, 33, 2, 1);call write~init~int(112, 33, 3, 1);call write~init~int(0, 33, 4, 1);~#loop_devices~0.base, ~#loop_devices~0.offset := 34, 0;call #Ultimate.allocInit(16, 34);call write~init~$Pointer$(~#loop_devices~0.base, ~#loop_devices~0.offset, ~#loop_devices~0.base, ~#loop_devices~0.offset, 8);call write~init~$Pointer$(~#loop_devices~0.base, ~#loop_devices~0.offset, ~#loop_devices~0.base, 8 + ~#loop_devices~0.offset, 8);~#loop_devices_mutex~0.base, ~#loop_devices_mutex~0.offset := 35, 0;call #Ultimate.allocInit(156, 35);call write~init~int(1, ~#loop_devices_mutex~0.base, ~#loop_devices_mutex~0.offset, 4);call write~init~int(0, ~#loop_devices_mutex~0.base, 4 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(3735899821, ~#loop_devices_mutex~0.base, 8 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(4294967295, ~#loop_devices_mutex~0.base, 12 + ~#loop_devices_mutex~0.offset, 4);call write~init~$Pointer$(0, 1152921504606846975, ~#loop_devices_mutex~0.base, 16 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 24 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 32 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 40 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(6, 0, ~#loop_devices_mutex~0.base, 48 + ~#loop_devices_mutex~0.offset, 8);call write~init~int(0, ~#loop_devices_mutex~0.base, 56 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(0, ~#loop_devices_mutex~0.base, 60 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(~#loop_devices_mutex~0.base, 72 + ~#loop_devices_mutex~0.offset, ~#loop_devices_mutex~0.base, 72 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(~#loop_devices_mutex~0.base, 72 + ~#loop_devices_mutex~0.offset, ~#loop_devices_mutex~0.base, 80 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 88 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 96 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(~#loop_devices_mutex~0.base, ~#loop_devices_mutex~0.offset, ~#loop_devices_mutex~0.base, 104 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 112 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 120 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_devices_mutex~0.base, 128 + ~#loop_devices_mutex~0.offset, 8);call write~init~$Pointer$(7, 0, ~#loop_devices_mutex~0.base, 136 + ~#loop_devices_mutex~0.offset, 8);call write~init~int(0, ~#loop_devices_mutex~0.base, 144 + ~#loop_devices_mutex~0.offset, 4);call write~init~int(0, ~#loop_devices_mutex~0.base, 148 + ~#loop_devices_mutex~0.offset, 8);~max_part~0 := 0;~part_shift~0 := 0;~#none_funcs~0.base, ~#none_funcs~0.offset := 36, 0;call #Ultimate.allocInit(44, 36);call write~init~int(0, ~#none_funcs~0.base, ~#none_funcs~0.offset, 4);call write~init~$Pointer$(#funAddr~transfer_none.base, #funAddr~transfer_none.offset, ~#none_funcs~0.base, 4 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 12 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 20 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 28 + ~#none_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#none_funcs~0.base, 36 + ~#none_funcs~0.offset, 8);~#xor_funcs~0.base, ~#xor_funcs~0.offset := 37, 0;call #Ultimate.allocInit(44, 37);call write~init~int(1, ~#xor_funcs~0.base, ~#xor_funcs~0.offset, 4);call write~init~$Pointer$(#funAddr~transfer_xor.base, #funAddr~transfer_xor.offset, ~#xor_funcs~0.base, 4 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(#funAddr~xor_init.base, #funAddr~xor_init.offset, ~#xor_funcs~0.base, 12 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xor_funcs~0.base, 20 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xor_funcs~0.base, 28 + ~#xor_funcs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#xor_funcs~0.base, 36 + ~#xor_funcs~0.offset, 8);~#xfer_funcs~0.base, ~#xfer_funcs~0.offset := 38, 0;call #Ultimate.allocInit(160, 38);#memory_$Pointer$.base, #memory_$Pointer$.offset := ~initToZeroAtPointerBaseAddress~$Pointer$.base(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#xfer_funcs~0.base), ~initToZeroAtPointerBaseAddress~$Pointer$.offset(#memory_$Pointer$.base, #memory_$Pointer$.offset, ~#xfer_funcs~0.base);call write~unchecked~$Pointer$(~#none_funcs~0.base, ~#none_funcs~0.offset, ~#xfer_funcs~0.base, ~#xfer_funcs~0.offset, 8);call write~unchecked~$Pointer$(~#xor_funcs~0.base, ~#xor_funcs~0.offset, ~#xfer_funcs~0.base, 8 + ~#xfer_funcs~0.offset, 8);~#loop_attr_backing_file~0.base, ~#loop_attr_backing_file~0.offset := 39, 0;call #Ultimate.allocInit(44, 39);call write~init~$Pointer$(20, 0, ~#loop_attr_backing_file~0.base, ~#loop_attr_backing_file~0.offset, 8);call write~init~int(292, ~#loop_attr_backing_file~0.base, 8 + ~#loop_attr_backing_file~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_backing_file~0.base, 12 + ~#loop_attr_backing_file~0.offset, 8);call write~init~int(0, ~#loop_attr_backing_file~0.base, 20 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 21 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 22 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 23 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 24 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 25 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 26 + ~#loop_attr_backing_file~0.offset, 1);call write~init~int(0, ~#loop_attr_backing_file~0.base, 27 + ~#loop_attr_backing_file~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_backing_file.base, #funAddr~loop_attr_do_show_backing_file.offset, ~#loop_attr_backing_file~0.base, 28 + ~#loop_attr_backing_file~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_backing_file~0.base, 36 + ~#loop_attr_backing_file~0.offset, 8);~#loop_attr_offset~0.base, ~#loop_attr_offset~0.offset := 40, 0;call #Ultimate.allocInit(44, 40);call write~init~$Pointer$(21, 0, ~#loop_attr_offset~0.base, ~#loop_attr_offset~0.offset, 8);call write~init~int(292, ~#loop_attr_offset~0.base, 8 + ~#loop_attr_offset~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_offset~0.base, 12 + ~#loop_attr_offset~0.offset, 8);call write~init~int(0, ~#loop_attr_offset~0.base, 20 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 21 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 22 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 23 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 24 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 25 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 26 + ~#loop_attr_offset~0.offset, 1);call write~init~int(0, ~#loop_attr_offset~0.base, 27 + ~#loop_attr_offset~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_offset.base, #funAddr~loop_attr_do_show_offset.offset, ~#loop_attr_offset~0.base, 28 + ~#loop_attr_offset~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_offset~0.base, 36 + ~#loop_attr_offset~0.offset, 8);~#loop_attr_sizelimit~0.base, ~#loop_attr_sizelimit~0.offset := 41, 0;call #Ultimate.allocInit(44, 41);call write~init~$Pointer$(22, 0, ~#loop_attr_sizelimit~0.base, ~#loop_attr_sizelimit~0.offset, 8);call write~init~int(292, ~#loop_attr_sizelimit~0.base, 8 + ~#loop_attr_sizelimit~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_sizelimit~0.base, 12 + ~#loop_attr_sizelimit~0.offset, 8);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 20 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 21 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 22 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 23 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 24 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 25 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 26 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~int(0, ~#loop_attr_sizelimit~0.base, 27 + ~#loop_attr_sizelimit~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_sizelimit.base, #funAddr~loop_attr_do_show_sizelimit.offset, ~#loop_attr_sizelimit~0.base, 28 + ~#loop_attr_sizelimit~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_sizelimit~0.base, 36 + ~#loop_attr_sizelimit~0.offset, 8);~#loop_attr_autoclear~0.base, ~#loop_attr_autoclear~0.offset := 42, 0;call #Ultimate.allocInit(44, 42);call write~init~$Pointer$(23, 0, ~#loop_attr_autoclear~0.base, ~#loop_attr_autoclear~0.offset, 8);call write~init~int(292, ~#loop_attr_autoclear~0.base, 8 + ~#loop_attr_autoclear~0.offset, 4);call write~init~$Pointer$(0, 0, ~#loop_attr_autoclear~0.base, 12 + ~#loop_attr_autoclear~0.offset, 8);call write~init~int(0, ~#loop_attr_autoclear~0.base, 20 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 21 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 22 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 23 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 24 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 25 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 26 + ~#loop_attr_autoclear~0.offset, 1);call write~init~int(0, ~#loop_attr_autoclear~0.base, 27 + ~#loop_attr_autoclear~0.offset, 1);call write~init~$Pointer$(#funAddr~loop_attr_do_show_autoclear.base, #funAddr~loop_attr_do_show_autoclear.offset, ~#loop_attr_autoclear~0.base, 28 + ~#loop_attr_autoclear~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attr_autoclear~0.base, 36 + ~#loop_attr_autoclear~0.offset, 8);~#loop_attrs~0.base, ~#loop_attrs~0.offset := 43, 0;call #Ultimate.allocInit(40, 43);call write~init~$Pointer$(~#loop_attr_backing_file~0.base, ~#loop_attr_backing_file~0.offset, ~#loop_attrs~0.base, ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(~#loop_attr_offset~0.base, ~#loop_attr_offset~0.offset, ~#loop_attrs~0.base, 8 + ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(~#loop_attr_sizelimit~0.base, ~#loop_attr_sizelimit~0.offset, ~#loop_attrs~0.base, 16 + ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(~#loop_attr_autoclear~0.base, ~#loop_attr_autoclear~0.offset, ~#loop_attrs~0.base, 24 + ~#loop_attrs~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attrs~0.base, 32 + ~#loop_attrs~0.offset, 8);~#loop_attribute_group~0.base, ~#loop_attribute_group~0.offset := 44, 0;call #Ultimate.allocInit(24, 44);call write~init~$Pointer$(24, 0, ~#loop_attribute_group~0.base, ~#loop_attribute_group~0.offset, 8);call write~init~$Pointer$(0, 0, ~#loop_attribute_group~0.base, 8 + ~#loop_attribute_group~0.offset, 8);call write~init~$Pointer$(~#loop_attrs~0.base, ~#loop_attrs~0.offset, ~#loop_attribute_group~0.base, 16 + ~#loop_attribute_group~0.offset, 8);~#lo_fops~0.base, ~#lo_fops~0.offset := 45, 0;call #Ultimate.allocInit(96, 45);call write~init~$Pointer$(#funAddr~lo_open.base, #funAddr~lo_open.offset, ~#lo_fops~0.base, ~#lo_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~lo_release.base, #funAddr~lo_release.offset, ~#lo_fops~0.base, 8 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~lo_ioctl.base, #funAddr~lo_ioctl.offset, ~#lo_fops~0.base, 16 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(#funAddr~lo_compat_ioctl.base, #funAddr~lo_compat_ioctl.offset, ~#lo_fops~0.base, 24 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 32 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 40 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 48 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 56 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 64 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 72 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#lo_fops~0.base, 80 + ~#lo_fops~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#lo_fops~0.base, 88 + ~#lo_fops~0.offset, 8);~max_loop~0 := 0;~LDV_IN_INTERRUPT~0 := 0;~ldv_module_refcounter~0 := 1; {43085#true} is VALID [2022-02-20 21:14:49,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {43085#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret737#1, main_#t~nondet738#1, main_#t~ret739#1, main_#t~ret740#1, main_#t~ret741#1, main_#t~ret742#1, main_#t~ret743#1, main_#t~ret744#1, main_#t~ret745#1, main_#t~nondet746#1, main_~var_group1~0#1.base, main_~var_group1~0#1.offset, main_~var_transfer_none_0_p1~0#1, main_~var_transfer_none_0_p2~0#1.base, main_~var_transfer_none_0_p2~0#1.offset, main_~var_transfer_none_0_p3~0#1, main_~var_transfer_none_0_p4~0#1.base, main_~var_transfer_none_0_p4~0#1.offset, main_~var_transfer_none_0_p5~0#1, main_~var_transfer_none_0_p6~0#1, main_~var_transfer_none_0_p7~0#1, main_~var_transfer_xor_1_p1~0#1, main_~var_transfer_xor_1_p2~0#1.base, main_~var_transfer_xor_1_p2~0#1.offset, main_~var_transfer_xor_1_p3~0#1, main_~var_transfer_xor_1_p4~0#1.base, main_~var_transfer_xor_1_p4~0#1.offset, main_~var_transfer_xor_1_p5~0#1, main_~var_transfer_xor_1_p6~0#1, main_~var_transfer_xor_1_p7~0#1, main_~var_xor_init_2_p1~0#1.base, main_~var_xor_init_2_p1~0#1.offset, main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~var_lo_open_51_p1~0#1, main_~res_lo_open_51~0#1, main_~var_group3~0#1.base, main_~var_group3~0#1.offset, main_~var_lo_release_52_p1~0#1, main_~var_lo_ioctl_45_p1~0#1, main_~var_lo_ioctl_45_p2~0#1, main_~var_lo_ioctl_45_p3~0#1, main_~var_lo_compat_ioctl_50_p1~0#1, main_~var_lo_compat_ioctl_50_p2~0#1, main_~var_lo_compat_ioctl_50_p3~0#1, main_~ldv_s_lo_fops_block_device_operations~0#1, main_~tmp~63#1, main_~tmp___0~28#1, main_~tmp___1~10#1;havoc main_~var_group1~0#1.base, main_~var_group1~0#1.offset;havoc main_~var_transfer_none_0_p1~0#1;havoc main_~var_transfer_none_0_p2~0#1.base, main_~var_transfer_none_0_p2~0#1.offset;havoc main_~var_transfer_none_0_p3~0#1;havoc main_~var_transfer_none_0_p4~0#1.base, main_~var_transfer_none_0_p4~0#1.offset;havoc main_~var_transfer_none_0_p5~0#1;havoc main_~var_transfer_none_0_p6~0#1;havoc main_~var_transfer_none_0_p7~0#1;havoc main_~var_transfer_xor_1_p1~0#1;havoc main_~var_transfer_xor_1_p2~0#1.base, main_~var_transfer_xor_1_p2~0#1.offset;havoc main_~var_transfer_xor_1_p3~0#1;havoc main_~var_transfer_xor_1_p4~0#1.base, main_~var_transfer_xor_1_p4~0#1.offset;havoc main_~var_transfer_xor_1_p5~0#1;havoc main_~var_transfer_xor_1_p6~0#1;havoc main_~var_transfer_xor_1_p7~0#1;havoc main_~var_xor_init_2_p1~0#1.base, main_~var_xor_init_2_p1~0#1.offset;havoc main_~var_group2~0#1.base, main_~var_group2~0#1.offset;havoc main_~var_lo_open_51_p1~0#1;havoc main_~res_lo_open_51~0#1;havoc main_~var_group3~0#1.base, main_~var_group3~0#1.offset;havoc main_~var_lo_release_52_p1~0#1;havoc main_~var_lo_ioctl_45_p1~0#1;havoc main_~var_lo_ioctl_45_p2~0#1;havoc main_~var_lo_ioctl_45_p3~0#1;havoc main_~var_lo_compat_ioctl_50_p1~0#1;havoc main_~var_lo_compat_ioctl_50_p2~0#1;havoc main_~var_lo_compat_ioctl_50_p3~0#1;havoc main_~ldv_s_lo_fops_block_device_operations~0#1;havoc main_~tmp~63#1;havoc main_~tmp___0~28#1;havoc main_~tmp___1~10#1;main_~ldv_s_lo_fops_block_device_operations~0#1 := 0;~LDV_IN_INTERRUPT~0 := 1;assume { :begin_inline_ldv_initialize } true; {43085#true} is VALID [2022-02-20 21:14:49,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {43085#true} assume { :end_inline_ldv_initialize } true;assume { :begin_inline_loop_init } true;havoc loop_init_#res#1;havoc loop_init_#t~ret722#1, loop_init_#t~ret723#1, loop_init_#t~ret724#1.base, loop_init_#t~ret724#1.offset, loop_init_#t~mem725#1.base, loop_init_#t~mem725#1.offset, loop_init_#t~mem726#1.base, loop_init_#t~mem726#1.offset, loop_init_#t~mem727#1.base, loop_init_#t~mem727#1.offset, loop_init_#t~nondet728#1, loop_init_#t~nondet729#1, loop_init_#t~mem730#1.base, loop_init_#t~mem730#1.offset, loop_init_#t~mem731#1.base, loop_init_#t~mem731#1.offset, loop_init_#t~mem732#1.base, loop_init_#t~mem732#1.offset, loop_init_~i~4#1, loop_init_~nr~0#1, loop_init_~range~0#1, loop_init_~lo~12#1.base, loop_init_~lo~12#1.offset, loop_init_~next~0#1.base, loop_init_~next~0#1.offset, loop_init_~tmp~62#1, loop_init_~__mptr~3#1.base, loop_init_~__mptr~3#1.offset, loop_init_~__mptr___0~3#1.base, loop_init_~__mptr___0~3#1.offset, loop_init_~__mptr___1~0#1.base, loop_init_~__mptr___1~0#1.offset, loop_init_~__mptr___2~0#1.base, loop_init_~__mptr___2~0#1.offset, loop_init_~__mptr___3~0#1.base, loop_init_~__mptr___3~0#1.offset;havoc loop_init_~i~4#1;havoc loop_init_~nr~0#1;havoc loop_init_~range~0#1;havoc loop_init_~lo~12#1.base, loop_init_~lo~12#1.offset;havoc loop_init_~next~0#1.base, loop_init_~next~0#1.offset;havoc loop_init_~tmp~62#1;havoc loop_init_~__mptr~3#1.base, loop_init_~__mptr~3#1.offset;havoc loop_init_~__mptr___0~3#1.base, loop_init_~__mptr___0~3#1.offset;havoc loop_init_~__mptr___1~0#1.base, loop_init_~__mptr___1~0#1.offset;havoc loop_init_~__mptr___2~0#1.base, loop_init_~__mptr___2~0#1.offset;havoc loop_init_~__mptr___3~0#1.base, loop_init_~__mptr___3~0#1.offset;~part_shift~0 := 0; {43085#true} is VALID [2022-02-20 21:14:49,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {43085#true} assume !(~max_part~0 > 0); {43085#true} is VALID [2022-02-20 21:14:49,235 INFO L290 TraceCheckUtils]: 4: Hoare triple {43085#true} assume !(~shiftLeft(1, ~part_shift~0) % 18446744073709551616 > 256); {43085#true} is VALID [2022-02-20 21:14:49,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {43085#true} assume !(~max_loop~0 % 18446744073709551616 > ~shiftLeft(1, 20 - ~part_shift~0) % 18446744073709551616); {43085#true} is VALID [2022-02-20 21:14:49,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {43085#true} assume !(0 != ~max_loop~0);loop_init_~nr~0#1 := 8;loop_init_~range~0#1 := 1048576; {43085#true} is VALID [2022-02-20 21:14:49,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {43085#true} assume { :begin_inline_register_blkdev } true;register_blkdev_#in~arg0#1, register_blkdev_#in~arg1#1.base, register_blkdev_#in~arg1#1.offset := 7, 29, 0;havoc register_blkdev_#res#1;havoc register_blkdev_#t~nondet775#1, register_blkdev_~arg0#1, register_blkdev_~arg1#1.base, register_blkdev_~arg1#1.offset;register_blkdev_~arg0#1 := register_blkdev_#in~arg0#1;register_blkdev_~arg1#1.base, register_blkdev_~arg1#1.offset := register_blkdev_#in~arg1#1.base, register_blkdev_#in~arg1#1.offset;assume -2147483648 <= register_blkdev_#t~nondet775#1 && register_blkdev_#t~nondet775#1 <= 2147483647;register_blkdev_#res#1 := register_blkdev_#t~nondet775#1;havoc register_blkdev_#t~nondet775#1; {43085#true} is VALID [2022-02-20 21:14:49,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {43085#true} loop_init_#t~ret723#1 := register_blkdev_#res#1;assume { :end_inline_register_blkdev } true;assume -2147483648 <= loop_init_#t~ret723#1 && loop_init_#t~ret723#1 <= 2147483647;loop_init_~tmp~62#1 := loop_init_#t~ret723#1;havoc loop_init_#t~ret723#1; {43085#true} is VALID [2022-02-20 21:14:49,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {43085#true} assume 0 != loop_init_~tmp~62#1;loop_init_#res#1 := -5; {43087#(<= (+ 5 |ULTIMATE.start_loop_init_#res#1|) 0)} is VALID [2022-02-20 21:14:49,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {43087#(<= (+ 5 |ULTIMATE.start_loop_init_#res#1|) 0)} main_#t~ret737#1 := loop_init_#res#1;assume { :end_inline_loop_init } true;assume -2147483648 <= main_#t~ret737#1 && main_#t~ret737#1 <= 2147483647;main_~tmp~63#1 := main_#t~ret737#1;havoc main_#t~ret737#1; {43088#(<= (+ 5 |ULTIMATE.start_main_~tmp~63#1|) 0)} is VALID [2022-02-20 21:14:49,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {43088#(<= (+ 5 |ULTIMATE.start_main_~tmp~63#1|) 0)} assume !(0 != main_~tmp~63#1); {43086#false} is VALID [2022-02-20 21:14:49,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {43086#false} assume -2147483648 <= main_#t~nondet746#1 && main_#t~nondet746#1 <= 2147483647;main_~tmp___1~10#1 := main_#t~nondet746#1;havoc main_#t~nondet746#1; {43086#false} is VALID [2022-02-20 21:14:49,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {43086#false} assume 0 != main_~tmp___1~10#1; {43086#false} is VALID [2022-02-20 21:14:49,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {43086#false} assume -2147483648 <= main_#t~nondet738#1 && main_#t~nondet738#1 <= 2147483647;main_~tmp___0~28#1 := main_#t~nondet738#1;havoc main_#t~nondet738#1; {43086#false} is VALID [2022-02-20 21:14:49,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {43086#false} assume !(0 == main_~tmp___0~28#1); {43086#false} is VALID [2022-02-20 21:14:49,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {43086#false} assume !(1 == main_~tmp___0~28#1); {43086#false} is VALID [2022-02-20 21:14:49,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {43086#false} assume !(2 == main_~tmp___0~28#1); {43086#false} is VALID [2022-02-20 21:14:49,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {43086#false} assume !(3 == main_~tmp___0~28#1); {43086#false} is VALID [2022-02-20 21:14:49,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {43086#false} assume !(4 == main_~tmp___0~28#1); {43086#false} is VALID [2022-02-20 21:14:49,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {43086#false} assume 5 == main_~tmp___0~28#1; {43086#false} is VALID [2022-02-20 21:14:49,238 INFO L272 TraceCheckUtils]: 21: Hoare triple {43086#false} call main_#t~ret744#1 := lo_ioctl(main_~var_group2~0#1.base, main_~var_group2~0#1.offset, main_~var_lo_ioctl_45_p1~0#1, main_~var_lo_ioctl_45_p2~0#1, main_~var_lo_ioctl_45_p3~0#1); {43086#false} is VALID [2022-02-20 21:14:49,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {43086#false} ~bdev#1.base, ~bdev#1.offset := #in~bdev#1.base, #in~bdev#1.offset;~mode#1 := #in~mode#1;~cmd#1 := #in~cmd#1;~arg#1 := #in~arg#1;havoc ~lo~4#1.base, ~lo~4#1.offset;havoc ~err~6#1;havoc ~tmp~55#1;havoc ~tmp___0~25#1;call #t~mem607#1.base, #t~mem607#1.offset := read~$Pointer$(~bdev#1.base, 261 + ~bdev#1.offset, 8);call #t~mem608#1.base, #t~mem608#1.offset := read~$Pointer$(#t~mem607#1.base, 1248 + #t~mem607#1.offset, 8);~lo~4#1.base, ~lo~4#1.offset := #t~mem608#1.base, #t~mem608#1.offset;havoc #t~mem607#1.base, #t~mem607#1.offset;havoc #t~mem608#1.base, #t~mem608#1.offset; {43086#false} is VALID [2022-02-20 21:14:49,238 INFO L272 TraceCheckUtils]: 23: Hoare triple {43086#false} call mutex_lock_nested(~lo~4#1.base, 348 + ~lo~4#1.offset, 1); {43085#true} is VALID [2022-02-20 21:14:49,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {43085#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset;~arg1 := #in~arg1; {43085#true} is VALID [2022-02-20 21:14:49,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {43085#true} assume true; {43085#true} is VALID [2022-02-20 21:14:49,239 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43085#true} {43086#false} #2635#return; {43086#false} is VALID [2022-02-20 21:14:49,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {43086#false} assume 19456 == (if ~cmd#1 % 4294967296 % 4294967296 <= 2147483647 then ~cmd#1 % 4294967296 % 4294967296 else ~cmd#1 % 4294967296 % 4294967296 - 4294967296); {43086#false} is VALID [2022-02-20 21:14:49,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {43086#false} assume { :begin_inline_loop_set_fd } true;loop_set_fd_#in~lo#1.base, loop_set_fd_#in~lo#1.offset, loop_set_fd_#in~mode#1, loop_set_fd_#in~bdev#1.base, loop_set_fd_#in~bdev#1.offset, loop_set_fd_#in~arg#1 := ~lo~4#1.base, ~lo~4#1.offset, ~mode#1, ~bdev#1.base, ~bdev#1.offset, ~arg#1;havoc loop_set_fd_#res#1;havoc loop_set_fd_#t~ret399#1.base, loop_set_fd_#t~ret399#1.offset, loop_set_fd_#t~mem400#1, loop_set_fd_#t~mem401#1.base, loop_set_fd_#t~mem401#1.offset, loop_set_fd_#t~mem402#1.base, loop_set_fd_#t~mem402#1.offset, loop_set_fd_#t~mem403#1.base, loop_set_fd_#t~mem403#1.offset, loop_set_fd_#t~mem404#1.base, loop_set_fd_#t~mem404#1.offset, loop_set_fd_#t~mem405#1.base, loop_set_fd_#t~mem405#1.offset, loop_set_fd_#t~mem406#1.base, loop_set_fd_#t~mem406#1.offset, loop_set_fd_#t~mem407#1.base, loop_set_fd_#t~mem407#1.offset, loop_set_fd_#t~mem408#1.base, loop_set_fd_#t~mem408#1.offset, loop_set_fd_#t~mem409#1, loop_set_fd_#t~mem410#1.base, loop_set_fd_#t~mem410#1.offset, loop_set_fd_#t~ret411#1, loop_set_fd_#t~mem412#1.base, loop_set_fd_#t~mem412#1.offset, loop_set_fd_#t~mem413#1.base, loop_set_fd_#t~mem413#1.offset, loop_set_fd_#t~mem414#1, loop_set_fd_#t~nondet415#1, loop_set_fd_#t~mem416#1, loop_set_fd_#t~mem417#1, loop_set_fd_#t~mem418#1.base, loop_set_fd_#t~mem418#1.offset, loop_set_fd_#t~mem419#1.base, loop_set_fd_#t~mem419#1.offset, loop_set_fd_#t~nondet420#1, loop_set_fd_#t~mem421#1.base, loop_set_fd_#t~mem421#1.offset, loop_set_fd_#t~mem422#1.base, loop_set_fd_#t~mem422#1.offset, loop_set_fd_#t~nondet423#1, loop_set_fd_#t~mem424#1, loop_set_fd_#t~mem425#1.base, loop_set_fd_#t~mem425#1.offset, loop_set_fd_#t~mem426#1, loop_set_fd_#t~ret427#1, loop_set_fd_#t~nondet428#1, loop_set_fd_#t~ret429#1, loop_set_fd_#t~mem430#1, loop_set_fd_#t~mem431#1.base, loop_set_fd_#t~mem431#1.offset, loop_set_fd_#t~mem432#1.base, loop_set_fd_#t~mem432#1.offset, loop_set_fd_#t~mem433#1.base, loop_set_fd_#t~mem433#1.offset, loop_set_fd_#t~mem434#1.base, loop_set_fd_#t~mem434#1.offset, loop_set_fd_#t~mem435#1.base, loop_set_fd_#t~mem435#1.offset, loop_set_fd_#t~mem436#1.base, loop_set_fd_#t~mem436#1.offset, loop_set_fd_#t~ret437#1, loop_set_fd_#t~mem438#1.base, loop_set_fd_#t~mem438#1.offset, loop_set_fd_#t~ret439#1, loop_set_fd_#t~ret440#1, loop_set_fd_#t~nondet441#1.base, loop_set_fd_#t~nondet441#1.offset, loop_set_fd_#t~mem442#1, loop_set_fd_#t~mem443#1.base, loop_set_fd_#t~mem443#1.offset, loop_set_fd_#t~ret444#1, loop_set_fd_#t~mem445#1.base, loop_set_fd_#t~mem445#1.offset, loop_set_fd_#t~ret446#1, loop_set_fd_#t~mem447#1.base, loop_set_fd_#t~mem447#1.offset, loop_set_fd_#t~ret448#1, loop_set_fd_#t~ret449#1, loop_set_fd_#t~mem450#1.base, loop_set_fd_#t~mem450#1.offset, loop_set_fd_#t~mem451#1.base, loop_set_fd_#t~mem451#1.offset, loop_set_fd_#t~ret452#1, loop_set_fd_#t~mem453#1, loop_set_fd_~lo#1.base, loop_set_fd_~lo#1.offset, loop_set_fd_~mode#1, loop_set_fd_~bdev#1.base, loop_set_fd_~bdev#1.offset, loop_set_fd_~arg#1, loop_set_fd_~file~5#1.base, loop_set_fd_~file~5#1.offset, loop_set_fd_~f~0#1.base, loop_set_fd_~f~0#1.offset, loop_set_fd_~inode~1#1.base, loop_set_fd_~inode~1#1.offset, loop_set_fd_~mapping~2#1.base, loop_set_fd_~mapping~2#1.offset, loop_set_fd_~lo_blocksize~0#1, loop_set_fd_~lo_flags~0#1, loop_set_fd_~error~1#1, loop_set_fd_~size~4#1, loop_set_fd_~l~1#1.base, loop_set_fd_~l~1#1.offset, loop_set_fd_~tmp~46#1, loop_set_fd_~aops~0#1.base, loop_set_fd_~aops~0#1.offset, loop_set_fd_~tmp___0~19#1, loop_set_fd_~tmp___1~8#1;loop_set_fd_~lo#1.base, loop_set_fd_~lo#1.offset := loop_set_fd_#in~lo#1.base, loop_set_fd_#in~lo#1.offset;loop_set_fd_~mode#1 := loop_set_fd_#in~mode#1;loop_set_fd_~bdev#1.base, loop_set_fd_~bdev#1.offset := loop_set_fd_#in~bdev#1.base, loop_set_fd_#in~bdev#1.offset;loop_set_fd_~arg#1 := loop_set_fd_#in~arg#1;havoc loop_set_fd_~file~5#1.base, loop_set_fd_~file~5#1.offset;havoc loop_set_fd_~f~0#1.base, loop_set_fd_~f~0#1.offset;havoc loop_set_fd_~inode~1#1.base, loop_set_fd_~inode~1#1.offset;havoc loop_set_fd_~mapping~2#1.base, loop_set_fd_~mapping~2#1.offset;havoc loop_set_fd_~lo_blocksize~0#1;havoc loop_set_fd_~lo_flags~0#1;havoc loop_set_fd_~error~1#1;havoc loop_set_fd_~size~4#1;havoc loop_set_fd_~l~1#1.base, loop_set_fd_~l~1#1.offset;havoc loop_set_fd_~tmp~46#1;havoc loop_set_fd_~aops~0#1.base, loop_set_fd_~aops~0#1.offset;havoc loop_set_fd_~tmp___0~19#1;havoc loop_set_fd_~tmp___1~8#1;loop_set_fd_~lo_flags~0#1 := 0;assume { :begin_inline_ldv___module_get_1 } true;ldv___module_get_1_#in~module#1.base, ldv___module_get_1_#in~module#1.offset := ~#__this_module~0.base, ~#__this_module~0.offset;havoc ldv___module_get_1_~module#1.base, ldv___module_get_1_~module#1.offset;ldv___module_get_1_~module#1.base, ldv___module_get_1_~module#1.offset := ldv___module_get_1_#in~module#1.base, ldv___module_get_1_#in~module#1.offset;assume { :begin_inline_ldv_module_get } true;ldv_module_get_#in~module#1.base, ldv_module_get_#in~module#1.offset := ldv___module_get_1_~module#1.base, ldv___module_get_1_~module#1.offset;havoc ldv_module_get_~module#1.base, ldv_module_get_~module#1.offset;ldv_module_get_~module#1.base, ldv_module_get_~module#1.offset := ldv_module_get_#in~module#1.base, ldv_module_get_#in~module#1.offset; {43086#false} is VALID [2022-02-20 21:14:49,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {43086#false} assume !(0 != (ldv_module_get_~module#1.base + ldv_module_get_~module#1.offset) % 18446744073709551616); {43086#false} is VALID [2022-02-20 21:14:49,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {43086#false} assume { :end_inline_ldv_module_get } true; {43086#false} is VALID [2022-02-20 21:14:49,239 INFO L290 TraceCheckUtils]: 31: Hoare triple {43086#false} assume { :end_inline_ldv___module_get_1 } true;loop_set_fd_~error~1#1 := -9; {43086#false} is VALID [2022-02-20 21:14:49,239 INFO L272 TraceCheckUtils]: 32: Hoare triple {43086#false} call loop_set_fd_#t~ret399#1.base, loop_set_fd_#t~ret399#1.offset := fget(loop_set_fd_~arg#1); {43101#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:14:49,240 INFO L290 TraceCheckUtils]: 33: Hoare triple {43101#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~arg0 := #in~arg0; {43085#true} is VALID [2022-02-20 21:14:49,240 INFO L272 TraceCheckUtils]: 34: Hoare triple {43085#true} call #t~ret764.base, #t~ret764.offset := ldv_malloc(320); {43101#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 21:14:49,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {43101#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1; {43085#true} is VALID [2022-02-20 21:14:49,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {43085#true} assume 0 != #t~nondet750#1 % 256;havoc #t~nondet750#1;#res#1.base, #res#1.offset := 0, 0; {43085#true} is VALID [2022-02-20 21:14:49,240 INFO L290 TraceCheckUtils]: 37: Hoare triple {43085#true} assume true; {43085#true} is VALID [2022-02-20 21:14:49,241 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {43085#true} {43085#true} #2811#return; {43085#true} is VALID [2022-02-20 21:14:49,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {43085#true} #res.base, #res.offset := #t~ret764.base, #t~ret764.offset;havoc #t~ret764.base, #t~ret764.offset; {43085#true} is VALID [2022-02-20 21:14:49,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {43085#true} assume true; {43085#true} is VALID [2022-02-20 21:14:49,241 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {43085#true} {43086#false} #2637#return; {43086#false} is VALID [2022-02-20 21:14:49,244 INFO L290 TraceCheckUtils]: 42: Hoare triple {43086#false} loop_set_fd_~file~5#1.base, loop_set_fd_~file~5#1.offset := loop_set_fd_#t~ret399#1.base, loop_set_fd_#t~ret399#1.offset;havoc loop_set_fd_#t~ret399#1.base, loop_set_fd_#t~ret399#1.offset; {43086#false} is VALID [2022-02-20 21:14:49,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {43086#false} assume 0 == (loop_set_fd_~file~5#1.base + loop_set_fd_~file~5#1.offset) % 18446744073709551616; {43086#false} is VALID [2022-02-20 21:14:49,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {43086#false} assume { :begin_inline_ldv_module_put_2 } true;ldv_module_put_2_#in~ldv_func_arg1#1.base, ldv_module_put_2_#in~ldv_func_arg1#1.offset := ~#__this_module~0.base, ~#__this_module~0.offset;havoc ldv_module_put_2_~ldv_func_arg1#1.base, ldv_module_put_2_~ldv_func_arg1#1.offset;ldv_module_put_2_~ldv_func_arg1#1.base, ldv_module_put_2_~ldv_func_arg1#1.offset := ldv_module_put_2_#in~ldv_func_arg1#1.base, ldv_module_put_2_#in~ldv_func_arg1#1.offset; {43086#false} is VALID [2022-02-20 21:14:49,244 INFO L272 TraceCheckUtils]: 45: Hoare triple {43086#false} call ldv_module_put(ldv_module_put_2_~ldv_func_arg1#1.base, ldv_module_put_2_~ldv_func_arg1#1.offset); {43086#false} is VALID [2022-02-20 21:14:49,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {43086#false} ~module.base, ~module.offset := #in~module.base, #in~module.offset; {43086#false} is VALID [2022-02-20 21:14:49,245 INFO L290 TraceCheckUtils]: 47: Hoare triple {43086#false} assume 0 != (~module.base + ~module.offset) % 18446744073709551616; {43086#false} is VALID [2022-02-20 21:14:49,245 INFO L290 TraceCheckUtils]: 48: Hoare triple {43086#false} assume ~ldv_module_refcounter~0 <= 1; {43086#false} is VALID [2022-02-20 21:14:49,245 INFO L272 TraceCheckUtils]: 49: Hoare triple {43086#false} call ldv_blast_assert(); {43086#false} is VALID [2022-02-20 21:14:49,245 INFO L290 TraceCheckUtils]: 50: Hoare triple {43086#false} assume !false; {43086#false} is VALID [2022-02-20 21:14:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 21:14:49,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:14:49,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039960889] [2022-02-20 21:14:49,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039960889] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:14:49,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:14:49,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 21:14:49,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808849924] [2022-02-20 21:14:49,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:14:49,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-02-20 21:14:49,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:14:49,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 21:14:49,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:14:49,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 21:14:49,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:14:49,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 21:14:49,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 21:14:49,289 INFO L87 Difference]: Start difference. First operand 2163 states and 2982 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)