./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--md--persistent-data--dm-persistent-data.ko-ldv_main3.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-consumption/linux-3.8-rc1-32_7a-drivers--md--persistent-data--dm-persistent-data.ko-ldv_main3.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 c71c8ad72880cb84277e62b04a7d1e6999cf259f90883ecbd7f670c614450b6e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 21:48:27,172 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 21:48:27,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 21:48:27,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 21:48:27,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 21:48:27,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 21:48:27,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 21:48:27,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 21:48:27,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 21:48:27,201 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 21:48:27,202 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 21:48:27,202 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 21:48:27,203 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 21:48:27,203 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 21:48:27,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 21:48:27,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 21:48:27,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 21:48:27,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 21:48:27,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 21:48:27,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 21:48:27,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 21:48:27,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 21:48:27,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 21:48:27,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 21:48:27,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 21:48:27,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 21:48:27,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 21:48:27,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 21:48:27,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 21:48:27,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 21:48:27,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 21:48:27,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 21:48:27,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 21:48:27,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 21:48:27,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 21:48:27,217 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 21:48:27,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 21:48:27,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 21:48:27,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 21:48:27,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 21:48:27,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 21:48:27,221 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:48:27,234 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 21:48:27,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 21:48:27,238 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 21:48:27,239 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 21:48:27,239 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 21:48:27,239 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 21:48:27,240 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 21:48:27,240 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 21:48:27,240 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 21:48:27,240 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 21:48:27,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 21:48:27,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 21:48:27,241 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 21:48:27,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 21:48:27,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 21:48:27,242 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 21:48:27,242 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 21:48:27,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 21:48:27,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 21:48:27,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 21:48:27,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 21:48:27,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:48:27,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 21:48:27,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 21:48:27,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 21:48:27,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 21:48:27,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 21:48:27,243 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 21:48:27,243 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 21:48:27,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 21:48:27,244 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 -> c71c8ad72880cb84277e62b04a7d1e6999cf259f90883ecbd7f670c614450b6e [2022-02-20 21:48:27,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 21:48:27,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 21:48:27,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 21:48:27,475 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 21:48:27,475 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 21:48:27,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--md--persistent-data--dm-persistent-data.ko-ldv_main3.cil.out.i [2022-02-20 21:48:27,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e0ceb00/c8db72932a4f4f1e99f9d2afcfb5418c/FLAG7fc03f863 [2022-02-20 21:48:28,099 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 21:48:28,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--md--persistent-data--dm-persistent-data.ko-ldv_main3.cil.out.i [2022-02-20 21:48:28,142 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e0ceb00/c8db72932a4f4f1e99f9d2afcfb5418c/FLAG7fc03f863 [2022-02-20 21:48:28,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40e0ceb00/c8db72932a4f4f1e99f9d2afcfb5418c [2022-02-20 21:48:28,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 21:48:28,561 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 21:48:28,563 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 21:48:28,563 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 21:48:28,566 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 21:48:28,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:48:28" (1/1) ... [2022-02-20 21:48:28,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@297ceef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:28, skipping insertion in model container [2022-02-20 21:48:28,568 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 09:48:28" (1/1) ... [2022-02-20 21:48:28,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 21:48:28,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 21:48:30,434 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-consumption/linux-3.8-rc1-32_7a-drivers--md--persistent-data--dm-persistent-data.ko-ldv_main3.cil.out.i[314638,314651] [2022-02-20 21:48:30,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:48:30,512 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 21:48:30,806 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-consumption/linux-3.8-rc1-32_7a-drivers--md--persistent-data--dm-persistent-data.ko-ldv_main3.cil.out.i[314638,314651] [2022-02-20 21:48:30,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 21:48:30,898 INFO L208 MainTranslator]: Completed translation [2022-02-20 21:48:30,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:30 WrapperNode [2022-02-20 21:48:30,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 21:48:30,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 21:48:30,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 21:48:30,901 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 21:48:30,906 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:48:30" (1/1) ... [2022-02-20 21:48:31,007 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:48:30" (1/1) ... [2022-02-20 21:48:31,056 INFO L137 Inliner]: procedures = 448, calls = 3142, calls flagged for inlining = 108, calls inlined = 6, statements flattened = 279 [2022-02-20 21:48:31,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 21:48:31,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 21:48:31,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 21:48:31,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 21:48:31,064 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:30" (1/1) ... [2022-02-20 21:48:31,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:30" (1/1) ... [2022-02-20 21:48:31,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:30" (1/1) ... [2022-02-20 21:48:31,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:30" (1/1) ... [2022-02-20 21:48:31,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:30" (1/1) ... [2022-02-20 21:48:31,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:30" (1/1) ... [2022-02-20 21:48:31,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:30" (1/1) ... [2022-02-20 21:48:31,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 21:48:31,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 21:48:31,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 21:48:31,119 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 21:48:31,120 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:30" (1/1) ... [2022-02-20 21:48:31,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 21:48:31,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 21:48:31,161 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:48:31,183 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:48:31,193 INFO L130 BoogieDeclarations]: Found specification of procedure dm_bm_checksum [2022-02-20 21:48:31,193 INFO L138 BoogieDeclarations]: Found implementation of procedure dm_bm_checksum [2022-02-20 21:48:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 21:48:31,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 21:48:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure index_prepare_for_write [2022-02-20 21:48:31,194 INFO L138 BoogieDeclarations]: Found implementation of procedure index_prepare_for_write [2022-02-20 21:48:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure index_check [2022-02-20 21:48:31,194 INFO L138 BoogieDeclarations]: Found implementation of procedure index_check [2022-02-20 21:48:31,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2022-02-20 21:48:31,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2022-02-20 21:48:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 21:48:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 21:48:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 21:48:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure ___ratelimit [2022-02-20 21:48:31,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ___ratelimit [2022-02-20 21:48:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 21:48:31,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 21:48:31,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 21:48:31,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 21:48:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure dm_bufio_get_block_number [2022-02-20 21:48:31,196 INFO L138 BoogieDeclarations]: Found implementation of procedure dm_bufio_get_block_number [2022-02-20 21:48:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure dm_block_location [2022-02-20 21:48:31,196 INFO L138 BoogieDeclarations]: Found implementation of procedure dm_block_location [2022-02-20 21:48:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure to_buffer [2022-02-20 21:48:31,196 INFO L138 BoogieDeclarations]: Found implementation of procedure to_buffer [2022-02-20 21:48:31,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 21:48:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure dm_block_data [2022-02-20 21:48:31,197 INFO L138 BoogieDeclarations]: Found implementation of procedure dm_block_data [2022-02-20 21:48:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-02-20 21:48:31,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-02-20 21:48:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure bitmap_check [2022-02-20 21:48:31,197 INFO L138 BoogieDeclarations]: Found implementation of procedure bitmap_check [2022-02-20 21:48:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 21:48:31,197 INFO L130 BoogieDeclarations]: Found specification of procedure bitmap_prepare_for_write [2022-02-20 21:48:31,198 INFO L138 BoogieDeclarations]: Found implementation of procedure bitmap_prepare_for_write [2022-02-20 21:48:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 21:48:31,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2022-02-20 21:48:31,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2022-02-20 21:48:31,363 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 21:48:31,364 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 21:48:31,732 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 21:48:31,738 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 21:48:31,738 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 21:48:31,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:48:31 BoogieIcfgContainer [2022-02-20 21:48:31,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 21:48:31,741 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 21:48:31,741 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 21:48:31,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 21:48:31,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 09:48:28" (1/3) ... [2022-02-20 21:48:31,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8f9b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:48:31, skipping insertion in model container [2022-02-20 21:48:31,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 09:48:30" (2/3) ... [2022-02-20 21:48:31,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a8f9b3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 09:48:31, skipping insertion in model container [2022-02-20 21:48:31,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:48:31" (3/3) ... [2022-02-20 21:48:31,755 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--md--persistent-data--dm-persistent-data.ko-ldv_main3.cil.out.i [2022-02-20 21:48:31,764 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 21:48:31,767 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 21:48:31,799 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 21:48:31,804 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:48:31,804 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 21:48:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 92 states have internal predecessors, (105), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2022-02-20 21:48:31,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 21:48:31,826 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:48:31,827 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:48:31,827 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:48:31,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:48:31,832 INFO L85 PathProgramCache]: Analyzing trace with hash -797928523, now seen corresponding path program 1 times [2022-02-20 21:48:31,838 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:48:31,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191912518] [2022-02-20 21:48:31,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:48:31,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:48:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:48:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:48:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:48:32,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#(and (= |old(~ldv_mutex_mutex_of_device~0)| ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 |old(~ldv_mutex_lock~0)|))} ~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1; {145#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:32,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#(= ~ldv_mutex_lock~0 1)} assume true; {145#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:32,209 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {145#(= ~ldv_mutex_lock~0 1)} {140#true} #240#return; {145#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:32,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#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(92, 2);call #Ultimate.allocInit(18, 3);call #Ultimate.allocInit(78, 4);call #Ultimate.allocInit(18, 5);call #Ultimate.allocInit(71, 6);call #Ultimate.allocInit(6, 7);call write~init~int(97, 7, 0, 1);call write~init~int(114, 7, 1, 1);call write~init~int(114, 7, 2, 1);call write~init~int(97, 7, 3, 1);call write~init~int(121, 7, 4, 1);call write~init~int(0, 7, 5, 1);call #Ultimate.allocInit(10, 8);call #Ultimate.allocInit(68, 9);call #Ultimate.allocInit(10, 10);call #Ultimate.allocInit(54, 11);call #Ultimate.allocInit(73, 12);call #Ultimate.allocInit(54, 13);call #Ultimate.allocInit(71, 14);call #Ultimate.allocInit(22, 15);call #Ultimate.allocInit(79, 16);call #Ultimate.allocInit(22, 17);call #Ultimate.allocInit(73, 18);call #Ultimate.allocInit(22, 19);call #Ultimate.allocInit(85, 20);call #Ultimate.allocInit(5, 21);call write~init~int(78, 21, 0, 1);call write~init~int(85, 21, 1, 1);call write~init~int(76, 21, 2, 1);call write~init~int(76, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(12, 22);call #Ultimate.allocInit(83, 23);call #Ultimate.allocInit(12, 24);call #Ultimate.allocInit(76, 25);call #Ultimate.allocInit(6, 26);call write~init~int(105, 26, 0, 1);call write~init~int(110, 26, 1, 1);call write~init~int(100, 26, 2, 1);call write~init~int(101, 26, 3, 1);call write~init~int(120, 26, 4, 1);call write~init~int(0, 26, 5, 1);call #Ultimate.allocInit(13, 27);call #Ultimate.allocInit(84, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(77, 30);call #Ultimate.allocInit(10, 31);call #Ultimate.allocInit(70, 32);call #Ultimate.allocInit(55, 33);call #Ultimate.allocInit(63, 34);call #Ultimate.allocInit(59, 35);call #Ultimate.allocInit(62, 36);call #Ultimate.allocInit(62, 37);call #Ultimate.allocInit(68, 38);call #Ultimate.allocInit(67, 39);call #Ultimate.allocInit(64, 40);call #Ultimate.allocInit(75, 41);call #Ultimate.allocInit(67, 42);call #Ultimate.allocInit(70, 43);call #Ultimate.allocInit(73, 44);call #Ultimate.allocInit(73, 45);call #Ultimate.allocInit(73, 46);call #Ultimate.allocInit(20, 47);call #Ultimate.allocInit(73, 48);call #Ultimate.allocInit(71, 49);call #Ultimate.allocInit(66, 50);call #Ultimate.allocInit(51, 51);call #Ultimate.allocInit(59, 52);call #Ultimate.allocInit(11, 53);call #Ultimate.allocInit(77, 54);call #Ultimate.allocInit(11, 55);call #Ultimate.allocInit(70, 56);call #Ultimate.allocInit(11, 57);call #Ultimate.allocInit(71, 58);call #Ultimate.allocInit(11, 59);call #Ultimate.allocInit(66, 60);call #Ultimate.allocInit(11, 61);call #Ultimate.allocInit(82, 62);call #Ultimate.allocInit(11, 63);~#array_validator~0.base, ~#array_validator~0.offset := 64, 0;call #Ultimate.allocInit(24, 64);call write~init~$Pointer$(7, 0, ~#array_validator~0.base, ~#array_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~array_block_prepare_for_write.base, #funAddr~array_block_prepare_for_write.offset, ~#array_validator~0.base, 8 + ~#array_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~array_block_check.base, #funAddr~array_block_check.offset, ~#array_validator~0.base, 16 + ~#array_validator~0.offset, 8);~LDV_IN_INTERRUPT~0 := 0;~#bitset_bvt~0.base, ~#bitset_bvt~0.offset := 65, 0;call #Ultimate.allocInit(36, 65);call write~init~$Pointer$(0, 0, ~#bitset_bvt~0.base, ~#bitset_bvt~0.offset, 8);call write~init~int(8, ~#bitset_bvt~0.base, 8 + ~#bitset_bvt~0.offset, 4);call write~init~$Pointer$(0, 0, ~#bitset_bvt~0.base, 12 + ~#bitset_bvt~0.offset, 8);call write~init~$Pointer$(0, 0, ~#bitset_bvt~0.base, 20 + ~#bitset_bvt~0.offset, 8);call write~init~$Pointer$(0, 0, ~#bitset_bvt~0.base, 28 + ~#bitset_bvt~0.offset, 8);~#index_validator~0.base, ~#index_validator~0.offset := 66, 0;call #Ultimate.allocInit(24, 66);call write~init~$Pointer$(26, 0, ~#index_validator~0.base, ~#index_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~index_prepare_for_write.base, #funAddr~index_prepare_for_write.offset, ~#index_validator~0.base, 8 + ~#index_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~index_check.base, #funAddr~index_check.offset, ~#index_validator~0.base, 16 + ~#index_validator~0.offset, 8);~#dm_sm_bitmap_validator~0.base, ~#dm_sm_bitmap_validator~0.offset := 67, 0;call #Ultimate.allocInit(24, 67);call write~init~$Pointer$(31, 0, ~#dm_sm_bitmap_validator~0.base, ~#dm_sm_bitmap_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~bitmap_prepare_for_write.base, #funAddr~bitmap_prepare_for_write.offset, ~#dm_sm_bitmap_validator~0.base, 8 + ~#dm_sm_bitmap_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~bitmap_check.base, #funAddr~bitmap_check.offset, ~#dm_sm_bitmap_validator~0.base, 16 + ~#dm_sm_bitmap_validator~0.offset, 8);~#ops~0.base, ~#ops~0.offset := 68, 0;call #Ultimate.allocInit(112, 68);call write~init~$Pointer$(#funAddr~sm_disk_destroy.base, #funAddr~sm_disk_destroy.offset, ~#ops~0.base, ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_extend.base, #funAddr~sm_disk_extend.offset, ~#ops~0.base, 8 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_get_nr_blocks.base, #funAddr~sm_disk_get_nr_blocks.offset, ~#ops~0.base, 16 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_get_nr_free.base, #funAddr~sm_disk_get_nr_free.offset, ~#ops~0.base, 24 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_get_count.base, #funAddr~sm_disk_get_count.offset, ~#ops~0.base, 32 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_count_is_more_than_one.base, #funAddr~sm_disk_count_is_more_than_one.offset, ~#ops~0.base, 40 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_set_count.base, #funAddr~sm_disk_set_count.offset, ~#ops~0.base, 48 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_commit.base, #funAddr~sm_disk_commit.offset, ~#ops~0.base, 56 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_inc_block.base, #funAddr~sm_disk_inc_block.offset, ~#ops~0.base, 64 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_dec_block.base, #funAddr~sm_disk_dec_block.offset, ~#ops~0.base, 72 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_new_block.base, #funAddr~sm_disk_new_block.offset, ~#ops~0.base, 80 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_root_size.base, #funAddr~sm_disk_root_size.offset, ~#ops~0.base, 88 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_copy_root.base, #funAddr~sm_disk_copy_root.offset, ~#ops~0.base, 96 + ~#ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ops~0.base, 104 + ~#ops~0.offset, 8);~#ops___0~0.base, ~#ops___0~0.offset := 69, 0;call #Ultimate.allocInit(112, 69);call write~init~$Pointer$(#funAddr~sm_metadata_destroy.base, #funAddr~sm_metadata_destroy.offset, ~#ops___0~0.base, ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_extend.base, #funAddr~sm_metadata_extend.offset, ~#ops___0~0.base, 8 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_get_nr_blocks.base, #funAddr~sm_metadata_get_nr_blocks.offset, ~#ops___0~0.base, 16 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_get_nr_free.base, #funAddr~sm_metadata_get_nr_free.offset, ~#ops___0~0.base, 24 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_get_count.base, #funAddr~sm_metadata_get_count.offset, ~#ops___0~0.base, 32 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_count_is_more_than_one.base, #funAddr~sm_metadata_count_is_more_than_one.offset, ~#ops___0~0.base, 40 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_set_count.base, #funAddr~sm_metadata_set_count.offset, ~#ops___0~0.base, 48 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_commit.base, #funAddr~sm_metadata_commit.offset, ~#ops___0~0.base, 56 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_inc_block.base, #funAddr~sm_metadata_inc_block.offset, ~#ops___0~0.base, 64 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_dec_block.base, #funAddr~sm_metadata_dec_block.offset, ~#ops___0~0.base, 72 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_new_block.base, #funAddr~sm_metadata_new_block.offset, ~#ops___0~0.base, 80 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_root_size.base, #funAddr~sm_metadata_root_size.offset, ~#ops___0~0.base, 88 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_copy_root.base, #funAddr~sm_metadata_copy_root.offset, ~#ops___0~0.base, 96 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_register_threshold_callback.base, #funAddr~sm_metadata_register_threshold_callback.offset, ~#ops___0~0.base, 104 + ~#ops___0~0.offset, 8);~#bootstrap_ops~0.base, ~#bootstrap_ops~0.offset := 70, 0;call #Ultimate.allocInit(112, 70);call write~init~$Pointer$(#funAddr~sm_bootstrap_destroy.base, #funAddr~sm_bootstrap_destroy.offset, ~#bootstrap_ops~0.base, ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_extend.base, #funAddr~sm_bootstrap_extend.offset, ~#bootstrap_ops~0.base, 8 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_get_nr_blocks.base, #funAddr~sm_bootstrap_get_nr_blocks.offset, ~#bootstrap_ops~0.base, 16 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_get_nr_free.base, #funAddr~sm_bootstrap_get_nr_free.offset, ~#bootstrap_ops~0.base, 24 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_get_count.base, #funAddr~sm_bootstrap_get_count.offset, ~#bootstrap_ops~0.base, 32 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_count_is_more_than_one.base, #funAddr~sm_bootstrap_count_is_more_than_one.offset, ~#bootstrap_ops~0.base, 40 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_set_count.base, #funAddr~sm_bootstrap_set_count.offset, ~#bootstrap_ops~0.base, 48 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_commit.base, #funAddr~sm_bootstrap_commit.offset, ~#bootstrap_ops~0.base, 56 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_inc_block.base, #funAddr~sm_bootstrap_inc_block.offset, ~#bootstrap_ops~0.base, 64 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_dec_block.base, #funAddr~sm_bootstrap_dec_block.offset, ~#bootstrap_ops~0.base, 72 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_new_block.base, #funAddr~sm_bootstrap_new_block.offset, ~#bootstrap_ops~0.base, 80 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_root_size.base, #funAddr~sm_bootstrap_root_size.offset, ~#bootstrap_ops~0.base, 88 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_copy_root.base, #funAddr~sm_bootstrap_copy_root.offset, ~#bootstrap_ops~0.base, 96 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#bootstrap_ops~0.base, 104 + ~#bootstrap_ops~0.offset, 8);~#le64_type~0.base, ~#le64_type~0.offset := 71, 0;call #Ultimate.allocInit(36, 71);call write~init~$Pointer$(0, 0, ~#le64_type~0.base, ~#le64_type~0.offset, 8);call write~init~int(8, ~#le64_type~0.base, 8 + ~#le64_type~0.offset, 4);call write~init~$Pointer$(0, 0, ~#le64_type~0.base, 12 + ~#le64_type~0.offset, 8);call write~init~$Pointer$(0, 0, ~#le64_type~0.base, 20 + ~#le64_type~0.offset, 8);call write~init~$Pointer$(0, 0, ~#le64_type~0.base, 28 + ~#le64_type~0.offset, 8);~#btree_node_validator~0.base, ~#btree_node_validator~0.offset := 72, 0;call #Ultimate.allocInit(24, 72);call write~init~$Pointer$(63, 0, ~#btree_node_validator~0.base, ~#btree_node_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~node_prepare_for_write.base, #funAddr~node_prepare_for_write.offset, ~#btree_node_validator~0.base, 8 + ~#btree_node_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~node_check.base, #funAddr~node_check.offset, ~#btree_node_validator~0.base, 16 + ~#btree_node_validator~0.offset, 8);~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0; {140#true} is VALID [2022-02-20 21:48:32,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet825#1, main_#t~switch826#1, main_#t~ret827#1, main_#t~ret828#1, main_#t~nondet829#1, main_~var_group1~1#1.base, main_~var_group1~1#1.offset, main_~var_group2~1#1.base, main_~var_group2~1#1.offset, main_~var_index_prepare_for_write_0_p2~0#1, main_~var_index_check_1_p2~0#1, main_~var_bitmap_prepare_for_write_2_p2~0#1, main_~var_bitmap_check_3_p2~0#1, main_~tmp~87#1, main_~tmp___0~42#1;havoc main_~var_group1~1#1.base, main_~var_group1~1#1.offset;havoc main_~var_group2~1#1.base, main_~var_group2~1#1.offset;havoc main_~var_index_prepare_for_write_0_p2~0#1;havoc main_~var_index_check_1_p2~0#1;havoc main_~var_bitmap_prepare_for_write_2_p2~0#1;havoc main_~var_bitmap_check_3_p2~0#1;havoc main_~tmp~87#1;havoc main_~tmp___0~42#1;~LDV_IN_INTERRUPT~0 := 1; {140#true} is VALID [2022-02-20 21:48:32,215 INFO L272 TraceCheckUtils]: 2: Hoare triple {140#true} call ldv_initialize(); {146#(and (= |old(~ldv_mutex_mutex_of_device~0)| ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 |old(~ldv_mutex_lock~0)|))} is VALID [2022-02-20 21:48:32,215 INFO L290 TraceCheckUtils]: 3: Hoare triple {146#(and (= |old(~ldv_mutex_mutex_of_device~0)| ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 |old(~ldv_mutex_lock~0)|))} ~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1; {145#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:32,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {145#(= ~ldv_mutex_lock~0 1)} assume true; {145#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:32,216 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {145#(= ~ldv_mutex_lock~0 1)} {140#true} #240#return; {145#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:32,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {145#(= ~ldv_mutex_lock~0 1)} assume -2147483648 <= main_#t~nondet829#1 && main_#t~nondet829#1 <= 2147483647;main_~tmp___0~42#1 := main_#t~nondet829#1;havoc main_#t~nondet829#1; {145#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:32,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {145#(= ~ldv_mutex_lock~0 1)} assume !(0 != main_~tmp___0~42#1); {145#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:32,218 INFO L272 TraceCheckUtils]: 8: Hoare triple {145#(= ~ldv_mutex_lock~0 1)} call ldv_check_final_state(); {145#(= ~ldv_mutex_lock~0 1)} is VALID [2022-02-20 21:48:32,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {145#(= ~ldv_mutex_lock~0 1)} assume !(1 == ~ldv_mutex_lock~0); {141#false} is VALID [2022-02-20 21:48:32,220 INFO L272 TraceCheckUtils]: 10: Hoare triple {141#false} call ldv_error(); {141#false} is VALID [2022-02-20 21:48:32,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {141#false} assume !false; {141#false} is VALID [2022-02-20 21:48:32,220 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:48:32,221 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:48:32,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191912518] [2022-02-20 21:48:32,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191912518] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:48:32,222 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:48:32,222 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:48:32,223 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983981642] [2022-02-20 21:48:32,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:48:32,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 21:48:32,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:48:32,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:32,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:48:32,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:48:32,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:48:32,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:48:32,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:48:32,276 INFO L87 Difference]: Start difference. First operand has 137 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 92 states have internal predecessors, (105), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:32,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:48:32,886 INFO L93 Difference]: Finished difference Result 265 states and 347 transitions. [2022-02-20 21:48:32,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:48:32,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 21:48:32,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:48:32,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 347 transitions. [2022-02-20 21:48:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 347 transitions. [2022-02-20 21:48:32,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 347 transitions. [2022-02-20 21:48:33,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:48:33,272 INFO L225 Difference]: With dead ends: 265 [2022-02-20 21:48:33,272 INFO L226 Difference]: Without dead ends: 128 [2022-02-20 21:48:33,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:48:33,278 INFO L933 BasicCegarLoop]: 132 mSDtfsCounter, 180 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:48:33,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 156 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 21:48:33,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-02-20 21:48:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-02-20 21:48:33,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:48:33,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 128 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 84 states have internal predecessors, (96), 33 states have call successors, (33), 15 states have call predecessors, (33), 13 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 21:48:33,321 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 128 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 84 states have internal predecessors, (96), 33 states have call successors, (33), 15 states have call predecessors, (33), 13 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 21:48:33,324 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 128 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 84 states have internal predecessors, (96), 33 states have call successors, (33), 15 states have call predecessors, (33), 13 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 21:48:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:48:33,335 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2022-02-20 21:48:33,335 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-02-20 21:48:33,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:48:33,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:48:33,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 84 states have internal predecessors, (96), 33 states have call successors, (33), 15 states have call predecessors, (33), 13 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 128 states. [2022-02-20 21:48:33,338 INFO L87 Difference]: Start difference. First operand has 128 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 84 states have internal predecessors, (96), 33 states have call successors, (33), 15 states have call predecessors, (33), 13 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 128 states. [2022-02-20 21:48:33,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:48:33,344 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2022-02-20 21:48:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-02-20 21:48:33,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:48:33,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:48:33,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:48:33,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:48:33,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 84 states have internal predecessors, (96), 33 states have call successors, (33), 15 states have call predecessors, (33), 13 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 21:48:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 160 transitions. [2022-02-20 21:48:33,353 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 160 transitions. Word has length 12 [2022-02-20 21:48:33,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:48:33,353 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 160 transitions. [2022-02-20 21:48:33,354 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-02-20 21:48:33,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 21:48:33,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 21:48:33,354 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 21:48:33,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 21:48:33,355 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 21:48:33,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 21:48:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1033838797, now seen corresponding path program 1 times [2022-02-20 21:48:33,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 21:48:33,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102210998] [2022-02-20 21:48:33,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 21:48:33,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 21:48:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:48:33,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 21:48:33,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 21:48:33,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {966#(and (= |old(~ldv_mutex_mutex_of_device~0)| ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 |old(~ldv_mutex_lock~0)|))} ~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1; {965#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:33,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {965#(= 1 ~ldv_mutex_mutex_of_device~0)} assume true; {965#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:33,451 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {965#(= 1 ~ldv_mutex_mutex_of_device~0)} {960#true} #240#return; {965#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:33,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {960#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(92, 2);call #Ultimate.allocInit(18, 3);call #Ultimate.allocInit(78, 4);call #Ultimate.allocInit(18, 5);call #Ultimate.allocInit(71, 6);call #Ultimate.allocInit(6, 7);call write~init~int(97, 7, 0, 1);call write~init~int(114, 7, 1, 1);call write~init~int(114, 7, 2, 1);call write~init~int(97, 7, 3, 1);call write~init~int(121, 7, 4, 1);call write~init~int(0, 7, 5, 1);call #Ultimate.allocInit(10, 8);call #Ultimate.allocInit(68, 9);call #Ultimate.allocInit(10, 10);call #Ultimate.allocInit(54, 11);call #Ultimate.allocInit(73, 12);call #Ultimate.allocInit(54, 13);call #Ultimate.allocInit(71, 14);call #Ultimate.allocInit(22, 15);call #Ultimate.allocInit(79, 16);call #Ultimate.allocInit(22, 17);call #Ultimate.allocInit(73, 18);call #Ultimate.allocInit(22, 19);call #Ultimate.allocInit(85, 20);call #Ultimate.allocInit(5, 21);call write~init~int(78, 21, 0, 1);call write~init~int(85, 21, 1, 1);call write~init~int(76, 21, 2, 1);call write~init~int(76, 21, 3, 1);call write~init~int(0, 21, 4, 1);call #Ultimate.allocInit(12, 22);call #Ultimate.allocInit(83, 23);call #Ultimate.allocInit(12, 24);call #Ultimate.allocInit(76, 25);call #Ultimate.allocInit(6, 26);call write~init~int(105, 26, 0, 1);call write~init~int(110, 26, 1, 1);call write~init~int(100, 26, 2, 1);call write~init~int(101, 26, 3, 1);call write~init~int(120, 26, 4, 1);call write~init~int(0, 26, 5, 1);call #Ultimate.allocInit(13, 27);call #Ultimate.allocInit(84, 28);call #Ultimate.allocInit(13, 29);call #Ultimate.allocInit(77, 30);call #Ultimate.allocInit(10, 31);call #Ultimate.allocInit(70, 32);call #Ultimate.allocInit(55, 33);call #Ultimate.allocInit(63, 34);call #Ultimate.allocInit(59, 35);call #Ultimate.allocInit(62, 36);call #Ultimate.allocInit(62, 37);call #Ultimate.allocInit(68, 38);call #Ultimate.allocInit(67, 39);call #Ultimate.allocInit(64, 40);call #Ultimate.allocInit(75, 41);call #Ultimate.allocInit(67, 42);call #Ultimate.allocInit(70, 43);call #Ultimate.allocInit(73, 44);call #Ultimate.allocInit(73, 45);call #Ultimate.allocInit(73, 46);call #Ultimate.allocInit(20, 47);call #Ultimate.allocInit(73, 48);call #Ultimate.allocInit(71, 49);call #Ultimate.allocInit(66, 50);call #Ultimate.allocInit(51, 51);call #Ultimate.allocInit(59, 52);call #Ultimate.allocInit(11, 53);call #Ultimate.allocInit(77, 54);call #Ultimate.allocInit(11, 55);call #Ultimate.allocInit(70, 56);call #Ultimate.allocInit(11, 57);call #Ultimate.allocInit(71, 58);call #Ultimate.allocInit(11, 59);call #Ultimate.allocInit(66, 60);call #Ultimate.allocInit(11, 61);call #Ultimate.allocInit(82, 62);call #Ultimate.allocInit(11, 63);~#array_validator~0.base, ~#array_validator~0.offset := 64, 0;call #Ultimate.allocInit(24, 64);call write~init~$Pointer$(7, 0, ~#array_validator~0.base, ~#array_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~array_block_prepare_for_write.base, #funAddr~array_block_prepare_for_write.offset, ~#array_validator~0.base, 8 + ~#array_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~array_block_check.base, #funAddr~array_block_check.offset, ~#array_validator~0.base, 16 + ~#array_validator~0.offset, 8);~LDV_IN_INTERRUPT~0 := 0;~#bitset_bvt~0.base, ~#bitset_bvt~0.offset := 65, 0;call #Ultimate.allocInit(36, 65);call write~init~$Pointer$(0, 0, ~#bitset_bvt~0.base, ~#bitset_bvt~0.offset, 8);call write~init~int(8, ~#bitset_bvt~0.base, 8 + ~#bitset_bvt~0.offset, 4);call write~init~$Pointer$(0, 0, ~#bitset_bvt~0.base, 12 + ~#bitset_bvt~0.offset, 8);call write~init~$Pointer$(0, 0, ~#bitset_bvt~0.base, 20 + ~#bitset_bvt~0.offset, 8);call write~init~$Pointer$(0, 0, ~#bitset_bvt~0.base, 28 + ~#bitset_bvt~0.offset, 8);~#index_validator~0.base, ~#index_validator~0.offset := 66, 0;call #Ultimate.allocInit(24, 66);call write~init~$Pointer$(26, 0, ~#index_validator~0.base, ~#index_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~index_prepare_for_write.base, #funAddr~index_prepare_for_write.offset, ~#index_validator~0.base, 8 + ~#index_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~index_check.base, #funAddr~index_check.offset, ~#index_validator~0.base, 16 + ~#index_validator~0.offset, 8);~#dm_sm_bitmap_validator~0.base, ~#dm_sm_bitmap_validator~0.offset := 67, 0;call #Ultimate.allocInit(24, 67);call write~init~$Pointer$(31, 0, ~#dm_sm_bitmap_validator~0.base, ~#dm_sm_bitmap_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~bitmap_prepare_for_write.base, #funAddr~bitmap_prepare_for_write.offset, ~#dm_sm_bitmap_validator~0.base, 8 + ~#dm_sm_bitmap_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~bitmap_check.base, #funAddr~bitmap_check.offset, ~#dm_sm_bitmap_validator~0.base, 16 + ~#dm_sm_bitmap_validator~0.offset, 8);~#ops~0.base, ~#ops~0.offset := 68, 0;call #Ultimate.allocInit(112, 68);call write~init~$Pointer$(#funAddr~sm_disk_destroy.base, #funAddr~sm_disk_destroy.offset, ~#ops~0.base, ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_extend.base, #funAddr~sm_disk_extend.offset, ~#ops~0.base, 8 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_get_nr_blocks.base, #funAddr~sm_disk_get_nr_blocks.offset, ~#ops~0.base, 16 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_get_nr_free.base, #funAddr~sm_disk_get_nr_free.offset, ~#ops~0.base, 24 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_get_count.base, #funAddr~sm_disk_get_count.offset, ~#ops~0.base, 32 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_count_is_more_than_one.base, #funAddr~sm_disk_count_is_more_than_one.offset, ~#ops~0.base, 40 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_set_count.base, #funAddr~sm_disk_set_count.offset, ~#ops~0.base, 48 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_commit.base, #funAddr~sm_disk_commit.offset, ~#ops~0.base, 56 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_inc_block.base, #funAddr~sm_disk_inc_block.offset, ~#ops~0.base, 64 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_dec_block.base, #funAddr~sm_disk_dec_block.offset, ~#ops~0.base, 72 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_new_block.base, #funAddr~sm_disk_new_block.offset, ~#ops~0.base, 80 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_root_size.base, #funAddr~sm_disk_root_size.offset, ~#ops~0.base, 88 + ~#ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_disk_copy_root.base, #funAddr~sm_disk_copy_root.offset, ~#ops~0.base, 96 + ~#ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#ops~0.base, 104 + ~#ops~0.offset, 8);~#ops___0~0.base, ~#ops___0~0.offset := 69, 0;call #Ultimate.allocInit(112, 69);call write~init~$Pointer$(#funAddr~sm_metadata_destroy.base, #funAddr~sm_metadata_destroy.offset, ~#ops___0~0.base, ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_extend.base, #funAddr~sm_metadata_extend.offset, ~#ops___0~0.base, 8 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_get_nr_blocks.base, #funAddr~sm_metadata_get_nr_blocks.offset, ~#ops___0~0.base, 16 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_get_nr_free.base, #funAddr~sm_metadata_get_nr_free.offset, ~#ops___0~0.base, 24 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_get_count.base, #funAddr~sm_metadata_get_count.offset, ~#ops___0~0.base, 32 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_count_is_more_than_one.base, #funAddr~sm_metadata_count_is_more_than_one.offset, ~#ops___0~0.base, 40 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_set_count.base, #funAddr~sm_metadata_set_count.offset, ~#ops___0~0.base, 48 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_commit.base, #funAddr~sm_metadata_commit.offset, ~#ops___0~0.base, 56 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_inc_block.base, #funAddr~sm_metadata_inc_block.offset, ~#ops___0~0.base, 64 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_dec_block.base, #funAddr~sm_metadata_dec_block.offset, ~#ops___0~0.base, 72 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_new_block.base, #funAddr~sm_metadata_new_block.offset, ~#ops___0~0.base, 80 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_root_size.base, #funAddr~sm_metadata_root_size.offset, ~#ops___0~0.base, 88 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_copy_root.base, #funAddr~sm_metadata_copy_root.offset, ~#ops___0~0.base, 96 + ~#ops___0~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_metadata_register_threshold_callback.base, #funAddr~sm_metadata_register_threshold_callback.offset, ~#ops___0~0.base, 104 + ~#ops___0~0.offset, 8);~#bootstrap_ops~0.base, ~#bootstrap_ops~0.offset := 70, 0;call #Ultimate.allocInit(112, 70);call write~init~$Pointer$(#funAddr~sm_bootstrap_destroy.base, #funAddr~sm_bootstrap_destroy.offset, ~#bootstrap_ops~0.base, ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_extend.base, #funAddr~sm_bootstrap_extend.offset, ~#bootstrap_ops~0.base, 8 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_get_nr_blocks.base, #funAddr~sm_bootstrap_get_nr_blocks.offset, ~#bootstrap_ops~0.base, 16 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_get_nr_free.base, #funAddr~sm_bootstrap_get_nr_free.offset, ~#bootstrap_ops~0.base, 24 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_get_count.base, #funAddr~sm_bootstrap_get_count.offset, ~#bootstrap_ops~0.base, 32 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_count_is_more_than_one.base, #funAddr~sm_bootstrap_count_is_more_than_one.offset, ~#bootstrap_ops~0.base, 40 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_set_count.base, #funAddr~sm_bootstrap_set_count.offset, ~#bootstrap_ops~0.base, 48 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_commit.base, #funAddr~sm_bootstrap_commit.offset, ~#bootstrap_ops~0.base, 56 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_inc_block.base, #funAddr~sm_bootstrap_inc_block.offset, ~#bootstrap_ops~0.base, 64 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_dec_block.base, #funAddr~sm_bootstrap_dec_block.offset, ~#bootstrap_ops~0.base, 72 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_new_block.base, #funAddr~sm_bootstrap_new_block.offset, ~#bootstrap_ops~0.base, 80 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_root_size.base, #funAddr~sm_bootstrap_root_size.offset, ~#bootstrap_ops~0.base, 88 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(#funAddr~sm_bootstrap_copy_root.base, #funAddr~sm_bootstrap_copy_root.offset, ~#bootstrap_ops~0.base, 96 + ~#bootstrap_ops~0.offset, 8);call write~init~$Pointer$(0, 0, ~#bootstrap_ops~0.base, 104 + ~#bootstrap_ops~0.offset, 8);~#le64_type~0.base, ~#le64_type~0.offset := 71, 0;call #Ultimate.allocInit(36, 71);call write~init~$Pointer$(0, 0, ~#le64_type~0.base, ~#le64_type~0.offset, 8);call write~init~int(8, ~#le64_type~0.base, 8 + ~#le64_type~0.offset, 4);call write~init~$Pointer$(0, 0, ~#le64_type~0.base, 12 + ~#le64_type~0.offset, 8);call write~init~$Pointer$(0, 0, ~#le64_type~0.base, 20 + ~#le64_type~0.offset, 8);call write~init~$Pointer$(0, 0, ~#le64_type~0.base, 28 + ~#le64_type~0.offset, 8);~#btree_node_validator~0.base, ~#btree_node_validator~0.offset := 72, 0;call #Ultimate.allocInit(24, 72);call write~init~$Pointer$(63, 0, ~#btree_node_validator~0.base, ~#btree_node_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~node_prepare_for_write.base, #funAddr~node_prepare_for_write.offset, ~#btree_node_validator~0.base, 8 + ~#btree_node_validator~0.offset, 8);call write~init~$Pointer$(#funAddr~node_check.base, #funAddr~node_check.offset, ~#btree_node_validator~0.base, 16 + ~#btree_node_validator~0.offset, 8);~ldv_mutex_lock~0 := 0;~ldv_mutex_mutex_of_device~0 := 0; {960#true} is VALID [2022-02-20 21:48:33,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {960#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet825#1, main_#t~switch826#1, main_#t~ret827#1, main_#t~ret828#1, main_#t~nondet829#1, main_~var_group1~1#1.base, main_~var_group1~1#1.offset, main_~var_group2~1#1.base, main_~var_group2~1#1.offset, main_~var_index_prepare_for_write_0_p2~0#1, main_~var_index_check_1_p2~0#1, main_~var_bitmap_prepare_for_write_2_p2~0#1, main_~var_bitmap_check_3_p2~0#1, main_~tmp~87#1, main_~tmp___0~42#1;havoc main_~var_group1~1#1.base, main_~var_group1~1#1.offset;havoc main_~var_group2~1#1.base, main_~var_group2~1#1.offset;havoc main_~var_index_prepare_for_write_0_p2~0#1;havoc main_~var_index_check_1_p2~0#1;havoc main_~var_bitmap_prepare_for_write_2_p2~0#1;havoc main_~var_bitmap_check_3_p2~0#1;havoc main_~tmp~87#1;havoc main_~tmp___0~42#1;~LDV_IN_INTERRUPT~0 := 1; {960#true} is VALID [2022-02-20 21:48:33,452 INFO L272 TraceCheckUtils]: 2: Hoare triple {960#true} call ldv_initialize(); {966#(and (= |old(~ldv_mutex_mutex_of_device~0)| ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 |old(~ldv_mutex_lock~0)|))} is VALID [2022-02-20 21:48:33,453 INFO L290 TraceCheckUtils]: 3: Hoare triple {966#(and (= |old(~ldv_mutex_mutex_of_device~0)| ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 |old(~ldv_mutex_lock~0)|))} ~ldv_mutex_lock~0 := 1;~ldv_mutex_mutex_of_device~0 := 1; {965#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:33,453 INFO L290 TraceCheckUtils]: 4: Hoare triple {965#(= 1 ~ldv_mutex_mutex_of_device~0)} assume true; {965#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:33,453 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {965#(= 1 ~ldv_mutex_mutex_of_device~0)} {960#true} #240#return; {965#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:33,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {965#(= 1 ~ldv_mutex_mutex_of_device~0)} assume -2147483648 <= main_#t~nondet829#1 && main_#t~nondet829#1 <= 2147483647;main_~tmp___0~42#1 := main_#t~nondet829#1;havoc main_#t~nondet829#1; {965#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:33,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {965#(= 1 ~ldv_mutex_mutex_of_device~0)} assume !(0 != main_~tmp___0~42#1); {965#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:33,455 INFO L272 TraceCheckUtils]: 8: Hoare triple {965#(= 1 ~ldv_mutex_mutex_of_device~0)} call ldv_check_final_state(); {965#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:33,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {965#(= 1 ~ldv_mutex_mutex_of_device~0)} assume 1 == ~ldv_mutex_lock~0; {965#(= 1 ~ldv_mutex_mutex_of_device~0)} is VALID [2022-02-20 21:48:33,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {965#(= 1 ~ldv_mutex_mutex_of_device~0)} assume !(1 == ~ldv_mutex_mutex_of_device~0); {961#false} is VALID [2022-02-20 21:48:33,456 INFO L272 TraceCheckUtils]: 11: Hoare triple {961#false} call ldv_error(); {961#false} is VALID [2022-02-20 21:48:33,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {961#false} assume !false; {961#false} is VALID [2022-02-20 21:48:33,456 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:48:33,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 21:48:33,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102210998] [2022-02-20 21:48:33,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102210998] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 21:48:33,465 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 21:48:33,465 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 21:48:33,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582987929] [2022-02-20 21:48:33,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 21:48:33,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 21:48:33,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 21:48:33,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:33,481 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:48:33,481 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 21:48:33,481 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 21:48:33,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 21:48:33,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 21:48:33,482 INFO L87 Difference]: Start difference. First operand 128 states and 160 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:48:33,998 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2022-02-20 21:48:33,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 21:48:33,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 21:48:33,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 21:48:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:34,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2022-02-20 21:48:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2022-02-20 21:48:34,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 160 transitions. [2022-02-20 21:48:34,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 21:48:34,138 INFO L225 Difference]: With dead ends: 128 [2022-02-20 21:48:34,138 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 21:48:34,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:48:34,140 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 168 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 21:48:34,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 147 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 21:48:34,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 21:48:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 21:48:34,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 21:48:34,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:48:34,141 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:48:34,141 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:48:34,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:48:34,142 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 21:48:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 21:48:34,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:48:34,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:48:34,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 21:48:34,143 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 21:48:34,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 21:48:34,143 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 21:48:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 21:48:34,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:48:34,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 21:48:34,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 21:48:34,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 21:48:34,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 21:48:34,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 21:48:34,144 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-02-20 21:48:34,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 21:48:34,145 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 21:48:34,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 21:48:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 21:48:34,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 21:48:34,147 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 21:48:34,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 21:48:34,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 21:48:34,337 INFO L861 garLoopResultBuilder]: At program point index_checkENTRY(lines 5903 5941) the Hoare annotation is: true [2022-02-20 21:48:34,337 INFO L861 garLoopResultBuilder]: At program point L5919(line 5919) the Hoare annotation is: true [2022-02-20 21:48:34,338 INFO L858 garLoopResultBuilder]: For program point L5919-1(line 5919) no Hoare annotation was computed. [2022-02-20 21:48:34,338 INFO L861 garLoopResultBuilder]: At program point L5915(line 5915) the Hoare annotation is: true [2022-02-20 21:48:34,338 INFO L858 garLoopResultBuilder]: For program point L5915-1(line 5915) no Hoare annotation was computed. [2022-02-20 21:48:34,338 INFO L861 garLoopResultBuilder]: At program point L5917(line 5917) the Hoare annotation is: true [2022-02-20 21:48:34,338 INFO L858 garLoopResultBuilder]: For program point L5917-1(line 5917) no Hoare annotation was computed. [2022-02-20 21:48:34,338 INFO L861 garLoopResultBuilder]: At program point L5913(line 5913) the Hoare annotation is: true [2022-02-20 21:48:34,338 INFO L858 garLoopResultBuilder]: For program point L5913-1(line 5913) no Hoare annotation was computed. [2022-02-20 21:48:34,339 INFO L861 garLoopResultBuilder]: At program point L5930(line 5930) the Hoare annotation is: true [2022-02-20 21:48:34,339 INFO L858 garLoopResultBuilder]: For program point L5930-1(line 5930) no Hoare annotation was computed. [2022-02-20 21:48:34,339 INFO L858 garLoopResultBuilder]: For program point L5918(lines 5918 5923) no Hoare annotation was computed. [2022-02-20 21:48:34,339 INFO L858 garLoopResultBuilder]: For program point L5916(lines 5916 5926) no Hoare annotation was computed. [2022-02-20 21:48:34,339 INFO L858 garLoopResultBuilder]: For program point L5918-2(lines 5918 5923) no Hoare annotation was computed. [2022-02-20 21:48:34,339 INFO L858 garLoopResultBuilder]: For program point index_checkEXIT(lines 5903 5941) no Hoare annotation was computed. [2022-02-20 21:48:34,339 INFO L858 garLoopResultBuilder]: For program point L5931(lines 5931 5935) no Hoare annotation was computed. [2022-02-20 21:48:34,340 INFO L861 garLoopResultBuilder]: At program point L5927(lines 5927 5928) the Hoare annotation is: true [2022-02-20 21:48:34,340 INFO L858 garLoopResultBuilder]: For program point index_checkFINAL(lines 5903 5941) no Hoare annotation was computed. [2022-02-20 21:48:34,340 INFO L858 garLoopResultBuilder]: For program point L5927-1(lines 5927 5928) no Hoare annotation was computed. [2022-02-20 21:48:34,340 INFO L858 garLoopResultBuilder]: For program point L5929(lines 5929 5938) no Hoare annotation was computed. [2022-02-20 21:48:34,340 INFO L858 garLoopResultBuilder]: For program point L5931-2(lines 5931 5935) no Hoare annotation was computed. [2022-02-20 21:48:34,340 INFO L861 garLoopResultBuilder]: At program point dm_bufio_get_block_numberENTRY(lines 11636 11638) the Hoare annotation is: true [2022-02-20 21:48:34,340 INFO L858 garLoopResultBuilder]: For program point dm_bufio_get_block_numberFINAL(lines 11636 11638) no Hoare annotation was computed. [2022-02-20 21:48:34,341 INFO L858 garLoopResultBuilder]: For program point dm_bufio_get_block_numberEXIT(lines 11636 11638) no Hoare annotation was computed. [2022-02-20 21:48:34,341 INFO L858 garLoopResultBuilder]: For program point dm_block_dataFINAL(lines 5366 5375) no Hoare annotation was computed. [2022-02-20 21:48:34,341 INFO L861 garLoopResultBuilder]: At program point L5371(line 5371) the Hoare annotation is: true [2022-02-20 21:48:34,341 INFO L858 garLoopResultBuilder]: For program point L11633-1(line 11633) no Hoare annotation was computed. [2022-02-20 21:48:34,341 INFO L858 garLoopResultBuilder]: For program point L5371-1(line 5371) no Hoare annotation was computed. [2022-02-20 21:48:34,341 INFO L861 garLoopResultBuilder]: At program point L11633(line 11633) the Hoare annotation is: true [2022-02-20 21:48:34,341 INFO L858 garLoopResultBuilder]: For program point dm_block_dataEXIT(lines 5366 5375) no Hoare annotation was computed. [2022-02-20 21:48:34,342 INFO L861 garLoopResultBuilder]: At program point L11633-2(lines 11632 11634) the Hoare annotation is: true [2022-02-20 21:48:34,342 INFO L861 garLoopResultBuilder]: At program point dm_block_dataENTRY(lines 5366 5375) the Hoare annotation is: true [2022-02-20 21:48:34,342 INFO L861 garLoopResultBuilder]: At program point dm_bm_checksumENTRY(lines 5773 5780) the Hoare annotation is: true [2022-02-20 21:48:34,342 INFO L858 garLoopResultBuilder]: For program point dm_bm_checksumFINAL(lines 5773 5780) no Hoare annotation was computed. [2022-02-20 21:48:34,342 INFO L858 garLoopResultBuilder]: For program point dm_bm_checksumEXIT(lines 5773 5780) no Hoare annotation was computed. [2022-02-20 21:48:34,342 INFO L861 garLoopResultBuilder]: At program point L11618(lines 11617 11619) the Hoare annotation is: true [2022-02-20 21:48:34,342 INFO L858 garLoopResultBuilder]: For program point index_prepare_for_writeEXIT(lines 5889 5902) no Hoare annotation was computed. [2022-02-20 21:48:34,343 INFO L861 garLoopResultBuilder]: At program point L5898(lines 5898 5899) the Hoare annotation is: true [2022-02-20 21:48:34,343 INFO L861 garLoopResultBuilder]: At program point index_prepare_for_writeENTRY(lines 5889 5902) the Hoare annotation is: true [2022-02-20 21:48:34,343 INFO L858 garLoopResultBuilder]: For program point index_prepare_for_writeFINAL(lines 5889 5902) no Hoare annotation was computed. [2022-02-20 21:48:34,343 INFO L861 garLoopResultBuilder]: At program point L5895(line 5895) the Hoare annotation is: true [2022-02-20 21:48:34,343 INFO L858 garLoopResultBuilder]: For program point L5895-1(line 5895) no Hoare annotation was computed. [2022-02-20 21:48:34,343 INFO L861 garLoopResultBuilder]: At program point L5897(line 5897) the Hoare annotation is: true [2022-02-20 21:48:34,343 INFO L858 garLoopResultBuilder]: For program point L5898-1(lines 5898 5899) no Hoare annotation was computed. [2022-02-20 21:48:34,343 INFO L858 garLoopResultBuilder]: For program point L5897-1(line 5897) no Hoare annotation was computed. [2022-02-20 21:48:34,344 INFO L858 garLoopResultBuilder]: For program point ldv_handler_precallEXIT(lines 11666 11668) no Hoare annotation was computed. [2022-02-20 21:48:34,344 INFO L861 garLoopResultBuilder]: At program point ldv_handler_precallFINAL(lines 11666 11668) the Hoare annotation is: true [2022-02-20 21:48:34,344 INFO L861 garLoopResultBuilder]: At program point L5951(line 5951) the Hoare annotation is: true [2022-02-20 21:48:34,344 INFO L858 garLoopResultBuilder]: For program point L5952-1(lines 5952 5953) no Hoare annotation was computed. [2022-02-20 21:48:34,344 INFO L858 garLoopResultBuilder]: For program point L5951-1(line 5951) no Hoare annotation was computed. [2022-02-20 21:48:34,344 INFO L861 garLoopResultBuilder]: At program point bitmap_prepare_for_writeENTRY(lines 5943 5956) the Hoare annotation is: true [2022-02-20 21:48:34,344 INFO L861 garLoopResultBuilder]: At program point L5952(lines 5952 5953) the Hoare annotation is: true [2022-02-20 21:48:34,345 INFO L861 garLoopResultBuilder]: At program point L5949(line 5949) the Hoare annotation is: true [2022-02-20 21:48:34,345 INFO L858 garLoopResultBuilder]: For program point L5949-1(line 5949) no Hoare annotation was computed. [2022-02-20 21:48:34,345 INFO L858 garLoopResultBuilder]: For program point bitmap_prepare_for_writeFINAL(lines 5943 5956) no Hoare annotation was computed. [2022-02-20 21:48:34,345 INFO L858 garLoopResultBuilder]: For program point bitmap_prepare_for_writeEXIT(lines 5943 5956) no Hoare annotation was computed. [2022-02-20 21:48:34,345 INFO L861 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 4859 4868) the Hoare annotation is: true [2022-02-20 21:48:34,345 INFO L858 garLoopResultBuilder]: For program point L4861(lines 4861 4867) no Hoare annotation was computed. [2022-02-20 21:48:34,345 INFO L861 garLoopResultBuilder]: At program point L4857(lines 4855 4858) the Hoare annotation is: true [2022-02-20 21:48:34,346 INFO L858 garLoopResultBuilder]: For program point L4851(lines 4851 4853) no Hoare annotation was computed. [2022-02-20 21:48:34,346 INFO L858 garLoopResultBuilder]: For program point L4852(line 4852) no Hoare annotation was computed. [2022-02-20 21:48:34,346 INFO L858 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 4859 4868) no Hoare annotation was computed. [2022-02-20 21:48:34,346 INFO L858 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 4859 4868) no Hoare annotation was computed. [2022-02-20 21:48:34,346 INFO L861 garLoopResultBuilder]: At program point L5361(line 5361) the Hoare annotation is: true [2022-02-20 21:48:34,346 INFO L858 garLoopResultBuilder]: For program point L5362-1(line 5362) no Hoare annotation was computed. [2022-02-20 21:48:34,346 INFO L858 garLoopResultBuilder]: For program point dm_block_locationEXIT(lines 5356 5365) no Hoare annotation was computed. [2022-02-20 21:48:34,346 INFO L858 garLoopResultBuilder]: For program point L5361-1(line 5361) no Hoare annotation was computed. [2022-02-20 21:48:34,347 INFO L861 garLoopResultBuilder]: At program point dm_block_locationENTRY(lines 5356 5365) the Hoare annotation is: true [2022-02-20 21:48:34,347 INFO L858 garLoopResultBuilder]: For program point dm_block_locationFINAL(lines 5356 5365) no Hoare annotation was computed. [2022-02-20 21:48:34,347 INFO L861 garLoopResultBuilder]: At program point L5362(line 5362) the Hoare annotation is: true [2022-02-20 21:48:34,347 INFO L858 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 11348 11353) no Hoare annotation was computed. [2022-02-20 21:48:34,347 INFO L861 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 11348 11353) the Hoare annotation is: true [2022-02-20 21:48:34,347 INFO L858 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11351) no Hoare annotation was computed. [2022-02-20 21:48:34,347 INFO L858 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 11348 11353) no Hoare annotation was computed. [2022-02-20 21:48:34,348 INFO L858 garLoopResultBuilder]: For program point to_bufferEXIT(lines 5350 5355) no Hoare annotation was computed. [2022-02-20 21:48:34,348 INFO L861 garLoopResultBuilder]: At program point to_bufferENTRY(lines 5350 5355) the Hoare annotation is: true [2022-02-20 21:48:34,348 INFO L858 garLoopResultBuilder]: For program point to_bufferFINAL(lines 5350 5355) no Hoare annotation was computed. [2022-02-20 21:48:34,348 INFO L861 garLoopResultBuilder]: At program point ldv_check_final_stateENTRY(lines 11583 11596) the Hoare annotation is: true [2022-02-20 21:48:34,348 INFO L854 garLoopResultBuilder]: At program point L11588(line 11588) the Hoare annotation is: (or (not (= ~ldv_mutex_lock~0 1)) (not (= 1 ~ldv_mutex_mutex_of_device~0))) [2022-02-20 21:48:34,348 INFO L858 garLoopResultBuilder]: For program point L11588-1(lines 11585 11595) no Hoare annotation was computed. [2022-02-20 21:48:34,348 INFO L854 garLoopResultBuilder]: At program point L11592(line 11592) the Hoare annotation is: (or (not (= ~ldv_mutex_lock~0 1)) (not (= 1 ~ldv_mutex_mutex_of_device~0))) [2022-02-20 21:48:34,349 INFO L858 garLoopResultBuilder]: For program point ldv_check_final_stateEXIT(lines 11583 11596) no Hoare annotation was computed. [2022-02-20 21:48:34,349 INFO L858 garLoopResultBuilder]: For program point L11592-1(lines 11583 11596) no Hoare annotation was computed. [2022-02-20 21:48:34,349 INFO L858 garLoopResultBuilder]: For program point L6782(line 6782) no Hoare annotation was computed. [2022-02-20 21:48:34,349 INFO L854 garLoopResultBuilder]: At program point L6803(lines 6759 6805) the Hoare annotation is: (= ~ldv_mutex_lock~0 1) [2022-02-20 21:48:34,349 INFO L854 garLoopResultBuilder]: At program point L6799(lines 6769 6804) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 1)) [2022-02-20 21:48:34,349 INFO L854 garLoopResultBuilder]: At program point L6795(lines 6769 6804) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 1)) [2022-02-20 21:48:34,349 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 21:48:34,350 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 21:48:34,350 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 21:48:34,350 INFO L858 garLoopResultBuilder]: For program point L6775(lines 6775 6794) no Hoare annotation was computed. [2022-02-20 21:48:34,350 INFO L861 garLoopResultBuilder]: At program point L6771(line 6771) the Hoare annotation is: true [2022-02-20 21:48:34,350 INFO L858 garLoopResultBuilder]: For program point L6792(line 6792) no Hoare annotation was computed. [2022-02-20 21:48:34,350 INFO L858 garLoopResultBuilder]: For program point L6788(line 6788) no Hoare annotation was computed. [2022-02-20 21:48:34,350 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 21:48:34,350 INFO L858 garLoopResultBuilder]: For program point L6784(line 6784) no Hoare annotation was computed. [2022-02-20 21:48:34,351 INFO L858 garLoopResultBuilder]: For program point L6780(line 6780) no Hoare annotation was computed. [2022-02-20 21:48:34,351 INFO L858 garLoopResultBuilder]: For program point L6776(line 6776) no Hoare annotation was computed. [2022-02-20 21:48:34,351 INFO L854 garLoopResultBuilder]: At program point L6789-1(line 6789) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 1)) [2022-02-20 21:48:34,351 INFO L854 garLoopResultBuilder]: At program point L6789(line 6789) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 1)) [2022-02-20 21:48:34,351 INFO L854 garLoopResultBuilder]: At program point L6785-1(line 6785) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 1)) [2022-02-20 21:48:34,351 INFO L854 garLoopResultBuilder]: At program point L6785(line 6785) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 1)) [2022-02-20 21:48:34,351 INFO L854 garLoopResultBuilder]: At program point L6781-1(line 6781) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 1)) [2022-02-20 21:48:34,352 INFO L854 garLoopResultBuilder]: At program point L6781(line 6781) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 1)) [2022-02-20 21:48:34,352 INFO L854 garLoopResultBuilder]: At program point L6777-1(line 6777) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 1)) [2022-02-20 21:48:34,352 INFO L854 garLoopResultBuilder]: At program point L6777(line 6777) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 1)) [2022-02-20 21:48:34,352 INFO L854 garLoopResultBuilder]: At program point L6802(line 6802) the Hoare annotation is: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 1)) [2022-02-20 21:48:34,352 INFO L858 garLoopResultBuilder]: For program point L6798(lines 6798 6801) no Hoare annotation was computed. [2022-02-20 21:48:34,352 INFO L858 garLoopResultBuilder]: For program point L6802-1(line 6802) no Hoare annotation was computed. [2022-02-20 21:48:34,352 INFO L858 garLoopResultBuilder]: For program point L6790(line 6790) no Hoare annotation was computed. [2022-02-20 21:48:34,353 INFO L854 garLoopResultBuilder]: At program point ldv_initializeENTRY(lines 11575 11582) the Hoare annotation is: (and (= |old(~ldv_mutex_mutex_of_device~0)| ~ldv_mutex_mutex_of_device~0) (= ~ldv_mutex_lock~0 |old(~ldv_mutex_lock~0)|)) [2022-02-20 21:48:34,353 INFO L858 garLoopResultBuilder]: For program point ldv_initializeFINAL(lines 11575 11582) no Hoare annotation was computed. [2022-02-20 21:48:34,353 INFO L858 garLoopResultBuilder]: For program point ldv_initializeEXIT(lines 11575 11582) no Hoare annotation was computed. [2022-02-20 21:48:34,353 INFO L858 garLoopResultBuilder]: For program point ___ratelimitEXIT(lines 11598 11600) no Hoare annotation was computed. [2022-02-20 21:48:34,353 INFO L861 garLoopResultBuilder]: At program point ___ratelimitENTRY(lines 11598 11600) the Hoare annotation is: true [2022-02-20 21:48:34,353 INFO L858 garLoopResultBuilder]: For program point ___ratelimitFINAL(lines 11598 11600) no Hoare annotation was computed. [2022-02-20 21:48:34,353 INFO L858 garLoopResultBuilder]: For program point L5983(lines 5983 5992) no Hoare annotation was computed. [2022-02-20 21:48:34,353 INFO L858 garLoopResultBuilder]: For program point L5985-2(lines 5985 5989) no Hoare annotation was computed. [2022-02-20 21:48:34,354 INFO L858 garLoopResultBuilder]: For program point L5985(lines 5985 5989) no Hoare annotation was computed. [2022-02-20 21:48:34,354 INFO L861 garLoopResultBuilder]: At program point L5981(lines 5981 5982) the Hoare annotation is: true [2022-02-20 21:48:34,354 INFO L858 garLoopResultBuilder]: For program point L5981-1(lines 5981 5982) no Hoare annotation was computed. [2022-02-20 21:48:34,354 INFO L861 garLoopResultBuilder]: At program point L5971(line 5971) the Hoare annotation is: true [2022-02-20 21:48:34,354 INFO L861 garLoopResultBuilder]: At program point bitmap_checkENTRY(lines 5957 5995) the Hoare annotation is: true [2022-02-20 21:48:34,354 INFO L858 garLoopResultBuilder]: For program point L5971-1(line 5971) no Hoare annotation was computed. [2022-02-20 21:48:34,354 INFO L861 garLoopResultBuilder]: At program point L5973(line 5973) the Hoare annotation is: true [2022-02-20 21:48:34,354 INFO L858 garLoopResultBuilder]: For program point L5973-1(line 5973) no Hoare annotation was computed. [2022-02-20 21:48:34,355 INFO L861 garLoopResultBuilder]: At program point L5967(line 5967) the Hoare annotation is: true [2022-02-20 21:48:34,355 INFO L858 garLoopResultBuilder]: For program point L5967-1(line 5967) no Hoare annotation was computed. [2022-02-20 21:48:34,355 INFO L861 garLoopResultBuilder]: At program point L5969(line 5969) the Hoare annotation is: true [2022-02-20 21:48:34,355 INFO L858 garLoopResultBuilder]: For program point L5969-1(line 5969) no Hoare annotation was computed. [2022-02-20 21:48:34,355 INFO L858 garLoopResultBuilder]: For program point L5984-1(line 5984) no Hoare annotation was computed. [2022-02-20 21:48:34,355 INFO L858 garLoopResultBuilder]: For program point bitmap_checkEXIT(lines 5957 5995) no Hoare annotation was computed. [2022-02-20 21:48:34,355 INFO L861 garLoopResultBuilder]: At program point L5984(line 5984) the Hoare annotation is: true [2022-02-20 21:48:34,355 INFO L858 garLoopResultBuilder]: For program point L5970(lines 5970 5980) no Hoare annotation was computed. [2022-02-20 21:48:34,356 INFO L858 garLoopResultBuilder]: For program point L5972-2(lines 5972 5977) no Hoare annotation was computed. [2022-02-20 21:48:34,356 INFO L858 garLoopResultBuilder]: For program point L5972(lines 5972 5977) no Hoare annotation was computed. [2022-02-20 21:48:34,356 INFO L858 garLoopResultBuilder]: For program point bitmap_checkFINAL(lines 5957 5995) no Hoare annotation was computed. [2022-02-20 21:48:34,358 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 21:48:34,359 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 21:48:34,362 WARN L170 areAnnotationChecker]: dm_bufio_get_block_numberFINAL has no Hoare annotation [2022-02-20 21:48:34,362 WARN L170 areAnnotationChecker]: ldv_handler_precallEXIT has no Hoare annotation [2022-02-20 21:48:34,362 WARN L170 areAnnotationChecker]: L4861 has no Hoare annotation [2022-02-20 21:48:34,362 WARN L170 areAnnotationChecker]: ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-02-20 21:48:34,363 WARN L170 areAnnotationChecker]: ldv_errorFINAL has no Hoare annotation [2022-02-20 21:48:34,363 WARN L170 areAnnotationChecker]: to_bufferFINAL has no Hoare annotation [2022-02-20 21:48:34,363 WARN L170 areAnnotationChecker]: L11588-1 has no Hoare annotation [2022-02-20 21:48:34,364 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 21:48:34,365 WARN L170 areAnnotationChecker]: ldv_initializeFINAL has no Hoare annotation [2022-02-20 21:48:34,365 WARN L170 areAnnotationChecker]: ___ratelimitFINAL has no Hoare annotation [2022-02-20 21:48:34,365 WARN L170 areAnnotationChecker]: L5913-1 has no Hoare annotation [2022-02-20 21:48:34,365 WARN L170 areAnnotationChecker]: dm_bufio_get_block_numberFINAL has no Hoare annotation [2022-02-20 21:48:34,365 WARN L170 areAnnotationChecker]: L5371-1 has no Hoare annotation [2022-02-20 21:48:34,365 WARN L170 areAnnotationChecker]: dm_bm_checksumFINAL has no Hoare annotation [2022-02-20 21:48:34,365 WARN L170 areAnnotationChecker]: L5895-1 has no Hoare annotation [2022-02-20 21:48:34,365 WARN L170 areAnnotationChecker]: ldv_handler_precallEXIT has no Hoare annotation [2022-02-20 21:48:34,365 WARN L170 areAnnotationChecker]: ldv_handler_precallEXIT has no Hoare annotation [2022-02-20 21:48:34,365 WARN L170 areAnnotationChecker]: ldv_handler_precallEXIT has no Hoare annotation [2022-02-20 21:48:34,366 WARN L170 areAnnotationChecker]: ldv_handler_precallEXIT has no Hoare annotation [2022-02-20 21:48:34,366 WARN L170 areAnnotationChecker]: L5949-1 has no Hoare annotation [2022-02-20 21:48:34,366 WARN L170 areAnnotationChecker]: L4861 has no Hoare annotation [2022-02-20 21:48:34,366 WARN L170 areAnnotationChecker]: L4861 has no Hoare annotation [2022-02-20 21:48:34,366 WARN L170 areAnnotationChecker]: L5361-1 has no Hoare annotation [2022-02-20 21:48:34,366 WARN L170 areAnnotationChecker]: ldv_errorFINAL has no Hoare annotation [2022-02-20 21:48:34,366 WARN L170 areAnnotationChecker]: to_bufferFINAL has no Hoare annotation [2022-02-20 21:48:34,366 WARN L170 areAnnotationChecker]: L11588-1 has no Hoare annotation [2022-02-20 21:48:34,366 WARN L170 areAnnotationChecker]: L11588-1 has no Hoare annotation [2022-02-20 21:48:34,367 WARN L170 areAnnotationChecker]: L11588-1 has no Hoare annotation [2022-02-20 21:48:34,367 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 21:48:34,367 WARN L170 areAnnotationChecker]: ldv_initializeFINAL has no Hoare annotation [2022-02-20 21:48:34,367 WARN L170 areAnnotationChecker]: ___ratelimitFINAL has no Hoare annotation [2022-02-20 21:48:34,367 WARN L170 areAnnotationChecker]: L5967-1 has no Hoare annotation [2022-02-20 21:48:34,367 WARN L170 areAnnotationChecker]: L5913-1 has no Hoare annotation [2022-02-20 21:48:34,367 WARN L170 areAnnotationChecker]: dm_bufio_get_block_numberEXIT has no Hoare annotation [2022-02-20 21:48:34,367 WARN L170 areAnnotationChecker]: L5371-1 has no Hoare annotation [2022-02-20 21:48:34,367 WARN L170 areAnnotationChecker]: dm_bm_checksumFINAL has no Hoare annotation [2022-02-20 21:48:34,367 WARN L170 areAnnotationChecker]: L5895-1 has no Hoare annotation [2022-02-20 21:48:34,368 WARN L170 areAnnotationChecker]: L6782 has no Hoare annotation [2022-02-20 21:48:34,368 WARN L170 areAnnotationChecker]: L6790 has no Hoare annotation [2022-02-20 21:48:34,368 WARN L170 areAnnotationChecker]: L5949-1 has no Hoare annotation [2022-02-20 21:48:34,368 WARN L170 areAnnotationChecker]: L4852 has no Hoare annotation [2022-02-20 21:48:34,368 WARN L170 areAnnotationChecker]: ldv_mallocFINAL has no Hoare annotation [2022-02-20 21:48:34,368 WARN L170 areAnnotationChecker]: L5361-1 has no Hoare annotation [2022-02-20 21:48:34,368 WARN L170 areAnnotationChecker]: ldv_errorEXIT has no Hoare annotation [2022-02-20 21:48:34,368 WARN L170 areAnnotationChecker]: ldv_errorEXIT has no Hoare annotation [2022-02-20 21:48:34,368 WARN L170 areAnnotationChecker]: to_bufferEXIT has no Hoare annotation [2022-02-20 21:48:34,368 WARN L170 areAnnotationChecker]: to_bufferEXIT has no Hoare annotation [2022-02-20 21:48:34,369 WARN L170 areAnnotationChecker]: L11592-1 has no Hoare annotation [2022-02-20 21:48:34,369 WARN L170 areAnnotationChecker]: L11592-1 has no Hoare annotation [2022-02-20 21:48:34,370 WARN L170 areAnnotationChecker]: ldv_initializeEXIT has no Hoare annotation [2022-02-20 21:48:34,370 WARN L170 areAnnotationChecker]: ___ratelimitEXIT has no Hoare annotation [2022-02-20 21:48:34,370 WARN L170 areAnnotationChecker]: ___ratelimitEXIT has no Hoare annotation [2022-02-20 21:48:34,370 WARN L170 areAnnotationChecker]: ___ratelimitEXIT has no Hoare annotation [2022-02-20 21:48:34,370 WARN L170 areAnnotationChecker]: ___ratelimitEXIT has no Hoare annotation [2022-02-20 21:48:34,370 WARN L170 areAnnotationChecker]: L5967-1 has no Hoare annotation [2022-02-20 21:48:34,370 WARN L170 areAnnotationChecker]: L5915-1 has no Hoare annotation [2022-02-20 21:48:34,370 WARN L170 areAnnotationChecker]: L5362-1 has no Hoare annotation [2022-02-20 21:48:34,370 WARN L170 areAnnotationChecker]: L11633-1 has no Hoare annotation [2022-02-20 21:48:34,371 WARN L170 areAnnotationChecker]: dm_bm_checksumEXIT has no Hoare annotation [2022-02-20 21:48:34,371 WARN L170 areAnnotationChecker]: dm_bm_checksumEXIT has no Hoare annotation [2022-02-20 21:48:34,371 WARN L170 areAnnotationChecker]: dm_bm_checksumEXIT has no Hoare annotation [2022-02-20 21:48:34,371 WARN L170 areAnnotationChecker]: dm_bm_checksumEXIT has no Hoare annotation [2022-02-20 21:48:34,371 WARN L170 areAnnotationChecker]: L5897-1 has no Hoare annotation [2022-02-20 21:48:34,371 WARN L170 areAnnotationChecker]: L6798 has no Hoare annotation [2022-02-20 21:48:34,371 WARN L170 areAnnotationChecker]: L6782 has no Hoare annotation [2022-02-20 21:48:34,371 WARN L170 areAnnotationChecker]: L6790 has no Hoare annotation [2022-02-20 21:48:34,371 WARN L170 areAnnotationChecker]: L5951-1 has no Hoare annotation [2022-02-20 21:48:34,371 WARN L170 areAnnotationChecker]: L4852 has no Hoare annotation [2022-02-20 21:48:34,372 WARN L170 areAnnotationChecker]: L4852 has no Hoare annotation [2022-02-20 21:48:34,372 WARN L170 areAnnotationChecker]: ldv_mallocEXIT has no Hoare annotation [2022-02-20 21:48:34,372 WARN L170 areAnnotationChecker]: L5362-1 has no Hoare annotation [2022-02-20 21:48:34,372 WARN L170 areAnnotationChecker]: ldv_check_final_stateEXIT has no Hoare annotation [2022-02-20 21:48:34,372 WARN L170 areAnnotationChecker]: L5917-1 has no Hoare annotation [2022-02-20 21:48:34,372 WARN L170 areAnnotationChecker]: L5930-1 has no Hoare annotation [2022-02-20 21:48:34,372 WARN L170 areAnnotationChecker]: L5971-1 has no Hoare annotation [2022-02-20 21:48:34,372 WARN L170 areAnnotationChecker]: L5984-1 has no Hoare annotation [2022-02-20 21:48:34,372 WARN L170 areAnnotationChecker]: L5969-1 has no Hoare annotation [2022-02-20 21:48:34,372 WARN L170 areAnnotationChecker]: L5915-1 has no Hoare annotation [2022-02-20 21:48:34,372 WARN L170 areAnnotationChecker]: dm_block_locationFINAL has no Hoare annotation [2022-02-20 21:48:34,373 WARN L170 areAnnotationChecker]: L11633-1 has no Hoare annotation [2022-02-20 21:48:34,373 WARN L170 areAnnotationChecker]: L5927-1 has no Hoare annotation [2022-02-20 21:48:34,373 WARN L170 areAnnotationChecker]: L5898-1 has no Hoare annotation [2022-02-20 21:48:34,373 WARN L170 areAnnotationChecker]: L5952-1 has no Hoare annotation [2022-02-20 21:48:34,373 WARN L170 areAnnotationChecker]: L5981-1 has no Hoare annotation [2022-02-20 21:48:34,373 WARN L170 areAnnotationChecker]: L5897-1 has no Hoare annotation [2022-02-20 21:48:34,373 WARN L170 areAnnotationChecker]: L6798 has no Hoare annotation [2022-02-20 21:48:34,373 WARN L170 areAnnotationChecker]: L6798 has no Hoare annotation [2022-02-20 21:48:34,373 WARN L170 areAnnotationChecker]: L5951-1 has no Hoare annotation [2022-02-20 21:48:34,373 WARN L170 areAnnotationChecker]: L4851 has no Hoare annotation [2022-02-20 21:48:34,374 WARN L170 areAnnotationChecker]: L6802-1 has no Hoare annotation [2022-02-20 21:48:34,374 WARN L170 areAnnotationChecker]: L5918 has no Hoare annotation [2022-02-20 21:48:34,374 WARN L170 areAnnotationChecker]: L5918 has no Hoare annotation [2022-02-20 21:48:34,374 WARN L170 areAnnotationChecker]: L5931 has no Hoare annotation [2022-02-20 21:48:34,374 WARN L170 areAnnotationChecker]: L5931 has no Hoare annotation [2022-02-20 21:48:34,374 WARN L170 areAnnotationChecker]: L5972 has no Hoare annotation [2022-02-20 21:48:34,374 WARN L170 areAnnotationChecker]: L5972 has no Hoare annotation [2022-02-20 21:48:34,374 WARN L170 areAnnotationChecker]: L5985 has no Hoare annotation [2022-02-20 21:48:34,374 WARN L170 areAnnotationChecker]: L5985 has no Hoare annotation [2022-02-20 21:48:34,374 WARN L170 areAnnotationChecker]: L5969-1 has no Hoare annotation [2022-02-20 21:48:34,374 WARN L170 areAnnotationChecker]: L5916 has no Hoare annotation [2022-02-20 21:48:34,375 WARN L170 areAnnotationChecker]: L5916 has no Hoare annotation [2022-02-20 21:48:34,375 WARN L170 areAnnotationChecker]: dm_block_locationEXIT has no Hoare annotation [2022-02-20 21:48:34,375 WARN L170 areAnnotationChecker]: dm_block_locationEXIT has no Hoare annotation [2022-02-20 21:48:34,375 WARN L170 areAnnotationChecker]: dm_block_locationEXIT has no Hoare annotation [2022-02-20 21:48:34,375 WARN L170 areAnnotationChecker]: dm_block_locationEXIT has no Hoare annotation [2022-02-20 21:48:34,375 WARN L170 areAnnotationChecker]: dm_block_locationEXIT has no Hoare annotation [2022-02-20 21:48:34,375 WARN L170 areAnnotationChecker]: dm_block_locationEXIT has no Hoare annotation [2022-02-20 21:48:34,375 WARN L170 areAnnotationChecker]: dm_block_dataFINAL has no Hoare annotation [2022-02-20 21:48:34,375 WARN L170 areAnnotationChecker]: L5929 has no Hoare annotation [2022-02-20 21:48:34,375 WARN L170 areAnnotationChecker]: L5929 has no Hoare annotation [2022-02-20 21:48:34,376 WARN L170 areAnnotationChecker]: index_prepare_for_writeFINAL has no Hoare annotation [2022-02-20 21:48:34,376 WARN L170 areAnnotationChecker]: bitmap_prepare_for_writeFINAL has no Hoare annotation [2022-02-20 21:48:34,376 WARN L170 areAnnotationChecker]: L5983 has no Hoare annotation [2022-02-20 21:48:34,376 WARN L170 areAnnotationChecker]: L5983 has no Hoare annotation [2022-02-20 21:48:34,376 WARN L170 areAnnotationChecker]: L5898-1 has no Hoare annotation [2022-02-20 21:48:34,376 WARN L170 areAnnotationChecker]: L6776 has no Hoare annotation [2022-02-20 21:48:34,376 WARN L170 areAnnotationChecker]: L6802-1 has no Hoare annotation [2022-02-20 21:48:34,376 WARN L170 areAnnotationChecker]: L5952-1 has no Hoare annotation [2022-02-20 21:48:34,376 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 21:48:34,376 WARN L170 areAnnotationChecker]: L5919-1 has no Hoare annotation [2022-02-20 21:48:34,377 WARN L170 areAnnotationChecker]: L5918-2 has no Hoare annotation [2022-02-20 21:48:34,377 WARN L170 areAnnotationChecker]: L5931-2 has no Hoare annotation [2022-02-20 21:48:34,377 WARN L170 areAnnotationChecker]: L5973-1 has no Hoare annotation [2022-02-20 21:48:34,377 WARN L170 areAnnotationChecker]: L5972-2 has no Hoare annotation [2022-02-20 21:48:34,377 WARN L170 areAnnotationChecker]: L5985-2 has no Hoare annotation [2022-02-20 21:48:34,377 WARN L170 areAnnotationChecker]: L5970 has no Hoare annotation [2022-02-20 21:48:34,377 WARN L170 areAnnotationChecker]: L5970 has no Hoare annotation [2022-02-20 21:48:34,377 WARN L170 areAnnotationChecker]: L5917-1 has no Hoare annotation [2022-02-20 21:48:34,377 WARN L170 areAnnotationChecker]: L5927-1 has no Hoare annotation [2022-02-20 21:48:34,377 WARN L170 areAnnotationChecker]: L5919-1 has no Hoare annotation [2022-02-20 21:48:34,378 WARN L170 areAnnotationChecker]: L5973-1 has no Hoare annotation [2022-02-20 21:48:34,378 WARN L170 areAnnotationChecker]: dm_block_dataFINAL has no Hoare annotation [2022-02-20 21:48:34,378 WARN L170 areAnnotationChecker]: L5930-1 has no Hoare annotation [2022-02-20 21:48:34,378 WARN L170 areAnnotationChecker]: index_checkFINAL has no Hoare annotation [2022-02-20 21:48:34,378 WARN L170 areAnnotationChecker]: index_prepare_for_writeEXIT has no Hoare annotation [2022-02-20 21:48:34,378 WARN L170 areAnnotationChecker]: bitmap_prepare_for_writeEXIT has no Hoare annotation [2022-02-20 21:48:34,378 WARN L170 areAnnotationChecker]: L5984-1 has no Hoare annotation [2022-02-20 21:48:34,378 WARN L170 areAnnotationChecker]: bitmap_checkFINAL has no Hoare annotation [2022-02-20 21:48:34,378 WARN L170 areAnnotationChecker]: L6776 has no Hoare annotation [2022-02-20 21:48:34,378 WARN L170 areAnnotationChecker]: L6776 has no Hoare annotation [2022-02-20 21:48:34,379 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 21:48:34,379 WARN L170 areAnnotationChecker]: L5971-1 has no Hoare annotation [2022-02-20 21:48:34,379 WARN L170 areAnnotationChecker]: L5981-1 has no Hoare annotation [2022-02-20 21:48:34,379 WARN L170 areAnnotationChecker]: dm_block_dataEXIT has no Hoare annotation [2022-02-20 21:48:34,379 WARN L170 areAnnotationChecker]: dm_block_dataEXIT has no Hoare annotation [2022-02-20 21:48:34,379 WARN L170 areAnnotationChecker]: dm_block_dataEXIT has no Hoare annotation [2022-02-20 21:48:34,379 WARN L170 areAnnotationChecker]: dm_block_dataEXIT has no Hoare annotation [2022-02-20 21:48:34,379 WARN L170 areAnnotationChecker]: index_checkEXIT has no Hoare annotation [2022-02-20 21:48:34,379 WARN L170 areAnnotationChecker]: bitmap_checkEXIT has no Hoare annotation [2022-02-20 21:48:34,379 WARN L170 areAnnotationChecker]: L6780 has no Hoare annotation [2022-02-20 21:48:34,380 WARN L170 areAnnotationChecker]: L6780 has no Hoare annotation [2022-02-20 21:48:34,380 WARN L170 areAnnotationChecker]: L6784 has no Hoare annotation [2022-02-20 21:48:34,380 WARN L170 areAnnotationChecker]: L6784 has no Hoare annotation [2022-02-20 21:48:34,380 WARN L170 areAnnotationChecker]: L6788 has no Hoare annotation [2022-02-20 21:48:34,380 WARN L170 areAnnotationChecker]: L6788 has no Hoare annotation [2022-02-20 21:48:34,380 WARN L170 areAnnotationChecker]: L6792 has no Hoare annotation [2022-02-20 21:48:34,380 WARN L170 areAnnotationChecker]: L6792 has no Hoare annotation [2022-02-20 21:48:34,380 WARN L170 areAnnotationChecker]: L6775 has no Hoare annotation [2022-02-20 21:48:34,380 INFO L163 areAnnotationChecker]: CFG has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 21:48:34,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 09:48:34 BoogieIcfgContainer [2022-02-20 21:48:34,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 21:48:34,388 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 21:48:34,388 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 21:48:34,389 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 21:48:34,389 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 09:48:31" (3/4) ... [2022-02-20 21:48:34,391 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 21:48:34,394 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure index_check [2022-02-20 21:48:34,395 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dm_bufio_get_block_number [2022-02-20 21:48:34,395 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dm_block_data [2022-02-20 21:48:34,395 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dm_bm_checksum [2022-02-20 21:48:34,395 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure index_prepare_for_write [2022-02-20 21:48:34,395 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2022-02-20 21:48:34,395 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bitmap_prepare_for_write [2022-02-20 21:48:34,395 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-02-20 21:48:34,395 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dm_block_location [2022-02-20 21:48:34,395 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-02-20 21:48:34,396 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure to_buffer [2022-02-20 21:48:34,396 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2022-02-20 21:48:34,396 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_initialize [2022-02-20 21:48:34,396 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ___ratelimit [2022-02-20 21:48:34,396 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bitmap_check [2022-02-20 21:48:34,402 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 81 nodes and edges [2022-02-20 21:48:34,403 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2022-02-20 21:48:34,403 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 21:48:34,404 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 21:48:34,404 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-02-20 21:48:34,404 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 21:48:34,405 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 21:48:34,447 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 21:48:34,447 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 21:48:34,448 INFO L158 Benchmark]: Toolchain (without parser) took 5886.62ms. Allocated memory was 117.4MB in the beginning and 274.7MB in the end (delta: 157.3MB). Free memory was 68.3MB in the beginning and 126.7MB in the end (delta: -58.4MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. [2022-02-20 21:48:34,448 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 88.9MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 21:48:34,448 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2336.83ms. Allocated memory was 117.4MB in the beginning and 224.4MB in the end (delta: 107.0MB). Free memory was 68.1MB in the beginning and 140.2MB in the end (delta: -72.2MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. [2022-02-20 21:48:34,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 156.43ms. Allocated memory is still 224.4MB. Free memory was 140.2MB in the beginning and 129.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 21:48:34,449 INFO L158 Benchmark]: Boogie Preprocessor took 61.01ms. Allocated memory is still 224.4MB. Free memory was 129.7MB in the beginning and 124.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 21:48:34,449 INFO L158 Benchmark]: RCFGBuilder took 620.55ms. Allocated memory is still 224.4MB. Free memory was 124.5MB in the beginning and 143.8MB in the end (delta: -19.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-02-20 21:48:34,449 INFO L158 Benchmark]: TraceAbstraction took 2647.27ms. Allocated memory was 224.4MB in the beginning and 274.7MB in the end (delta: 50.3MB). Free memory was 142.8MB in the beginning and 135.1MB in the end (delta: 7.7MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. [2022-02-20 21:48:34,449 INFO L158 Benchmark]: Witness Printer took 58.76ms. Allocated memory is still 274.7MB. Free memory was 135.1MB in the beginning and 126.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 21:48:34,451 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 88.9MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2336.83ms. Allocated memory was 117.4MB in the beginning and 224.4MB in the end (delta: 107.0MB). Free memory was 68.1MB in the beginning and 140.2MB in the end (delta: -72.2MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 156.43ms. Allocated memory is still 224.4MB. Free memory was 140.2MB in the beginning and 129.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.01ms. Allocated memory is still 224.4MB. Free memory was 129.7MB in the beginning and 124.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 620.55ms. Allocated memory is still 224.4MB. Free memory was 124.5MB in the beginning and 143.8MB in the end (delta: -19.3MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2647.27ms. Allocated memory was 224.4MB in the beginning and 274.7MB in the end (delta: 50.3MB). Free memory was 142.8MB in the beginning and 135.1MB in the end (delta: 7.7MB). Peak memory consumption was 59.1MB. Max. memory is 16.1GB. * Witness Printer took 58.76ms. Allocated memory is still 274.7MB. Free memory was 135.1MB in the beginning and 126.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 11351]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 137 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 365 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 348 mSDsluCounter, 303 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 196 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 90 IncrementalHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 196 mSolverCounterUnsat, 258 mSDtfsCounter, 90 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 55 LocationsWithAnnotation, 177 PreInvPairs, 207 NumberOfFragments, 145 HoareAnnotationTreeSize, 177 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 55 FomulaSimplificationsInter, 570 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 23 ConstructedInterpolants, 0 QuantifiedInterpolants, 61 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6769]: Loop Invariant Derived loop invariant: 1 == ldv_mutex_mutex_of_device && ldv_mutex_lock == 1 - InvariantResult [Line: 6769]: Loop Invariant Derived loop invariant: 1 == ldv_mutex_mutex_of_device && ldv_mutex_lock == 1 - InvariantResult [Line: 4855]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11632]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11617]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6759]: Loop Invariant Derived loop invariant: ldv_mutex_lock == 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 21:48:34,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE