./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5fbdf5bf 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff7833c0ca06ba6ba2d91b85f43d4c4452421700 .......................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ff7833c0ca06ba6ba2d91b85f43d4c4452421700 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: HoareTripleChecker results differ between SdHoareTripleChecker (result: INVALID) and MonolithicHoareTripleChecker (result: VALID) --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 23:46:58,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 23:46:58,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 23:46:58,710 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 23:46:58,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 23:46:58,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 23:46:58,712 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 23:46:58,714 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 23:46:58,715 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 23:46:58,716 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 23:46:58,717 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 23:46:58,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 23:46:58,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 23:46:58,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 23:46:58,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 23:46:58,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 23:46:58,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 23:46:58,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 23:46:58,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 23:46:58,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 23:46:58,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 23:46:58,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 23:46:58,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 23:46:58,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 23:46:58,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 23:46:58,729 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 23:46:58,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 23:46:58,740 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 23:46:58,740 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 23:46:58,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 23:46:58,741 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 23:46:58,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 23:46:58,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 23:46:58,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 23:46:58,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 23:46:58,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 23:46:58,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 23:46:58,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 23:46:58,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 23:46:58,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 23:46:58,744 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 23:46:58,748 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-09-13 23:46:58,770 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 23:46:58,770 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 23:46:58,771 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 23:46:58,771 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 23:46:58,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 23:46:58,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 23:46:58,772 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 23:46:58,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 23:46:58,773 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 23:46:58,773 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-09-13 23:46:58,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 23:46:58,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 23:46:58,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 23:46:58,774 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-09-13 23:46:58,774 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-09-13 23:46:58,774 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-09-13 23:46:58,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 23:46:58,774 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-09-13 23:46:58,774 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 23:46:58,775 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 23:46:58,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 23:46:58,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 23:46:58,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 23:46:58,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 23:46:58,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 23:46:58,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 23:46:58,776 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 23:46:58,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 23:46:58,776 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 23:46:58,776 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff7833c0ca06ba6ba2d91b85f43d4c4452421700 [2021-09-13 23:46:58,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 23:46:59,002 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 23:46:59,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 23:46:59,004 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 23:46:59,005 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 23:46:59,006 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2021-09-13 23:46:59,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aea2f1bc/4ed2ce04726c4d2dbeebcc970d83d4e7/FLAG1afd75c78 [2021-09-13 23:46:59,488 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 23:46:59,488 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2021-09-13 23:46:59,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aea2f1bc/4ed2ce04726c4d2dbeebcc970d83d4e7/FLAG1afd75c78 [2021-09-13 23:46:59,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6aea2f1bc/4ed2ce04726c4d2dbeebcc970d83d4e7 [2021-09-13 23:46:59,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 23:46:59,516 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-09-13 23:46:59,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 23:46:59,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 23:46:59,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 23:46:59,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:46:59" (1/1) ... [2021-09-13 23:46:59,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31125229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:46:59, skipping insertion in model container [2021-09-13 23:46:59,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:46:59" (1/1) ... [2021-09-13 23:46:59,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 23:46:59,559 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 23:46:59,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 23:46:59,892 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.IllegalArgumentException: This array type is incomplete! Cannot extract actual dimensions. at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.getConstantFirstDimensionOfArray(CTranslationUtil.java:210) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.constructIndexToInitInfo(InitializationHandler.java:1272) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.constructInitializerInfo(InitializationHandler.java:1228) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:236) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:207) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:790) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:208) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:607) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) 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) [2021-09-13 23:46:59,896 INFO L158 Benchmark]: Toolchain (without parser) took 379.23ms. Allocated memory is still 71.3MB. Free memory was 51.8MB in the beginning and 48.8MB in the end (delta: 3.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 23:46:59,897 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory was 51.9MB in the beginning and 51.8MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 23:46:59,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 377.56ms. Allocated memory is still 71.3MB. Free memory was 51.6MB in the beginning and 48.8MB in the end (delta: 2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-09-13 23:46:59,898 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 71.3MB. Free memory was 51.9MB in the beginning and 51.8MB in the end (delta: 94.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 377.56ms. Allocated memory is still 71.3MB. Free memory was 51.6MB in the beginning and 48.8MB in the end (delta: 2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: IllegalArgumentException: This array type is incomplete! Cannot extract actual dimensions. de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: IllegalArgumentException: This array type is incomplete! Cannot extract actual dimensions.: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.getConstantFirstDimensionOfArray(CTranslationUtil.java:210) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-09-13 23:47:01,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 23:47:01,217 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 23:47:01,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 23:47:01,237 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 23:47:01,238 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 23:47:01,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 23:47:01,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 23:47:01,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 23:47:01,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 23:47:01,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 23:47:01,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 23:47:01,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 23:47:01,250 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 23:47:01,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 23:47:01,252 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 23:47:01,252 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 23:47:01,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 23:47:01,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 23:47:01,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 23:47:01,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 23:47:01,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 23:47:01,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 23:47:01,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 23:47:01,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 23:47:01,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 23:47:01,265 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 23:47:01,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 23:47:01,267 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 23:47:01,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 23:47:01,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 23:47:01,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 23:47:01,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 23:47:01,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 23:47:01,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 23:47:01,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 23:47:01,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 23:47:01,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 23:47:01,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 23:47:01,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 23:47:01,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 23:47:01,278 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-09-13 23:47:01,296 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 23:47:01,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 23:47:01,297 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 23:47:01,297 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 23:47:01,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 23:47:01,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 23:47:01,298 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 23:47:01,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 23:47:01,299 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 23:47:01,299 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-09-13 23:47:01,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 23:47:01,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 23:47:01,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 23:47:01,299 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-09-13 23:47:01,300 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-09-13 23:47:01,300 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-09-13 23:47:01,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 23:47:01,300 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-09-13 23:47:01,300 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-09-13 23:47:01,300 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-09-13 23:47:01,301 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 23:47:01,301 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 23:47:01,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 23:47:01,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 23:47:01,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 23:47:01,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 23:47:01,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 23:47:01,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 23:47:01,302 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-09-13 23:47:01,302 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-09-13 23:47:01,302 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 23:47:01,302 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-09-13 23:47:01,303 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ff7833c0ca06ba6ba2d91b85f43d4c4452421700 [2021-09-13 23:47:01,542 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 23:47:01,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 23:47:01,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 23:47:01,558 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 23:47:01,558 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 23:47:01,559 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2021-09-13 23:47:01,601 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2024f591/5bf6bee93cc044cc945bf054038059cf/FLAGa00582986 [2021-09-13 23:47:01,997 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 23:47:01,998 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2021-09-13 23:47:02,007 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2024f591/5bf6bee93cc044cc945bf054038059cf/FLAGa00582986 [2021-09-13 23:47:02,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2024f591/5bf6bee93cc044cc945bf054038059cf [2021-09-13 23:47:02,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 23:47:02,022 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-09-13 23:47:02,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 23:47:02,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 23:47:02,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 23:47:02,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:47:02" (1/1) ... [2021-09-13 23:47:02,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e9304d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:02, skipping insertion in model container [2021-09-13 23:47:02,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:47:02" (1/1) ... [2021-09-13 23:47:02,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 23:47:02,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 23:47:02,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 23:47:02,470 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-09-13 23:47:02,478 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 23:47:02,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 23:47:02,564 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 23:47:02,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 23:47:02,649 INFO L208 MainTranslator]: Completed translation [2021-09-13 23:47:02,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:02 WrapperNode [2021-09-13 23:47:02,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 23:47:02,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 23:47:02,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 23:47:02,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 23:47:02,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:02" (1/1) ... [2021-09-13 23:47:02,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:02" (1/1) ... [2021-09-13 23:47:02,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:02" (1/1) ... [2021-09-13 23:47:02,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:02" (1/1) ... [2021-09-13 23:47:02,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:02" (1/1) ... [2021-09-13 23:47:02,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:02" (1/1) ... [2021-09-13 23:47:02,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:02" (1/1) ... [2021-09-13 23:47:02,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 23:47:02,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 23:47:02,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 23:47:02,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 23:47:02,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:02" (1/1) ... [2021-09-13 23:47:02,756 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 23:47:02,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 23:47:02,773 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) [2021-09-13 23:47:02,796 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 [2021-09-13 23:47:02,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-09-13 23:47:02,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 23:47:02,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-09-13 23:47:02,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~C_INT [2021-09-13 23:47:02,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-09-13 23:47:02,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-09-13 23:47:02,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-09-13 23:47:02,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-09-13 23:47:02,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-09-13 23:47:02,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-09-13 23:47:02,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2021-09-13 23:47:02,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2021-09-13 23:47:02,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-09-13 23:47:02,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-09-13 23:47:02,811 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2021-09-13 23:47:02,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2021-09-13 23:47:02,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2021-09-13 23:47:02,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2021-09-13 23:47:02,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2021-09-13 23:47:02,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2021-09-13 23:47:02,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2021-09-13 23:47:02,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2021-09-13 23:47:02,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2021-09-13 23:47:02,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2021-09-13 23:47:02,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2021-09-13 23:47:02,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2021-09-13 23:47:02,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2021-09-13 23:47:02,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2021-09-13 23:47:02,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2021-09-13 23:47:02,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2021-09-13 23:47:02,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2021-09-13 23:47:02,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2021-09-13 23:47:02,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2021-09-13 23:47:02,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2021-09-13 23:47:02,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2021-09-13 23:47:02,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2021-09-13 23:47:02,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2021-09-13 23:47:02,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2021-09-13 23:47:02,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2021-09-13 23:47:02,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2021-09-13 23:47:02,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2021-09-13 23:47:02,814 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2021-09-13 23:47:02,815 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2021-09-13 23:47:02,815 INFO L138 BoogieDeclarations]: Found implementation of procedure fetch_item [2021-09-13 23:47:02,815 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_register_report [2021-09-13 23:47:02,815 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_parser_main [2021-09-13 23:47:02,815 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2021-09-13 23:47:02,815 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_open_report [2021-09-13 23:47:02,815 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_device [2021-09-13 23:47:02,815 INFO L138 BoogieDeclarations]: Found implementation of procedure probe_23 [2021-09-13 23:47:02,815 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_23 [2021-09-13 23:47:02,816 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2021-09-13 23:47:02,816 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-09-13 23:47:02,816 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-09-13 23:47:02,816 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-09-13 23:47:02,816 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-09-13 23:47:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-09-13 23:47:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-09-13 23:47:02,816 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-09-13 23:47:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-09-13 23:47:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-09-13 23:47:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-09-13 23:47:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-09-13 23:47:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-09-13 23:47:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-09-13 23:47:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-09-13 23:47:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-09-13 23:47:02,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-09-13 23:47:02,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-09-13 23:47:02,818 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-09-13 23:47:02,818 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-09-13 23:47:02,818 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-09-13 23:47:02,818 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-09-13 23:47:02,818 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-09-13 23:47:02,818 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-09-13 23:47:02,818 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-09-13 23:47:02,818 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-09-13 23:47:02,819 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-09-13 23:47:02,819 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-09-13 23:47:02,819 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-09-13 23:47:02,819 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-09-13 23:47:02,819 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-09-13 23:47:02,819 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-09-13 23:47:02,819 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-09-13 23:47:02,819 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-09-13 23:47:02,819 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-09-13 23:47:02,820 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-09-13 23:47:02,820 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-09-13 23:47:02,820 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-09-13 23:47:02,820 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-09-13 23:47:02,820 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-09-13 23:47:02,820 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-09-13 23:47:02,820 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-09-13 23:47:02,820 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-09-13 23:47:02,820 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-09-13 23:47:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-09-13 23:47:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-09-13 23:47:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-09-13 23:47:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-09-13 23:47:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-09-13 23:47:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-09-13 23:47:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-09-13 23:47:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-09-13 23:47:02,821 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-09-13 23:47:02,822 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-09-13 23:47:02,822 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-09-13 23:47:02,822 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-09-13 23:47:02,822 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-09-13 23:47:02,822 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-09-13 23:47:02,822 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-09-13 23:47:02,822 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-09-13 23:47:02,822 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-09-13 23:47:02,822 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-09-13 23:47:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-09-13 23:47:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-09-13 23:47:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-09-13 23:47:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-09-13 23:47:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-09-13 23:47:02,823 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-09-13 23:47:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-09-13 23:47:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-09-13 23:47:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-09-13 23:47:02,824 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-09-13 23:47:02,825 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-09-13 23:47:02,827 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-09-13 23:47:02,827 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-09-13 23:47:02,827 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-09-13 23:47:02,827 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-09-13 23:47:02,828 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-09-13 23:47:02,828 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-09-13 23:47:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-09-13 23:47:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-09-13 23:47:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-09-13 23:47:02,831 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-09-13 23:47:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-09-13 23:47:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-09-13 23:47:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-09-13 23:47:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-09-13 23:47:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-09-13 23:47:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-09-13 23:47:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-09-13 23:47:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-09-13 23:47:02,832 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-09-13 23:47:02,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-09-13 23:47:02,833 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-09-13 23:47:02,833 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-09-13 23:47:02,833 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-09-13 23:47:02,833 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-09-13 23:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-09-13 23:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-09-13 23:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-09-13 23:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-09-13 23:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-09-13 23:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-09-13 23:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-09-13 23:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-09-13 23:47:02,834 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-09-13 23:47:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-09-13 23:47:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-09-13 23:47:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-09-13 23:47:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-09-13 23:47:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-09-13 23:47:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-09-13 23:47:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-09-13 23:47:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-09-13 23:47:02,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2021-09-13 23:47:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2021-09-13 23:47:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2021-09-13 23:47:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2021-09-13 23:47:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-09-13 23:47:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-09-13 23:47:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-09-13 23:47:02,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-09-13 23:47:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2021-09-13 23:47:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-09-13 23:47:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2021-09-13 23:47:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2021-09-13 23:47:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2021-09-13 23:47:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-09-13 23:47:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2021-09-13 23:47:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2021-09-13 23:47:02,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2021-09-13 23:47:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2021-09-13 23:47:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-09-13 23:47:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2021-09-13 23:47:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-09-13 23:47:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2021-09-13 23:47:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2021-09-13 23:47:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2021-09-13 23:47:02,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2021-09-13 23:47:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2021-09-13 23:47:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-09-13 23:47:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-09-13 23:47:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2021-09-13 23:47:02,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2021-09-13 23:47:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-09-13 23:47:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2021-09-13 23:47:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2021-09-13 23:47:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2021-09-13 23:47:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2021-09-13 23:47:02,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2021-09-13 23:47:02,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2021-09-13 23:47:02,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2021-09-13 23:47:02,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2021-09-13 23:47:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2021-09-13 23:47:02,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2021-09-13 23:47:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2021-09-13 23:47:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-09-13 23:47:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure f [2021-09-13 23:47:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure g [2021-09-13 23:47:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure fetch_item [2021-09-13 23:47:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure hid_register_report [2021-09-13 23:47:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure hid_parser_main [2021-09-13 23:47:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2021-09-13 23:47:02,847 INFO L130 BoogieDeclarations]: Found specification of procedure hid_open_report [2021-09-13 23:47:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 23:47:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~C_INT [2021-09-13 23:47:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_device [2021-09-13 23:47:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure probe_23 [2021-09-13 23:47:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_23 [2021-09-13 23:47:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2021-09-13 23:47:02,848 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-09-13 23:47:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-09-13 23:47:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-09-13 23:47:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 23:47:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-09-13 23:47:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-09-13 23:47:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-09-13 23:47:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-09-13 23:47:02,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-09-13 23:47:03,465 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-09-13 23:47:03,719 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-09-13 23:47:03,823 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 23:47:03,823 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-09-13 23:47:03,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 11:47:03 BoogieIcfgContainer [2021-09-13 23:47:03,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 23:47:03,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 23:47:03,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 23:47:03,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 23:47:03,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 11:47:02" (1/3) ... [2021-09-13 23:47:03,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e4f1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 11:47:03, skipping insertion in model container [2021-09-13 23:47:03,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:47:02" (2/3) ... [2021-09-13 23:47:03,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e4f1f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 11:47:03, skipping insertion in model container [2021-09-13 23:47:03,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 11:47:03" (3/3) ... [2021-09-13 23:47:03,830 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test23_2.i [2021-09-13 23:47:03,833 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 23:47:03,833 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 127 error locations. [2021-09-13 23:47:03,859 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 23:47:03,863 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=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2021-09-13 23:47:03,863 INFO L340 AbstractCegarLoop]: Starting to check reachability of 127 error locations. [2021-09-13 23:47:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 343 states, 179 states have (on average 1.687150837988827) internal successors, (302), 282 states have internal predecessors, (302), 32 states have call successors, (32), 27 states have call predecessors, (32), 27 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2021-09-13 23:47:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 23:47:03,884 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 23:47:03,885 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 23:47:03,885 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION === [disconnect_deviceErr0REQUIRES_VIOLATION, disconnect_deviceErr1REQUIRES_VIOLATION, disconnect_deviceErr2REQUIRES_VIOLATION (and 124 more)] === [2021-09-13 23:47:03,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 23:47:03,888 INFO L82 PathProgramCache]: Analyzing trace with hash 537664467, now seen corresponding path program 1 times [2021-09-13 23:47:03,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 23:47:03,896 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106196482] [2021-09-13 23:47:03,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 23:47:03,897 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 23:47:03,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 23:47:03,898 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) [2021-09-13 23:47:03,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-09-13 23:47:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:04,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2021-09-13 23:47:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:04,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 23:47:04,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-09-13 23:47:04,331 INFO L264 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2021-09-13 23:47:04,332 INFO L281 TraceCheckUtils]: 1: Hoare triple {346#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~dispatch_type~0.base, ~dispatch_type~0.offset := ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.base(), ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.offset();call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {346#true} is VALID [2021-09-13 23:47:04,332 INFO L281 TraceCheckUtils]: 2: Hoare triple {346#true} assume true; {346#true} is VALID [2021-09-13 23:47:04,332 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {346#true} {346#true} #673#return; {346#true} is VALID [2021-09-13 23:47:04,332 INFO L264 TraceCheckUtils]: 4: Hoare triple {346#true} call main(); {346#true} is VALID [2021-09-13 23:47:04,332 INFO L264 TraceCheckUtils]: 5: Hoare triple {346#true} call entry_point(); {346#true} is VALID [2021-09-13 23:47:04,333 INFO L264 TraceCheckUtils]: 6: Hoare triple {346#true} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {346#true} is VALID [2021-09-13 23:47:04,333 INFO L281 TraceCheckUtils]: 7: Hoare triple {346#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {346#true} is VALID [2021-09-13 23:47:04,333 INFO L264 TraceCheckUtils]: 8: Hoare triple {346#true} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {346#true} is VALID [2021-09-13 23:47:04,333 INFO L281 TraceCheckUtils]: 9: Hoare triple {346#true} ~size := #in~size; {346#true} is VALID [2021-09-13 23:47:04,334 INFO L281 TraceCheckUtils]: 10: Hoare triple {346#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {381#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} is VALID [2021-09-13 23:47:04,335 INFO L281 TraceCheckUtils]: 11: Hoare triple {381#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} assume true; {381#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} is VALID [2021-09-13 23:47:04,336 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {381#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} {346#true} #595#return; {388#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| |probe_23_#t~ret61.base|)))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:04,336 INFO L281 TraceCheckUtils]: 13: Hoare triple {388#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| |probe_23_#t~ret61.base|)))))) (_ bv1 1)))} ~p~1.base, ~p~1.offset := #t~ret61.base, #t~ret61.offset;havoc #t~ret61.base, #t~ret61.offset; {392#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))))))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:04,337 INFO L281 TraceCheckUtils]: 14: Hoare triple {392#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))))))))) (_ bv1 1)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {392#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))))))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:04,338 INFO L264 TraceCheckUtils]: 15: Hoare triple {392#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))))))))) (_ bv1 1)))} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {399#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)))))))))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:04,338 INFO L281 TraceCheckUtils]: 16: Hoare triple {399#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)))))))))))) (_ bv1 1)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {403#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| LDV_INIT_LIST_HEAD_~list.base))))))))))))))} is VALID [2021-09-13 23:47:04,339 INFO L281 TraceCheckUtils]: 17: Hoare triple {403#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| LDV_INIT_LIST_HEAD_~list.base))))))))))))))} assume !(1bv1 == #valid[~list.base]); {347#false} is VALID [2021-09-13 23:47:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:04,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 23:47:04,545 INFO L281 TraceCheckUtils]: 17: Hoare triple {403#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| LDV_INIT_LIST_HEAD_~list.base))))))))))))))} assume !(1bv1 == #valid[~list.base]); {347#false} is VALID [2021-09-13 23:47:04,546 INFO L281 TraceCheckUtils]: 16: Hoare triple {399#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)))))))))))) (_ bv1 1)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {403#(= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| LDV_INIT_LIST_HEAD_~list.base))))))))))))))} is VALID [2021-09-13 23:47:04,547 INFO L264 TraceCheckUtils]: 15: Hoare triple {392#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))))))))) (_ bv1 1)))} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {399#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| |LDV_INIT_LIST_HEAD_#in~list.base|)))))))))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:04,547 INFO L281 TraceCheckUtils]: 14: Hoare triple {392#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))))))))) (_ bv1 1)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {392#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))))))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:04,548 INFO L281 TraceCheckUtils]: 13: Hoare triple {388#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| |probe_23_#t~ret61.base|)))))) (_ bv1 1)))} ~p~1.base, ~p~1.offset := #t~ret61.base, #t~ret61.offset;havoc #t~ret61.base, #t~ret61.offset; {392#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| probe_23_~p~1.base))))))))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:04,549 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {381#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} {346#true} #595#return; {388#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| |probe_23_#t~ret61.base|)))))) (_ bv1 1)))} is VALID [2021-09-13 23:47:04,559 INFO L281 TraceCheckUtils]: 11: Hoare triple {381#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} assume true; {381#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} is VALID [2021-09-13 23:47:04,560 INFO L281 TraceCheckUtils]: 10: Hoare triple {346#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {381#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} is VALID [2021-09-13 23:47:04,560 INFO L281 TraceCheckUtils]: 9: Hoare triple {346#true} ~size := #in~size; {346#true} is VALID [2021-09-13 23:47:04,560 INFO L264 TraceCheckUtils]: 8: Hoare triple {346#true} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {346#true} is VALID [2021-09-13 23:47:04,561 INFO L281 TraceCheckUtils]: 7: Hoare triple {346#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {346#true} is VALID [2021-09-13 23:47:04,561 INFO L264 TraceCheckUtils]: 6: Hoare triple {346#true} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {346#true} is VALID [2021-09-13 23:47:04,561 INFO L264 TraceCheckUtils]: 5: Hoare triple {346#true} call entry_point(); {346#true} is VALID [2021-09-13 23:47:04,561 INFO L264 TraceCheckUtils]: 4: Hoare triple {346#true} call main(); {346#true} is VALID [2021-09-13 23:47:04,561 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {346#true} {346#true} #673#return; {346#true} is VALID [2021-09-13 23:47:04,562 INFO L281 TraceCheckUtils]: 2: Hoare triple {346#true} assume true; {346#true} is VALID [2021-09-13 23:47:04,562 INFO L281 TraceCheckUtils]: 1: Hoare triple {346#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~dispatch_type~0.base, ~dispatch_type~0.offset := ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.base(), ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.offset();call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {346#true} is VALID [2021-09-13 23:47:04,562 INFO L264 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {346#true} is VALID [2021-09-13 23:47:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:04,564 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 23:47:04,564 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106196482] [2021-09-13 23:47:04,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106196482] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 23:47:04,564 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 23:47:04,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-09-13 23:47:04,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629134257] [2021-09-13 23:47:04,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2021-09-13 23:47:04,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 23:47:04,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:04,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:04,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 23:47:04,597 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 23:47:04,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 23:47:04,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-09-13 23:47:04,622 INFO L87 Difference]: Start difference. First operand has 343 states, 179 states have (on average 1.687150837988827) internal successors, (302), 282 states have internal predecessors, (302), 32 states have call successors, (32), 27 states have call predecessors, (32), 27 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:08,112 INFO L93 Difference]: Finished difference Result 264 states and 279 transitions. [2021-09-13 23:47:08,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 23:47:08,113 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2021-09-13 23:47:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 23:47:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:08,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 284 transitions. [2021-09-13 23:47:08,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 284 transitions. [2021-09-13 23:47:08,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 284 transitions. [2021-09-13 23:47:08,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 284 edges. 284 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:08,415 INFO L225 Difference]: With dead ends: 264 [2021-09-13 23:47:08,415 INFO L226 Difference]: Without dead ends: 261 [2021-09-13 23:47:08,416 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 77.98ms TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-13 23:47:08,418 INFO L928 BasicCegarLoop]: 47 mSDtfsCounter, 19 mSDsluCounter, 1055 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1560.17ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 12.88ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1574.15ms IncrementalHoareTripleChecker+Time [2021-09-13 23:47:08,419 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 257 Invalid, 1306 Unknown, 0 Unchecked, 12.88ms Time], IncrementalHoareTripleChecker [3 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1574.15ms Time] [2021-09-13 23:47:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2021-09-13 23:47:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 253. [2021-09-13 23:47:08,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 23:47:08,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 253 states, 129 states have (on average 1.7131782945736433) internal successors, (221), 208 states have internal predecessors, (221), 24 states have call successors, (24), 22 states have call predecessors, (24), 22 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2021-09-13 23:47:08,448 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 253 states, 129 states have (on average 1.7131782945736433) internal successors, (221), 208 states have internal predecessors, (221), 24 states have call successors, (24), 22 states have call predecessors, (24), 22 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2021-09-13 23:47:08,449 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 253 states, 129 states have (on average 1.7131782945736433) internal successors, (221), 208 states have internal predecessors, (221), 24 states have call successors, (24), 22 states have call predecessors, (24), 22 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2021-09-13 23:47:08,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:08,462 INFO L93 Difference]: Finished difference Result 261 states and 276 transitions. [2021-09-13 23:47:08,462 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 276 transitions. [2021-09-13 23:47:08,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:08,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:08,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 129 states have (on average 1.7131782945736433) internal successors, (221), 208 states have internal predecessors, (221), 24 states have call successors, (24), 22 states have call predecessors, (24), 22 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Second operand 261 states. [2021-09-13 23:47:08,465 INFO L87 Difference]: Start difference. First operand has 253 states, 129 states have (on average 1.7131782945736433) internal successors, (221), 208 states have internal predecessors, (221), 24 states have call successors, (24), 22 states have call predecessors, (24), 22 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Second operand 261 states. [2021-09-13 23:47:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:08,475 INFO L93 Difference]: Finished difference Result 261 states and 276 transitions. [2021-09-13 23:47:08,475 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 276 transitions. [2021-09-13 23:47:08,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:08,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:08,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 23:47:08,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 23:47:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 129 states have (on average 1.7131782945736433) internal successors, (221), 208 states have internal predecessors, (221), 24 states have call successors, (24), 22 states have call predecessors, (24), 22 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2021-09-13 23:47:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 269 transitions. [2021-09-13 23:47:08,486 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 269 transitions. Word has length 18 [2021-09-13 23:47:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 23:47:08,486 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 269 transitions. [2021-09-13 23:47:08,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 269 transitions. [2021-09-13 23:47:08,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 23:47:08,487 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 23:47:08,487 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 23:47:08,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-09-13 23:47:08,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 23:47:08,696 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION === [disconnect_deviceErr0REQUIRES_VIOLATION, disconnect_deviceErr1REQUIRES_VIOLATION, disconnect_deviceErr2REQUIRES_VIOLATION (and 124 more)] === [2021-09-13 23:47:08,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 23:47:08,697 INFO L82 PathProgramCache]: Analyzing trace with hash 537664468, now seen corresponding path program 1 times [2021-09-13 23:47:08,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 23:47:08,698 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146479495] [2021-09-13 23:47:08,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 23:47:08,698 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 23:47:08,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 23:47:08,699 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) [2021-09-13 23:47:08,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-09-13 23:47:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:08,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 23:47:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:08,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 23:47:08,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-09-13 23:47:09,082 INFO L264 TraceCheckUtils]: 0: Hoare triple {1501#true} call ULTIMATE.init(); {1501#true} is VALID [2021-09-13 23:47:09,083 INFO L281 TraceCheckUtils]: 1: Hoare triple {1501#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~dispatch_type~0.base, ~dispatch_type~0.offset := ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.base(), ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.offset();call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {1501#true} is VALID [2021-09-13 23:47:09,083 INFO L281 TraceCheckUtils]: 2: Hoare triple {1501#true} assume true; {1501#true} is VALID [2021-09-13 23:47:09,083 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {1501#true} {1501#true} #673#return; {1501#true} is VALID [2021-09-13 23:47:09,083 INFO L264 TraceCheckUtils]: 4: Hoare triple {1501#true} call main(); {1501#true} is VALID [2021-09-13 23:47:09,083 INFO L264 TraceCheckUtils]: 5: Hoare triple {1501#true} call entry_point(); {1501#true} is VALID [2021-09-13 23:47:09,083 INFO L264 TraceCheckUtils]: 6: Hoare triple {1501#true} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {1501#true} is VALID [2021-09-13 23:47:09,084 INFO L281 TraceCheckUtils]: 7: Hoare triple {1501#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {1501#true} is VALID [2021-09-13 23:47:09,084 INFO L264 TraceCheckUtils]: 8: Hoare triple {1501#true} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {1501#true} is VALID [2021-09-13 23:47:09,084 INFO L281 TraceCheckUtils]: 9: Hoare triple {1501#true} ~size := #in~size; {1533#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2021-09-13 23:47:09,085 INFO L281 TraceCheckUtils]: 10: Hoare triple {1533#(= ldv_malloc_~size |ldv_malloc_#in~size|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1537#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2021-09-13 23:47:09,086 INFO L281 TraceCheckUtils]: 11: Hoare triple {1537#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {1537#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2021-09-13 23:47:09,087 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {1537#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {1501#true} #595#return; {1544#(and (= |probe_23_#t~ret61.offset| (_ bv0 32)) (= (_ bv1036 32) (select |#length| |probe_23_#t~ret61.base|)))} is VALID [2021-09-13 23:47:09,087 INFO L281 TraceCheckUtils]: 13: Hoare triple {1544#(and (= |probe_23_#t~ret61.offset| (_ bv0 32)) (= (_ bv1036 32) (select |#length| |probe_23_#t~ret61.base|)))} ~p~1.base, ~p~1.offset := #t~ret61.base, #t~ret61.offset;havoc #t~ret61.base, #t~ret61.offset; {1548#(and (= (_ bv1036 32) (select |#length| probe_23_~p~1.base)) (= probe_23_~p~1.offset (_ bv0 32)))} is VALID [2021-09-13 23:47:09,090 INFO L281 TraceCheckUtils]: 14: Hoare triple {1548#(and (= (_ bv1036 32) (select |#length| probe_23_~p~1.base)) (= probe_23_~p~1.offset (_ bv0 32)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {1548#(and (= (_ bv1036 32) (select |#length| probe_23_~p~1.base)) (= probe_23_~p~1.offset (_ bv0 32)))} is VALID [2021-09-13 23:47:09,090 INFO L264 TraceCheckUtils]: 15: Hoare triple {1548#(and (= (_ bv1036 32) (select |#length| probe_23_~p~1.base)) (= probe_23_~p~1.offset (_ bv0 32)))} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {1555#(and (= (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (= (_ bv1036 32) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|)))} is VALID [2021-09-13 23:47:09,091 INFO L281 TraceCheckUtils]: 16: Hoare triple {1555#(and (= (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (= (_ bv1036 32) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {1559#(and (= (_ bv4 32) LDV_INIT_LIST_HEAD_~list.offset) (= (_ bv1036 32) (select |#length| LDV_INIT_LIST_HEAD_~list.base)))} is VALID [2021-09-13 23:47:09,091 INFO L281 TraceCheckUtils]: 17: Hoare triple {1559#(and (= (_ bv4 32) LDV_INIT_LIST_HEAD_~list.offset) (= (_ bv1036 32) (select |#length| LDV_INIT_LIST_HEAD_~list.base)))} assume !((~bvule32(~bvadd32(4bv32, ~list.offset), #length[~list.base]) && ~bvule32(~list.offset, ~bvadd32(4bv32, ~list.offset))) && ~bvule32(0bv32, ~list.offset)); {1502#false} is VALID [2021-09-13 23:47:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:09,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 23:47:09,591 INFO L281 TraceCheckUtils]: 17: Hoare triple {1563#(and (bvule (bvadd (_ bv4 32) LDV_INIT_LIST_HEAD_~list.offset) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (bvule LDV_INIT_LIST_HEAD_~list.offset (bvadd (_ bv4 32) LDV_INIT_LIST_HEAD_~list.offset)))} assume !((~bvule32(~bvadd32(4bv32, ~list.offset), #length[~list.base]) && ~bvule32(~list.offset, ~bvadd32(4bv32, ~list.offset))) && ~bvule32(0bv32, ~list.offset)); {1502#false} is VALID [2021-09-13 23:47:09,592 INFO L281 TraceCheckUtils]: 16: Hoare triple {1567#(and (bvule (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|)) (bvule |LDV_INIT_LIST_HEAD_#in~list.offset| (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {1563#(and (bvule (bvadd (_ bv4 32) LDV_INIT_LIST_HEAD_~list.offset) (select |#length| LDV_INIT_LIST_HEAD_~list.base)) (bvule LDV_INIT_LIST_HEAD_~list.offset (bvadd (_ bv4 32) LDV_INIT_LIST_HEAD_~list.offset)))} is VALID [2021-09-13 23:47:09,617 INFO L264 TraceCheckUtils]: 15: Hoare triple {1571#(and (bvule (bvadd probe_23_~p~1.offset (_ bv8 32)) (select |#length| probe_23_~p~1.base)) (bvule (bvadd probe_23_~p~1.offset (_ bv4 32)) (bvadd probe_23_~p~1.offset (_ bv8 32))))} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {1567#(and (bvule (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|) (select |#length| |LDV_INIT_LIST_HEAD_#in~list.base|)) (bvule |LDV_INIT_LIST_HEAD_#in~list.offset| (bvadd (_ bv4 32) |LDV_INIT_LIST_HEAD_#in~list.offset|)))} is VALID [2021-09-13 23:47:09,618 INFO L281 TraceCheckUtils]: 14: Hoare triple {1571#(and (bvule (bvadd probe_23_~p~1.offset (_ bv8 32)) (select |#length| probe_23_~p~1.base)) (bvule (bvadd probe_23_~p~1.offset (_ bv4 32)) (bvadd probe_23_~p~1.offset (_ bv8 32))))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {1571#(and (bvule (bvadd probe_23_~p~1.offset (_ bv8 32)) (select |#length| probe_23_~p~1.base)) (bvule (bvadd probe_23_~p~1.offset (_ bv4 32)) (bvadd probe_23_~p~1.offset (_ bv8 32))))} is VALID [2021-09-13 23:47:09,618 INFO L281 TraceCheckUtils]: 13: Hoare triple {1578#(and (bvule (bvadd (_ bv4 32) |probe_23_#t~ret61.offset|) (bvadd (_ bv8 32) |probe_23_#t~ret61.offset|)) (bvule (bvadd (_ bv8 32) |probe_23_#t~ret61.offset|) (select |#length| |probe_23_#t~ret61.base|)))} ~p~1.base, ~p~1.offset := #t~ret61.base, #t~ret61.offset;havoc #t~ret61.base, #t~ret61.offset; {1571#(and (bvule (bvadd probe_23_~p~1.offset (_ bv8 32)) (select |#length| probe_23_~p~1.base)) (bvule (bvadd probe_23_~p~1.offset (_ bv4 32)) (bvadd probe_23_~p~1.offset (_ bv8 32))))} is VALID [2021-09-13 23:47:09,620 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {1585#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (not (= (_ bv1036 32) |ldv_malloc_#in~size|)))} {1501#true} #595#return; {1578#(and (bvule (bvadd (_ bv4 32) |probe_23_#t~ret61.offset|) (bvadd (_ bv8 32) |probe_23_#t~ret61.offset|)) (bvule (bvadd (_ bv8 32) |probe_23_#t~ret61.offset|) (select |#length| |probe_23_#t~ret61.base|)))} is VALID [2021-09-13 23:47:09,620 INFO L281 TraceCheckUtils]: 11: Hoare triple {1585#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (not (= (_ bv1036 32) |ldv_malloc_#in~size|)))} assume true; {1585#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (not (= (_ bv1036 32) |ldv_malloc_#in~size|)))} is VALID [2021-09-13 23:47:09,621 INFO L281 TraceCheckUtils]: 10: Hoare triple {1592#(or (bvule (_ bv8 32) ldv_malloc_~size) (not (= (_ bv1036 32) |ldv_malloc_#in~size|)))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1585#(or (and (bvule (bvadd (_ bv8 32) |ldv_malloc_#res.offset|) (select |#length| |ldv_malloc_#res.base|)) (bvule (bvadd (_ bv4 32) |ldv_malloc_#res.offset|) (bvadd (_ bv8 32) |ldv_malloc_#res.offset|))) (not (= (_ bv1036 32) |ldv_malloc_#in~size|)))} is VALID [2021-09-13 23:47:09,622 INFO L281 TraceCheckUtils]: 9: Hoare triple {1501#true} ~size := #in~size; {1592#(or (bvule (_ bv8 32) ldv_malloc_~size) (not (= (_ bv1036 32) |ldv_malloc_#in~size|)))} is VALID [2021-09-13 23:47:09,622 INFO L264 TraceCheckUtils]: 8: Hoare triple {1501#true} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {1501#true} is VALID [2021-09-13 23:47:09,622 INFO L281 TraceCheckUtils]: 7: Hoare triple {1501#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {1501#true} is VALID [2021-09-13 23:47:09,622 INFO L264 TraceCheckUtils]: 6: Hoare triple {1501#true} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {1501#true} is VALID [2021-09-13 23:47:09,622 INFO L264 TraceCheckUtils]: 5: Hoare triple {1501#true} call entry_point(); {1501#true} is VALID [2021-09-13 23:47:09,622 INFO L264 TraceCheckUtils]: 4: Hoare triple {1501#true} call main(); {1501#true} is VALID [2021-09-13 23:47:09,622 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {1501#true} {1501#true} #673#return; {1501#true} is VALID [2021-09-13 23:47:09,622 INFO L281 TraceCheckUtils]: 2: Hoare triple {1501#true} assume true; {1501#true} is VALID [2021-09-13 23:47:09,622 INFO L281 TraceCheckUtils]: 1: Hoare triple {1501#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~dispatch_type~0.base, ~dispatch_type~0.offset := ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.base(), ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.offset();call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {1501#true} is VALID [2021-09-13 23:47:09,622 INFO L264 TraceCheckUtils]: 0: Hoare triple {1501#true} call ULTIMATE.init(); {1501#true} is VALID [2021-09-13 23:47:09,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:09,623 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 23:47:09,623 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146479495] [2021-09-13 23:47:09,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146479495] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 23:47:09,623 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 23:47:09,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2021-09-13 23:47:09,623 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296610088] [2021-09-13 23:47:09,624 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2021-09-13 23:47:09,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 23:47:09,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-09-13 23:47:09,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:09,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 23:47:09,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 23:47:09,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 23:47:09,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-09-13 23:47:09,683 INFO L87 Difference]: Start difference. First operand 253 states and 269 transitions. Second operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-09-13 23:47:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:18,392 INFO L93 Difference]: Finished difference Result 259 states and 274 transitions. [2021-09-13 23:47:18,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 23:47:18,392 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2021-09-13 23:47:18,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 23:47:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-09-13 23:47:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 276 transitions. [2021-09-13 23:47:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-09-13 23:47:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 276 transitions. [2021-09-13 23:47:18,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 276 transitions. [2021-09-13 23:47:18,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:18,625 INFO L225 Difference]: With dead ends: 259 [2021-09-13 23:47:18,625 INFO L226 Difference]: Without dead ends: 259 [2021-09-13 23:47:18,625 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 303.98ms TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-09-13 23:47:18,626 INFO L928 BasicCegarLoop]: 45 mSDtfsCounter, 26 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3884.21ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 16.93ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3900.38ms IncrementalHoareTripleChecker+Time [2021-09-13 23:47:18,626 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 376 Invalid, 1937 Unknown, 0 Unchecked, 16.93ms Time], IncrementalHoareTripleChecker [2 Valid, 1935 Invalid, 0 Unknown, 0 Unchecked, 3900.38ms Time] [2021-09-13 23:47:18,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-09-13 23:47:18,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 253. [2021-09-13 23:47:18,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 23:47:18,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 259 states. Second operand has 253 states, 129 states have (on average 1.697674418604651) internal successors, (219), 208 states have internal predecessors, (219), 24 states have call successors, (24), 22 states have call predecessors, (24), 22 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2021-09-13 23:47:18,635 INFO L74 IsIncluded]: Start isIncluded. First operand 259 states. Second operand has 253 states, 129 states have (on average 1.697674418604651) internal successors, (219), 208 states have internal predecessors, (219), 24 states have call successors, (24), 22 states have call predecessors, (24), 22 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2021-09-13 23:47:18,636 INFO L87 Difference]: Start difference. First operand 259 states. Second operand has 253 states, 129 states have (on average 1.697674418604651) internal successors, (219), 208 states have internal predecessors, (219), 24 states have call successors, (24), 22 states have call predecessors, (24), 22 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2021-09-13 23:47:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:18,647 INFO L93 Difference]: Finished difference Result 259 states and 274 transitions. [2021-09-13 23:47:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 274 transitions. [2021-09-13 23:47:18,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:18,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:18,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 129 states have (on average 1.697674418604651) internal successors, (219), 208 states have internal predecessors, (219), 24 states have call successors, (24), 22 states have call predecessors, (24), 22 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Second operand 259 states. [2021-09-13 23:47:18,649 INFO L87 Difference]: Start difference. First operand has 253 states, 129 states have (on average 1.697674418604651) internal successors, (219), 208 states have internal predecessors, (219), 24 states have call successors, (24), 22 states have call predecessors, (24), 22 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) Second operand 259 states. [2021-09-13 23:47:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:18,661 INFO L93 Difference]: Finished difference Result 259 states and 274 transitions. [2021-09-13 23:47:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 274 transitions. [2021-09-13 23:47:18,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:18,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:18,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 23:47:18,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 23:47:18,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 129 states have (on average 1.697674418604651) internal successors, (219), 208 states have internal predecessors, (219), 24 states have call successors, (24), 22 states have call predecessors, (24), 22 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2021-09-13 23:47:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 267 transitions. [2021-09-13 23:47:18,673 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 267 transitions. Word has length 18 [2021-09-13 23:47:18,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 23:47:18,673 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 267 transitions. [2021-09-13 23:47:18,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 10 states have internal predecessors, (17), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2021-09-13 23:47:18,673 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 267 transitions. [2021-09-13 23:47:18,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 23:47:18,674 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 23:47:18,674 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 23:47:18,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-09-13 23:47:18,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 23:47:18,881 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION === [disconnect_deviceErr0REQUIRES_VIOLATION, disconnect_deviceErr1REQUIRES_VIOLATION, disconnect_deviceErr2REQUIRES_VIOLATION (and 124 more)] === [2021-09-13 23:47:18,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 23:47:18,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2014492494, now seen corresponding path program 1 times [2021-09-13 23:47:18,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 23:47:18,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121813148] [2021-09-13 23:47:18,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 23:47:18,882 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 23:47:18,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 23:47:18,883 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) [2021-09-13 23:47:18,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-09-13 23:47:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:19,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 23:47:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:19,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 23:47:19,155 INFO L264 TraceCheckUtils]: 0: Hoare triple {2656#true} call ULTIMATE.init(); {2656#true} is VALID [2021-09-13 23:47:19,156 INFO L281 TraceCheckUtils]: 1: Hoare triple {2656#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~dispatch_type~0.base, ~dispatch_type~0.offset := ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.base(), ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.offset();call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {2656#true} is VALID [2021-09-13 23:47:19,156 INFO L281 TraceCheckUtils]: 2: Hoare triple {2656#true} assume true; {2656#true} is VALID [2021-09-13 23:47:19,156 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {2656#true} {2656#true} #673#return; {2656#true} is VALID [2021-09-13 23:47:19,156 INFO L264 TraceCheckUtils]: 4: Hoare triple {2656#true} call main(); {2656#true} is VALID [2021-09-13 23:47:19,156 INFO L264 TraceCheckUtils]: 5: Hoare triple {2656#true} call entry_point(); {2656#true} is VALID [2021-09-13 23:47:19,156 INFO L264 TraceCheckUtils]: 6: Hoare triple {2656#true} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {2656#true} is VALID [2021-09-13 23:47:19,156 INFO L281 TraceCheckUtils]: 7: Hoare triple {2656#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {2656#true} is VALID [2021-09-13 23:47:19,156 INFO L264 TraceCheckUtils]: 8: Hoare triple {2656#true} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {2656#true} is VALID [2021-09-13 23:47:19,157 INFO L281 TraceCheckUtils]: 9: Hoare triple {2656#true} ~size := #in~size; {2656#true} is VALID [2021-09-13 23:47:19,157 INFO L281 TraceCheckUtils]: 10: Hoare triple {2656#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {2691#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:19,157 INFO L281 TraceCheckUtils]: 11: Hoare triple {2691#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {2691#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:19,158 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {2691#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {2656#true} #595#return; {2698#(and (= |probe_23_#t~ret61.offset| (_ bv0 32)) (= |probe_23_#t~ret61.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:19,159 INFO L281 TraceCheckUtils]: 13: Hoare triple {2698#(and (= |probe_23_#t~ret61.offset| (_ bv0 32)) (= |probe_23_#t~ret61.base| (_ bv0 32)))} ~p~1.base, ~p~1.offset := #t~ret61.base, #t~ret61.offset;havoc #t~ret61.base, #t~ret61.offset; {2702#(and (= probe_23_~p~1.base (_ bv0 32)) (= probe_23_~p~1.offset (_ bv0 32)))} is VALID [2021-09-13 23:47:19,159 INFO L281 TraceCheckUtils]: 14: Hoare triple {2702#(and (= probe_23_~p~1.base (_ bv0 32)) (= probe_23_~p~1.offset (_ bv0 32)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {2657#false} is VALID [2021-09-13 23:47:19,159 INFO L264 TraceCheckUtils]: 15: Hoare triple {2657#false} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {2657#false} is VALID [2021-09-13 23:47:19,159 INFO L281 TraceCheckUtils]: 16: Hoare triple {2657#false} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {2657#false} is VALID [2021-09-13 23:47:19,159 INFO L281 TraceCheckUtils]: 17: Hoare triple {2657#false} assume !(1bv1 == #valid[~list.base]); {2657#false} is VALID [2021-09-13 23:47:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:19,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 23:47:19,310 INFO L281 TraceCheckUtils]: 17: Hoare triple {2657#false} assume !(1bv1 == #valid[~list.base]); {2657#false} is VALID [2021-09-13 23:47:19,311 INFO L281 TraceCheckUtils]: 16: Hoare triple {2657#false} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {2657#false} is VALID [2021-09-13 23:47:19,311 INFO L264 TraceCheckUtils]: 15: Hoare triple {2657#false} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {2657#false} is VALID [2021-09-13 23:47:19,312 INFO L281 TraceCheckUtils]: 14: Hoare triple {2702#(and (= probe_23_~p~1.base (_ bv0 32)) (= probe_23_~p~1.offset (_ bv0 32)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {2657#false} is VALID [2021-09-13 23:47:19,312 INFO L281 TraceCheckUtils]: 13: Hoare triple {2698#(and (= |probe_23_#t~ret61.offset| (_ bv0 32)) (= |probe_23_#t~ret61.base| (_ bv0 32)))} ~p~1.base, ~p~1.offset := #t~ret61.base, #t~ret61.offset;havoc #t~ret61.base, #t~ret61.offset; {2702#(and (= probe_23_~p~1.base (_ bv0 32)) (= probe_23_~p~1.offset (_ bv0 32)))} is VALID [2021-09-13 23:47:19,313 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {2691#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {2656#true} #595#return; {2698#(and (= |probe_23_#t~ret61.offset| (_ bv0 32)) (= |probe_23_#t~ret61.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:19,313 INFO L281 TraceCheckUtils]: 11: Hoare triple {2691#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {2691#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:19,314 INFO L281 TraceCheckUtils]: 10: Hoare triple {2656#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {2691#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:19,314 INFO L281 TraceCheckUtils]: 9: Hoare triple {2656#true} ~size := #in~size; {2656#true} is VALID [2021-09-13 23:47:19,314 INFO L264 TraceCheckUtils]: 8: Hoare triple {2656#true} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {2656#true} is VALID [2021-09-13 23:47:19,314 INFO L281 TraceCheckUtils]: 7: Hoare triple {2656#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {2656#true} is VALID [2021-09-13 23:47:19,314 INFO L264 TraceCheckUtils]: 6: Hoare triple {2656#true} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {2656#true} is VALID [2021-09-13 23:47:19,315 INFO L264 TraceCheckUtils]: 5: Hoare triple {2656#true} call entry_point(); {2656#true} is VALID [2021-09-13 23:47:19,315 INFO L264 TraceCheckUtils]: 4: Hoare triple {2656#true} call main(); {2656#true} is VALID [2021-09-13 23:47:19,315 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {2656#true} {2656#true} #673#return; {2656#true} is VALID [2021-09-13 23:47:19,315 INFO L281 TraceCheckUtils]: 2: Hoare triple {2656#true} assume true; {2656#true} is VALID [2021-09-13 23:47:19,315 INFO L281 TraceCheckUtils]: 1: Hoare triple {2656#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~dispatch_type~0.base, ~dispatch_type~0.offset := ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.base(), ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.offset();call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {2656#true} is VALID [2021-09-13 23:47:19,315 INFO L264 TraceCheckUtils]: 0: Hoare triple {2656#true} call ULTIMATE.init(); {2656#true} is VALID [2021-09-13 23:47:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:19,316 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 23:47:19,316 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121813148] [2021-09-13 23:47:19,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121813148] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 23:47:19,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 23:47:19,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-09-13 23:47:19,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051306944] [2021-09-13 23:47:19,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2021-09-13 23:47:19,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 23:47:19,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:19,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:19,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 23:47:19,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 23:47:19,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 23:47:19,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 23:47:19,335 INFO L87 Difference]: Start difference. First operand 253 states and 267 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:21,363 INFO L93 Difference]: Finished difference Result 246 states and 259 transitions. [2021-09-13 23:47:21,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 23:47:21,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2021-09-13 23:47:21,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 23:47:21,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:21,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 260 transitions. [2021-09-13 23:47:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 260 transitions. [2021-09-13 23:47:21,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 260 transitions. [2021-09-13 23:47:21,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:21,579 INFO L225 Difference]: With dead ends: 246 [2021-09-13 23:47:21,579 INFO L226 Difference]: Without dead ends: 246 [2021-09-13 23:47:21,579 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.45ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 23:47:21,582 INFO L928 BasicCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 872.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 6.15ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 877.07ms IncrementalHoareTripleChecker+Time [2021-09-13 23:47:21,584 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 183 Invalid, 840 Unknown, 0 Unchecked, 6.15ms Time], IncrementalHoareTripleChecker [1 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 877.07ms Time] [2021-09-13 23:47:21,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-09-13 23:47:21,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2021-09-13 23:47:21,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 23:47:21,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand has 244 states, 125 states have (on average 1.688) internal successors, (211), 200 states have internal predecessors, (211), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 23 states have call predecessors, (23), 22 states have call successors, (23) [2021-09-13 23:47:21,601 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand has 244 states, 125 states have (on average 1.688) internal successors, (211), 200 states have internal predecessors, (211), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 23 states have call predecessors, (23), 22 states have call successors, (23) [2021-09-13 23:47:21,603 INFO L87 Difference]: Start difference. First operand 246 states. Second operand has 244 states, 125 states have (on average 1.688) internal successors, (211), 200 states have internal predecessors, (211), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 23 states have call predecessors, (23), 22 states have call successors, (23) [2021-09-13 23:47:21,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:21,607 INFO L93 Difference]: Finished difference Result 246 states and 259 transitions. [2021-09-13 23:47:21,608 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 259 transitions. [2021-09-13 23:47:21,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:21,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:21,608 INFO L74 IsIncluded]: Start isIncluded. First operand has 244 states, 125 states have (on average 1.688) internal successors, (211), 200 states have internal predecessors, (211), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 23 states have call predecessors, (23), 22 states have call successors, (23) Second operand 246 states. [2021-09-13 23:47:21,609 INFO L87 Difference]: Start difference. First operand has 244 states, 125 states have (on average 1.688) internal successors, (211), 200 states have internal predecessors, (211), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 23 states have call predecessors, (23), 22 states have call successors, (23) Second operand 246 states. [2021-09-13 23:47:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:21,614 INFO L93 Difference]: Finished difference Result 246 states and 259 transitions. [2021-09-13 23:47:21,614 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 259 transitions. [2021-09-13 23:47:21,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:21,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:21,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 23:47:21,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 23:47:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 125 states have (on average 1.688) internal successors, (211), 200 states have internal predecessors, (211), 23 states have call successors, (23), 21 states have call predecessors, (23), 21 states have return successors, (23), 23 states have call predecessors, (23), 22 states have call successors, (23) [2021-09-13 23:47:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 257 transitions. [2021-09-13 23:47:21,621 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 257 transitions. Word has length 18 [2021-09-13 23:47:21,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 23:47:21,622 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 257 transitions. [2021-09-13 23:47:21,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-09-13 23:47:21,622 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 257 transitions. [2021-09-13 23:47:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 23:47:21,623 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 23:47:21,623 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 23:47:21,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-09-13 23:47:21,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 23:47:21,831 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting probe_23Err0REQUIRES_VIOLATION === [disconnect_deviceErr0REQUIRES_VIOLATION, disconnect_deviceErr1REQUIRES_VIOLATION, disconnect_deviceErr2REQUIRES_VIOLATION (and 124 more)] === [2021-09-13 23:47:21,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 23:47:21,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1035441071, now seen corresponding path program 1 times [2021-09-13 23:47:21,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 23:47:21,832 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311490888] [2021-09-13 23:47:21,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 23:47:21,832 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 23:47:21,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 23:47:21,833 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 23:47:21,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-09-13 23:47:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:21,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2021-09-13 23:47:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:21,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 23:47:21,983 INFO L354 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2021-09-13 23:47:21,983 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 26 [2021-09-13 23:47:22,177 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-09-13 23:47:22,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 33 [2021-09-13 23:47:23,155 INFO L264 TraceCheckUtils]: 0: Hoare triple {3750#true} call ULTIMATE.init(); {3750#true} is VALID [2021-09-13 23:47:23,161 INFO L281 TraceCheckUtils]: 1: Hoare triple {3750#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~dispatch_type~0.base, ~dispatch_type~0.offset := ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.base(), ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.offset();call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {3758#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} is VALID [2021-09-13 23:47:23,161 INFO L281 TraceCheckUtils]: 2: Hoare triple {3758#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} assume true; {3758#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} is VALID [2021-09-13 23:47:23,162 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {3758#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} {3750#true} #673#return; {3758#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} is VALID [2021-09-13 23:47:23,162 INFO L264 TraceCheckUtils]: 4: Hoare triple {3758#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} call main(); {3758#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} is VALID [2021-09-13 23:47:23,163 INFO L264 TraceCheckUtils]: 5: Hoare triple {3758#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} call entry_point(); {3758#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} is VALID [2021-09-13 23:47:23,164 INFO L264 TraceCheckUtils]: 6: Hoare triple {3758#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {3774#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| |probe_23_#in~dev.base|)))) (_ bv1 1)))} is VALID [2021-09-13 23:47:23,165 INFO L281 TraceCheckUtils]: 7: Hoare triple {3774#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| |probe_23_#in~dev.base|)))) (_ bv1 1)))} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {3778#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} is VALID [2021-09-13 23:47:23,165 INFO L264 TraceCheckUtils]: 8: Hoare triple {3778#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {3782#(= |old(#valid)| |#valid|)} is VALID [2021-09-13 23:47:23,166 INFO L281 TraceCheckUtils]: 9: Hoare triple {3782#(= |old(#valid)| |#valid|)} ~size := #in~size; {3782#(= |old(#valid)| |#valid|)} is VALID [2021-09-13 23:47:23,172 INFO L281 TraceCheckUtils]: 10: Hoare triple {3782#(= |old(#valid)| |#valid|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3789#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} is VALID [2021-09-13 23:47:23,182 INFO L281 TraceCheckUtils]: 11: Hoare triple {3789#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} assume true; {3789#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} is VALID [2021-09-13 23:47:23,184 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {3789#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|)))} {3778#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} #595#return; {3796#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} is VALID [2021-09-13 23:47:23,184 INFO L281 TraceCheckUtils]: 13: Hoare triple {3796#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} ~p~1.base, ~p~1.offset := #t~ret61.base, #t~ret61.offset;havoc #t~ret61.base, #t~ret61.offset; {3796#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} is VALID [2021-09-13 23:47:23,185 INFO L281 TraceCheckUtils]: 14: Hoare triple {3796#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {3796#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} is VALID [2021-09-13 23:47:23,187 INFO L264 TraceCheckUtils]: 15: Hoare triple {3796#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {3806#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} is VALID [2021-09-13 23:47:23,188 INFO L281 TraceCheckUtils]: 16: Hoare triple {3806#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {3806#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} is VALID [2021-09-13 23:47:23,188 INFO L281 TraceCheckUtils]: 17: Hoare triple {3806#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {3806#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} is VALID [2021-09-13 23:47:23,189 INFO L281 TraceCheckUtils]: 18: Hoare triple {3806#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {3806#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} is VALID [2021-09-13 23:47:23,189 INFO L281 TraceCheckUtils]: 19: Hoare triple {3806#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} assume true; {3806#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} is VALID [2021-09-13 23:47:23,197 INFO L276 TraceCheckUtils]: 20: Hoare quadruple {3806#(exists ((v_probe_23_~dev.base_BEFORE_CALL_2 (_ BitVec 32))) (and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| v_probe_23_~dev.base_BEFORE_CALL_2)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1))))) (bvneg (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_2))))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1)))))))} {3796#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} #597#return; {3796#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} is VALID [2021-09-13 23:47:23,198 INFO L281 TraceCheckUtils]: 21: Hoare triple {3796#(and (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))) (not (= |ldv_malloc_#res.base| probe_23_~dev.base)))) (exists ((v_arrayElimCell_1 (_ BitVec 1))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg v_arrayElimCell_1)) (bvneg (select |#valid| probe_23_~dev.base)))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg v_arrayElimCell_1)))) (_ bv1 1))))))} assume !(1bv1 == #valid[~dev.base]); {3751#false} is VALID [2021-09-13 23:47:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:23,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 23:47:35,890 INFO L281 TraceCheckUtils]: 21: Hoare triple {3778#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} assume !(1bv1 == #valid[~dev.base]); {3751#false} is VALID [2021-09-13 23:47:35,891 INFO L276 TraceCheckUtils]: 20: Hoare quadruple {3750#true} {3778#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} #597#return; {3778#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} is VALID [2021-09-13 23:47:35,891 INFO L281 TraceCheckUtils]: 19: Hoare triple {3750#true} assume true; {3750#true} is VALID [2021-09-13 23:47:35,891 INFO L281 TraceCheckUtils]: 18: Hoare triple {3750#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {3750#true} is VALID [2021-09-13 23:47:35,892 INFO L281 TraceCheckUtils]: 17: Hoare triple {3750#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {3750#true} is VALID [2021-09-13 23:47:35,892 INFO L281 TraceCheckUtils]: 16: Hoare triple {3750#true} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {3750#true} is VALID [2021-09-13 23:47:35,892 INFO L264 TraceCheckUtils]: 15: Hoare triple {3778#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {3750#true} is VALID [2021-09-13 23:47:35,892 INFO L281 TraceCheckUtils]: 14: Hoare triple {3778#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {3778#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} is VALID [2021-09-13 23:47:35,892 INFO L281 TraceCheckUtils]: 13: Hoare triple {3778#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} ~p~1.base, ~p~1.offset := #t~ret61.base, #t~ret61.offset;havoc #t~ret61.base, #t~ret61.offset; {3778#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} is VALID [2021-09-13 23:47:35,894 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {3856#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_4)))) (_ bv1 1))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} {3852#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) probe_23_~dev.base)))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|))))))))} #595#return; {3778#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} is VALID [2021-09-13 23:47:35,894 INFO L281 TraceCheckUtils]: 11: Hoare triple {3856#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_4)))) (_ bv1 1))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} assume true; {3856#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_4)))) (_ bv1 1))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} is VALID [2021-09-13 23:47:35,895 INFO L281 TraceCheckUtils]: 10: Hoare triple {3863#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32)) (|v_ldv_malloc_#res.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |#valid| |v_ldv_malloc_#res.base_18|)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_18| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4))))))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {3856#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| v_probe_23_~dev.base_BEFORE_CALL_4)))) (_ bv1 1))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} is VALID [2021-09-13 23:47:35,895 INFO L281 TraceCheckUtils]: 9: Hoare triple {3863#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32)) (|v_ldv_malloc_#res.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |#valid| |v_ldv_malloc_#res.base_18|)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_18| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4))))))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} ~size := #in~size; {3863#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32)) (|v_ldv_malloc_#res.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |#valid| |v_ldv_malloc_#res.base_18|)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_18| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4))))))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} is VALID [2021-09-13 23:47:35,896 INFO L264 TraceCheckUtils]: 8: Hoare triple {3852#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) probe_23_~dev.base)))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|))))))))} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {3863#(forall ((v_probe_23_~dev.base_BEFORE_CALL_4 (_ BitVec 32)) (|v_ldv_malloc_#res.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |#valid| |v_ldv_malloc_#res.base_18|)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_18| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4))))))) (exists ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (and (not (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select (store |old(#valid)| |v_ldv_malloc_#res.base_17| (_ bv1 1)) v_probe_23_~dev.base_BEFORE_CALL_4)))))) (_ bv1 1)))) (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (bvneg (select |old(#valid)| |v_ldv_malloc_#res.base_17|)))))))))))} is VALID [2021-09-13 23:47:35,897 INFO L281 TraceCheckUtils]: 7: Hoare triple {3870#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |probe_23_#in~dev.base|)))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|))))))))} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {3852#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) probe_23_~dev.base)))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|))))))))} is VALID [2021-09-13 23:47:35,898 INFO L264 TraceCheckUtils]: 6: Hoare triple {3874#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {3870#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |probe_23_#in~dev.base|)))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|))))))))} is VALID [2021-09-13 23:47:35,898 INFO L264 TraceCheckUtils]: 5: Hoare triple {3874#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} call entry_point(); {3874#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} is VALID [2021-09-13 23:47:35,898 INFO L264 TraceCheckUtils]: 4: Hoare triple {3874#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} call main(); {3874#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} is VALID [2021-09-13 23:47:35,899 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {3874#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} {3750#true} #673#return; {3874#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} is VALID [2021-09-13 23:47:35,899 INFO L281 TraceCheckUtils]: 2: Hoare triple {3874#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} assume true; {3874#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} is VALID [2021-09-13 23:47:35,901 INFO L281 TraceCheckUtils]: 1: Hoare triple {3750#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~dispatch_type~0.base, ~dispatch_type~0.offset := ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.base(), ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.offset();call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {3874#(forall ((|v_ldv_malloc_#res.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (select (store |#valid| |v_ldv_malloc_#res.base_17| (_ bv1 1)) |~#dev~0.base|))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (bvneg (select |#valid| |v_ldv_malloc_#res.base_17|)))))))))} is VALID [2021-09-13 23:47:35,901 INFO L264 TraceCheckUtils]: 0: Hoare triple {3750#true} call ULTIMATE.init(); {3750#true} is VALID [2021-09-13 23:47:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:35,901 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 23:47:35,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311490888] [2021-09-13 23:47:35,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311490888] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 23:47:35,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 23:47:35,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2021-09-13 23:47:35,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30840483] [2021-09-13 23:47:35,902 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 22 [2021-09-13 23:47:35,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 23:47:35,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-09-13 23:47:35,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:35,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 23:47:35,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 23:47:35,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 23:47:35,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=142, Unknown=5, NotChecked=0, Total=182 [2021-09-13 23:47:35,964 INFO L87 Difference]: Start difference. First operand 244 states and 257 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-09-13 23:47:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:51,508 INFO L93 Difference]: Finished difference Result 335 states and 355 transitions. [2021-09-13 23:47:51,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-09-13 23:47:51,508 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 22 [2021-09-13 23:47:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 23:47:51,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-09-13 23:47:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 357 transitions. [2021-09-13 23:47:51,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-09-13 23:47:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 357 transitions. [2021-09-13 23:47:51,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 357 transitions. [2021-09-13 23:47:51,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:51,851 INFO L225 Difference]: With dead ends: 335 [2021-09-13 23:47:51,852 INFO L226 Difference]: Without dead ends: 332 [2021-09-13 23:47:51,852 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 24769.42ms TimeCoverageRelationStatistics Valid=69, Invalid=225, Unknown=12, NotChecked=0, Total=306 [2021-09-13 23:47:51,852 INFO L928 BasicCegarLoop]: 45 mSDtfsCounter, 196 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1412.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 3155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 10.98ms SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1932 IncrementalHoareTripleChecker+Unchecked, 1423.54ms IncrementalHoareTripleChecker+Time [2021-09-13 23:47:51,853 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 209 Invalid, 3155 Unknown, 0 Unchecked, 10.98ms Time], IncrementalHoareTripleChecker [48 Valid, 1175 Invalid, 0 Unknown, 1932 Unchecked, 1423.54ms Time] [2021-09-13 23:47:51,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2021-09-13 23:47:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 264. [2021-09-13 23:47:51,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 23:47:51,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 332 states. Second operand has 264 states, 140 states have (on average 1.6642857142857144) internal successors, (233), 216 states have internal predecessors, (233), 26 states have call successors, (26), 24 states have call predecessors, (26), 24 states have return successors, (30), 24 states have call predecessors, (30), 25 states have call successors, (30) [2021-09-13 23:47:51,867 INFO L74 IsIncluded]: Start isIncluded. First operand 332 states. Second operand has 264 states, 140 states have (on average 1.6642857142857144) internal successors, (233), 216 states have internal predecessors, (233), 26 states have call successors, (26), 24 states have call predecessors, (26), 24 states have return successors, (30), 24 states have call predecessors, (30), 25 states have call successors, (30) [2021-09-13 23:47:51,868 INFO L87 Difference]: Start difference. First operand 332 states. Second operand has 264 states, 140 states have (on average 1.6642857142857144) internal successors, (233), 216 states have internal predecessors, (233), 26 states have call successors, (26), 24 states have call predecessors, (26), 24 states have return successors, (30), 24 states have call predecessors, (30), 25 states have call successors, (30) [2021-09-13 23:47:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:51,875 INFO L93 Difference]: Finished difference Result 332 states and 352 transitions. [2021-09-13 23:47:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 352 transitions. [2021-09-13 23:47:51,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:51,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:51,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 140 states have (on average 1.6642857142857144) internal successors, (233), 216 states have internal predecessors, (233), 26 states have call successors, (26), 24 states have call predecessors, (26), 24 states have return successors, (30), 24 states have call predecessors, (30), 25 states have call successors, (30) Second operand 332 states. [2021-09-13 23:47:51,877 INFO L87 Difference]: Start difference. First operand has 264 states, 140 states have (on average 1.6642857142857144) internal successors, (233), 216 states have internal predecessors, (233), 26 states have call successors, (26), 24 states have call predecessors, (26), 24 states have return successors, (30), 24 states have call predecessors, (30), 25 states have call successors, (30) Second operand 332 states. [2021-09-13 23:47:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:51,884 INFO L93 Difference]: Finished difference Result 332 states and 352 transitions. [2021-09-13 23:47:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 352 transitions. [2021-09-13 23:47:51,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:51,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:51,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 23:47:51,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 23:47:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 140 states have (on average 1.6642857142857144) internal successors, (233), 216 states have internal predecessors, (233), 26 states have call successors, (26), 24 states have call predecessors, (26), 24 states have return successors, (30), 24 states have call predecessors, (30), 25 states have call successors, (30) [2021-09-13 23:47:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 289 transitions. [2021-09-13 23:47:51,891 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 289 transitions. Word has length 22 [2021-09-13 23:47:51,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 23:47:51,891 INFO L470 AbstractCegarLoop]: Abstraction has 264 states and 289 transitions. [2021-09-13 23:47:51,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-09-13 23:47:51,892 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 289 transitions. [2021-09-13 23:47:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 23:47:51,892 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 23:47:51,892 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-13 23:47:51,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-09-13 23:47:52,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 23:47:52,101 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting probe_23Err1REQUIRES_VIOLATION === [disconnect_deviceErr0REQUIRES_VIOLATION, disconnect_deviceErr1REQUIRES_VIOLATION, disconnect_deviceErr2REQUIRES_VIOLATION (and 124 more)] === [2021-09-13 23:47:52,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 23:47:52,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1035441070, now seen corresponding path program 1 times [2021-09-13 23:47:52,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 23:47:52,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710701919] [2021-09-13 23:47:52,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 23:47:52,102 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 23:47:52,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 23:47:52,103 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-09-13 23:47:52,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-09-13 23:47:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:52,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 26 conjunts are in the unsatisfiable core [2021-09-13 23:47:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:52,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 23:47:52,273 INFO L354 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2021-09-13 23:47:52,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 35 [2021-09-13 23:47:52,287 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-09-13 23:47:52,287 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-09-13 23:47:55,033 INFO L354 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2021-09-13 23:47:55,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 62 [2021-09-13 23:47:55,063 INFO L354 Elim1Store]: treesize reduction 18, result has 63.3 percent of original size [2021-09-13 23:47:55,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 73 [2021-09-13 23:47:55,751 INFO L264 TraceCheckUtils]: 0: Hoare triple {5166#true} call ULTIMATE.init(); {5166#true} is VALID [2021-09-13 23:47:55,754 INFO L281 TraceCheckUtils]: 1: Hoare triple {5166#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~dispatch_type~0.base, ~dispatch_type~0.offset := ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.base(), ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.offset();call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {5174#(and (= (_ bv0 32) |~#dev~0.offset|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |~#ldv_global_msg_list~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |~#ldv_global_msg_list~0.base|)))) (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |~#dev~0.base| (_ bv0 32)) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)))) (= (_ bv8 32) (select |#length| |~#dev~0.base|)))} is VALID [2021-09-13 23:47:55,754 INFO L281 TraceCheckUtils]: 2: Hoare triple {5174#(and (= (_ bv0 32) |~#dev~0.offset|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |~#ldv_global_msg_list~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |~#ldv_global_msg_list~0.base|)))) (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |~#dev~0.base| (_ bv0 32)) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)))) (= (_ bv8 32) (select |#length| |~#dev~0.base|)))} assume true; {5174#(and (= (_ bv0 32) |~#dev~0.offset|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |~#ldv_global_msg_list~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |~#ldv_global_msg_list~0.base|)))) (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |~#dev~0.base| (_ bv0 32)) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)))) (= (_ bv8 32) (select |#length| |~#dev~0.base|)))} is VALID [2021-09-13 23:47:55,755 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {5174#(and (= (_ bv0 32) |~#dev~0.offset|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |~#ldv_global_msg_list~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |~#ldv_global_msg_list~0.base|)))) (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |~#dev~0.base| (_ bv0 32)) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)))) (= (_ bv8 32) (select |#length| |~#dev~0.base|)))} {5166#true} #673#return; {5174#(and (= (_ bv0 32) |~#dev~0.offset|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |~#ldv_global_msg_list~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |~#ldv_global_msg_list~0.base|)))) (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |~#dev~0.base| (_ bv0 32)) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)))) (= (_ bv8 32) (select |#length| |~#dev~0.base|)))} is VALID [2021-09-13 23:47:55,755 INFO L264 TraceCheckUtils]: 4: Hoare triple {5174#(and (= (_ bv0 32) |~#dev~0.offset|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |~#ldv_global_msg_list~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |~#ldv_global_msg_list~0.base|)))) (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |~#dev~0.base| (_ bv0 32)) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)))) (= (_ bv8 32) (select |#length| |~#dev~0.base|)))} call main(); {5174#(and (= (_ bv0 32) |~#dev~0.offset|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |~#ldv_global_msg_list~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |~#ldv_global_msg_list~0.base|)))) (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |~#dev~0.base| (_ bv0 32)) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)))) (= (_ bv8 32) (select |#length| |~#dev~0.base|)))} is VALID [2021-09-13 23:47:55,756 INFO L264 TraceCheckUtils]: 5: Hoare triple {5174#(and (= (_ bv0 32) |~#dev~0.offset|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |~#ldv_global_msg_list~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |~#ldv_global_msg_list~0.base|)))) (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |~#dev~0.base| (_ bv0 32)) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)))) (= (_ bv8 32) (select |#length| |~#dev~0.base|)))} call entry_point(); {5174#(and (= (_ bv0 32) |~#dev~0.offset|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |~#ldv_global_msg_list~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |~#ldv_global_msg_list~0.base|)))) (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |~#dev~0.base| (_ bv0 32)) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)))) (= (_ bv8 32) (select |#length| |~#dev~0.base|)))} is VALID [2021-09-13 23:47:55,757 INFO L264 TraceCheckUtils]: 6: Hoare triple {5174#(and (= (_ bv0 32) |~#dev~0.offset|) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (= (_ bv8 32) (select |#length| |~#ldv_global_msg_list~0.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |~#ldv_global_msg_list~0.base|)))) (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |~#dev~0.base| (_ bv0 32)) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)))) (= (_ bv8 32) (select |#length| |~#dev~0.base|)))} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {5190#(and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (or (= |probe_23_#in~dev.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)) (= (_ bv8 32) (select |#length| |~#ldv_global_msg_list~0.base|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#ldv_global_msg_list~0.base|))) (_ bv1 1))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| |probe_23_#in~dev.base|)))) (_ bv1 1))) (= (select |#length| |probe_23_#in~dev.base|) (_ bv8 32)) (= |probe_23_#in~dev.offset| (_ bv0 32)))} is VALID [2021-09-13 23:47:55,757 INFO L281 TraceCheckUtils]: 7: Hoare triple {5190#(and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (or (= |probe_23_#in~dev.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)) (= (_ bv8 32) (select |#length| |~#ldv_global_msg_list~0.base|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#ldv_global_msg_list~0.base|))) (_ bv1 1))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| |probe_23_#in~dev.base|)))) (_ bv1 1))) (= (select |#length| |probe_23_#in~dev.base|) (_ bv8 32)) (= |probe_23_#in~dev.offset| (_ bv0 32)))} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {5194#(and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (or (= (_ bv0 32) probe_23_~dev.base) (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)) (= (_ bv8 32) (select |#length| |~#ldv_global_msg_list~0.base|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#ldv_global_msg_list~0.base|))) (_ bv1 1))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1))) (= (_ bv8 32) (select |#length| probe_23_~dev.base)) (= probe_23_~dev.offset (_ bv0 32)))} is VALID [2021-09-13 23:47:55,758 INFO L264 TraceCheckUtils]: 8: Hoare triple {5194#(and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (or (= (_ bv0 32) probe_23_~dev.base) (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)) (= (_ bv8 32) (select |#length| |~#ldv_global_msg_list~0.base|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#ldv_global_msg_list~0.base|))) (_ bv1 1))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1))) (= (_ bv8 32) (select |#length| probe_23_~dev.base)) (= probe_23_~dev.offset (_ bv0 32)))} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {5198#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2021-09-13 23:47:55,758 INFO L281 TraceCheckUtils]: 9: Hoare triple {5198#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {5198#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2021-09-13 23:47:55,759 INFO L281 TraceCheckUtils]: 10: Hoare triple {5198#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5205#(exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |old(#length)| |ldv_malloc_#res.base| ldv_malloc_~size) |#length|)))} is VALID [2021-09-13 23:47:55,760 INFO L281 TraceCheckUtils]: 11: Hoare triple {5205#(exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |old(#length)| |ldv_malloc_#res.base| ldv_malloc_~size) |#length|)))} assume true; {5205#(exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |old(#length)| |ldv_malloc_#res.base| ldv_malloc_~size) |#length|)))} is VALID [2021-09-13 23:47:55,761 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {5205#(exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |ldv_malloc_#res.base|)) (= (store |old(#length)| |ldv_malloc_#res.base| ldv_malloc_~size) |#length|)))} {5194#(and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (and (or (= (_ bv0 32) probe_23_~dev.base) (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= (_ bv0 32) |~#ldv_global_msg_list~0.base|)) (= (_ bv8 32) (select |#length| |~#ldv_global_msg_list~0.base|)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#ldv_global_msg_list~0.base|))) (_ bv1 1))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1))) (= (_ bv8 32) (select |#length| probe_23_~dev.base)) (= probe_23_~dev.offset (_ bv0 32)))} #595#return; {5212#(and (= (_ bv8 32) (select |#length| probe_23_~dev.base)) (= probe_23_~dev.offset (_ bv0 32)))} is VALID [2021-09-13 23:47:55,761 INFO L281 TraceCheckUtils]: 13: Hoare triple {5212#(and (= (_ bv8 32) (select |#length| probe_23_~dev.base)) (= probe_23_~dev.offset (_ bv0 32)))} ~p~1.base, ~p~1.offset := #t~ret61.base, #t~ret61.offset;havoc #t~ret61.base, #t~ret61.offset; {5212#(and (= (_ bv8 32) (select |#length| probe_23_~dev.base)) (= probe_23_~dev.offset (_ bv0 32)))} is VALID [2021-09-13 23:47:55,762 INFO L281 TraceCheckUtils]: 14: Hoare triple {5212#(and (= (_ bv8 32) (select |#length| probe_23_~dev.base)) (= probe_23_~dev.offset (_ bv0 32)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {5212#(and (= (_ bv8 32) (select |#length| probe_23_~dev.base)) (= probe_23_~dev.offset (_ bv0 32)))} is VALID [2021-09-13 23:47:55,763 INFO L264 TraceCheckUtils]: 15: Hoare triple {5212#(and (= (_ bv8 32) (select |#length| probe_23_~dev.base)) (= probe_23_~dev.offset (_ bv0 32)))} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {5222#(exists ((v_probe_23_~dev.base_BEFORE_CALL_6 (_ BitVec 32))) (= (_ bv8 32) (select |#length| v_probe_23_~dev.base_BEFORE_CALL_6)))} is VALID [2021-09-13 23:47:55,763 INFO L281 TraceCheckUtils]: 16: Hoare triple {5222#(exists ((v_probe_23_~dev.base_BEFORE_CALL_6 (_ BitVec 32))) (= (_ bv8 32) (select |#length| v_probe_23_~dev.base_BEFORE_CALL_6)))} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {5222#(exists ((v_probe_23_~dev.base_BEFORE_CALL_6 (_ BitVec 32))) (= (_ bv8 32) (select |#length| v_probe_23_~dev.base_BEFORE_CALL_6)))} is VALID [2021-09-13 23:47:55,763 INFO L281 TraceCheckUtils]: 17: Hoare triple {5222#(exists ((v_probe_23_~dev.base_BEFORE_CALL_6 (_ BitVec 32))) (= (_ bv8 32) (select |#length| v_probe_23_~dev.base_BEFORE_CALL_6)))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {5222#(exists ((v_probe_23_~dev.base_BEFORE_CALL_6 (_ BitVec 32))) (= (_ bv8 32) (select |#length| v_probe_23_~dev.base_BEFORE_CALL_6)))} is VALID [2021-09-13 23:47:55,764 INFO L281 TraceCheckUtils]: 18: Hoare triple {5222#(exists ((v_probe_23_~dev.base_BEFORE_CALL_6 (_ BitVec 32))) (= (_ bv8 32) (select |#length| v_probe_23_~dev.base_BEFORE_CALL_6)))} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {5222#(exists ((v_probe_23_~dev.base_BEFORE_CALL_6 (_ BitVec 32))) (= (_ bv8 32) (select |#length| v_probe_23_~dev.base_BEFORE_CALL_6)))} is VALID [2021-09-13 23:47:55,764 INFO L281 TraceCheckUtils]: 19: Hoare triple {5222#(exists ((v_probe_23_~dev.base_BEFORE_CALL_6 (_ BitVec 32))) (= (_ bv8 32) (select |#length| v_probe_23_~dev.base_BEFORE_CALL_6)))} assume true; {5222#(exists ((v_probe_23_~dev.base_BEFORE_CALL_6 (_ BitVec 32))) (= (_ bv8 32) (select |#length| v_probe_23_~dev.base_BEFORE_CALL_6)))} is VALID [2021-09-13 23:47:55,764 INFO L276 TraceCheckUtils]: 20: Hoare quadruple {5222#(exists ((v_probe_23_~dev.base_BEFORE_CALL_6 (_ BitVec 32))) (= (_ bv8 32) (select |#length| v_probe_23_~dev.base_BEFORE_CALL_6)))} {5212#(and (= (_ bv8 32) (select |#length| probe_23_~dev.base)) (= probe_23_~dev.offset (_ bv0 32)))} #597#return; {5212#(and (= (_ bv8 32) (select |#length| probe_23_~dev.base)) (= probe_23_~dev.offset (_ bv0 32)))} is VALID [2021-09-13 23:47:55,765 INFO L281 TraceCheckUtils]: 21: Hoare triple {5212#(and (= (_ bv8 32) (select |#length| probe_23_~dev.base)) (= probe_23_~dev.offset (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~dev.offset), #length[~dev.base]) && ~bvule32(~dev.offset, ~bvadd32(4bv32, ~dev.offset))) && ~bvule32(0bv32, ~dev.offset)); {5167#false} is VALID [2021-09-13 23:47:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:47:55,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 23:48:15,772 INFO L281 TraceCheckUtils]: 21: Hoare triple {5241#(and (bvule (bvadd probe_23_~dev.offset (_ bv4 32)) (select |#length| probe_23_~dev.base)) (bvule probe_23_~dev.offset (bvadd probe_23_~dev.offset (_ bv4 32))))} assume !((~bvule32(~bvadd32(4bv32, ~dev.offset), #length[~dev.base]) && ~bvule32(~dev.offset, ~bvadd32(4bv32, ~dev.offset))) && ~bvule32(0bv32, ~dev.offset)); {5167#false} is VALID [2021-09-13 23:48:15,773 INFO L276 TraceCheckUtils]: 20: Hoare quadruple {5166#true} {5241#(and (bvule (bvadd probe_23_~dev.offset (_ bv4 32)) (select |#length| probe_23_~dev.base)) (bvule probe_23_~dev.offset (bvadd probe_23_~dev.offset (_ bv4 32))))} #597#return; {5241#(and (bvule (bvadd probe_23_~dev.offset (_ bv4 32)) (select |#length| probe_23_~dev.base)) (bvule probe_23_~dev.offset (bvadd probe_23_~dev.offset (_ bv4 32))))} is VALID [2021-09-13 23:48:15,773 INFO L281 TraceCheckUtils]: 19: Hoare triple {5166#true} assume true; {5166#true} is VALID [2021-09-13 23:48:15,773 INFO L281 TraceCheckUtils]: 18: Hoare triple {5166#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {5166#true} is VALID [2021-09-13 23:48:15,773 INFO L281 TraceCheckUtils]: 17: Hoare triple {5166#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {5166#true} is VALID [2021-09-13 23:48:15,773 INFO L281 TraceCheckUtils]: 16: Hoare triple {5166#true} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {5166#true} is VALID [2021-09-13 23:48:15,773 INFO L264 TraceCheckUtils]: 15: Hoare triple {5241#(and (bvule (bvadd probe_23_~dev.offset (_ bv4 32)) (select |#length| probe_23_~dev.base)) (bvule probe_23_~dev.offset (bvadd probe_23_~dev.offset (_ bv4 32))))} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {5166#true} is VALID [2021-09-13 23:48:15,774 INFO L281 TraceCheckUtils]: 14: Hoare triple {5241#(and (bvule (bvadd probe_23_~dev.offset (_ bv4 32)) (select |#length| probe_23_~dev.base)) (bvule probe_23_~dev.offset (bvadd probe_23_~dev.offset (_ bv4 32))))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {5241#(and (bvule (bvadd probe_23_~dev.offset (_ bv4 32)) (select |#length| probe_23_~dev.base)) (bvule probe_23_~dev.offset (bvadd probe_23_~dev.offset (_ bv4 32))))} is VALID [2021-09-13 23:48:15,774 INFO L281 TraceCheckUtils]: 13: Hoare triple {5241#(and (bvule (bvadd probe_23_~dev.offset (_ bv4 32)) (select |#length| probe_23_~dev.base)) (bvule probe_23_~dev.offset (bvadd probe_23_~dev.offset (_ bv4 32))))} ~p~1.base, ~p~1.offset := #t~ret61.base, #t~ret61.offset;havoc #t~ret61.base, #t~ret61.offset; {5241#(and (bvule (bvadd probe_23_~dev.offset (_ bv4 32)) (select |#length| probe_23_~dev.base)) (bvule probe_23_~dev.offset (bvadd probe_23_~dev.offset (_ bv4 32))))} is VALID [2021-09-13 23:48:17,792 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {5273#(forall ((v_probe_23_~dev.base_BEFORE_CALL_8 (_ BitVec 32)) (v_probe_23_~dev.offset_BEFORE_CALL_4 (_ BitVec 32))) (or (and (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select |#length| v_probe_23_~dev.base_BEFORE_CALL_8)) (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (and (or (not (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((v_ldv_malloc_~size_19 (_ BitVec 32))) (not (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |old(#length)| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) v_probe_23_~dev.base_BEFORE_CALL_8))))) (= (_ bv0 1) (select |old(#valid)| |v_ldv_malloc_#res.base_21|))))))} {5269#(forall ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (or (and (bvule probe_23_~dev.offset (bvadd probe_23_~dev.offset (_ bv4 32))) (forall ((v_ldv_malloc_~size_19 (_ BitVec 32))) (bvule (bvadd probe_23_~dev.offset (_ bv4 32)) (select (store |#length| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) probe_23_~dev.base)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_21|)))))} #595#return; {5241#(and (bvule (bvadd probe_23_~dev.offset (_ bv4 32)) (select |#length| probe_23_~dev.base)) (bvule probe_23_~dev.offset (bvadd probe_23_~dev.offset (_ bv4 32))))} is UNKNOWN [2021-09-13 23:48:17,793 INFO L281 TraceCheckUtils]: 11: Hoare triple {5273#(forall ((v_probe_23_~dev.base_BEFORE_CALL_8 (_ BitVec 32)) (v_probe_23_~dev.offset_BEFORE_CALL_4 (_ BitVec 32))) (or (and (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select |#length| v_probe_23_~dev.base_BEFORE_CALL_8)) (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (and (or (not (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((v_ldv_malloc_~size_19 (_ BitVec 32))) (not (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |old(#length)| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) v_probe_23_~dev.base_BEFORE_CALL_8))))) (= (_ bv0 1) (select |old(#valid)| |v_ldv_malloc_#res.base_21|))))))} assume true; {5273#(forall ((v_probe_23_~dev.base_BEFORE_CALL_8 (_ BitVec 32)) (v_probe_23_~dev.offset_BEFORE_CALL_4 (_ BitVec 32))) (or (and (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select |#length| v_probe_23_~dev.base_BEFORE_CALL_8)) (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (and (or (not (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((v_ldv_malloc_~size_19 (_ BitVec 32))) (not (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |old(#length)| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) v_probe_23_~dev.base_BEFORE_CALL_8))))) (= (_ bv0 1) (select |old(#valid)| |v_ldv_malloc_#res.base_21|))))))} is VALID [2021-09-13 23:48:19,800 INFO L281 TraceCheckUtils]: 10: Hoare triple {5280#(forall ((|v_ldv_malloc_#res.base_22| (_ BitVec 32)) (v_probe_23_~dev.base_BEFORE_CALL_8 (_ BitVec 32)) (v_probe_23_~dev.offset_BEFORE_CALL_4 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_22|))) (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |#length| |v_ldv_malloc_#res.base_22| ldv_malloc_~size) v_probe_23_~dev.base_BEFORE_CALL_8))) (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (and (or (not (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((v_ldv_malloc_~size_19 (_ BitVec 32))) (not (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |old(#length)| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) v_probe_23_~dev.base_BEFORE_CALL_8))))) (= (_ bv0 1) (select |old(#valid)| |v_ldv_malloc_#res.base_21|))))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5273#(forall ((v_probe_23_~dev.base_BEFORE_CALL_8 (_ BitVec 32)) (v_probe_23_~dev.offset_BEFORE_CALL_4 (_ BitVec 32))) (or (and (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select |#length| v_probe_23_~dev.base_BEFORE_CALL_8)) (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (and (or (not (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((v_ldv_malloc_~size_19 (_ BitVec 32))) (not (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |old(#length)| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) v_probe_23_~dev.base_BEFORE_CALL_8))))) (= (_ bv0 1) (select |old(#valid)| |v_ldv_malloc_#res.base_21|))))))} is UNKNOWN [2021-09-13 23:48:19,801 INFO L281 TraceCheckUtils]: 9: Hoare triple {5280#(forall ((|v_ldv_malloc_#res.base_22| (_ BitVec 32)) (v_probe_23_~dev.base_BEFORE_CALL_8 (_ BitVec 32)) (v_probe_23_~dev.offset_BEFORE_CALL_4 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_22|))) (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |#length| |v_ldv_malloc_#res.base_22| ldv_malloc_~size) v_probe_23_~dev.base_BEFORE_CALL_8))) (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (and (or (not (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((v_ldv_malloc_~size_19 (_ BitVec 32))) (not (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |old(#length)| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) v_probe_23_~dev.base_BEFORE_CALL_8))))) (= (_ bv0 1) (select |old(#valid)| |v_ldv_malloc_#res.base_21|))))))} ~size := #in~size; {5280#(forall ((|v_ldv_malloc_#res.base_22| (_ BitVec 32)) (v_probe_23_~dev.base_BEFORE_CALL_8 (_ BitVec 32)) (v_probe_23_~dev.offset_BEFORE_CALL_4 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_22|))) (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |#length| |v_ldv_malloc_#res.base_22| ldv_malloc_~size) v_probe_23_~dev.base_BEFORE_CALL_8))) (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (and (or (not (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((v_ldv_malloc_~size_19 (_ BitVec 32))) (not (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |old(#length)| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) v_probe_23_~dev.base_BEFORE_CALL_8))))) (= (_ bv0 1) (select |old(#valid)| |v_ldv_malloc_#res.base_21|))))))} is VALID [2021-09-13 23:48:19,803 INFO L264 TraceCheckUtils]: 8: Hoare triple {5269#(forall ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (or (and (bvule probe_23_~dev.offset (bvadd probe_23_~dev.offset (_ bv4 32))) (forall ((v_ldv_malloc_~size_19 (_ BitVec 32))) (bvule (bvadd probe_23_~dev.offset (_ bv4 32)) (select (store |#length| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) probe_23_~dev.base)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_21|)))))} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {5280#(forall ((|v_ldv_malloc_#res.base_22| (_ BitVec 32)) (v_probe_23_~dev.base_BEFORE_CALL_8 (_ BitVec 32)) (v_probe_23_~dev.offset_BEFORE_CALL_4 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_22|))) (and (forall ((ldv_malloc_~size (_ BitVec 32))) (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |#length| |v_ldv_malloc_#res.base_22| ldv_malloc_~size) v_probe_23_~dev.base_BEFORE_CALL_8))) (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (and (or (not (bvule v_probe_23_~dev.offset_BEFORE_CALL_4 (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)))) (exists ((v_ldv_malloc_~size_19 (_ BitVec 32))) (not (bvule (bvadd v_probe_23_~dev.offset_BEFORE_CALL_4 (_ bv4 32)) (select (store |old(#length)| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) v_probe_23_~dev.base_BEFORE_CALL_8))))) (= (_ bv0 1) (select |old(#valid)| |v_ldv_malloc_#res.base_21|))))))} is VALID [2021-09-13 23:48:19,813 INFO L281 TraceCheckUtils]: 7: Hoare triple {5287#(forall ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (or (and (bvule |probe_23_#in~dev.offset| (bvadd (_ bv4 32) |probe_23_#in~dev.offset|)) (forall ((v_ldv_malloc_~size_19 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |probe_23_#in~dev.offset|) (select (store |#length| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) |probe_23_#in~dev.base|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_21|)))))} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {5269#(forall ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (or (and (bvule probe_23_~dev.offset (bvadd probe_23_~dev.offset (_ bv4 32))) (forall ((v_ldv_malloc_~size_19 (_ BitVec 32))) (bvule (bvadd probe_23_~dev.offset (_ bv4 32)) (select (store |#length| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) probe_23_~dev.base)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_21|)))))} is VALID [2021-09-13 23:48:19,814 INFO L264 TraceCheckUtils]: 6: Hoare triple {5291#(forall ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (or (and (bvule |~#dev~0.offset| (bvadd (_ bv4 32) |~#dev~0.offset|)) (forall ((v_ldv_malloc_~size_19 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |~#dev~0.offset|) (select (store |#length| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) |~#dev~0.base|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_21|)))))} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {5287#(forall ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (or (and (bvule |probe_23_#in~dev.offset| (bvadd (_ bv4 32) |probe_23_#in~dev.offset|)) (forall ((v_ldv_malloc_~size_19 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |probe_23_#in~dev.offset|) (select (store |#length| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) |probe_23_#in~dev.base|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_21|)))))} is VALID [2021-09-13 23:48:19,814 INFO L264 TraceCheckUtils]: 5: Hoare triple {5291#(forall ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (or (and (bvule |~#dev~0.offset| (bvadd (_ bv4 32) |~#dev~0.offset|)) (forall ((v_ldv_malloc_~size_19 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |~#dev~0.offset|) (select (store |#length| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) |~#dev~0.base|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_21|)))))} call entry_point(); {5291#(forall ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (or (and (bvule |~#dev~0.offset| (bvadd (_ bv4 32) |~#dev~0.offset|)) (forall ((v_ldv_malloc_~size_19 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |~#dev~0.offset|) (select (store |#length| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) |~#dev~0.base|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_21|)))))} is VALID [2021-09-13 23:48:19,815 INFO L264 TraceCheckUtils]: 4: Hoare triple {5291#(forall ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (or (and (bvule |~#dev~0.offset| (bvadd (_ bv4 32) |~#dev~0.offset|)) (forall ((v_ldv_malloc_~size_19 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |~#dev~0.offset|) (select (store |#length| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) |~#dev~0.base|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_21|)))))} call main(); {5291#(forall ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (or (and (bvule |~#dev~0.offset| (bvadd (_ bv4 32) |~#dev~0.offset|)) (forall ((v_ldv_malloc_~size_19 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |~#dev~0.offset|) (select (store |#length| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) |~#dev~0.base|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_21|)))))} is VALID [2021-09-13 23:48:19,815 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {5291#(forall ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (or (and (bvule |~#dev~0.offset| (bvadd (_ bv4 32) |~#dev~0.offset|)) (forall ((v_ldv_malloc_~size_19 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |~#dev~0.offset|) (select (store |#length| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) |~#dev~0.base|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_21|)))))} {5166#true} #673#return; {5291#(forall ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (or (and (bvule |~#dev~0.offset| (bvadd (_ bv4 32) |~#dev~0.offset|)) (forall ((v_ldv_malloc_~size_19 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |~#dev~0.offset|) (select (store |#length| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) |~#dev~0.base|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_21|)))))} is VALID [2021-09-13 23:48:19,816 INFO L281 TraceCheckUtils]: 2: Hoare triple {5291#(forall ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (or (and (bvule |~#dev~0.offset| (bvadd (_ bv4 32) |~#dev~0.offset|)) (forall ((v_ldv_malloc_~size_19 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |~#dev~0.offset|) (select (store |#length| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) |~#dev~0.base|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_21|)))))} assume true; {5291#(forall ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (or (and (bvule |~#dev~0.offset| (bvadd (_ bv4 32) |~#dev~0.offset|)) (forall ((v_ldv_malloc_~size_19 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |~#dev~0.offset|) (select (store |#length| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) |~#dev~0.base|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_21|)))))} is VALID [2021-09-13 23:48:19,819 INFO L281 TraceCheckUtils]: 1: Hoare triple {5166#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32);~dispatch_type~0.base, ~dispatch_type~0.offset := ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.base(), ~const~array~~LB~bv32~RB~~LC~base~COL~bv32~COM~offset~COL~bv32~RC~.offset();call ~#dev~0.base, ~#dev~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~#dev~0.offset, 4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#dev~0.base, ~bvadd32(4bv32, ~#dev~0.offset), 4bv32); {5291#(forall ((|v_ldv_malloc_#res.base_21| (_ BitVec 32))) (or (and (bvule |~#dev~0.offset| (bvadd (_ bv4 32) |~#dev~0.offset|)) (forall ((v_ldv_malloc_~size_19 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) |~#dev~0.offset|) (select (store |#length| |v_ldv_malloc_#res.base_21| v_ldv_malloc_~size_19) |~#dev~0.base|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_21|)))))} is VALID [2021-09-13 23:48:19,819 INFO L264 TraceCheckUtils]: 0: Hoare triple {5166#true} call ULTIMATE.init(); {5166#true} is VALID [2021-09-13 23:48:19,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-13 23:48:19,819 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 23:48:19,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710701919] [2021-09-13 23:48:19,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710701919] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 23:48:19,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 23:48:19,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2021-09-13 23:48:19,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809934148] [2021-09-13 23:48:19,820 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 7 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 22 [2021-09-13 23:48:19,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 23:48:19,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 7 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-09-13 23:48:27,910 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 39 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2021-09-13 23:48:27,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-09-13 23:48:27,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 23:48:27,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-09-13 23:48:27,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=162, Unknown=9, NotChecked=0, Total=210 [2021-09-13 23:48:27,911 INFO L87 Difference]: Start difference. First operand 264 states and 289 transitions. Second operand has 15 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 13 states have internal predecessors, (26), 7 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2021-09-13 23:48:40,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 23:48:40,990 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 20107.26ms TimeCoverageRelationStatistics Valid=39, Invalid=162, Unknown=9, NotChecked=0, Total=210 [2021-09-13 23:48:40,990 INFO L928 BasicCegarLoop]: 24 mSDtfsCounter, 12 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 314.55ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 3.85ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 670 IncrementalHoareTripleChecker+Unchecked, 316.93ms IncrementalHoareTripleChecker+Time [2021-09-13 23:48:40,991 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 133 Invalid, 834 Unknown, 0 Unchecked, 3.85ms Time], IncrementalHoareTripleChecker [0 Valid, 164 Invalid, 0 Unknown, 670 Unchecked, 316.93ms Time] [2021-09-13 23:48:41,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-09-13 23:48:41,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-09-13 23:48:41,198 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: HoareTripleChecker results differ between SdHoareTripleChecker (result: INVALID) and MonolithicHoareTripleChecker (result: VALID) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.createAssertionError(ChainingHoareTripleChecker.java:367) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.reviewInductiveReturn(ChainingHoareTripleChecker.java:346) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.checkReturn(ChainingHoareTripleChecker.java:311) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkReturn(ChainingHoareTripleChecker.java:123) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkReturn(CachingHoareTripleChecker.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$ReturnSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:442) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.returnSuccessors(AbstractInterpolantAutomaton.java:279) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.returnSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.returnSuccessors(TotalizeNwa.java:308) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.returnSuccessors(ComplementDeterministicNwa.java:142) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.returnSuccessors(ProductNwa.java:284) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.returnSuccessorsGivenHier(ProductNwa.java:308) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addReturnsAndSuccessors(NestedWordAutomatonReachableStates.java:1118) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:950) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:863) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:779) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-09-13 23:48:41,205 INFO L158 Benchmark]: Toolchain (without parser) took 99183.71ms. Allocated memory was 52.4MB in the beginning and 119.5MB in the end (delta: 67.1MB). Free memory was 27.6MB in the beginning and 29.4MB in the end (delta: -1.8MB). Peak memory consumption was 65.7MB. Max. memory is 16.1GB. [2021-09-13 23:48:41,206 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 52.4MB. Free memory is still 34.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 23:48:41,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 627.56ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 27.3MB in the beginning and 33.0MB in the end (delta: -5.7MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2021-09-13 23:48:41,206 INFO L158 Benchmark]: Boogie Preprocessor took 93.87ms. Allocated memory is still 65.0MB. Free memory was 33.0MB in the beginning and 38.9MB in the end (delta: -5.9MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2021-09-13 23:48:41,207 INFO L158 Benchmark]: RCFGBuilder took 1079.93ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 38.9MB in the beginning and 46.4MB in the end (delta: -7.6MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2021-09-13 23:48:41,207 INFO L158 Benchmark]: TraceAbstraction took 97378.60ms. Allocated memory was 79.7MB in the beginning and 119.5MB in the end (delta: 39.8MB). Free memory was 46.1MB in the beginning and 30.5MB in the end (delta: 15.6MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2021-09-13 23:48:41,208 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.17ms. Allocated memory is still 52.4MB. Free memory is still 34.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 627.56ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 27.3MB in the beginning and 33.0MB in the end (delta: -5.7MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.87ms. Allocated memory is still 65.0MB. Free memory was 33.0MB in the beginning and 38.9MB in the end (delta: -5.9MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1079.93ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 38.9MB in the beginning and 46.4MB in the end (delta: -7.6MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * TraceAbstraction took 97378.60ms. Allocated memory was 79.7MB in the beginning and 119.5MB in the end (delta: 39.8MB). Free memory was 46.1MB in the beginning and 30.5MB in the end (delta: 15.6MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: HoareTripleChecker results differ between SdHoareTripleChecker (result: INVALID) and MonolithicHoareTripleChecker (result: VALID) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: HoareTripleChecker results differ between SdHoareTripleChecker (result: INVALID) and MonolithicHoareTripleChecker (result: VALID): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ReviewedProtectedHtc.createAssertionError(ChainingHoareTripleChecker.java:367) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-09-13 23:48:41,253 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...