./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.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_1.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 d92dad4d1e0f3cc1aec7a25aae4568f99aabbda8 ............................................................................................................................................................. 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_1.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 d92dad4d1e0f3cc1aec7a25aae4568f99aabbda8 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:42,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 23:46:42,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 23:46:42,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 23:46:42,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 23:46:42,645 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 23:46:42,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 23:46:42,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 23:46:42,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 23:46:42,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 23:46:42,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 23:46:42,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 23:46:42,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 23:46:42,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 23:46:42,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 23:46:42,671 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 23:46:42,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 23:46:42,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 23:46:42,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 23:46:42,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 23:46:42,682 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 23:46:42,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 23:46:42,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 23:46:42,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 23:46:42,688 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 23:46:42,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 23:46:42,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 23:46:42,692 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 23:46:42,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 23:46:42,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 23:46:42,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 23:46:42,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 23:46:42,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 23:46:42,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 23:46:42,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 23:46:42,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 23:46:42,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 23:46:42,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 23:46:42,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 23:46:42,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 23:46:42,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 23:46:42,701 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:42,732 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 23:46:42,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 23:46:42,733 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 23:46:42,733 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 23:46:42,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 23:46:42,735 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 23:46:42,735 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 23:46:42,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 23:46:42,736 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 23:46:42,736 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-09-13 23:46:42,737 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 23:46:42,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 23:46:42,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 23:46:42,737 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-09-13 23:46:42,737 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-09-13 23:46:42,737 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-09-13 23:46:42,738 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 23:46:42,738 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-09-13 23:46:42,738 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 23:46:42,738 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 23:46:42,739 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 23:46:42,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 23:46:42,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 23:46:42,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 23:46:42,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 23:46:42,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 23:46:42,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-13 23:46:42,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-13 23:46:42,740 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 23:46:42,740 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 -> d92dad4d1e0f3cc1aec7a25aae4568f99aabbda8 [2021-09-13 23:46:43,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 23:46:43,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 23:46:43,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 23:46:43,122 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 23:46:43,123 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 23:46:43,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.i [2021-09-13 23:46:43,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afb8fca01/01449cc98f16403ab602d16eb316e580/FLAG61dd23434 [2021-09-13 23:46:43,752 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 23:46:43,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.i [2021-09-13 23:46:43,779 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afb8fca01/01449cc98f16403ab602d16eb316e580/FLAG61dd23434 [2021-09-13 23:46:44,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afb8fca01/01449cc98f16403ab602d16eb316e580 [2021-09-13 23:46:44,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 23:46:44,189 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-09-13 23:46:44,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 23:46:44,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 23:46:44,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 23:46:44,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:46:44" (1/1) ... [2021-09-13 23:46:44,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343320a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:46:44, skipping insertion in model container [2021-09-13 23:46:44,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:46:44" (1/1) ... [2021-09-13 23:46:44,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 23:46:44,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 23:46:44,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 23:46:44,679 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:44,687 INFO L158 Benchmark]: Toolchain (without parser) took 496.59ms. Allocated memory is still 58.7MB. Free memory was 36.1MB in the beginning and 36.5MB in the end (delta: -379.9kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 23:46:44,688 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 58.7MB. Free memory was 41.3MB in the beginning and 41.3MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 23:46:44,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 494.29ms. Allocated memory is still 58.7MB. Free memory was 35.9MB in the beginning and 36.7MB in the end (delta: -783.9kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-09-13 23:46:44,691 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.28ms. Allocated memory is still 58.7MB. Free memory was 41.3MB in the beginning and 41.3MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 494.29ms. Allocated memory is still 58.7MB. Free memory was 35.9MB in the beginning and 36.7MB in the end (delta: -783.9kB). Peak memory consumption was 12.6MB. 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:46:46,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-13 23:46:46,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-13 23:46:46,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-13 23:46:46,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-13 23:46:46,458 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-13 23:46:46,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-13 23:46:46,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-13 23:46:46,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-13 23:46:46,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-13 23:46:46,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-13 23:46:46,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-13 23:46:46,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-13 23:46:46,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-13 23:46:46,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-13 23:46:46,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-13 23:46:46,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-13 23:46:46,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-13 23:46:46,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-13 23:46:46,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-13 23:46:46,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-13 23:46:46,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-13 23:46:46,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-13 23:46:46,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-13 23:46:46,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-13 23:46:46,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-13 23:46:46,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-13 23:46:46,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-13 23:46:46,511 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-13 23:46:46,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-13 23:46:46,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-13 23:46:46,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-13 23:46:46,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-13 23:46:46,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-13 23:46:46,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-13 23:46:46,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-13 23:46:46,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-13 23:46:46,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-13 23:46:46,518 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-13 23:46:46,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-13 23:46:46,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-13 23:46:46,522 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:46:46,556 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-13 23:46:46,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-13 23:46:46,558 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-13 23:46:46,558 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-13 23:46:46,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-13 23:46:46,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-13 23:46:46,560 INFO L138 SettingsManager]: * Use SBE=true [2021-09-13 23:46:46,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-13 23:46:46,560 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-13 23:46:46,560 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-09-13 23:46:46,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-13 23:46:46,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-13 23:46:46,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-13 23:46:46,562 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-09-13 23:46:46,562 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-09-13 23:46:46,562 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-09-13 23:46:46,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-13 23:46:46,563 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-09-13 23:46:46,563 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-09-13 23:46:46,563 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-09-13 23:46:46,563 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-13 23:46:46,563 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-13 23:46:46,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-13 23:46:46,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-13 23:46:46,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-13 23:46:46,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 23:46:46,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-13 23:46:46,564 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-13 23:46:46,565 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-09-13 23:46:46,565 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-09-13 23:46:46,565 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-13 23:46:46,565 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-09-13 23:46:46,565 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 -> d92dad4d1e0f3cc1aec7a25aae4568f99aabbda8 [2021-09-13 23:46:46,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-13 23:46:46,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-13 23:46:46,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-13 23:46:46,898 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-13 23:46:46,898 INFO L275 PluginConnector]: CDTParser initialized [2021-09-13 23:46:46,899 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.i [2021-09-13 23:46:46,955 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a758b962d/ea98daecd4c54c978b91d756c813b579/FLAG18f96887f [2021-09-13 23:46:47,500 INFO L306 CDTParser]: Found 1 translation units. [2021-09-13 23:46:47,500 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.i [2021-09-13 23:46:47,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a758b962d/ea98daecd4c54c978b91d756c813b579/FLAG18f96887f [2021-09-13 23:46:47,823 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a758b962d/ea98daecd4c54c978b91d756c813b579 [2021-09-13 23:46:47,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-13 23:46:47,826 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-09-13 23:46:47,827 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-13 23:46:47,827 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-13 23:46:47,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-13 23:46:47,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:46:47" (1/1) ... [2021-09-13 23:46:47,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73cd5e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:46:47, skipping insertion in model container [2021-09-13 23:46:47,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.09 11:46:47" (1/1) ... [2021-09-13 23:46:47,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-13 23:46:47,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 23:46:48,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 23:46:48,346 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-09-13 23:46:48,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-13 23:46:48,442 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 23:46:48,462 INFO L203 MainTranslator]: Completed pre-run [2021-09-13 23:46:48,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-13 23:46:48,590 INFO L208 MainTranslator]: Completed translation [2021-09-13 23:46:48,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:46:48 WrapperNode [2021-09-13 23:46:48,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-13 23:46:48,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-13 23:46:48,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-13 23:46:48,593 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-13 23:46:48,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:46:48" (1/1) ... [2021-09-13 23:46:48,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:46:48" (1/1) ... [2021-09-13 23:46:48,639 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:46:48" (1/1) ... [2021-09-13 23:46:48,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:46:48" (1/1) ... [2021-09-13 23:46:48,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:46:48" (1/1) ... [2021-09-13 23:46:48,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:46:48" (1/1) ... [2021-09-13 23:46:48,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:46:48" (1/1) ... [2021-09-13 23:46:48,761 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-13 23:46:48,767 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-13 23:46:48,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-13 23:46:48,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-13 23:46:48,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:46:48" (1/1) ... [2021-09-13 23:46:48,775 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-13 23:46:48,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-13 23:46:48,798 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:46:48,815 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:46:48,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-09-13 23:46:48,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-13 23:46:48,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2021-09-13 23:46:48,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~C_INT [2021-09-13 23:46:48,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2021-09-13 23:46:48,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2021-09-13 23:46:48,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2021-09-13 23:46:48,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2021-09-13 23:46:48,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2021-09-13 23:46:48,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2021-09-13 23:46:48,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2021-09-13 23:46:48,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2021-09-13 23:46:48,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-09-13 23:46:48,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2021-09-13 23:46:48,840 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2021-09-13 23:46:48,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2021-09-13 23:46:48,840 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2021-09-13 23:46:48,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2021-09-13 23:46:48,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2021-09-13 23:46:48,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2021-09-13 23:46:48,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2021-09-13 23:46:48,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2021-09-13 23:46:48,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2021-09-13 23:46:48,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2021-09-13 23:46:48,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2021-09-13 23:46:48,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2021-09-13 23:46:48,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2021-09-13 23:46:48,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2021-09-13 23:46:48,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2021-09-13 23:46:48,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2021-09-13 23:46:48,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2021-09-13 23:46:48,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2021-09-13 23:46:48,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2021-09-13 23:46:48,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2021-09-13 23:46:48,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2021-09-13 23:46:48,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2021-09-13 23:46:48,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2021-09-13 23:46:48,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2021-09-13 23:46:48,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2021-09-13 23:46:48,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2021-09-13 23:46:48,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2021-09-13 23:46:48,844 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2021-09-13 23:46:48,845 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2021-09-13 23:46:48,845 INFO L138 BoogieDeclarations]: Found implementation of procedure fetch_item [2021-09-13 23:46:48,845 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_register_report [2021-09-13 23:46:48,845 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_parser_main [2021-09-13 23:46:48,846 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2021-09-13 23:46:48,846 INFO L138 BoogieDeclarations]: Found implementation of procedure hid_open_report [2021-09-13 23:46:48,846 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_device [2021-09-13 23:46:48,847 INFO L138 BoogieDeclarations]: Found implementation of procedure probe_23 [2021-09-13 23:46:48,847 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_23 [2021-09-13 23:46:48,847 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2021-09-13 23:46:48,847 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-09-13 23:46:48,847 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-09-13 23:46:48,848 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-09-13 23:46:48,848 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-09-13 23:46:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2021-09-13 23:46:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2021-09-13 23:46:48,848 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2021-09-13 23:46:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2021-09-13 23:46:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2021-09-13 23:46:48,849 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2021-09-13 23:46:48,850 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2021-09-13 23:46:48,850 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2021-09-13 23:46:48,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2021-09-13 23:46:48,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2021-09-13 23:46:48,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2021-09-13 23:46:48,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2021-09-13 23:46:48,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2021-09-13 23:46:48,851 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2021-09-13 23:46:48,851 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2021-09-13 23:46:48,852 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2021-09-13 23:46:48,852 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2021-09-13 23:46:48,852 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2021-09-13 23:46:48,852 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2021-09-13 23:46:48,852 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2021-09-13 23:46:48,852 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2021-09-13 23:46:48,853 INFO L130 BoogieDeclarations]: Found specification of procedure select [2021-09-13 23:46:48,853 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2021-09-13 23:46:48,853 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2021-09-13 23:46:48,853 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2021-09-13 23:46:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2021-09-13 23:46:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure random [2021-09-13 23:46:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2021-09-13 23:46:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2021-09-13 23:46:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2021-09-13 23:46:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2021-09-13 23:46:48,854 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2021-09-13 23:46:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2021-09-13 23:46:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2021-09-13 23:46:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2021-09-13 23:46:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2021-09-13 23:46:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2021-09-13 23:46:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2021-09-13 23:46:48,855 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2021-09-13 23:46:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2021-09-13 23:46:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2021-09-13 23:46:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2021-09-13 23:46:48,856 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2021-09-13 23:46:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2021-09-13 23:46:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2021-09-13 23:46:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2021-09-13 23:46:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2021-09-13 23:46:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2021-09-13 23:46:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2021-09-13 23:46:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2021-09-13 23:46:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2021-09-13 23:46:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2021-09-13 23:46:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2021-09-13 23:46:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2021-09-13 23:46:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2021-09-13 23:46:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-09-13 23:46:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-09-13 23:46:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2021-09-13 23:46:48,859 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-09-13 23:46:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2021-09-13 23:46:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2021-09-13 23:46:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2021-09-13 23:46:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2021-09-13 23:46:48,860 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-09-13 23:46:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2021-09-13 23:46:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2021-09-13 23:46:48,861 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2021-09-13 23:46:48,862 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2021-09-13 23:46:48,864 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2021-09-13 23:46:48,864 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2021-09-13 23:46:48,864 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2021-09-13 23:46:48,864 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2021-09-13 23:46:48,865 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2021-09-13 23:46:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2021-09-13 23:46:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2021-09-13 23:46:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2021-09-13 23:46:48,866 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2021-09-13 23:46:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2021-09-13 23:46:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2021-09-13 23:46:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure system [2021-09-13 23:46:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2021-09-13 23:46:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2021-09-13 23:46:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2021-09-13 23:46:48,872 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2021-09-13 23:46:48,873 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2021-09-13 23:46:48,873 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2021-09-13 23:46:48,873 INFO L130 BoogieDeclarations]: Found specification of procedure div [2021-09-13 23:46:48,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2021-09-13 23:46:48,873 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2021-09-13 23:46:48,873 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2021-09-13 23:46:48,874 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2021-09-13 23:46:48,874 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2021-09-13 23:46:48,874 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2021-09-13 23:46:48,874 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2021-09-13 23:46:48,874 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2021-09-13 23:46:48,874 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2021-09-13 23:46:48,874 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2021-09-13 23:46:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2021-09-13 23:46:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2021-09-13 23:46:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2021-09-13 23:46:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2021-09-13 23:46:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2021-09-13 23:46:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2021-09-13 23:46:48,875 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2021-09-13 23:46:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2021-09-13 23:46:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2021-09-13 23:46:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2021-09-13 23:46:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-09-13 23:46:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-09-13 23:46:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2021-09-13 23:46:48,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2021-09-13 23:46:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2021-09-13 23:46:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2021-09-13 23:46:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-09-13 23:46:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-09-13 23:46:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2021-09-13 23:46:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-09-13 23:46:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2021-09-13 23:46:48,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-09-13 23:46:48,878 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2021-09-13 23:46:48,878 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2021-09-13 23:46:48,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2021-09-13 23:46:48,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-09-13 23:46:48,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2021-09-13 23:46:48,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2021-09-13 23:46:48,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2021-09-13 23:46:48,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2021-09-13 23:46:48,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-09-13 23:46:48,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2021-09-13 23:46:48,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-09-13 23:46:48,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2021-09-13 23:46:48,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2021-09-13 23:46:48,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2021-09-13 23:46:48,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2021-09-13 23:46:48,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2021-09-13 23:46:48,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-09-13 23:46:48,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-09-13 23:46:48,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2021-09-13 23:46:48,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2021-09-13 23:46:48,880 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2021-09-13 23:46:48,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2021-09-13 23:46:48,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2021-09-13 23:46:48,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2021-09-13 23:46:48,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2021-09-13 23:46:48,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2021-09-13 23:46:48,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2021-09-13 23:46:48,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2021-09-13 23:46:48,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2021-09-13 23:46:48,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2021-09-13 23:46:48,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2021-09-13 23:46:48,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2021-09-13 23:46:48,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-09-13 23:46:48,882 INFO L130 BoogieDeclarations]: Found specification of procedure f [2021-09-13 23:46:48,882 INFO L130 BoogieDeclarations]: Found specification of procedure g [2021-09-13 23:46:48,882 INFO L130 BoogieDeclarations]: Found specification of procedure fetch_item [2021-09-13 23:46:48,882 INFO L130 BoogieDeclarations]: Found specification of procedure hid_register_report [2021-09-13 23:46:48,883 INFO L130 BoogieDeclarations]: Found specification of procedure hid_parser_main [2021-09-13 23:46:48,883 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2021-09-13 23:46:48,883 INFO L130 BoogieDeclarations]: Found specification of procedure hid_open_report [2021-09-13 23:46:48,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-13 23:46:48,883 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~C_INT [2021-09-13 23:46:48,883 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_device [2021-09-13 23:46:48,883 INFO L130 BoogieDeclarations]: Found specification of procedure probe_23 [2021-09-13 23:46:48,883 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_23 [2021-09-13 23:46:48,884 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2021-09-13 23:46:48,884 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-09-13 23:46:48,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-09-13 23:46:48,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-09-13 23:46:48,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-13 23:46:48,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2021-09-13 23:46:48,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-09-13 23:46:48,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-09-13 23:46:48,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-09-13 23:46:48,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-09-13 23:46:49,552 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-09-13 23:46:49,924 WARN L804 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-09-13 23:46:50,072 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-13 23:46:50,073 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-09-13 23:46:50,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 11:46:50 BoogieIcfgContainer [2021-09-13 23:46:50,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-13 23:46:50,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-13 23:46:50,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-13 23:46:50,079 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-13 23:46:50,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.09 11:46:47" (1/3) ... [2021-09-13 23:46:50,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377a4652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 11:46:50, skipping insertion in model container [2021-09-13 23:46:50,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.09 11:46:48" (2/3) ... [2021-09-13 23:46:50,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@377a4652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.09 11:46:50, skipping insertion in model container [2021-09-13 23:46:50,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.09 11:46:50" (3/3) ... [2021-09-13 23:46:50,081 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test23_1.i [2021-09-13 23:46:50,085 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-13 23:46:50,086 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 127 error locations. [2021-09-13 23:46:50,144 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-13 23:46:50,159 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:46:50,160 INFO L340 AbstractCegarLoop]: Starting to check reachability of 127 error locations. [2021-09-13 23:46:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 344 states, 180 states have (on average 1.6888888888888889) internal successors, (304), 283 states have internal predecessors, (304), 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:46:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 23:46:50,207 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 23:46:50,208 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:46:50,208 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:46:50,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 23:46:50,213 INFO L82 PathProgramCache]: Analyzing trace with hash -771466933, now seen corresponding path program 1 times [2021-09-13 23:46:50,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 23:46:50,225 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303794757] [2021-09-13 23:46:50,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 23:46:50,227 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 23:46:50,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 23:46:50,229 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:46:50,269 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:46:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:46:50,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 6 conjunts are in the unsatisfiable core [2021-09-13 23:46:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:46:50,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 23:46:50,585 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:46:50,742 INFO L264 TraceCheckUtils]: 0: Hoare triple {347#true} call ULTIMATE.init(); {347#true} is VALID [2021-09-13 23:46:50,743 INFO L281 TraceCheckUtils]: 1: Hoare triple {347#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); {347#true} is VALID [2021-09-13 23:46:50,743 INFO L281 TraceCheckUtils]: 2: Hoare triple {347#true} assume true; {347#true} is VALID [2021-09-13 23:46:50,744 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} #677#return; {347#true} is VALID [2021-09-13 23:46:50,744 INFO L264 TraceCheckUtils]: 4: Hoare triple {347#true} call main(); {347#true} is VALID [2021-09-13 23:46:50,744 INFO L264 TraceCheckUtils]: 5: Hoare triple {347#true} call entry_point(); {347#true} is VALID [2021-09-13 23:46:50,744 INFO L264 TraceCheckUtils]: 6: Hoare triple {347#true} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {347#true} is VALID [2021-09-13 23:46:50,745 INFO L281 TraceCheckUtils]: 7: Hoare triple {347#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {347#true} is VALID [2021-09-13 23:46:50,745 INFO L264 TraceCheckUtils]: 8: Hoare triple {347#true} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {347#true} is VALID [2021-09-13 23:46:50,746 INFO L281 TraceCheckUtils]: 9: Hoare triple {347#true} ~size := #in~size; {347#true} is VALID [2021-09-13 23:46:50,748 INFO L281 TraceCheckUtils]: 10: Hoare triple {347#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; {382#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} is VALID [2021-09-13 23:46:50,748 INFO L281 TraceCheckUtils]: 11: Hoare triple {382#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} assume true; {382#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} is VALID [2021-09-13 23:46:50,750 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {382#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} {347#true} #599#return; {389#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| |probe_23_#t~ret61.base|)))))) (_ bv1 1)))} is VALID [2021-09-13 23:46:50,751 INFO L281 TraceCheckUtils]: 13: Hoare triple {389#(= (_ 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; {393#(= (_ 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:46:50,751 INFO L281 TraceCheckUtils]: 14: Hoare triple {393#(= (_ 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); {393#(= (_ 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:46:50,752 INFO L264 TraceCheckUtils]: 15: Hoare triple {393#(= (_ 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)); {400#(= (_ 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:46:50,753 INFO L281 TraceCheckUtils]: 16: Hoare triple {400#(= (_ 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; {404#(= (_ 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:46:50,754 INFO L281 TraceCheckUtils]: 17: Hoare triple {404#(= (_ 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]); {348#false} is VALID [2021-09-13 23:46:50,755 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:46:50,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 23:46:51,005 INFO L281 TraceCheckUtils]: 17: Hoare triple {404#(= (_ 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]); {348#false} is VALID [2021-09-13 23:46:51,006 INFO L281 TraceCheckUtils]: 16: Hoare triple {400#(= (_ 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; {404#(= (_ 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:46:51,008 INFO L264 TraceCheckUtils]: 15: Hoare triple {393#(= (_ 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)); {400#(= (_ 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:46:51,009 INFO L281 TraceCheckUtils]: 14: Hoare triple {393#(= (_ 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); {393#(= (_ 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:46:51,010 INFO L281 TraceCheckUtils]: 13: Hoare triple {389#(= (_ 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; {393#(= (_ 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:46:51,011 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {382#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} {347#true} #599#return; {389#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (bvneg (bvneg (select |#valid| |probe_23_#t~ret61.base|)))))) (_ bv1 1)))} is VALID [2021-09-13 23:46:51,011 INFO L281 TraceCheckUtils]: 11: Hoare triple {382#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} assume true; {382#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} is VALID [2021-09-13 23:46:51,012 INFO L281 TraceCheckUtils]: 10: Hoare triple {347#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; {382#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)))} is VALID [2021-09-13 23:46:51,013 INFO L281 TraceCheckUtils]: 9: Hoare triple {347#true} ~size := #in~size; {347#true} is VALID [2021-09-13 23:46:51,013 INFO L264 TraceCheckUtils]: 8: Hoare triple {347#true} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {347#true} is VALID [2021-09-13 23:46:51,013 INFO L281 TraceCheckUtils]: 7: Hoare triple {347#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {347#true} is VALID [2021-09-13 23:46:51,013 INFO L264 TraceCheckUtils]: 6: Hoare triple {347#true} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {347#true} is VALID [2021-09-13 23:46:51,014 INFO L264 TraceCheckUtils]: 5: Hoare triple {347#true} call entry_point(); {347#true} is VALID [2021-09-13 23:46:51,014 INFO L264 TraceCheckUtils]: 4: Hoare triple {347#true} call main(); {347#true} is VALID [2021-09-13 23:46:51,014 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {347#true} {347#true} #677#return; {347#true} is VALID [2021-09-13 23:46:51,014 INFO L281 TraceCheckUtils]: 2: Hoare triple {347#true} assume true; {347#true} is VALID [2021-09-13 23:46:51,014 INFO L281 TraceCheckUtils]: 1: Hoare triple {347#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); {347#true} is VALID [2021-09-13 23:46:51,015 INFO L264 TraceCheckUtils]: 0: Hoare triple {347#true} call ULTIMATE.init(); {347#true} is VALID [2021-09-13 23:46:51,015 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:46:51,016 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 23:46:51,016 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303794757] [2021-09-13 23:46:51,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303794757] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 23:46:51,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 23:46:51,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2021-09-13 23:46:51,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215798136] [2021-09-13 23:46:51,023 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:46:51,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 23:46:51,028 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:46:51,053 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:46:51,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-13 23:46:51,054 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 23:46:51,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-13 23:46:51,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-09-13 23:46:51,086 INFO L87 Difference]: Start difference. First operand has 344 states, 180 states have (on average 1.6888888888888889) internal successors, (304), 283 states have internal predecessors, (304), 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:46:55,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:46:55,058 INFO L93 Difference]: Finished difference Result 265 states and 281 transitions. [2021-09-13 23:46:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-13 23:46:55,062 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:46:55,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 23:46:55,064 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:46:55,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 286 transitions. [2021-09-13 23:46:55,086 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:46:55,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 286 transitions. [2021-09-13 23:46:55,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 286 transitions. [2021-09-13 23:46:55,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:46:55,493 INFO L225 Difference]: With dead ends: 265 [2021-09-13 23:46:55,493 INFO L226 Difference]: Without dead ends: 262 [2021-09-13 23:46:55,495 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 84.53ms TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-09-13 23:46:55,498 INFO L928 BasicCegarLoop]: 47 mSDtfsCounter, 19 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1720.59ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 13.97ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1736.45ms IncrementalHoareTripleChecker+Time [2021-09-13 23:46:55,498 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 257 Invalid, 1318 Unknown, 0 Unchecked, 13.97ms Time], IncrementalHoareTripleChecker [3 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 1736.45ms Time] [2021-09-13 23:46:55,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-09-13 23:46:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 254. [2021-09-13 23:46:55,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 23:46:55,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 254 states, 130 states have (on average 1.7153846153846153) internal successors, (223), 209 states have internal predecessors, (223), 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:46:55,561 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 254 states, 130 states have (on average 1.7153846153846153) internal successors, (223), 209 states have internal predecessors, (223), 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:46:55,563 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 254 states, 130 states have (on average 1.7153846153846153) internal successors, (223), 209 states have internal predecessors, (223), 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:46:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:46:55,578 INFO L93 Difference]: Finished difference Result 262 states and 278 transitions. [2021-09-13 23:46:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 278 transitions. [2021-09-13 23:46:55,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:46:55,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:46:55,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 130 states have (on average 1.7153846153846153) internal successors, (223), 209 states have internal predecessors, (223), 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 262 states. [2021-09-13 23:46:55,588 INFO L87 Difference]: Start difference. First operand has 254 states, 130 states have (on average 1.7153846153846153) internal successors, (223), 209 states have internal predecessors, (223), 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 262 states. [2021-09-13 23:46:55,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:46:55,616 INFO L93 Difference]: Finished difference Result 262 states and 278 transitions. [2021-09-13 23:46:55,616 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 278 transitions. [2021-09-13 23:46:55,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:46:55,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:46:55,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 23:46:55,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 23:46:55,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 130 states have (on average 1.7153846153846153) internal successors, (223), 209 states have internal predecessors, (223), 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:46:55,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 271 transitions. [2021-09-13 23:46:55,641 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 271 transitions. Word has length 18 [2021-09-13 23:46:55,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 23:46:55,642 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 271 transitions. [2021-09-13 23:46:55,642 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:46:55,643 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 271 transitions. [2021-09-13 23:46:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 23:46:55,643 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 23:46:55,643 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:46:55,656 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:46:55,852 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:46:55,852 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:46:55,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 23:46:55,853 INFO L82 PathProgramCache]: Analyzing trace with hash -771466932, now seen corresponding path program 1 times [2021-09-13 23:46:55,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 23:46:55,856 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308855158] [2021-09-13 23:46:55,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 23:46:55,856 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 23:46:55,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 23:46:55,858 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:46:55,861 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:46:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:46:56,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 13 conjunts are in the unsatisfiable core [2021-09-13 23:46:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:46:56,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 23:46:56,105 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:46:56,317 INFO L264 TraceCheckUtils]: 0: Hoare triple {1506#true} call ULTIMATE.init(); {1506#true} is VALID [2021-09-13 23:46:56,318 INFO L281 TraceCheckUtils]: 1: Hoare triple {1506#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); {1506#true} is VALID [2021-09-13 23:46:56,318 INFO L281 TraceCheckUtils]: 2: Hoare triple {1506#true} assume true; {1506#true} is VALID [2021-09-13 23:46:56,318 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {1506#true} {1506#true} #677#return; {1506#true} is VALID [2021-09-13 23:46:56,318 INFO L264 TraceCheckUtils]: 4: Hoare triple {1506#true} call main(); {1506#true} is VALID [2021-09-13 23:46:56,319 INFO L264 TraceCheckUtils]: 5: Hoare triple {1506#true} call entry_point(); {1506#true} is VALID [2021-09-13 23:46:56,319 INFO L264 TraceCheckUtils]: 6: Hoare triple {1506#true} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {1506#true} is VALID [2021-09-13 23:46:56,320 INFO L281 TraceCheckUtils]: 7: Hoare triple {1506#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {1506#true} is VALID [2021-09-13 23:46:56,320 INFO L264 TraceCheckUtils]: 8: Hoare triple {1506#true} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {1506#true} is VALID [2021-09-13 23:46:56,320 INFO L281 TraceCheckUtils]: 9: Hoare triple {1506#true} ~size := #in~size; {1538#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2021-09-13 23:46:56,322 INFO L281 TraceCheckUtils]: 10: Hoare triple {1538#(= 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; {1542#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2021-09-13 23:46:56,322 INFO L281 TraceCheckUtils]: 11: Hoare triple {1542#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {1542#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2021-09-13 23:46:56,326 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {1542#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {1506#true} #599#return; {1549#(and (= |probe_23_#t~ret61.offset| (_ bv0 32)) (= (_ bv1036 32) (select |#length| |probe_23_#t~ret61.base|)))} is VALID [2021-09-13 23:46:56,327 INFO L281 TraceCheckUtils]: 13: Hoare triple {1549#(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; {1553#(and (= (_ bv1036 32) (select |#length| probe_23_~p~1.base)) (= probe_23_~p~1.offset (_ bv0 32)))} is VALID [2021-09-13 23:46:56,328 INFO L281 TraceCheckUtils]: 14: Hoare triple {1553#(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); {1553#(and (= (_ bv1036 32) (select |#length| probe_23_~p~1.base)) (= probe_23_~p~1.offset (_ bv0 32)))} is VALID [2021-09-13 23:46:56,330 INFO L264 TraceCheckUtils]: 15: Hoare triple {1553#(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)); {1560#(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:46:56,331 INFO L281 TraceCheckUtils]: 16: Hoare triple {1560#(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; {1564#(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:46:56,332 INFO L281 TraceCheckUtils]: 17: Hoare triple {1564#(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)); {1507#false} is VALID [2021-09-13 23:46:56,332 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:46:56,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 23:46:56,941 INFO L281 TraceCheckUtils]: 17: Hoare triple {1568#(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)); {1507#false} is VALID [2021-09-13 23:46:56,942 INFO L281 TraceCheckUtils]: 16: Hoare triple {1572#(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; {1568#(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:46:56,964 INFO L264 TraceCheckUtils]: 15: Hoare triple {1576#(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)); {1572#(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:46:56,965 INFO L281 TraceCheckUtils]: 14: Hoare triple {1576#(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); {1576#(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:46:56,965 INFO L281 TraceCheckUtils]: 13: Hoare triple {1583#(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; {1576#(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:46:56,967 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {1590#(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|)))} {1506#true} #599#return; {1583#(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:46:56,968 INFO L281 TraceCheckUtils]: 11: Hoare triple {1590#(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; {1590#(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:46:56,969 INFO L281 TraceCheckUtils]: 10: Hoare triple {1597#(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; {1590#(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:46:56,969 INFO L281 TraceCheckUtils]: 9: Hoare triple {1506#true} ~size := #in~size; {1597#(or (bvule (_ bv8 32) ldv_malloc_~size) (not (= (_ bv1036 32) |ldv_malloc_#in~size|)))} is VALID [2021-09-13 23:46:56,970 INFO L264 TraceCheckUtils]: 8: Hoare triple {1506#true} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {1506#true} is VALID [2021-09-13 23:46:56,970 INFO L281 TraceCheckUtils]: 7: Hoare triple {1506#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {1506#true} is VALID [2021-09-13 23:46:56,970 INFO L264 TraceCheckUtils]: 6: Hoare triple {1506#true} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {1506#true} is VALID [2021-09-13 23:46:56,970 INFO L264 TraceCheckUtils]: 5: Hoare triple {1506#true} call entry_point(); {1506#true} is VALID [2021-09-13 23:46:56,970 INFO L264 TraceCheckUtils]: 4: Hoare triple {1506#true} call main(); {1506#true} is VALID [2021-09-13 23:46:56,970 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {1506#true} {1506#true} #677#return; {1506#true} is VALID [2021-09-13 23:46:56,970 INFO L281 TraceCheckUtils]: 2: Hoare triple {1506#true} assume true; {1506#true} is VALID [2021-09-13 23:46:56,971 INFO L281 TraceCheckUtils]: 1: Hoare triple {1506#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); {1506#true} is VALID [2021-09-13 23:46:56,971 INFO L264 TraceCheckUtils]: 0: Hoare triple {1506#true} call ULTIMATE.init(); {1506#true} is VALID [2021-09-13 23:46:56,971 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:46:56,971 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 23:46:56,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308855158] [2021-09-13 23:46:56,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308855158] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 23:46:56,971 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 23:46:56,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2021-09-13 23:46:56,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765936328] [2021-09-13 23:46:56,973 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:46:56,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 23:46:56,973 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:46:57,037 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:46:57,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 23:46:57,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 23:46:57,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 23:46:57,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-09-13 23:46:57,039 INFO L87 Difference]: Start difference. First operand 254 states and 271 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:06,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:06,872 INFO L93 Difference]: Finished difference Result 260 states and 276 transitions. [2021-09-13 23:47:06,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 23:47:06,873 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:06,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 23:47:06,873 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:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 278 transitions. [2021-09-13 23:47:06,879 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:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 278 transitions. [2021-09-13 23:47:06,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 278 transitions. [2021-09-13 23:47:07,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 278 edges. 278 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:07,142 INFO L225 Difference]: With dead ends: 260 [2021-09-13 23:47:07,143 INFO L226 Difference]: Without dead ends: 260 [2021-09-13 23:47:07,143 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 377.26ms TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2021-09-13 23:47:07,144 INFO L928 BasicCegarLoop]: 45 mSDtfsCounter, 32 mSDsluCounter, 1903 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4311.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 19.63ms SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4331.40ms IncrementalHoareTripleChecker+Time [2021-09-13 23:47:07,144 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 414 Invalid, 2178 Unknown, 0 Unchecked, 19.63ms Time], IncrementalHoareTripleChecker [3 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 4331.40ms Time] [2021-09-13 23:47:07,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2021-09-13 23:47:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 254. [2021-09-13 23:47:07,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 23:47:07,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand has 254 states, 130 states have (on average 1.7) internal successors, (221), 209 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:07,155 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand has 254 states, 130 states have (on average 1.7) internal successors, (221), 209 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:07,156 INFO L87 Difference]: Start difference. First operand 260 states. Second operand has 254 states, 130 states have (on average 1.7) internal successors, (221), 209 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:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:07,165 INFO L93 Difference]: Finished difference Result 260 states and 276 transitions. [2021-09-13 23:47:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 276 transitions. [2021-09-13 23:47:07,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:07,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:07,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 130 states have (on average 1.7) internal successors, (221), 209 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 260 states. [2021-09-13 23:47:07,167 INFO L87 Difference]: Start difference. First operand has 254 states, 130 states have (on average 1.7) internal successors, (221), 209 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 260 states. [2021-09-13 23:47:07,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:07,176 INFO L93 Difference]: Finished difference Result 260 states and 276 transitions. [2021-09-13 23:47:07,177 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 276 transitions. [2021-09-13 23:47:07,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:07,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:07,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 23:47:07,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 23:47:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 130 states have (on average 1.7) internal successors, (221), 209 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:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 269 transitions. [2021-09-13 23:47:07,186 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 269 transitions. Word has length 18 [2021-09-13 23:47:07,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 23:47:07,187 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 269 transitions. [2021-09-13 23:47:07,187 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:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 269 transitions. [2021-09-13 23:47:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-13 23:47:07,188 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 23:47:07,188 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:07,201 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:07,399 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:07,399 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:07,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 23:47:07,400 INFO L82 PathProgramCache]: Analyzing trace with hash 971343402, now seen corresponding path program 1 times [2021-09-13 23:47:07,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 23:47:07,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623332803] [2021-09-13 23:47:07,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 23:47:07,401 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 23:47:07,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 23:47:07,402 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:07,402 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:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:07,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 7 conjunts are in the unsatisfiable core [2021-09-13 23:47:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:07,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 23:47:07,699 INFO L264 TraceCheckUtils]: 0: Hoare triple {2665#true} call ULTIMATE.init(); {2665#true} is VALID [2021-09-13 23:47:07,699 INFO L281 TraceCheckUtils]: 1: Hoare triple {2665#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); {2665#true} is VALID [2021-09-13 23:47:07,699 INFO L281 TraceCheckUtils]: 2: Hoare triple {2665#true} assume true; {2665#true} is VALID [2021-09-13 23:47:07,699 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {2665#true} {2665#true} #677#return; {2665#true} is VALID [2021-09-13 23:47:07,699 INFO L264 TraceCheckUtils]: 4: Hoare triple {2665#true} call main(); {2665#true} is VALID [2021-09-13 23:47:07,699 INFO L264 TraceCheckUtils]: 5: Hoare triple {2665#true} call entry_point(); {2665#true} is VALID [2021-09-13 23:47:07,700 INFO L264 TraceCheckUtils]: 6: Hoare triple {2665#true} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {2665#true} is VALID [2021-09-13 23:47:07,700 INFO L281 TraceCheckUtils]: 7: Hoare triple {2665#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {2665#true} is VALID [2021-09-13 23:47:07,700 INFO L264 TraceCheckUtils]: 8: Hoare triple {2665#true} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {2665#true} is VALID [2021-09-13 23:47:07,700 INFO L281 TraceCheckUtils]: 9: Hoare triple {2665#true} ~size := #in~size; {2665#true} is VALID [2021-09-13 23:47:07,701 INFO L281 TraceCheckUtils]: 10: Hoare triple {2665#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {2700#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:07,702 INFO L281 TraceCheckUtils]: 11: Hoare triple {2700#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {2700#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:07,703 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {2700#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {2665#true} #599#return; {2707#(and (= |probe_23_#t~ret61.offset| (_ bv0 32)) (= |probe_23_#t~ret61.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:07,703 INFO L281 TraceCheckUtils]: 13: Hoare triple {2707#(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; {2711#(and (= probe_23_~p~1.base (_ bv0 32)) (= probe_23_~p~1.offset (_ bv0 32)))} is VALID [2021-09-13 23:47:07,704 INFO L281 TraceCheckUtils]: 14: Hoare triple {2711#(and (= probe_23_~p~1.base (_ bv0 32)) (= probe_23_~p~1.offset (_ bv0 32)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {2666#false} is VALID [2021-09-13 23:47:07,704 INFO L264 TraceCheckUtils]: 15: Hoare triple {2666#false} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {2666#false} is VALID [2021-09-13 23:47:07,704 INFO L281 TraceCheckUtils]: 16: Hoare triple {2666#false} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {2666#false} is VALID [2021-09-13 23:47:07,704 INFO L281 TraceCheckUtils]: 17: Hoare triple {2666#false} assume !(1bv1 == #valid[~list.base]); {2666#false} is VALID [2021-09-13 23:47:07,705 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:07,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 23:47:07,898 INFO L281 TraceCheckUtils]: 17: Hoare triple {2666#false} assume !(1bv1 == #valid[~list.base]); {2666#false} is VALID [2021-09-13 23:47:07,898 INFO L281 TraceCheckUtils]: 16: Hoare triple {2666#false} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {2666#false} is VALID [2021-09-13 23:47:07,898 INFO L264 TraceCheckUtils]: 15: Hoare triple {2666#false} call LDV_INIT_LIST_HEAD(~p~1.base, ~bvadd32(4bv32, ~p~1.offset)); {2666#false} is VALID [2021-09-13 23:47:07,898 INFO L281 TraceCheckUtils]: 14: Hoare triple {2711#(and (= probe_23_~p~1.base (_ bv0 32)) (= probe_23_~p~1.offset (_ bv0 32)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {2666#false} is VALID [2021-09-13 23:47:07,899 INFO L281 TraceCheckUtils]: 13: Hoare triple {2707#(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; {2711#(and (= probe_23_~p~1.base (_ bv0 32)) (= probe_23_~p~1.offset (_ bv0 32)))} is VALID [2021-09-13 23:47:07,899 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {2700#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {2665#true} #599#return; {2707#(and (= |probe_23_#t~ret61.offset| (_ bv0 32)) (= |probe_23_#t~ret61.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:07,900 INFO L281 TraceCheckUtils]: 11: Hoare triple {2700#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {2700#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:07,900 INFO L281 TraceCheckUtils]: 10: Hoare triple {2665#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {2700#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2021-09-13 23:47:07,900 INFO L281 TraceCheckUtils]: 9: Hoare triple {2665#true} ~size := #in~size; {2665#true} is VALID [2021-09-13 23:47:07,900 INFO L264 TraceCheckUtils]: 8: Hoare triple {2665#true} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {2665#true} is VALID [2021-09-13 23:47:07,901 INFO L281 TraceCheckUtils]: 7: Hoare triple {2665#true} ~dev.base, ~dev.offset := #in~dev.base, #in~dev.offset;~ret~0 := 3bv32; {2665#true} is VALID [2021-09-13 23:47:07,901 INFO L264 TraceCheckUtils]: 6: Hoare triple {2665#true} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {2665#true} is VALID [2021-09-13 23:47:07,903 INFO L264 TraceCheckUtils]: 5: Hoare triple {2665#true} call entry_point(); {2665#true} is VALID [2021-09-13 23:47:07,903 INFO L264 TraceCheckUtils]: 4: Hoare triple {2665#true} call main(); {2665#true} is VALID [2021-09-13 23:47:07,903 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {2665#true} {2665#true} #677#return; {2665#true} is VALID [2021-09-13 23:47:07,903 INFO L281 TraceCheckUtils]: 2: Hoare triple {2665#true} assume true; {2665#true} is VALID [2021-09-13 23:47:07,904 INFO L281 TraceCheckUtils]: 1: Hoare triple {2665#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); {2665#true} is VALID [2021-09-13 23:47:07,904 INFO L264 TraceCheckUtils]: 0: Hoare triple {2665#true} call ULTIMATE.init(); {2665#true} is VALID [2021-09-13 23:47:07,904 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:07,904 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 23:47:07,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623332803] [2021-09-13 23:47:07,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623332803] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 23:47:07,904 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 23:47:07,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-09-13 23:47:07,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394465935] [2021-09-13 23:47:07,905 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:07,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 23:47:07,906 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:07,920 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:07,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-13 23:47:07,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 23:47:07,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-13 23:47:07,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 23:47:07,921 INFO L87 Difference]: Start difference. First operand 254 states and 269 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:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:10,092 INFO L93 Difference]: Finished difference Result 247 states and 261 transitions. [2021-09-13 23:47:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-13 23:47:10,092 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:10,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-13 23:47:10,093 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:10,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 262 transitions. [2021-09-13 23:47:10,107 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:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 262 transitions. [2021-09-13 23:47:10,111 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 262 transitions. [2021-09-13 23:47:10,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2021-09-13 23:47:10,335 INFO L225 Difference]: With dead ends: 247 [2021-09-13 23:47:10,335 INFO L226 Difference]: Without dead ends: 247 [2021-09-13 23:47:10,335 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.08ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-09-13 23:47:10,336 INFO L928 BasicCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 971.58ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 5.68ms SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 975.61ms IncrementalHoareTripleChecker+Time [2021-09-13 23:47:10,336 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 183 Invalid, 848 Unknown, 0 Unchecked, 5.68ms Time], IncrementalHoareTripleChecker [1 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 975.61ms Time] [2021-09-13 23:47:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-09-13 23:47:10,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2021-09-13 23:47:10,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2021-09-13 23:47:10,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 245 states, 126 states have (on average 1.6904761904761905) internal successors, (213), 201 states have internal predecessors, (213), 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:10,346 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 245 states, 126 states have (on average 1.6904761904761905) internal successors, (213), 201 states have internal predecessors, (213), 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:10,347 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 245 states, 126 states have (on average 1.6904761904761905) internal successors, (213), 201 states have internal predecessors, (213), 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:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:10,354 INFO L93 Difference]: Finished difference Result 247 states and 261 transitions. [2021-09-13 23:47:10,354 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 261 transitions. [2021-09-13 23:47:10,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:10,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:10,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 245 states, 126 states have (on average 1.6904761904761905) internal successors, (213), 201 states have internal predecessors, (213), 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 247 states. [2021-09-13 23:47:10,357 INFO L87 Difference]: Start difference. First operand has 245 states, 126 states have (on average 1.6904761904761905) internal successors, (213), 201 states have internal predecessors, (213), 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 247 states. [2021-09-13 23:47:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-13 23:47:10,364 INFO L93 Difference]: Finished difference Result 247 states and 261 transitions. [2021-09-13 23:47:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 261 transitions. [2021-09-13 23:47:10,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-09-13 23:47:10,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2021-09-13 23:47:10,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2021-09-13 23:47:10,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2021-09-13 23:47:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 126 states have (on average 1.6904761904761905) internal successors, (213), 201 states have internal predecessors, (213), 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:10,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 259 transitions. [2021-09-13 23:47:10,373 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 259 transitions. Word has length 18 [2021-09-13 23:47:10,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-13 23:47:10,374 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 259 transitions. [2021-09-13 23:47:10,374 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:10,374 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 259 transitions. [2021-09-13 23:47:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-09-13 23:47:10,375 INFO L505 BasicCegarLoop]: Found error trace [2021-09-13 23:47:10,375 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:10,384 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:10,580 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:10,581 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:10,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-13 23:47:10,581 INFO L82 PathProgramCache]: Analyzing trace with hash 443887173, now seen corresponding path program 1 times [2021-09-13 23:47:10,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-09-13 23:47:10,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336234847] [2021-09-13 23:47:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-13 23:47:10,582 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-09-13 23:47:10,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-09-13 23:47:10,583 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:10,584 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:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:10,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 14 conjunts are in the unsatisfiable core [2021-09-13 23:47:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-13 23:47:10,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-09-13 23:47:10,776 INFO L354 Elim1Store]: treesize reduction 34, result has 38.2 percent of original size [2021-09-13 23:47:10,776 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:11,048 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-09-13 23:47:11,049 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:12,236 INFO L264 TraceCheckUtils]: 0: Hoare triple {3763#true} call ULTIMATE.init(); {3763#true} is VALID [2021-09-13 23:47:12,238 INFO L281 TraceCheckUtils]: 1: Hoare triple {3763#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); {3771#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} is VALID [2021-09-13 23:47:12,239 INFO L281 TraceCheckUtils]: 2: Hoare triple {3771#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} assume true; {3771#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} is VALID [2021-09-13 23:47:12,240 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {3771#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} {3763#true} #677#return; {3771#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} is VALID [2021-09-13 23:47:12,240 INFO L264 TraceCheckUtils]: 4: Hoare triple {3771#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} call main(); {3771#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} is VALID [2021-09-13 23:47:12,241 INFO L264 TraceCheckUtils]: 5: Hoare triple {3771#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} call entry_point(); {3771#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} is VALID [2021-09-13 23:47:12,243 INFO L264 TraceCheckUtils]: 6: Hoare triple {3771#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| |~#dev~0.base|))) (_ bv1 1)))} call #t~ret63 := probe_23(~#dev~0.base, ~#dev~0.offset); {3787#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| |probe_23_#in~dev.base|)))) (_ bv1 1)))} is VALID [2021-09-13 23:47:12,243 INFO L281 TraceCheckUtils]: 7: Hoare triple {3787#(= (_ 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; {3791#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} is VALID [2021-09-13 23:47:12,253 INFO L264 TraceCheckUtils]: 8: Hoare triple {3791#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} call #t~ret61.base, #t~ret61.offset := ldv_malloc(1036bv32); {3795#(= |old(#valid)| |#valid|)} is VALID [2021-09-13 23:47:12,254 INFO L281 TraceCheckUtils]: 9: Hoare triple {3795#(= |old(#valid)| |#valid|)} ~size := #in~size; {3795#(= |old(#valid)| |#valid|)} is VALID [2021-09-13 23:47:12,263 INFO L281 TraceCheckUtils]: 10: Hoare triple {3795#(= |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; {3802#(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:12,264 INFO L281 TraceCheckUtils]: 11: Hoare triple {3802#(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; {3802#(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:12,267 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {3802#(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|)))} {3791#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} #599#return; {3809#(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:12,267 INFO L281 TraceCheckUtils]: 13: Hoare triple {3809#(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; {3809#(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:12,268 INFO L281 TraceCheckUtils]: 14: Hoare triple {3809#(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); {3809#(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:12,271 INFO L264 TraceCheckUtils]: 15: Hoare triple {3809#(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)); {3819#(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:12,272 INFO L281 TraceCheckUtils]: 16: Hoare triple {3819#(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; {3819#(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:12,272 INFO L281 TraceCheckUtils]: 17: Hoare triple {3819#(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 {3819#(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:12,273 INFO L281 TraceCheckUtils]: 18: Hoare triple {3819#(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 {3819#(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:12,273 INFO L281 TraceCheckUtils]: 19: Hoare triple {3819#(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; {3819#(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:12,274 INFO L276 TraceCheckUtils]: 20: Hoare quadruple {3819#(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)))))))} {3809#(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))))))} #601#return; {3809#(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:12,274 INFO L281 TraceCheckUtils]: 21: Hoare triple {3809#(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]); {3764#false} is VALID [2021-09-13 23:47:12,275 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:12,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-09-13 23:47:25,270 INFO L281 TraceCheckUtils]: 21: Hoare triple {3791#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} assume !(1bv1 == #valid[~dev.base]); {3764#false} is VALID [2021-09-13 23:47:25,271 INFO L276 TraceCheckUtils]: 20: Hoare quadruple {3763#true} {3791#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} #601#return; {3791#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} is VALID [2021-09-13 23:47:25,272 INFO L281 TraceCheckUtils]: 19: Hoare triple {3763#true} assume true; {3763#true} is VALID [2021-09-13 23:47:25,272 INFO L281 TraceCheckUtils]: 18: Hoare triple {3763#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~bvadd32(4bv32, ~list.offset), 4bv32); srcloc: L540-1 {3763#true} is VALID [2021-09-13 23:47:25,272 INFO L281 TraceCheckUtils]: 17: Hoare triple {3763#true} SUMMARY for call write~$Pointer$(~list.base, ~list.offset, ~list.base, ~list.offset, 4bv32); srcloc: L540 {3763#true} is VALID [2021-09-13 23:47:25,272 INFO L281 TraceCheckUtils]: 16: Hoare triple {3763#true} ~list.base, ~list.offset := #in~list.base, #in~list.offset; {3763#true} is VALID [2021-09-13 23:47:25,273 INFO L264 TraceCheckUtils]: 15: Hoare triple {3791#(= (_ 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)); {3763#true} is VALID [2021-09-13 23:47:25,273 INFO L281 TraceCheckUtils]: 14: Hoare triple {3791#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} assume !(~p~1.base == 0bv32 && ~p~1.offset == 0bv32); {3791#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} is VALID [2021-09-13 23:47:25,273 INFO L281 TraceCheckUtils]: 13: Hoare triple {3791#(= (_ 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; {3791#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} is VALID [2021-09-13 23:47:25,275 INFO L276 TraceCheckUtils]: 12: Hoare quadruple {3869#(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|)))))))))))} {3865#(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|))))))))} #599#return; {3791#(= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select |#valid| probe_23_~dev.base)))) (_ bv1 1)))} is VALID [2021-09-13 23:47:25,279 INFO L281 TraceCheckUtils]: 11: Hoare triple {3869#(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; {3869#(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:25,281 INFO L281 TraceCheckUtils]: 10: Hoare triple {3876#(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; {3869#(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:25,282 INFO L281 TraceCheckUtils]: 9: Hoare triple {3876#(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; {3876#(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:25,283 INFO L264 TraceCheckUtils]: 8: Hoare triple {3865#(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); {3876#(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:25,284 INFO L281 TraceCheckUtils]: 7: Hoare triple {3883#(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; {3865#(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:25,285 INFO L264 TraceCheckUtils]: 6: Hoare triple {3887#(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); {3883#(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:25,285 INFO L264 TraceCheckUtils]: 5: Hoare triple {3887#(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(); {3887#(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:25,286 INFO L264 TraceCheckUtils]: 4: Hoare triple {3887#(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(); {3887#(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:25,286 INFO L276 TraceCheckUtils]: 3: Hoare quadruple {3887#(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|)))))))))} {3763#true} #677#return; {3887#(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:25,287 INFO L281 TraceCheckUtils]: 2: Hoare triple {3887#(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; {3887#(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:25,289 INFO L281 TraceCheckUtils]: 1: Hoare triple {3763#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); {3887#(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:25,289 INFO L264 TraceCheckUtils]: 0: Hoare triple {3763#true} call ULTIMATE.init(); {3763#true} is VALID [2021-09-13 23:47:25,289 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:25,289 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-09-13 23:47:25,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336234847] [2021-09-13 23:47:25,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336234847] provided 2 perfect and 0 imperfect interpolant sequences [2021-09-13 23:47:25,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-09-13 23:47:25,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2021-09-13 23:47:25,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046122890] [2021-09-13 23:47:25,291 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:25,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2021-09-13 23:47:25,291 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:25,369 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:25,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-09-13 23:47:25,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-09-13 23:47:25,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-09-13 23:47:25,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=142, Unknown=5, NotChecked=0, Total=182 [2021-09-13 23:47:25,370 INFO L87 Difference]: Start difference. First operand 245 states and 259 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:28,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-13 23:47:28,265 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 12589.98ms TimeCoverageRelationStatistics Valid=41, Invalid=164, Unknown=5, NotChecked=0, Total=210 [2021-09-13 23:47:28,266 INFO L928 BasicCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 301.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 4.46ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 435 IncrementalHoareTripleChecker+Unchecked, 304.41ms IncrementalHoareTripleChecker+Time [2021-09-13 23:47:28,266 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 143 Invalid, 676 Unknown, 0 Unchecked, 4.46ms Time], IncrementalHoareTripleChecker [0 Valid, 241 Invalid, 0 Unknown, 435 Unchecked, 304.41ms Time] [2021-09-13 23:47:28,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-09-13 23:47:28,467 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:28,468 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:47:28,471 INFO L158 Benchmark]: Toolchain (without parser) took 40645.72ms. Allocated memory was 52.4MB in the beginning and 79.7MB in the end (delta: 27.3MB). Free memory was 26.9MB in the beginning and 40.6MB in the end (delta: -13.8MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2021-09-13 23:47:28,472 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 52.4MB. Free memory was 34.0MB in the beginning and 34.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2021-09-13 23:47:28,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 764.60ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 26.7MB in the beginning and 33.9MB in the end (delta: -7.2MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2021-09-13 23:47:28,472 INFO L158 Benchmark]: Boogie Preprocessor took 174.22ms. Allocated memory is still 65.0MB. Free memory was 33.9MB in the beginning and 43.3MB in the end (delta: -9.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2021-09-13 23:47:28,473 INFO L158 Benchmark]: RCFGBuilder took 1307.59ms. Allocated memory is still 65.0MB. Free memory was 43.3MB in the beginning and 24.8MB in the end (delta: 18.5MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2021-09-13 23:47:28,473 INFO L158 Benchmark]: TraceAbstraction took 38394.24ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 24.5MB in the beginning and 40.6MB in the end (delta: -16.2MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2021-09-13 23:47:28,480 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.19ms. Allocated memory is still 52.4MB. Free memory was 34.0MB in the beginning and 34.0MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 764.60ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 26.7MB in the beginning and 33.9MB in the end (delta: -7.2MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 174.22ms. Allocated memory is still 65.0MB. Free memory was 33.9MB in the beginning and 43.3MB in the end (delta: -9.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1307.59ms. Allocated memory is still 65.0MB. Free memory was 43.3MB in the beginning and 24.8MB in the end (delta: 18.5MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 38394.24ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 24.5MB in the beginning and 40.6MB in the end (delta: -16.2MB). Peak memory consumption was 21.3MB. 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:47:28,498 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...