./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--mtd--maps--l440gx.ko-entry_point.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--mtd--maps--l440gx.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 00e024fc1f0b82ae7f67f2e1fbd5ae99cfcf89e3f63aef822e2243882f82daf0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:09:31,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:09:31,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:09:31,984 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:09:31,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:09:31,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:09:31,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:09:31,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:09:31,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:09:31,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:09:31,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:09:31,996 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:09:31,996 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:09:32,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:09:32,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:09:32,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:09:32,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:09:32,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:09:32,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:09:32,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:09:32,013 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:09:32,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:09:32,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:09:32,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:09:32,017 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:09:32,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:09:32,018 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:09:32,019 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:09:32,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:09:32,020 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:09:32,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:09:32,022 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:09:32,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:09:32,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:09:32,024 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:09:32,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:09:32,026 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:09:32,026 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:09:32,026 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:09:32,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:09:32,027 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:09:32,028 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 22:09:32,049 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:09:32,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:09:32,050 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:09:32,050 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:09:32,051 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:09:32,051 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:09:32,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:09:32,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:09:32,052 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:09:32,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:09:32,052 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:09:32,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:09:32,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:09:32,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:09:32,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:09:32,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:09:32,053 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:09:32,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:09:32,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:09:32,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:09:32,054 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:09:32,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:09:32,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:09:32,054 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:09:32,055 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:09:32,055 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:09:32,055 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:09:32,055 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:09:32,055 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:09:32,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:09:32,056 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 -> 00e024fc1f0b82ae7f67f2e1fbd5ae99cfcf89e3f63aef822e2243882f82daf0 [2022-02-20 22:09:32,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:09:32,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:09:32,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:09:32,269 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:09:32,270 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:09:32,271 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--mtd--maps--l440gx.ko-entry_point.cil.out.i [2022-02-20 22:09:32,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/787c08a30/9003d69c33b1463d92d4cfb0b0aa55c5/FLAGa43694874 [2022-02-20 22:09:32,820 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:09:32,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--mtd--maps--l440gx.ko-entry_point.cil.out.i [2022-02-20 22:09:32,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/787c08a30/9003d69c33b1463d92d4cfb0b0aa55c5/FLAGa43694874 [2022-02-20 22:09:33,354 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/787c08a30/9003d69c33b1463d92d4cfb0b0aa55c5 [2022-02-20 22:09:33,355 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:09:33,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:09:33,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:09:33,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:09:33,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:09:33,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:09:33" (1/1) ... [2022-02-20 22:09:33,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb33909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:09:33, skipping insertion in model container [2022-02-20 22:09:33,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:09:33" (1/1) ... [2022-02-20 22:09:33,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:09:33,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:09:33,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--mtd--maps--l440gx.ko-entry_point.cil.out.i[87203,87216] [2022-02-20 22:09:33,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:09:33,884 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:09:33,973 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: de.uni_freiburg.informatik.ultimate.boogie.typechecker.TypeCheckException: Type check failed for C: iobase = iobase & 4294967294U [2976] at de.uni_freiburg.informatik.ultimate.boogie.TypeErrorReporter.report(TypeErrorReporter.java:52) at de.uni_freiburg.informatik.ultimate.boogie.typechecker.TypeCheckHelper.typeCheckBinaryExpression(TypeCheckHelper.java:207) at de.uni_freiburg.informatik.ultimate.boogie.ExpressionFactory.constructBinaryExpression(ExpressionFactory.java:597) at de.uni_freiburg.informatik.ultimate.boogie.ExpressionFactory.newBinaryExpression(ExpressionFactory.java:132) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.BitabsTranslation.abstractAssign(BitabsTranslation.java:483) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.abstractAssginWithBitwiseOp(IntegerTranslation.java:973) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:737) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1392) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:326) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1076) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:334) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1622) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:332) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1076) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:334) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1076) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:334) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1465) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:289) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3271) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2356) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:270) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:244) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:206) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 22:09:33,979 INFO L158 Benchmark]: Toolchain (without parser) took 621.84ms. Allocated memory is still 111.1MB. Free memory was 76.3MB in the beginning and 44.4MB in the end (delta: 31.9MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-02-20 22:09:33,980 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 111.1MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 22:09:33,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.83ms. Allocated memory is still 111.1MB. Free memory was 76.1MB in the beginning and 44.4MB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-02-20 22:09:33,982 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 111.1MB. Free memory is still 66.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.83ms. Allocated memory is still 111.1MB. Free memory was 76.1MB in the beginning and 44.4MB in the end (delta: 31.7MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: TypeCheckException: Type check failed for C: iobase = iobase & 4294967294U [2976] de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: TypeCheckException: Type check failed for C: iobase = iobase & 4294967294U [2976]: de.uni_freiburg.informatik.ultimate.boogie.TypeErrorReporter.report(TypeErrorReporter.java:52) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--mtd--maps--l440gx.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 00e024fc1f0b82ae7f67f2e1fbd5ae99cfcf89e3f63aef822e2243882f82daf0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:09:35,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:09:35,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:09:35,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:09:35,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:09:35,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:09:35,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:09:35,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:09:35,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:09:35,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:09:35,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:09:35,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:09:35,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:09:35,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:09:35,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:09:35,485 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:09:35,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:09:35,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:09:35,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:09:35,492 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:09:35,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:09:35,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:09:35,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:09:35,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:09:35,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:09:35,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:09:35,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:09:35,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:09:35,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:09:35,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:09:35,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:09:35,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:09:35,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:09:35,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:09:35,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:09:35,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:09:35,506 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:09:35,506 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:09:35,506 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:09:35,507 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:09:35,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:09:35,509 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-02-20 22:09:35,546 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:09:35,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:09:35,547 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:09:35,547 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:09:35,548 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:09:35,548 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:09:35,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:09:35,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:09:35,550 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:09:35,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:09:35,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:09:35,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:09:35,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:09:35,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:09:35,551 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 22:09:35,551 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 22:09:35,551 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 22:09:35,552 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:09:35,552 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:09:35,552 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:09:35,552 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:09:35,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:09:35,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:09:35,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:09:35,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:09:35,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:09:35,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:09:35,553 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 22:09:35,553 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 22:09:35,553 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:09:35,553 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:09:35,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:09:35,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 22:09:35,554 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 00e024fc1f0b82ae7f67f2e1fbd5ae99cfcf89e3f63aef822e2243882f82daf0 [2022-02-20 22:09:35,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:09:35,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:09:35,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:09:35,801 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:09:35,802 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:09:35,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--mtd--maps--l440gx.ko-entry_point.cil.out.i [2022-02-20 22:09:35,857 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8792862/1370ee25a3b241a8b2fcbd5f2a57fea4/FLAGb18f62584 [2022-02-20 22:09:36,379 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:09:36,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--mtd--maps--l440gx.ko-entry_point.cil.out.i [2022-02-20 22:09:36,396 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8792862/1370ee25a3b241a8b2fcbd5f2a57fea4/FLAGb18f62584 [2022-02-20 22:09:36,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8792862/1370ee25a3b241a8b2fcbd5f2a57fea4 [2022-02-20 22:09:36,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:09:36,888 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:09:36,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:09:36,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:09:36,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:09:36,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:09:36" (1/1) ... [2022-02-20 22:09:36,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29707340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:09:36, skipping insertion in model container [2022-02-20 22:09:36,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:09:36" (1/1) ... [2022-02-20 22:09:36,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:09:36,955 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:09:37,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--mtd--maps--l440gx.ko-entry_point.cil.out.i[87203,87216] [2022-02-20 22:09:37,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:09:37,424 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:09:37,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--mtd--maps--l440gx.ko-entry_point.cil.out.i[87203,87216] [2022-02-20 22:09:37,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:09:37,557 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:09:37,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:09:37 WrapperNode [2022-02-20 22:09:37,558 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:09:37,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:09:37,559 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:09:37,559 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:09:37,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:09:37" (1/1) ... [2022-02-20 22:09:37,594 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:09:37" (1/1) ... [2022-02-20 22:09:37,641 INFO L137 Inliner]: procedures = 85, calls = 159, calls flagged for inlining = 31, calls inlined = 27, statements flattened = 414 [2022-02-20 22:09:37,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:09:37,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:09:37,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:09:37,648 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:09:37,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:09:37" (1/1) ... [2022-02-20 22:09:37,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:09:37" (1/1) ... [2022-02-20 22:09:37,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:09:37" (1/1) ... [2022-02-20 22:09:37,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:09:37" (1/1) ... [2022-02-20 22:09:37,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:09:37" (1/1) ... [2022-02-20 22:09:37,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:09:37" (1/1) ... [2022-02-20 22:09:37,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:09:37" (1/1) ... [2022-02-20 22:09:37,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:09:37,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:09:37,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:09:37,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:09:37,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:09:37" (1/1) ... [2022-02-20 22:09:37,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:09:37,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:09:37,748 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 22:09:37,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 22:09:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:09:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:09:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:09:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-02-20 22:09:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 22:09:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-02-20 22:09:37,783 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:09:37,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:09:37,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:09:37,783 INFO L130 BoogieDeclarations]: Found specification of procedure do_map_probe [2022-02-20 22:09:37,783 INFO L138 BoogieDeclarations]: Found implementation of procedure do_map_probe [2022-02-20 22:09:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:09:37,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:09:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure pci_get_device [2022-02-20 22:09:37,784 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_get_device [2022-02-20 22:09:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-02-20 22:09:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-02-20 22:09:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 22:09:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:09:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2022-02-20 22:09:37,785 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2022-02-20 22:09:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:09:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 22:09:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-02-20 22:09:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-02-20 22:09:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:09:37,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:09:37,785 INFO L130 BoogieDeclarations]: Found specification of procedure inl [2022-02-20 22:09:37,785 INFO L138 BoogieDeclarations]: Found implementation of procedure inl [2022-02-20 22:09:37,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:09:37,786 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:09:37,786 INFO L130 BoogieDeclarations]: Found specification of procedure outl [2022-02-20 22:09:37,786 INFO L138 BoogieDeclarations]: Found implementation of procedure outl [2022-02-20 22:09:37,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:09:37,786 INFO L130 BoogieDeclarations]: Found specification of procedure pci_dev_put [2022-02-20 22:09:37,787 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_dev_put [2022-02-20 22:09:37,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:09:37,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:09:38,022 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:09:38,024 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:09:38,062 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:09:39,647 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:09:39,653 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:09:39,653 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:09:39,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:09:39 BoogieIcfgContainer [2022-02-20 22:09:39,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:09:39,656 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:09:39,656 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:09:39,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:09:39,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:09:36" (1/3) ... [2022-02-20 22:09:39,658 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b84c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:09:39, skipping insertion in model container [2022-02-20 22:09:39,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:09:37" (2/3) ... [2022-02-20 22:09:39,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b84c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:09:39, skipping insertion in model container [2022-02-20 22:09:39,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:09:39" (3/3) ... [2022-02-20 22:09:39,660 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--mtd--maps--l440gx.ko-entry_point.cil.out.i [2022-02-20 22:09:39,663 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:09:39,663 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:09:39,695 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:09:39,701 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 22:09:39,702 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:09:39,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 99 states have internal predecessors, (118), 24 states have call successors, (24), 10 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-02-20 22:09:39,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 22:09:39,726 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:09:39,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:09:39,727 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:09:39,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:09:39,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1680540981, now seen corresponding path program 1 times [2022-02-20 22:09:39,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 22:09:39,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153708713] [2022-02-20 22:09:39,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:09:39,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 22:09:39,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 22:09:39,749 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 22:09:39,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 22:09:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:09:39,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 22:09:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:09:39,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 22:09:40,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {133#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(79bv64, 2bv64);call #Ultimate.allocInit(16bv64, 3bv64);call #Ultimate.allocInit(12bv64, 4bv64);call #Ultimate.allocInit(73bv64, 5bv64);call #Ultimate.allocInit(40bv64, 6bv64);call #Ultimate.allocInit(24bv64, 7bv64);call #Ultimate.allocInit(10bv64, 8bv64);call #Ultimate.allocInit(40bv64, 9bv64);call #Ultimate.allocInit(45bv64, 10bv64);call #Ultimate.allocInit(12bv64, 11bv64);call #Ultimate.allocInit(45bv64, 12bv64);call #Ultimate.allocInit(8bv64, 13bv64);~LDV_IN_INTERRUPT~0 := 1bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 0bv32;~#iobase~0.base, ~#iobase~0.offset := 14bv64, 0bv64;call #Ultimate.allocInit(4bv64, 14bv64);call write~init~intINTTYPE4(0bv32, ~#iobase~0.base, ~#iobase~0.offset, 4bv64);~mymtd~0.base, ~mymtd~0.offset := 0bv64, 0bv64;~#l440gx_vpp_lock~0.base, ~#l440gx_vpp_lock~0.offset := 15bv64, 0bv64;call #Ultimate.allocInit(68bv64, 15bv64);call write~init~intINTTYPE4(0bv32, ~#l440gx_vpp_lock~0.base, ~#l440gx_vpp_lock~0.offset, 4bv64);call write~init~intINTTYPE4(3735899821bv32, ~#l440gx_vpp_lock~0.base, ~bvadd64(4bv64, ~#l440gx_vpp_lock~0.offset), 4bv64);call write~init~intINTTYPE4(4294967295bv32, ~#l440gx_vpp_lock~0.base, ~bvadd64(8bv64, ~#l440gx_vpp_lock~0.offset), 4bv64);call write~init~$Pointer$(0bv64, 18446744073709551615bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(12bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(20bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(28bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(36bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);call write~init~$Pointer$(3bv64, 0bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(44bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);call write~init~intINTTYPE4(0bv32, ~#l440gx_vpp_lock~0.base, ~bvadd64(52bv64, ~#l440gx_vpp_lock~0.offset), 4bv64);call write~init~intINTTYPE8(0bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(56bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);~l440gx_vpp_refcnt~0 := 0bv32;~#l440gx_map~0.base, ~#l440gx_map~0.offset := 16bv64, 0bv64;call #Ultimate.allocInit(144bv64, 16bv64);call write~init~$Pointer$(4bv64, 0bv64, ~#l440gx_map~0.base, ~#l440gx_map~0.offset, 8bv64);call write~init~intINTTYPE8(1048576bv64, ~#l440gx_map~0.base, ~bvadd64(8bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~intINTTYPE8(4293918720bv64, ~#l440gx_map~0.base, ~bvadd64(16bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(24bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(32bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~intINTTYPE4(0bv32, ~#l440gx_map~0.base, ~bvadd64(40bv64, ~#l440gx_map~0.offset), 4bv64);call write~init~intINTTYPE4(1bv32, ~#l440gx_map~0.base, ~bvadd64(44bv64, ~#l440gx_map~0.offset), 4bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(48bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(56bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(64bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(72bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(80bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(88bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~intINTTYPE8(0bv64, ~#l440gx_map~0.base, ~bvadd64(96bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~intINTTYPE8(0bv64, ~#l440gx_map~0.base, ~bvadd64(104bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~intINTTYPE8(0bv64, ~#l440gx_map~0.base, ~bvadd64(112bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(120bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(128bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(136bv64, ~#l440gx_map~0.offset), 8bv64);~ldv_retval_0~0 := 0bv32;~ldv_module_refcounter~0 := 1bv32; {133#true} is VALID [2022-02-20 22:09:40,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {133#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet110#1, main_#t~switch111#1, main_#t~nondet112#1, main_#t~switch113#1, main_#t~ret114#1, main_~tmp~12#1, main_~tmp___0~4#1;havoc main_~tmp~12#1;havoc main_~tmp___0~4#1;assume { :begin_inline_ldv_initialize } true; {133#true} is VALID [2022-02-20 22:09:40,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {133#true} assume { :end_inline_ldv_initialize } true;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32; {144#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 22:09:40,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {144#(= (_ bv1 32) ~ldv_state_variable_0~0)} main_~tmp~12#1 := main_#t~nondet110#1;havoc main_#t~nondet110#1;main_#t~switch111#1 := 0bv32 == main_~tmp~12#1; {144#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 22:09:40,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {144#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume main_#t~switch111#1; {144#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 22:09:40,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {144#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___0~4#1 := main_#t~nondet112#1;havoc main_#t~nondet112#1;main_#t~switch113#1 := 0bv32 == main_~tmp___0~4#1; {144#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 22:09:40,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {144#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume main_#t~switch113#1; {144#(= (_ bv1 32) ~ldv_state_variable_0~0)} is VALID [2022-02-20 22:09:40,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {144#(= (_ bv1 32) ~ldv_state_variable_0~0)} assume 3bv32 == ~ldv_state_variable_0~0 && 0bv32 == ~ref_cnt~0;assume { :begin_inline_cleanup_l440gx } true;havoc cleanup_l440gx_#t~ret108#1, cleanup_l440gx_#t~mem109#1.base, cleanup_l440gx_#t~mem109#1.offset;assume { :begin_inline_mtd_device_unregister } true;mtd_device_unregister_#in~arg0#1.base, mtd_device_unregister_#in~arg0#1.offset := ~mymtd~0.base, ~mymtd~0.offset;havoc mtd_device_unregister_#res#1;havoc mtd_device_unregister_#t~nondet124#1, mtd_device_unregister_~arg0#1.base, mtd_device_unregister_~arg0#1.offset;mtd_device_unregister_~arg0#1.base, mtd_device_unregister_~arg0#1.offset := mtd_device_unregister_#in~arg0#1.base, mtd_device_unregister_#in~arg0#1.offset;mtd_device_unregister_#res#1 := mtd_device_unregister_#t~nondet124#1;havoc mtd_device_unregister_#t~nondet124#1; {134#false} is VALID [2022-02-20 22:09:40,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {134#false} cleanup_l440gx_#t~ret108#1 := mtd_device_unregister_#res#1;assume { :end_inline_mtd_device_unregister } true;havoc cleanup_l440gx_#t~ret108#1;assume { :begin_inline_map_destroy } true;map_destroy_#in~arg0#1.base, map_destroy_#in~arg0#1.offset := ~mymtd~0.base, ~mymtd~0.offset;havoc map_destroy_~arg0#1.base, map_destroy_~arg0#1.offset;map_destroy_~arg0#1.base, map_destroy_~arg0#1.offset := map_destroy_#in~arg0#1.base, map_destroy_#in~arg0#1.offset; {134#false} is VALID [2022-02-20 22:09:40,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {134#false} assume { :end_inline_map_destroy } true;call cleanup_l440gx_#t~mem109#1.base, cleanup_l440gx_#t~mem109#1.offset := read~$Pointer$(~#l440gx_map~0.base, ~bvadd64(24bv64, ~#l440gx_map~0.offset), 8bv64); {134#false} is VALID [2022-02-20 22:09:40,034 INFO L272 TraceCheckUtils]: 10: Hoare triple {134#false} call iounmap(cleanup_l440gx_#t~mem109#1.base, cleanup_l440gx_#t~mem109#1.offset); {134#false} is VALID [2022-02-20 22:09:40,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {134#false} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {134#false} is VALID [2022-02-20 22:09:40,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {134#false} assume true; {134#false} is VALID [2022-02-20 22:09:40,034 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {134#false} {134#false} #258#return; {134#false} is VALID [2022-02-20 22:09:40,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {134#false} havoc cleanup_l440gx_#t~mem109#1.base, cleanup_l440gx_#t~mem109#1.offset; {134#false} is VALID [2022-02-20 22:09:40,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {134#false} assume { :end_inline_cleanup_l440gx } true;~ldv_state_variable_0~0 := 2bv32; {134#false} is VALID [2022-02-20 22:09:40,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {134#false} assume { :begin_inline_ldv_check_final_state } true; {134#false} is VALID [2022-02-20 22:09:40,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {134#false} assume 1bv32 != ~ldv_module_refcounter~0; {134#false} is VALID [2022-02-20 22:09:40,035 INFO L272 TraceCheckUtils]: 18: Hoare triple {134#false} call ldv_error(); {134#false} is VALID [2022-02-20 22:09:40,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {134#false} assume !false; {134#false} is VALID [2022-02-20 22:09:40,036 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 22:09:40,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 22:09:40,038 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 22:09:40,039 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153708713] [2022-02-20 22:09:40,039 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153708713] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:09:40,039 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:09:40,040 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 22:09:40,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572277301] [2022-02-20 22:09:40,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:09:40,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 22:09:40,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:09:40,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 22:09:40,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:09:40,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 22:09:40,090 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 22:09:40,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 22:09:40,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 22:09:40,109 INFO L87 Difference]: Start difference. First operand has 130 states, 95 states have (on average 1.2421052631578948) internal successors, (118), 99 states have internal predecessors, (118), 24 states have call successors, (24), 10 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 22:09:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:09:41,141 INFO L93 Difference]: Finished difference Result 273 states and 358 transitions. [2022-02-20 22:09:41,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 22:09:41,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-20 22:09:41,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:09:41,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 22:09:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2022-02-20 22:09:41,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 22:09:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2022-02-20 22:09:41,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 358 transitions. [2022-02-20 22:09:41,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:09:41,597 INFO L225 Difference]: With dead ends: 273 [2022-02-20 22:09:41,598 INFO L226 Difference]: Without dead ends: 136 [2022-02-20 22:09:41,601 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 22:09:41,605 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 134 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:09:41,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 194 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 22:09:41,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-02-20 22:09:41,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-02-20 22:09:41,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:09:41,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 136 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 104 states have internal predecessors, (126), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 22:09:41,654 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 136 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 104 states have internal predecessors, (126), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 22:09:41,655 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 136 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 104 states have internal predecessors, (126), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 22:09:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:09:41,670 INFO L93 Difference]: Finished difference Result 136 states and 169 transitions. [2022-02-20 22:09:41,671 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 169 transitions. [2022-02-20 22:09:41,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:09:41,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:09:41,673 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 104 states have internal predecessors, (126), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 136 states. [2022-02-20 22:09:41,673 INFO L87 Difference]: Start difference. First operand has 136 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 104 states have internal predecessors, (126), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 136 states. [2022-02-20 22:09:41,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:09:41,679 INFO L93 Difference]: Finished difference Result 136 states and 169 transitions. [2022-02-20 22:09:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 169 transitions. [2022-02-20 22:09:41,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:09:41,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:09:41,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:09:41,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:09:41,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 104 states have internal predecessors, (126), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 22:09:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 169 transitions. [2022-02-20 22:09:41,687 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 169 transitions. Word has length 20 [2022-02-20 22:09:41,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:09:41,687 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 169 transitions. [2022-02-20 22:09:41,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 22:09:41,688 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 169 transitions. [2022-02-20 22:09:41,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 22:09:41,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:09:41,689 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:09:41,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 22:09:41,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 22:09:41,897 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:09:41,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:09:41,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1275376956, now seen corresponding path program 1 times [2022-02-20 22:09:41,898 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 22:09:41,898 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962527613] [2022-02-20 22:09:41,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:09:41,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 22:09:41,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 22:09:41,900 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 22:09:41,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 22:09:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:09:42,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 22:09:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:09:42,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 22:09:42,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {1063#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(79bv64, 2bv64);call #Ultimate.allocInit(16bv64, 3bv64);call #Ultimate.allocInit(12bv64, 4bv64);call #Ultimate.allocInit(73bv64, 5bv64);call #Ultimate.allocInit(40bv64, 6bv64);call #Ultimate.allocInit(24bv64, 7bv64);call #Ultimate.allocInit(10bv64, 8bv64);call #Ultimate.allocInit(40bv64, 9bv64);call #Ultimate.allocInit(45bv64, 10bv64);call #Ultimate.allocInit(12bv64, 11bv64);call #Ultimate.allocInit(45bv64, 12bv64);call #Ultimate.allocInit(8bv64, 13bv64);~LDV_IN_INTERRUPT~0 := 1bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 0bv32;~#iobase~0.base, ~#iobase~0.offset := 14bv64, 0bv64;call #Ultimate.allocInit(4bv64, 14bv64);call write~init~intINTTYPE4(0bv32, ~#iobase~0.base, ~#iobase~0.offset, 4bv64);~mymtd~0.base, ~mymtd~0.offset := 0bv64, 0bv64;~#l440gx_vpp_lock~0.base, ~#l440gx_vpp_lock~0.offset := 15bv64, 0bv64;call #Ultimate.allocInit(68bv64, 15bv64);call write~init~intINTTYPE4(0bv32, ~#l440gx_vpp_lock~0.base, ~#l440gx_vpp_lock~0.offset, 4bv64);call write~init~intINTTYPE4(3735899821bv32, ~#l440gx_vpp_lock~0.base, ~bvadd64(4bv64, ~#l440gx_vpp_lock~0.offset), 4bv64);call write~init~intINTTYPE4(4294967295bv32, ~#l440gx_vpp_lock~0.base, ~bvadd64(8bv64, ~#l440gx_vpp_lock~0.offset), 4bv64);call write~init~$Pointer$(0bv64, 18446744073709551615bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(12bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(20bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(28bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(36bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);call write~init~$Pointer$(3bv64, 0bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(44bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);call write~init~intINTTYPE4(0bv32, ~#l440gx_vpp_lock~0.base, ~bvadd64(52bv64, ~#l440gx_vpp_lock~0.offset), 4bv64);call write~init~intINTTYPE8(0bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(56bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);~l440gx_vpp_refcnt~0 := 0bv32;~#l440gx_map~0.base, ~#l440gx_map~0.offset := 16bv64, 0bv64;call #Ultimate.allocInit(144bv64, 16bv64);call write~init~$Pointer$(4bv64, 0bv64, ~#l440gx_map~0.base, ~#l440gx_map~0.offset, 8bv64);call write~init~intINTTYPE8(1048576bv64, ~#l440gx_map~0.base, ~bvadd64(8bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~intINTTYPE8(4293918720bv64, ~#l440gx_map~0.base, ~bvadd64(16bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(24bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(32bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~intINTTYPE4(0bv32, ~#l440gx_map~0.base, ~bvadd64(40bv64, ~#l440gx_map~0.offset), 4bv64);call write~init~intINTTYPE4(1bv32, ~#l440gx_map~0.base, ~bvadd64(44bv64, ~#l440gx_map~0.offset), 4bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(48bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(56bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(64bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(72bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(80bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(88bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~intINTTYPE8(0bv64, ~#l440gx_map~0.base, ~bvadd64(96bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~intINTTYPE8(0bv64, ~#l440gx_map~0.base, ~bvadd64(104bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~intINTTYPE8(0bv64, ~#l440gx_map~0.base, ~bvadd64(112bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(120bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(128bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(136bv64, ~#l440gx_map~0.offset), 8bv64);~ldv_retval_0~0 := 0bv32;~ldv_module_refcounter~0 := 1bv32; {1063#true} is VALID [2022-02-20 22:09:42,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {1063#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet110#1, main_#t~switch111#1, main_#t~nondet112#1, main_#t~switch113#1, main_#t~ret114#1, main_~tmp~12#1, main_~tmp___0~4#1;havoc main_~tmp~12#1;havoc main_~tmp___0~4#1;assume { :begin_inline_ldv_initialize } true; {1063#true} is VALID [2022-02-20 22:09:42,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {1063#true} assume { :end_inline_ldv_initialize } true;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32; {1063#true} is VALID [2022-02-20 22:09:42,158 INFO L290 TraceCheckUtils]: 3: Hoare triple {1063#true} main_~tmp~12#1 := main_#t~nondet110#1;havoc main_#t~nondet110#1;main_#t~switch111#1 := 0bv32 == main_~tmp~12#1; {1063#true} is VALID [2022-02-20 22:09:42,158 INFO L290 TraceCheckUtils]: 4: Hoare triple {1063#true} assume main_#t~switch111#1; {1063#true} is VALID [2022-02-20 22:09:42,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {1063#true} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___0~4#1 := main_#t~nondet112#1;havoc main_#t~nondet112#1;main_#t~switch113#1 := 0bv32 == main_~tmp___0~4#1; {1063#true} is VALID [2022-02-20 22:09:42,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {1063#true} assume !main_#t~switch113#1;main_#t~switch113#1 := main_#t~switch113#1 || 1bv32 == main_~tmp___0~4#1; {1063#true} is VALID [2022-02-20 22:09:42,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {1063#true} assume main_#t~switch113#1; {1063#true} is VALID [2022-02-20 22:09:42,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {1063#true} assume 1bv32 == ~ldv_state_variable_0~0;assume { :begin_inline_init_l440gx } true;havoc init_l440gx_#res#1;havoc init_l440gx_#t~ret74#1.base, init_l440gx_#t~ret74#1.offset, init_l440gx_#t~ret75#1.base, init_l440gx_#t~ret75#1.offset, init_l440gx_#t~nondet76#1, init_l440gx_#t~ret77#1.base, init_l440gx_#t~ret77#1.offset, init_l440gx_#t~mem78#1.base, init_l440gx_#t~mem78#1.offset, init_l440gx_#t~nondet79#1, init_l440gx_#t~nondet80#1, init_l440gx_#t~mem81#1.base, init_l440gx_#t~mem81#1.offset, init_l440gx_#t~mem82#1, init_l440gx_#t~ret83#1, init_l440gx_#t~mem84#1, init_l440gx_#t~mem86#1, init_l440gx_#t~mem85#1, init_l440gx_#t~mem88#1, init_l440gx_#t~mem87#1, init_l440gx_#t~ret89#1, init_l440gx_#t~nondet90#1, init_l440gx_#t~mem91#1.base, init_l440gx_#t~mem91#1.offset, init_l440gx_#t~mem92#1, init_l440gx_#t~mem93#1, init_l440gx_#t~ret94#1, init_l440gx_#t~ret95#1, init_l440gx_#t~mem96#1, init_l440gx_#t~mem97#1, init_l440gx_#t~ret98#1, init_l440gx_#t~mem99#1, init_l440gx_#t~ret100#1, init_l440gx_#t~mem101#1, init_l440gx_#t~nondet102#1, init_l440gx_#t~ret103#1.base, init_l440gx_#t~ret103#1.offset, init_l440gx_#t~nondet104#1, init_l440gx_#t~ret105#1.base, init_l440gx_#t~ret105#1.offset, init_l440gx_#t~ret106#1, init_l440gx_#t~mem107#1.base, init_l440gx_#t~mem107#1.offset, init_l440gx_~dev~0#1.base, init_l440gx_~dev~0#1.offset, init_l440gx_~pm_dev~0#1.base, init_l440gx_~pm_dev~0#1.offset, init_l440gx_~pm_iobase~0#1.base, init_l440gx_~pm_iobase~0#1.offset, init_l440gx_~#word~0#1.base, init_l440gx_~#word~0#1.offset, init_l440gx_~tmp~11#1, init_l440gx_~tmp___0~3#1;havoc init_l440gx_~dev~0#1.base, init_l440gx_~dev~0#1.offset;havoc init_l440gx_~pm_dev~0#1.base, init_l440gx_~pm_dev~0#1.offset;havoc init_l440gx_~pm_iobase~0#1.base, init_l440gx_~pm_iobase~0#1.offset;call init_l440gx_~#word~0#1.base, init_l440gx_~#word~0#1.offset := #Ultimate.allocOnStack(2bv64);havoc init_l440gx_~tmp~11#1;havoc init_l440gx_~tmp___0~3#1; {1063#true} is VALID [2022-02-20 22:09:42,159 INFO L272 TraceCheckUtils]: 9: Hoare triple {1063#true} call init_l440gx_#t~ret74#1.base, init_l440gx_#t~ret74#1.offset := pci_get_device(32902bv32, 28944bv32, 0bv64, 0bv64); {1063#true} is VALID [2022-02-20 22:09:42,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {1063#true} ~arg0 := #in~arg0;~arg1 := #in~arg1;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {1063#true} is VALID [2022-02-20 22:09:42,159 INFO L272 TraceCheckUtils]: 11: Hoare triple {1063#true} call #t~ret130.base, #t~ret130.offset := ldv_malloc(2905bv64); {1063#true} is VALID [2022-02-20 22:09:42,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {1063#true} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;~tmp___0~0 := #t~nondet14;havoc #t~nondet14; {1063#true} is VALID [2022-02-20 22:09:42,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {1063#true} assume 0bv32 != ~tmp___0~0;#res.base, #res.offset := 0bv64, 0bv64; {1063#true} is VALID [2022-02-20 22:09:42,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-02-20 22:09:42,160 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1063#true} {1063#true} #256#return; {1063#true} is VALID [2022-02-20 22:09:42,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {1063#true} #res.base, #res.offset := #t~ret130.base, #t~ret130.offset;havoc #t~ret130.base, #t~ret130.offset; {1063#true} is VALID [2022-02-20 22:09:42,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-02-20 22:09:42,161 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1063#true} {1063#true} #260#return; {1063#true} is VALID [2022-02-20 22:09:42,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {1063#true} init_l440gx_~dev~0#1.base, init_l440gx_~dev~0#1.offset := init_l440gx_#t~ret74#1.base, init_l440gx_#t~ret74#1.offset;havoc init_l440gx_#t~ret74#1.base, init_l440gx_#t~ret74#1.offset; {1063#true} is VALID [2022-02-20 22:09:42,161 INFO L272 TraceCheckUtils]: 20: Hoare triple {1063#true} call init_l440gx_#t~ret75#1.base, init_l440gx_#t~ret75#1.offset := pci_get_device(32902bv32, 28947bv32, 0bv64, 0bv64); {1063#true} is VALID [2022-02-20 22:09:42,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {1063#true} ~arg0 := #in~arg0;~arg1 := #in~arg1;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {1063#true} is VALID [2022-02-20 22:09:42,162 INFO L272 TraceCheckUtils]: 22: Hoare triple {1063#true} call #t~ret130.base, #t~ret130.offset := ldv_malloc(2905bv64); {1063#true} is VALID [2022-02-20 22:09:42,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {1063#true} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;~tmp___0~0 := #t~nondet14;havoc #t~nondet14; {1063#true} is VALID [2022-02-20 22:09:42,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {1063#true} assume 0bv32 != ~tmp___0~0;#res.base, #res.offset := 0bv64, 0bv64; {1063#true} is VALID [2022-02-20 22:09:42,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-02-20 22:09:42,162 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1063#true} {1063#true} #256#return; {1063#true} is VALID [2022-02-20 22:09:42,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {1063#true} #res.base, #res.offset := #t~ret130.base, #t~ret130.offset;havoc #t~ret130.base, #t~ret130.offset; {1063#true} is VALID [2022-02-20 22:09:42,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-02-20 22:09:42,163 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1063#true} {1063#true} #262#return; {1063#true} is VALID [2022-02-20 22:09:42,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {1063#true} init_l440gx_~pm_dev~0#1.base, init_l440gx_~pm_dev~0#1.offset := init_l440gx_#t~ret75#1.base, init_l440gx_#t~ret75#1.offset;havoc init_l440gx_#t~ret75#1.base, init_l440gx_#t~ret75#1.offset; {1063#true} is VALID [2022-02-20 22:09:42,164 INFO L272 TraceCheckUtils]: 31: Hoare triple {1063#true} call pci_dev_put(init_l440gx_~dev~0#1.base, init_l440gx_~dev~0#1.offset); {1063#true} is VALID [2022-02-20 22:09:42,164 INFO L290 TraceCheckUtils]: 32: Hoare triple {1063#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {1063#true} is VALID [2022-02-20 22:09:42,164 INFO L290 TraceCheckUtils]: 33: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-02-20 22:09:42,164 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1063#true} {1063#true} #264#return; {1063#true} is VALID [2022-02-20 22:09:42,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {1063#true} assume 0bv64 == ~bvadd64(init_l440gx_~dev~0#1.base, init_l440gx_~dev~0#1.offset) || 0bv64 == ~bvadd64(init_l440gx_~pm_dev~0#1.base, init_l440gx_~pm_dev~0#1.offset);havoc init_l440gx_#t~nondet76#1; {1063#true} is VALID [2022-02-20 22:09:42,165 INFO L272 TraceCheckUtils]: 36: Hoare triple {1063#true} call pci_dev_put(init_l440gx_~pm_dev~0#1.base, init_l440gx_~pm_dev~0#1.offset); {1063#true} is VALID [2022-02-20 22:09:42,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {1063#true} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {1063#true} is VALID [2022-02-20 22:09:42,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {1063#true} assume true; {1063#true} is VALID [2022-02-20 22:09:42,165 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1063#true} {1063#true} #266#return; {1063#true} is VALID [2022-02-20 22:09:42,166 INFO L290 TraceCheckUtils]: 40: Hoare triple {1063#true} init_l440gx_#res#1 := 4294967277bv32;call ULTIMATE.dealloc(init_l440gx_~#word~0#1.base, init_l440gx_~#word~0#1.offset);havoc init_l440gx_~#word~0#1.base, init_l440gx_~#word~0#1.offset; {1188#(= |ULTIMATE.start_init_l440gx_#res#1| (_ bv4294967277 32))} is VALID [2022-02-20 22:09:42,166 INFO L290 TraceCheckUtils]: 41: Hoare triple {1188#(= |ULTIMATE.start_init_l440gx_#res#1| (_ bv4294967277 32))} main_#t~ret114#1 := init_l440gx_#res#1;assume { :end_inline_init_l440gx } true;~ldv_retval_0~0 := main_#t~ret114#1;havoc main_#t~ret114#1; {1192#(= (_ bv4294967277 32) ~ldv_retval_0~0)} is VALID [2022-02-20 22:09:42,167 INFO L290 TraceCheckUtils]: 42: Hoare triple {1192#(= (_ bv4294967277 32) ~ldv_retval_0~0)} assume 0bv32 == ~ldv_retval_0~0;~ldv_state_variable_0~0 := 3bv32; {1064#false} is VALID [2022-02-20 22:09:42,167 INFO L290 TraceCheckUtils]: 43: Hoare triple {1064#false} assume 0bv32 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2bv32; {1064#false} is VALID [2022-02-20 22:09:42,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {1064#false} assume { :begin_inline_ldv_check_final_state } true; {1064#false} is VALID [2022-02-20 22:09:42,167 INFO L290 TraceCheckUtils]: 45: Hoare triple {1064#false} assume 1bv32 != ~ldv_module_refcounter~0; {1064#false} is VALID [2022-02-20 22:09:42,168 INFO L272 TraceCheckUtils]: 46: Hoare triple {1064#false} call ldv_error(); {1064#false} is VALID [2022-02-20 22:09:42,168 INFO L290 TraceCheckUtils]: 47: Hoare triple {1064#false} assume !false; {1064#false} is VALID [2022-02-20 22:09:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 22:09:42,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 22:09:42,168 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 22:09:42,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962527613] [2022-02-20 22:09:42,169 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962527613] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:09:42,169 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:09:42,169 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 22:09:42,169 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117537784] [2022-02-20 22:09:42,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:09:42,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 48 [2022-02-20 22:09:42,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:09:42,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 22:09:42,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:09:42,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 22:09:42,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 22:09:42,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 22:09:42,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 22:09:42,212 INFO L87 Difference]: Start difference. First operand 136 states and 169 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 22:09:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:09:45,478 INFO L93 Difference]: Finished difference Result 277 states and 344 transitions. [2022-02-20 22:09:45,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 22:09:45,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 48 [2022-02-20 22:09:45,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:09:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 22:09:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 308 transitions. [2022-02-20 22:09:45,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 22:09:45,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 308 transitions. [2022-02-20 22:09:45,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 308 transitions. [2022-02-20 22:09:45,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 308 edges. 308 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:09:45,794 INFO L225 Difference]: With dead ends: 277 [2022-02-20 22:09:45,794 INFO L226 Difference]: Without dead ends: 144 [2022-02-20 22:09:45,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:09:45,795 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 10 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:09:45,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 437 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 22:09:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-02-20 22:09:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 139. [2022-02-20 22:09:45,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:09:45,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 139 states, 107 states have (on average 1.205607476635514) internal successors, (129), 107 states have internal predecessors, (129), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 22:09:45,803 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 139 states, 107 states have (on average 1.205607476635514) internal successors, (129), 107 states have internal predecessors, (129), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 22:09:45,804 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 139 states, 107 states have (on average 1.205607476635514) internal successors, (129), 107 states have internal predecessors, (129), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 22:09:45,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:09:45,808 INFO L93 Difference]: Finished difference Result 144 states and 176 transitions. [2022-02-20 22:09:45,808 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 176 transitions. [2022-02-20 22:09:45,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:09:45,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:09:45,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 107 states have (on average 1.205607476635514) internal successors, (129), 107 states have internal predecessors, (129), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 144 states. [2022-02-20 22:09:45,810 INFO L87 Difference]: Start difference. First operand has 139 states, 107 states have (on average 1.205607476635514) internal successors, (129), 107 states have internal predecessors, (129), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 144 states. [2022-02-20 22:09:45,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:09:45,814 INFO L93 Difference]: Finished difference Result 144 states and 176 transitions. [2022-02-20 22:09:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 176 transitions. [2022-02-20 22:09:45,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:09:45,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:09:45,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:09:45,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:09:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 107 states have (on average 1.205607476635514) internal successors, (129), 107 states have internal predecessors, (129), 22 states have call successors, (22), 10 states have call predecessors, (22), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-02-20 22:09:45,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 172 transitions. [2022-02-20 22:09:45,819 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 172 transitions. Word has length 48 [2022-02-20 22:09:45,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:09:45,820 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 172 transitions. [2022-02-20 22:09:45,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 22:09:45,820 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 172 transitions. [2022-02-20 22:09:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-20 22:09:45,821 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:09:45,821 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:09:45,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 22:09:46,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 22:09:46,030 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:09:46,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:09:46,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1218118654, now seen corresponding path program 1 times [2022-02-20 22:09:46,031 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 22:09:46,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180000128] [2022-02-20 22:09:46,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:09:46,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 22:09:46,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 22:09:46,033 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 22:09:46,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 22:09:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:09:46,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 22:09:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:09:46,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 22:09:46,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {2097#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv64, 0bv64;assume 0bv1 == #valid[0bv64];assume ~bvult64(0bv64, #StackHeapBarrier);call #Ultimate.allocInit(2bv64, 1bv64);call write~init~intINTTYPE1(48bv8, 1bv64, 0bv64, 1bv64);call write~init~intINTTYPE1(0bv8, 1bv64, 1bv64, 1bv64);call #Ultimate.allocInit(79bv64, 2bv64);call #Ultimate.allocInit(16bv64, 3bv64);call #Ultimate.allocInit(12bv64, 4bv64);call #Ultimate.allocInit(73bv64, 5bv64);call #Ultimate.allocInit(40bv64, 6bv64);call #Ultimate.allocInit(24bv64, 7bv64);call #Ultimate.allocInit(10bv64, 8bv64);call #Ultimate.allocInit(40bv64, 9bv64);call #Ultimate.allocInit(45bv64, 10bv64);call #Ultimate.allocInit(12bv64, 11bv64);call #Ultimate.allocInit(45bv64, 12bv64);call #Ultimate.allocInit(8bv64, 13bv64);~LDV_IN_INTERRUPT~0 := 1bv32;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 0bv32;~#iobase~0.base, ~#iobase~0.offset := 14bv64, 0bv64;call #Ultimate.allocInit(4bv64, 14bv64);call write~init~intINTTYPE4(0bv32, ~#iobase~0.base, ~#iobase~0.offset, 4bv64);~mymtd~0.base, ~mymtd~0.offset := 0bv64, 0bv64;~#l440gx_vpp_lock~0.base, ~#l440gx_vpp_lock~0.offset := 15bv64, 0bv64;call #Ultimate.allocInit(68bv64, 15bv64);call write~init~intINTTYPE4(0bv32, ~#l440gx_vpp_lock~0.base, ~#l440gx_vpp_lock~0.offset, 4bv64);call write~init~intINTTYPE4(3735899821bv32, ~#l440gx_vpp_lock~0.base, ~bvadd64(4bv64, ~#l440gx_vpp_lock~0.offset), 4bv64);call write~init~intINTTYPE4(4294967295bv32, ~#l440gx_vpp_lock~0.base, ~bvadd64(8bv64, ~#l440gx_vpp_lock~0.offset), 4bv64);call write~init~$Pointer$(0bv64, 18446744073709551615bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(12bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(20bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(28bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(36bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);call write~init~$Pointer$(3bv64, 0bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(44bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);call write~init~intINTTYPE4(0bv32, ~#l440gx_vpp_lock~0.base, ~bvadd64(52bv64, ~#l440gx_vpp_lock~0.offset), 4bv64);call write~init~intINTTYPE8(0bv64, ~#l440gx_vpp_lock~0.base, ~bvadd64(56bv64, ~#l440gx_vpp_lock~0.offset), 8bv64);~l440gx_vpp_refcnt~0 := 0bv32;~#l440gx_map~0.base, ~#l440gx_map~0.offset := 16bv64, 0bv64;call #Ultimate.allocInit(144bv64, 16bv64);call write~init~$Pointer$(4bv64, 0bv64, ~#l440gx_map~0.base, ~#l440gx_map~0.offset, 8bv64);call write~init~intINTTYPE8(1048576bv64, ~#l440gx_map~0.base, ~bvadd64(8bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~intINTTYPE8(4293918720bv64, ~#l440gx_map~0.base, ~bvadd64(16bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(24bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(32bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~intINTTYPE4(0bv32, ~#l440gx_map~0.base, ~bvadd64(40bv64, ~#l440gx_map~0.offset), 4bv64);call write~init~intINTTYPE4(1bv32, ~#l440gx_map~0.base, ~bvadd64(44bv64, ~#l440gx_map~0.offset), 4bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(48bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(56bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(64bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(72bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(80bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(88bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~intINTTYPE8(0bv64, ~#l440gx_map~0.base, ~bvadd64(96bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~intINTTYPE8(0bv64, ~#l440gx_map~0.base, ~bvadd64(104bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~intINTTYPE8(0bv64, ~#l440gx_map~0.base, ~bvadd64(112bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(120bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(128bv64, ~#l440gx_map~0.offset), 8bv64);call write~init~$Pointer$(0bv64, 0bv64, ~#l440gx_map~0.base, ~bvadd64(136bv64, ~#l440gx_map~0.offset), 8bv64);~ldv_retval_0~0 := 0bv32;~ldv_module_refcounter~0 := 1bv32; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet110#1, main_#t~switch111#1, main_#t~nondet112#1, main_#t~switch113#1, main_#t~ret114#1, main_~tmp~12#1, main_~tmp___0~4#1;havoc main_~tmp~12#1;havoc main_~tmp___0~4#1;assume { :begin_inline_ldv_initialize } true; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume { :end_inline_ldv_initialize } true;~ref_cnt~0 := 0bv32;~ldv_state_variable_0~0 := 1bv32; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} main_~tmp~12#1 := main_#t~nondet110#1;havoc main_#t~nondet110#1;main_#t~switch111#1 := 0bv32 == main_~tmp~12#1; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,367 INFO L290 TraceCheckUtils]: 4: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume main_#t~switch111#1; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume 0bv32 != ~ldv_state_variable_0~0;main_~tmp___0~4#1 := main_#t~nondet112#1;havoc main_#t~nondet112#1;main_#t~switch113#1 := 0bv32 == main_~tmp___0~4#1; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume !main_#t~switch113#1;main_#t~switch113#1 := main_#t~switch113#1 || 1bv32 == main_~tmp___0~4#1; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume main_#t~switch113#1; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume 1bv32 == ~ldv_state_variable_0~0;assume { :begin_inline_init_l440gx } true;havoc init_l440gx_#res#1;havoc init_l440gx_#t~ret74#1.base, init_l440gx_#t~ret74#1.offset, init_l440gx_#t~ret75#1.base, init_l440gx_#t~ret75#1.offset, init_l440gx_#t~nondet76#1, init_l440gx_#t~ret77#1.base, init_l440gx_#t~ret77#1.offset, init_l440gx_#t~mem78#1.base, init_l440gx_#t~mem78#1.offset, init_l440gx_#t~nondet79#1, init_l440gx_#t~nondet80#1, init_l440gx_#t~mem81#1.base, init_l440gx_#t~mem81#1.offset, init_l440gx_#t~mem82#1, init_l440gx_#t~ret83#1, init_l440gx_#t~mem84#1, init_l440gx_#t~mem86#1, init_l440gx_#t~mem85#1, init_l440gx_#t~mem88#1, init_l440gx_#t~mem87#1, init_l440gx_#t~ret89#1, init_l440gx_#t~nondet90#1, init_l440gx_#t~mem91#1.base, init_l440gx_#t~mem91#1.offset, init_l440gx_#t~mem92#1, init_l440gx_#t~mem93#1, init_l440gx_#t~ret94#1, init_l440gx_#t~ret95#1, init_l440gx_#t~mem96#1, init_l440gx_#t~mem97#1, init_l440gx_#t~ret98#1, init_l440gx_#t~mem99#1, init_l440gx_#t~ret100#1, init_l440gx_#t~mem101#1, init_l440gx_#t~nondet102#1, init_l440gx_#t~ret103#1.base, init_l440gx_#t~ret103#1.offset, init_l440gx_#t~nondet104#1, init_l440gx_#t~ret105#1.base, init_l440gx_#t~ret105#1.offset, init_l440gx_#t~ret106#1, init_l440gx_#t~mem107#1.base, init_l440gx_#t~mem107#1.offset, init_l440gx_~dev~0#1.base, init_l440gx_~dev~0#1.offset, init_l440gx_~pm_dev~0#1.base, init_l440gx_~pm_dev~0#1.offset, init_l440gx_~pm_iobase~0#1.base, init_l440gx_~pm_iobase~0#1.offset, init_l440gx_~#word~0#1.base, init_l440gx_~#word~0#1.offset, init_l440gx_~tmp~11#1, init_l440gx_~tmp___0~3#1;havoc init_l440gx_~dev~0#1.base, init_l440gx_~dev~0#1.offset;havoc init_l440gx_~pm_dev~0#1.base, init_l440gx_~pm_dev~0#1.offset;havoc init_l440gx_~pm_iobase~0#1.base, init_l440gx_~pm_iobase~0#1.offset;call init_l440gx_~#word~0#1.base, init_l440gx_~#word~0#1.offset := #Ultimate.allocOnStack(2bv64);havoc init_l440gx_~tmp~11#1;havoc init_l440gx_~tmp___0~3#1; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,373 INFO L272 TraceCheckUtils]: 9: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} call init_l440gx_#t~ret74#1.base, init_l440gx_#t~ret74#1.offset := pci_get_device(32902bv32, 28944bv32, 0bv64, 0bv64); {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} ~arg0 := #in~arg0;~arg1 := #in~arg1;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,374 INFO L272 TraceCheckUtils]: 11: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} call #t~ret130.base, #t~ret130.offset := ldv_malloc(2905bv64); {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;~tmp___0~0 := #t~nondet14;havoc #t~nondet14; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume 0bv32 != ~tmp___0~0;#res.base, #res.offset := 0bv64, 0bv64; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume true; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,376 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} #256#return; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} #res.base, #res.offset := #t~ret130.base, #t~ret130.offset;havoc #t~ret130.base, #t~ret130.offset; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume true; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,378 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} #260#return; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} init_l440gx_~dev~0#1.base, init_l440gx_~dev~0#1.offset := init_l440gx_#t~ret74#1.base, init_l440gx_#t~ret74#1.offset;havoc init_l440gx_#t~ret74#1.base, init_l440gx_#t~ret74#1.offset; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,379 INFO L272 TraceCheckUtils]: 20: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} call init_l440gx_#t~ret75#1.base, init_l440gx_#t~ret75#1.offset := pci_get_device(32902bv32, 28947bv32, 0bv64, 0bv64); {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} ~arg0 := #in~arg0;~arg1 := #in~arg1;~arg2.base, ~arg2.offset := #in~arg2.base, #in~arg2.offset; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,380 INFO L272 TraceCheckUtils]: 22: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} call #t~ret130.base, #t~ret130.offset := ldv_malloc(2905bv64); {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;~tmp___0~0 := #t~nondet14;havoc #t~nondet14; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume 0bv32 != ~tmp___0~0;#res.base, #res.offset := 0bv64, 0bv64; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume true; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,382 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} #256#return; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} #res.base, #res.offset := #t~ret130.base, #t~ret130.offset;havoc #t~ret130.base, #t~ret130.offset; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume true; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,384 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} #262#return; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} init_l440gx_~pm_dev~0#1.base, init_l440gx_~pm_dev~0#1.offset := init_l440gx_#t~ret75#1.base, init_l440gx_#t~ret75#1.offset;havoc init_l440gx_#t~ret75#1.base, init_l440gx_#t~ret75#1.offset; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,385 INFO L272 TraceCheckUtils]: 31: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} call pci_dev_put(init_l440gx_~dev~0#1.base, init_l440gx_~dev~0#1.offset); {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume true; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,386 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} #264#return; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume 0bv64 == ~bvadd64(init_l440gx_~dev~0#1.base, init_l440gx_~dev~0#1.offset) || 0bv64 == ~bvadd64(init_l440gx_~pm_dev~0#1.base, init_l440gx_~pm_dev~0#1.offset);havoc init_l440gx_#t~nondet76#1; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,387 INFO L272 TraceCheckUtils]: 36: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} call pci_dev_put(init_l440gx_~pm_dev~0#1.base, init_l440gx_~pm_dev~0#1.offset); {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} ~arg0.base, ~arg0.offset := #in~arg0.base, #in~arg0.offset; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume true; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,389 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} #266#return; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,389 INFO L290 TraceCheckUtils]: 40: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} init_l440gx_#res#1 := 4294967277bv32;call ULTIMATE.dealloc(init_l440gx_~#word~0#1.base, init_l440gx_~#word~0#1.offset);havoc init_l440gx_~#word~0#1.base, init_l440gx_~#word~0#1.offset; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,389 INFO L290 TraceCheckUtils]: 41: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} main_#t~ret114#1 := init_l440gx_#res#1;assume { :end_inline_init_l440gx } true;~ldv_retval_0~0 := main_#t~ret114#1;havoc main_#t~ret114#1; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume !(0bv32 == ~ldv_retval_0~0); {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume 0bv32 != ~ldv_retval_0~0;~ldv_state_variable_0~0 := 2bv32; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume { :begin_inline_ldv_check_final_state } true; {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} is VALID [2022-02-20 22:09:46,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {2102#(= ~ldv_module_refcounter~0 (_ bv1 32))} assume 1bv32 != ~ldv_module_refcounter~0; {2098#false} is VALID [2022-02-20 22:09:46,391 INFO L272 TraceCheckUtils]: 46: Hoare triple {2098#false} call ldv_error(); {2098#false} is VALID [2022-02-20 22:09:46,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {2098#false} assume !false; {2098#false} is VALID [2022-02-20 22:09:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 22:09:46,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 22:09:46,392 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 22:09:46,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180000128] [2022-02-20 22:09:46,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180000128] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:09:46,392 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:09:46,393 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 22:09:46,393 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123854978] [2022-02-20 22:09:46,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:09:46,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 48 [2022-02-20 22:09:46,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:09:46,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 22:09:46,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:09:46,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 22:09:46,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 22:09:46,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 22:09:46,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 22:09:46,449 INFO L87 Difference]: Start difference. First operand 139 states and 172 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 22:09:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:09:47,344 INFO L93 Difference]: Finished difference Result 139 states and 172 transitions. [2022-02-20 22:09:47,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 22:09:47,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 48 [2022-02-20 22:09:47,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:09:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 22:09:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2022-02-20 22:09:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 22:09:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2022-02-20 22:09:47,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 151 transitions. [2022-02-20 22:09:47,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:09:47,520 INFO L225 Difference]: With dead ends: 139 [2022-02-20 22:09:47,520 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 22:09:47,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 22:09:47,522 INFO L933 BasicCegarLoop]: 148 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 22:09:47,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 22:09:47,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 22:09:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 22:09:47,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:09:47,522 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 22:09:47,523 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 22:09:47,523 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 22:09:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:09:47,523 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 22:09:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 22:09:47,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:09:47,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:09:47,523 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 22:09:47,523 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 22:09:47,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:09:47,523 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 22:09:47,523 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 22:09:47,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:09:47,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:09:47,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:09:47,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:09:47,524 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 22:09:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 22:09:47,524 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2022-02-20 22:09:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:09:47,524 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 22:09:47,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-02-20 22:09:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 22:09:47,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:09:47,526 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 22:09:47,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 22:09:47,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 22:09:47,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 22:09:47,975 INFO L858 garLoopResultBuilder]: For program point iounmapEXIT(lines 3207 3209) no Hoare annotation was computed. [2022-02-20 22:09:47,975 INFO L861 garLoopResultBuilder]: At program point iounmapENTRY(lines 3207 3209) the Hoare annotation is: true [2022-02-20 22:09:47,975 INFO L858 garLoopResultBuilder]: For program point iounmapFINAL(lines 3207 3209) no Hoare annotation was computed. [2022-02-20 22:09:47,975 INFO L858 garLoopResultBuilder]: For program point ldv_errorFINAL(lines 3085 3091) no Hoare annotation was computed. [2022-02-20 22:09:47,975 INFO L861 garLoopResultBuilder]: At program point ldv_errorENTRY(lines 3085 3091) the Hoare annotation is: true [2022-02-20 22:09:47,976 INFO L858 garLoopResultBuilder]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3089) no Hoare annotation was computed. [2022-02-20 22:09:47,976 INFO L858 garLoopResultBuilder]: For program point ldv_errorEXIT(lines 3085 3091) no Hoare annotation was computed. [2022-02-20 22:09:47,976 INFO L858 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 2846 2852) no Hoare annotation was computed. [2022-02-20 22:09:47,976 INFO L861 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 2846 2852) the Hoare annotation is: true [2022-02-20 22:09:47,976 INFO L858 garLoopResultBuilder]: For program point L3202-1(line 3202) no Hoare annotation was computed. [2022-02-20 22:09:47,976 INFO L858 garLoopResultBuilder]: For program point do_map_probeEXIT(lines 3201 3203) no Hoare annotation was computed. [2022-02-20 22:09:47,976 INFO L861 garLoopResultBuilder]: At program point do_map_probeENTRY(lines 3201 3203) the Hoare annotation is: true [2022-02-20 22:09:47,976 INFO L861 garLoopResultBuilder]: At program point L3202(line 3202) the Hoare annotation is: true [2022-02-20 22:09:47,976 INFO L858 garLoopResultBuilder]: For program point do_map_probeFINAL(lines 3201 3203) no Hoare annotation was computed. [2022-02-20 22:09:47,976 INFO L858 garLoopResultBuilder]: For program point inlEXIT(lines 2761 2768) no Hoare annotation was computed. [2022-02-20 22:09:47,976 INFO L861 garLoopResultBuilder]: At program point inlENTRY(lines 2761 2768) the Hoare annotation is: true [2022-02-20 22:09:47,976 INFO L858 garLoopResultBuilder]: For program point inlFINAL(lines 2761 2768) no Hoare annotation was computed. [2022-02-20 22:09:47,976 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 2774 2776) the Hoare annotation is: true [2022-02-20 22:09:47,976 INFO L858 garLoopResultBuilder]: For program point L2775(line 2775) no Hoare annotation was computed. [2022-02-20 22:09:47,976 INFO L858 garLoopResultBuilder]: For program point L2775-2(lines 2774 2776) no Hoare annotation was computed. [2022-02-20 22:09:47,976 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 2774 2776) no Hoare annotation was computed. [2022-02-20 22:09:47,977 INFO L861 garLoopResultBuilder]: At program point outlENTRY(lines 2754 2760) the Hoare annotation is: true [2022-02-20 22:09:47,977 INFO L858 garLoopResultBuilder]: For program point outlEXIT(lines 2754 2760) no Hoare annotation was computed. [2022-02-20 22:09:47,977 INFO L858 garLoopResultBuilder]: For program point outlFINAL(lines 2754 2760) no Hoare annotation was computed. [2022-02-20 22:09:47,977 INFO L858 garLoopResultBuilder]: For program point L2784(lines 2784 2791) no Hoare annotation was computed. [2022-02-20 22:09:47,977 INFO L861 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 2777 2793) the Hoare annotation is: true [2022-02-20 22:09:47,977 INFO L858 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 2777 2793) no Hoare annotation was computed. [2022-02-20 22:09:47,977 INFO L858 garLoopResultBuilder]: For program point L2789-1(line 2789) no Hoare annotation was computed. [2022-02-20 22:09:47,977 INFO L861 garLoopResultBuilder]: At program point L2789(line 2789) the Hoare annotation is: true [2022-02-20 22:09:47,977 INFO L858 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 2777 2793) no Hoare annotation was computed. [2022-02-20 22:09:47,977 INFO L861 garLoopResultBuilder]: At program point L3248(line 3248) the Hoare annotation is: true [2022-02-20 22:09:47,977 INFO L858 garLoopResultBuilder]: For program point pci_get_deviceEXIT(lines 3247 3249) no Hoare annotation was computed. [2022-02-20 22:09:47,977 INFO L858 garLoopResultBuilder]: For program point L3248-1(line 3248) no Hoare annotation was computed. [2022-02-20 22:09:47,977 INFO L861 garLoopResultBuilder]: At program point pci_get_deviceENTRY(lines 3247 3249) the Hoare annotation is: true [2022-02-20 22:09:47,977 INFO L858 garLoopResultBuilder]: For program point pci_get_deviceFINAL(lines 3247 3249) no Hoare annotation was computed. [2022-02-20 22:09:47,977 INFO L861 garLoopResultBuilder]: At program point pci_dev_putENTRY(lines 3244 3246) the Hoare annotation is: true [2022-02-20 22:09:47,977 INFO L858 garLoopResultBuilder]: For program point pci_dev_putEXIT(lines 3244 3246) no Hoare annotation was computed. [2022-02-20 22:09:47,977 INFO L858 garLoopResultBuilder]: For program point pci_dev_putFINAL(lines 3244 3246) no Hoare annotation was computed. [2022-02-20 22:09:47,977 INFO L858 garLoopResultBuilder]: For program point L3041(lines 3041 3072) no Hoare annotation was computed. [2022-02-20 22:09:47,978 INFO L861 garLoopResultBuilder]: At program point L3075(line 3075) the Hoare annotation is: true [2022-02-20 22:09:47,978 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 22:09:47,978 INFO L854 garLoopResultBuilder]: At program point L2877(lines 2871 2879) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,978 INFO L858 garLoopResultBuilder]: For program point L3043(lines 3043 3069) no Hoare annotation was computed. [2022-02-20 22:09:47,978 INFO L858 garLoopResultBuilder]: For program point L2961(lines 2961 2966) no Hoare annotation was computed. [2022-02-20 22:09:47,978 INFO L854 garLoopResultBuilder]: At program point L2895(lines 2889 2897) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,978 INFO L854 garLoopResultBuilder]: At program point L3242(lines 3241 3243) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,978 INFO L858 garLoopResultBuilder]: For program point L3044(line 3044) no Hoare annotation was computed. [2022-02-20 22:09:47,978 INFO L854 garLoopResultBuilder]: At program point L3077(lines 3033 3082) the Hoare annotation is: (= ~ldv_module_refcounter~0 (_ bv1 32)) [2022-02-20 22:09:47,978 INFO L854 garLoopResultBuilder]: At program point L3226(lines 3225 3227) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,978 INFO L854 garLoopResultBuilder]: At program point L3061(lines 3033 3082) the Hoare annotation is: (= ~ldv_module_refcounter~0 (_ bv1 32)) [2022-02-20 22:09:47,978 INFO L858 garLoopResultBuilder]: For program point L2929(lines 2929 2933) no Hoare annotation was computed. [2022-02-20 22:09:47,978 INFO L858 garLoopResultBuilder]: For program point L2929-2(lines 2920 2934) no Hoare annotation was computed. [2022-02-20 22:09:47,978 INFO L858 garLoopResultBuilder]: For program point L3045(lines 3045 3050) no Hoare annotation was computed. [2022-02-20 22:09:47,978 INFO L858 garLoopResultBuilder]: For program point L2979-1(line 2979) no Hoare annotation was computed. [2022-02-20 22:09:47,979 INFO L854 garLoopResultBuilder]: At program point L2979(line 2979) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,979 INFO L858 garLoopResultBuilder]: For program point L2963-1(line 2963) no Hoare annotation was computed. [2022-02-20 22:09:47,979 INFO L854 garLoopResultBuilder]: At program point L2930(line 2930) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,979 INFO L854 garLoopResultBuilder]: At program point L2963(line 2963) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,979 INFO L858 garLoopResultBuilder]: For program point L2930-1(line 2930) no Hoare annotation was computed. [2022-02-20 22:09:47,979 INFO L854 garLoopResultBuilder]: At program point L3211(lines 3210 3212) the Hoare annotation is: (= ~ldv_module_refcounter~0 (_ bv1 32)) [2022-02-20 22:09:47,979 INFO L858 garLoopResultBuilder]: For program point L3013-1(line 3013) no Hoare annotation was computed. [2022-02-20 22:09:47,979 INFO L854 garLoopResultBuilder]: At program point L3013(line 3013) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,979 INFO L858 garLoopResultBuilder]: For program point L2931-1(line 2931) no Hoare annotation was computed. [2022-02-20 22:09:47,979 INFO L854 garLoopResultBuilder]: At program point L2931(line 2931) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,979 INFO L854 garLoopResultBuilder]: At program point L3014(lines 2942 3016) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,979 INFO L858 garLoopResultBuilder]: For program point L2981(lines 2981 2988) no Hoare annotation was computed. [2022-02-20 22:09:47,979 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 22:09:47,979 INFO L854 garLoopResultBuilder]: At program point L3196(lines 3195 3197) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,979 INFO L854 garLoopResultBuilder]: At program point L2734(lines 2730 2736) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,979 INFO L861 garLoopResultBuilder]: At program point L3081(lines 3029 3083) the Hoare annotation is: true [2022-02-20 22:09:47,980 INFO L854 garLoopResultBuilder]: At program point L2982(line 2982) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,980 INFO L854 garLoopResultBuilder]: At program point L2982-1(line 2982) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,980 INFO L854 garLoopResultBuilder]: At program point L3230(lines 3229 3231) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,980 INFO L854 garLoopResultBuilder]: At program point L2751(lines 2746 2753) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,980 INFO L854 garLoopResultBuilder]: At program point L3214(lines 3213 3215) the Hoare annotation is: (= ~ldv_module_refcounter~0 (_ bv1 32)) [2022-02-20 22:09:47,980 INFO L858 garLoopResultBuilder]: For program point L2983(line 2983) no Hoare annotation was computed. [2022-02-20 22:09:47,980 INFO L854 garLoopResultBuilder]: At program point L3000(line 3000) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,980 INFO L858 garLoopResultBuilder]: For program point L3000-1(line 3000) no Hoare annotation was computed. [2022-02-20 22:09:47,980 INFO L854 garLoopResultBuilder]: At program point L2868(lines 2862 2870) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,980 INFO L858 garLoopResultBuilder]: For program point L2951-1(line 2951) no Hoare annotation was computed. [2022-02-20 22:09:47,980 INFO L854 garLoopResultBuilder]: At program point L2951(line 2951) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,980 INFO L854 garLoopResultBuilder]: At program point L3199(lines 3198 3200) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,980 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 22:09:47,980 INFO L858 garLoopResultBuilder]: For program point L3067(line 3067) no Hoare annotation was computed. [2022-02-20 22:09:47,980 INFO L858 garLoopResultBuilder]: For program point L3001(lines 3001 3005) no Hoare annotation was computed. [2022-02-20 22:09:47,980 INFO L858 garLoopResultBuilder]: For program point L3001-2(lines 2950 3015) no Hoare annotation was computed. [2022-02-20 22:09:47,981 INFO L854 garLoopResultBuilder]: At program point L2952(line 2952) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,981 INFO L858 garLoopResultBuilder]: For program point L2985-1(line 2985) no Hoare annotation was computed. [2022-02-20 22:09:47,981 INFO L854 garLoopResultBuilder]: At program point L2985(line 2985) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,981 INFO L854 garLoopResultBuilder]: At program point L2886(lines 2880 2888) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,981 INFO L858 garLoopResultBuilder]: For program point L2952-1(line 2952) no Hoare annotation was computed. [2022-02-20 22:09:47,981 INFO L861 garLoopResultBuilder]: At program point L3068(line 3068) the Hoare annotation is: true [2022-02-20 22:09:47,981 INFO L854 garLoopResultBuilder]: At program point L2936(lines 2911 2938) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,981 INFO L858 garLoopResultBuilder]: For program point L3052(line 3052) no Hoare annotation was computed. [2022-02-20 22:09:47,981 INFO L858 garLoopResultBuilder]: For program point L2953-1(lines 2950 3015) no Hoare annotation was computed. [2022-02-20 22:09:47,981 INFO L858 garLoopResultBuilder]: For program point L2920(lines 2920 2934) no Hoare annotation was computed. [2022-02-20 22:09:47,981 INFO L854 garLoopResultBuilder]: At program point L2953(line 2953) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,981 INFO L854 garLoopResultBuilder]: At program point L3234(lines 3233 3235) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,981 INFO L858 garLoopResultBuilder]: For program point L2970(lines 2970 2990) no Hoare annotation was computed. [2022-02-20 22:09:47,981 INFO L858 garLoopResultBuilder]: For program point L3003-1(line 3003) no Hoare annotation was computed. [2022-02-20 22:09:47,981 INFO L854 garLoopResultBuilder]: At program point L3003(line 3003) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,981 INFO L858 garLoopResultBuilder]: For program point L2970-2(lines 2970 2990) no Hoare annotation was computed. [2022-02-20 22:09:47,982 INFO L854 garLoopResultBuilder]: At program point L3218(lines 3217 3219) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,985 INFO L858 garLoopResultBuilder]: For program point L3053(lines 3053 3065) no Hoare annotation was computed. [2022-02-20 22:09:47,985 INFO L858 garLoopResultBuilder]: For program point L2922(lines 2922 2926) no Hoare annotation was computed. [2022-02-20 22:09:47,985 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 22:09:47,985 INFO L861 garLoopResultBuilder]: At program point L3187-1(lines 3184 3193) the Hoare annotation is: true [2022-02-20 22:09:47,985 INFO L858 garLoopResultBuilder]: For program point L3187(lines 3187 3190) no Hoare annotation was computed. [2022-02-20 22:09:47,985 INFO L854 garLoopResultBuilder]: At program point L3022(line 3022) the Hoare annotation is: (= ~ldv_module_refcounter~0 (_ bv1 32)) [2022-02-20 22:09:47,985 INFO L858 garLoopResultBuilder]: For program point L3055(lines 3055 3058) no Hoare annotation was computed. [2022-02-20 22:09:47,985 INFO L854 garLoopResultBuilder]: At program point L2956(line 2956) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,985 INFO L858 garLoopResultBuilder]: For program point L3022-1(line 3022) no Hoare annotation was computed. [2022-02-20 22:09:47,985 INFO L858 garLoopResultBuilder]: For program point L3055-2(lines 3053 3064) no Hoare annotation was computed. [2022-02-20 22:09:47,985 INFO L858 garLoopResultBuilder]: For program point L2923-1(line 2923) no Hoare annotation was computed. [2022-02-20 22:09:47,985 INFO L858 garLoopResultBuilder]: For program point L2956-1(line 2956) no Hoare annotation was computed. [2022-02-20 22:09:47,985 INFO L854 garLoopResultBuilder]: At program point L2923(line 2923) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,985 INFO L858 garLoopResultBuilder]: For program point L3039(lines 3039 3076) no Hoare annotation was computed. [2022-02-20 22:09:47,985 INFO L854 garLoopResultBuilder]: At program point L3188(line 3188) the Hoare annotation is: false [2022-02-20 22:09:47,985 INFO L854 garLoopResultBuilder]: At program point L3023(lines 3017 3025) the Hoare annotation is: (= ~ldv_module_refcounter~0 (_ bv1 32)) [2022-02-20 22:09:47,986 INFO L854 garLoopResultBuilder]: At program point L2924(line 2924) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,986 INFO L858 garLoopResultBuilder]: For program point L2924-1(line 2924) no Hoare annotation was computed. [2022-02-20 22:09:47,986 INFO L854 garLoopResultBuilder]: At program point L3238(lines 3237 3239) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,986 INFO L858 garLoopResultBuilder]: For program point L3205-1(line 3205) no Hoare annotation was computed. [2022-02-20 22:09:47,986 INFO L854 garLoopResultBuilder]: At program point L3205(line 3205) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,986 INFO L854 garLoopResultBuilder]: At program point L3205-2(lines 3204 3206) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,986 INFO L858 garLoopResultBuilder]: For program point L3040(line 3040) no Hoare annotation was computed. [2022-02-20 22:09:47,986 INFO L854 garLoopResultBuilder]: At program point L3222(lines 3221 3223) the Hoare annotation is: (= ~ldv_module_refcounter~0 (_ bv1 32)) [2022-02-20 22:09:47,986 INFO L854 garLoopResultBuilder]: At program point L3255(lines 3254 3256) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,986 INFO L854 garLoopResultBuilder]: At program point L2743(lines 2739 2745) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,986 INFO L854 garLoopResultBuilder]: At program point L2727(lines 2724 2729) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_state_variable_0~0) (= ~ldv_module_refcounter~0 (_ bv1 32))) [2022-02-20 22:09:47,986 INFO L858 garLoopResultBuilder]: For program point L3074(line 3074) no Hoare annotation was computed. [2022-02-20 22:09:47,989 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 22:09:47,990 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 22:09:47,992 WARN L170 areAnnotationChecker]: iounmapFINAL has no Hoare annotation [2022-02-20 22:09:47,992 WARN L170 areAnnotationChecker]: L2784 has no Hoare annotation [2022-02-20 22:09:47,992 WARN L170 areAnnotationChecker]: ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-02-20 22:09:47,992 WARN L170 areAnnotationChecker]: ldv_errorFINAL has no Hoare annotation [2022-02-20 22:09:47,992 WARN L170 areAnnotationChecker]: inlFINAL has no Hoare annotation [2022-02-20 22:09:47,992 WARN L170 areAnnotationChecker]: pci_dev_putFINAL has no Hoare annotation [2022-02-20 22:09:47,992 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 22:09:47,992 WARN L170 areAnnotationChecker]: L2775 has no Hoare annotation [2022-02-20 22:09:47,992 WARN L170 areAnnotationChecker]: outlFINAL has no Hoare annotation [2022-02-20 22:09:47,992 WARN L170 areAnnotationChecker]: iounmapFINAL has no Hoare annotation [2022-02-20 22:09:47,992 WARN L170 areAnnotationChecker]: L2784 has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: L2784 has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: L3202-1 has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: ldv_errorFINAL has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: L3248-1 has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: inlFINAL has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: pci_dev_putFINAL has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: L2775 has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: L2775 has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: outlFINAL has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: iounmapEXIT has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: iounmapEXIT has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: iounmapEXIT has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: ldv_mallocFINAL has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: L2789-1 has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: L3202-1 has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: ldv_errorEXIT has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: L3248-1 has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: inlEXIT has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: inlEXIT has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: pci_dev_putEXIT has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: pci_dev_putEXIT has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: pci_dev_putEXIT has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: pci_dev_putEXIT has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: pci_dev_putEXIT has no Hoare annotation [2022-02-20 22:09:47,993 WARN L170 areAnnotationChecker]: pci_dev_putEXIT has no Hoare annotation [2022-02-20 22:09:47,994 WARN L170 areAnnotationChecker]: L2775-2 has no Hoare annotation [2022-02-20 22:09:47,994 WARN L170 areAnnotationChecker]: outlEXIT has no Hoare annotation [2022-02-20 22:09:47,994 WARN L170 areAnnotationChecker]: outlEXIT has no Hoare annotation [2022-02-20 22:09:47,994 WARN L170 areAnnotationChecker]: L3022-1 has no Hoare annotation [2022-02-20 22:09:47,994 WARN L170 areAnnotationChecker]: L2985-1 has no Hoare annotation [2022-02-20 22:09:47,994 WARN L170 areAnnotationChecker]: L3013-1 has no Hoare annotation [2022-02-20 22:09:47,994 WARN L170 areAnnotationChecker]: ldv_mallocEXIT has no Hoare annotation [2022-02-20 22:09:47,994 WARN L170 areAnnotationChecker]: ldv_mallocEXIT has no Hoare annotation [2022-02-20 22:09:47,994 WARN L170 areAnnotationChecker]: ldv_mallocEXIT has no Hoare annotation [2022-02-20 22:09:47,994 WARN L170 areAnnotationChecker]: L2789-1 has no Hoare annotation [2022-02-20 22:09:47,994 WARN L170 areAnnotationChecker]: do_map_probeFINAL has no Hoare annotation [2022-02-20 22:09:47,994 WARN L170 areAnnotationChecker]: pci_get_deviceFINAL has no Hoare annotation [2022-02-20 22:09:47,994 WARN L170 areAnnotationChecker]: L2923-1 has no Hoare annotation [2022-02-20 22:09:47,994 WARN L170 areAnnotationChecker]: L2930-1 has no Hoare annotation [2022-02-20 22:09:47,994 WARN L170 areAnnotationChecker]: L2953-1 has no Hoare annotation [2022-02-20 22:09:47,995 WARN L170 areAnnotationChecker]: L2953-1 has no Hoare annotation [2022-02-20 22:09:47,995 WARN L170 areAnnotationChecker]: L2956-1 has no Hoare annotation [2022-02-20 22:09:47,995 WARN L170 areAnnotationChecker]: L2963-1 has no Hoare annotation [2022-02-20 22:09:47,995 WARN L170 areAnnotationChecker]: L2979-1 has no Hoare annotation [2022-02-20 22:09:47,995 WARN L170 areAnnotationChecker]: L2983 has no Hoare annotation [2022-02-20 22:09:47,995 WARN L170 areAnnotationChecker]: L2983 has no Hoare annotation [2022-02-20 22:09:47,995 WARN L170 areAnnotationChecker]: L3040 has no Hoare annotation [2022-02-20 22:09:47,995 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 22:09:47,995 WARN L170 areAnnotationChecker]: L2924-1 has no Hoare annotation [2022-02-20 22:09:47,995 WARN L170 areAnnotationChecker]: L2931-1 has no Hoare annotation [2022-02-20 22:09:47,995 WARN L170 areAnnotationChecker]: L3055 has no Hoare annotation [2022-02-20 22:09:47,995 WARN L170 areAnnotationChecker]: L3205-1 has no Hoare annotation [2022-02-20 22:09:47,995 WARN L170 areAnnotationChecker]: do_map_probeEXIT has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: do_map_probeEXIT has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: pci_get_deviceEXIT has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: pci_get_deviceEXIT has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L2924-1 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L2931-1 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L2956-1 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L3205-1 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L2981 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L2985-1 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L3040 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L3040 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L2929-2 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L3187 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L3055 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L3055 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L2961 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L3000-1 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L3003-1 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L2951-1 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L2952-1 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L2981 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L2981 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L3041 has no Hoare annotation [2022-02-20 22:09:47,996 WARN L170 areAnnotationChecker]: L3041 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L3074 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L3074 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L3187 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L3187 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L3055-2 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L3055-2 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L2961 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L2961 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L3001 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L3001 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L3001-2 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L3001-2 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L2952-1 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L2953-1 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L2970-2 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L3044 has no Hoare annotation [2022-02-20 22:09:47,997 WARN L170 areAnnotationChecker]: L3044 has no Hoare annotation [2022-02-20 22:09:47,998 WARN L170 areAnnotationChecker]: L3039 has no Hoare annotation [2022-02-20 22:09:47,998 WARN L170 areAnnotationChecker]: L3039 has no Hoare annotation [2022-02-20 22:09:47,998 WARN L170 areAnnotationChecker]: L2963-1 has no Hoare annotation [2022-02-20 22:09:47,998 WARN L170 areAnnotationChecker]: L2970 has no Hoare annotation [2022-02-20 22:09:47,998 WARN L170 areAnnotationChecker]: L3003-1 has no Hoare annotation [2022-02-20 22:09:47,998 WARN L170 areAnnotationChecker]: L3013-1 has no Hoare annotation [2022-02-20 22:09:47,999 WARN L170 areAnnotationChecker]: L3045 has no Hoare annotation [2022-02-20 22:09:47,999 WARN L170 areAnnotationChecker]: L3045 has no Hoare annotation [2022-02-20 22:09:47,999 WARN L170 areAnnotationChecker]: L3052 has no Hoare annotation [2022-02-20 22:09:47,999 WARN L170 areAnnotationChecker]: L3052 has no Hoare annotation [2022-02-20 22:09:47,999 WARN L170 areAnnotationChecker]: L2970 has no Hoare annotation [2022-02-20 22:09:47,999 WARN L170 areAnnotationChecker]: L2970 has no Hoare annotation [2022-02-20 22:09:48,000 WARN L170 areAnnotationChecker]: L3053 has no Hoare annotation [2022-02-20 22:09:48,000 WARN L170 areAnnotationChecker]: L3053 has no Hoare annotation [2022-02-20 22:09:48,000 WARN L170 areAnnotationChecker]: L3067 has no Hoare annotation [2022-02-20 22:09:48,000 WARN L170 areAnnotationChecker]: L3067 has no Hoare annotation [2022-02-20 22:09:48,001 WARN L170 areAnnotationChecker]: L2951-1 has no Hoare annotation [2022-02-20 22:09:48,001 WARN L170 areAnnotationChecker]: L3043 has no Hoare annotation [2022-02-20 22:09:48,001 WARN L170 areAnnotationChecker]: L3043 has no Hoare annotation [2022-02-20 22:09:48,004 WARN L170 areAnnotationChecker]: L3022-1 has no Hoare annotation [2022-02-20 22:09:48,004 WARN L170 areAnnotationChecker]: L3000-1 has no Hoare annotation [2022-02-20 22:09:48,004 WARN L170 areAnnotationChecker]: L2979-1 has no Hoare annotation [2022-02-20 22:09:48,005 WARN L170 areAnnotationChecker]: L2920 has no Hoare annotation [2022-02-20 22:09:48,005 WARN L170 areAnnotationChecker]: L2920 has no Hoare annotation [2022-02-20 22:09:48,005 WARN L170 areAnnotationChecker]: L2920 has no Hoare annotation [2022-02-20 22:09:48,005 WARN L170 areAnnotationChecker]: L2922 has no Hoare annotation [2022-02-20 22:09:48,005 WARN L170 areAnnotationChecker]: L2922 has no Hoare annotation [2022-02-20 22:09:48,005 WARN L170 areAnnotationChecker]: L2929 has no Hoare annotation [2022-02-20 22:09:48,005 WARN L170 areAnnotationChecker]: L2929 has no Hoare annotation [2022-02-20 22:09:48,005 WARN L170 areAnnotationChecker]: L2923-1 has no Hoare annotation [2022-02-20 22:09:48,005 WARN L170 areAnnotationChecker]: L2930-1 has no Hoare annotation [2022-02-20 22:09:48,005 INFO L163 areAnnotationChecker]: CFG has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 22:09:48,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 10:09:48 BoogieIcfgContainer [2022-02-20 22:09:48,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 22:09:48,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 22:09:48,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 22:09:48,016 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 22:09:48,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:09:39" (3/4) ... [2022-02-20 22:09:48,018 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 22:09:48,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure iounmap [2022-02-20 22:09:48,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-02-20 22:09:48,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure do_map_probe [2022-02-20 22:09:48,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2022-02-20 22:09:48,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pci_get_device [2022-02-20 22:09:48,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inl [2022-02-20 22:09:48,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pci_dev_put [2022-02-20 22:09:48,022 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2022-02-20 22:09:48,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 22:09:48,023 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure outl [2022-02-20 22:09:48,030 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 78 nodes and edges [2022-02-20 22:09:48,030 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-02-20 22:09:48,031 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 22:09:48,031 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 22:09:48,032 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 22:09:48,076 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 22:09:48,076 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 22:09:48,077 INFO L158 Benchmark]: Toolchain (without parser) took 11189.10ms. Allocated memory was 69.2MB in the beginning and 144.7MB in the end (delta: 75.5MB). Free memory was 44.1MB in the beginning and 42.6MB in the end (delta: 1.6MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. [2022-02-20 22:09:48,077 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 69.2MB. Free memory was 49.6MB in the beginning and 49.6MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 22:09:48,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 669.45ms. Allocated memory was 69.2MB in the beginning and 98.6MB in the end (delta: 29.4MB). Free memory was 43.9MB in the beginning and 70.0MB in the end (delta: -26.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-02-20 22:09:48,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.36ms. Allocated memory is still 98.6MB. Free memory was 70.0MB in the beginning and 65.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 22:09:48,078 INFO L158 Benchmark]: Boogie Preprocessor took 75.36ms. Allocated memory is still 98.6MB. Free memory was 65.0MB in the beginning and 60.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 22:09:48,078 INFO L158 Benchmark]: RCFGBuilder took 1931.17ms. Allocated memory is still 98.6MB. Free memory was 60.1MB in the beginning and 47.0MB in the end (delta: 13.1MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2022-02-20 22:09:48,078 INFO L158 Benchmark]: TraceAbstraction took 8359.21ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 46.5MB in the beginning and 52.0MB in the end (delta: -5.5MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. [2022-02-20 22:09:48,078 INFO L158 Benchmark]: Witness Printer took 60.85ms. Allocated memory is still 144.7MB. Free memory was 52.0MB in the beginning and 42.6MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 22:09:48,079 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.16ms. Allocated memory is still 69.2MB. Free memory was 49.6MB in the beginning and 49.6MB in the end (delta: 31.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 669.45ms. Allocated memory was 69.2MB in the beginning and 98.6MB in the end (delta: 29.4MB). Free memory was 43.9MB in the beginning and 70.0MB in the end (delta: -26.1MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.36ms. Allocated memory is still 98.6MB. Free memory was 70.0MB in the beginning and 65.0MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.36ms. Allocated memory is still 98.6MB. Free memory was 65.0MB in the beginning and 60.1MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1931.17ms. Allocated memory is still 98.6MB. Free memory was 60.1MB in the beginning and 47.0MB in the end (delta: 13.1MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8359.21ms. Allocated memory was 98.6MB in the beginning and 144.7MB in the end (delta: 46.1MB). Free memory was 46.5MB in the beginning and 52.0MB in the end (delta: -5.5MB). Peak memory consumption was 40.6MB. Max. memory is 16.1GB. * Witness Printer took 60.85ms. Allocated memory is still 144.7MB. Free memory was 52.0MB in the beginning and 42.6MB in the end (delta: 9.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: 3089]: 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 11 procedures, 131 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 257 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 257 mSDsluCounter, 779 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 322 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 457 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=2, InterpolantAutomatonStates: 11, 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, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 62 LocationsWithAnnotation, 142 PreInvPairs, 193 NumberOfFragments, 298 HoareAnnotationTreeSize, 142 FomulaSimplifications, 8 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 62 FomulaSimplificationsInter, 176 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 217 SizeOfPredicates, 1 NumberOfNonLiveVariables, 590 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 24/24 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: 3225]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 2730]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3029]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3221]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1bv32 - InvariantResult [Line: 2871]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 2942]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3033]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3204]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 2746]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3254]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3229]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 2739]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3213]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3217]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 2846]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2862]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3195]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3198]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3017]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1bv32 - InvariantResult [Line: 2880]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3241]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3237]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3033]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1bv32 - InvariantResult [Line: 2724]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3184]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2911]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3210]: Loop Invariant Derived loop invariant: ldv_module_refcounter == 1bv32 - InvariantResult [Line: 2889]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 - InvariantResult [Line: 3233]: Loop Invariant Derived loop invariant: 1bv32 == ldv_state_variable_0 && ldv_module_refcounter == 1bv32 RESULT: Ultimate proved your program to be correct! [2022-02-20 22:09:48,127 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