./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test4-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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_test4-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 eb6bcc62184a60bbcb9e0528a455aeb84b21f101 ............................................................................................................................... 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 -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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_test4-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 eb6bcc62184a60bbcb9e0528a455aeb84b21f101 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:05:46,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:05:46,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:05:46,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:05:46,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:05:46,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:05:46,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:05:46,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:05:46,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:05:46,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:05:46,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:05:46,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:05:46,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:05:46,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:05:46,969 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:05:46,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:05:46,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:05:46,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:05:46,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:05:46,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:05:46,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:05:46,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:05:46,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:05:46,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:05:46,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:05:46,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:05:47,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:05:47,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:05:47,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:05:47,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:05:47,003 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:05:47,004 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:05:47,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:05:47,005 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:05:47,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:05:47,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:05:47,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:05:47,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:05:47,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:05:47,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:05:47,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:05:47,011 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 01:05:47,033 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:05:47,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:05:47,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:05:47,036 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:05:47,036 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:05:47,036 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:05:47,036 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:05:47,037 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:05:47,037 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:05:47,037 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:05:47,038 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:05:47,038 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:05:47,039 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:05:47,039 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:05:47,039 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:05:47,039 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:05:47,040 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:05:47,040 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:05:47,040 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:05:47,040 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:05:47,041 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:05:47,041 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:05:47,041 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:05:47,041 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:05:47,041 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:05:47,042 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:05:47,042 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:05:47,042 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:05:47,042 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> eb6bcc62184a60bbcb9e0528a455aeb84b21f101 [2020-07-29 01:05:47,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:05:47,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:05:47,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:05:47,386 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:05:47,386 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:05:47,387 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test4-1.i [2020-07-29 01:05:47,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9142d0ba/e7c6000817634635b3253ef103d24cfe/FLAG92042cef6 [2020-07-29 01:05:47,998 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:05:47,999 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test4-1.i [2020-07-29 01:05:48,014 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9142d0ba/e7c6000817634635b3253ef103d24cfe/FLAG92042cef6 [2020-07-29 01:05:48,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9142d0ba/e7c6000817634635b3253ef103d24cfe [2020-07-29 01:05:48,271 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:05:48,273 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:05:48,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:05:48,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:05:48,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:05:48,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:05:48" (1/1) ... [2020-07-29 01:05:48,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d2f222d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:48, skipping insertion in model container [2020-07-29 01:05:48,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:05:48" (1/1) ... [2020-07-29 01:05:48,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:05:48,334 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:05:48,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:05:48,836 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2020-07-29 01:05:48,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@60c6cf72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:48, skipping insertion in model container [2020-07-29 01:05:48,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:05:48,838 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2020-07-29 01:05:48,843 INFO L168 Benchmark]: Toolchain (without parser) took 568.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:05:48,844 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:05:48,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 563.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:05:48,850 INFO L336 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 563.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:05:50,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:05:50,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:05:50,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:05:50,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:05:50,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:05:50,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:05:50,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:05:50,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:05:50,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:05:50,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:05:50,668 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:05:50,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:05:50,670 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:05:50,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:05:50,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:05:50,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:05:50,675 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:05:50,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:05:50,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:05:50,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:05:50,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:05:50,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:05:50,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:05:50,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:05:50,688 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:05:50,688 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:05:50,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:05:50,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:05:50,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:05:50,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:05:50,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:05:50,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:05:50,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:05:50,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:05:50,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:05:50,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:05:50,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:05:50,696 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:05:50,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:05:50,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:05:50,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-07-29 01:05:50,728 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:05:50,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:05:50,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:05:50,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:05:50,731 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:05:50,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:05:50,732 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:05:50,732 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:05:50,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:05:50,732 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:05:50,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:05:50,734 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:05:50,734 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:05:50,735 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:05:50,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:05:50,735 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:05:50,736 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-29 01:05:50,736 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-29 01:05:50,736 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:05:50,736 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:05:50,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:05:50,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:05:50,738 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:05:50,738 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:05:50,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:05:50,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:05:50,739 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:05:50,739 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-29 01:05:50,739 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-29 01:05:50,740 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:05:50,740 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-29 01:05:50,740 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> eb6bcc62184a60bbcb9e0528a455aeb84b21f101 [2020-07-29 01:05:51,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:05:51,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:05:51,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:05:51,105 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:05:51,105 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:05:51,106 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test4-1.i [2020-07-29 01:05:51,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdc3ed2ac/a5df60384c04467591b6f1c01cab72ba/FLAG7c95d66c7 [2020-07-29 01:05:51,771 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:05:51,772 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test4-1.i [2020-07-29 01:05:51,788 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdc3ed2ac/a5df60384c04467591b6f1c01cab72ba/FLAG7c95d66c7 [2020-07-29 01:05:52,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdc3ed2ac/a5df60384c04467591b6f1c01cab72ba [2020-07-29 01:05:52,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:05:52,029 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:05:52,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:05:52,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:05:52,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:05:52,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:05:52" (1/1) ... [2020-07-29 01:05:52,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c728ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:52, skipping insertion in model container [2020-07-29 01:05:52,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:05:52" (1/1) ... [2020-07-29 01:05:52,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:05:52,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:05:52,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:05:52,733 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2020-07-29 01:05:52,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:05:52,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:05:52,869 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:05:52,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:05:53,042 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:05:53,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:53 WrapperNode [2020-07-29 01:05:53,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:05:53,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:05:53,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:05:53,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:05:53,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:53" (1/1) ... [2020-07-29 01:05:53,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:53" (1/1) ... [2020-07-29 01:05:53,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:53" (1/1) ... [2020-07-29 01:05:53,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:53" (1/1) ... [2020-07-29 01:05:53,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:53" (1/1) ... [2020-07-29 01:05:53,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:53" (1/1) ... [2020-07-29 01:05:53,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:53" (1/1) ... [2020-07-29 01:05:53,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:05:53,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:05:53,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:05:53,202 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:05:53,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:05:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:05:53,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:05:53,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2020-07-29 01:05:53,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:05:53,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 01:05:53,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 01:05:53,265 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 01:05:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 01:05:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 01:05:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2020-07-29 01:05:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2020-07-29 01:05:53,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2020-07-29 01:05:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2020-07-29 01:05:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2020-07-29 01:05:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2020-07-29 01:05:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2020-07-29 01:05:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2020-07-29 01:05:53,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2020-07-29 01:05:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2020-07-29 01:05:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2020-07-29 01:05:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2020-07-29 01:05:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2020-07-29 01:05:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2020-07-29 01:05:53,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2020-07-29 01:05:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2020-07-29 01:05:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2020-07-29 01:05:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2020-07-29 01:05:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2020-07-29 01:05:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2020-07-29 01:05:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2020-07-29 01:05:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2020-07-29 01:05:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2020-07-29 01:05:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2020-07-29 01:05:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2020-07-29 01:05:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2020-07-29 01:05:53,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2020-07-29 01:05:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2020-07-29 01:05:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2020-07-29 01:05:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2020-07-29 01:05:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2020-07-29 01:05:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2020-07-29 01:05:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2020-07-29 01:05:53,271 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2020-07-29 01:05:53,272 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:05:53,272 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2020-07-29 01:05:53,272 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-29 01:05:53,272 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2020-07-29 01:05:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:05:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:05:53,272 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:05:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:05:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:05:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:05:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:05:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:05:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:05:53,273 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:05:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:05:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:05:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:05:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:05:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:05:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:05:53,274 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 01:05:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 01:05:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 01:05:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 01:05:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 01:05:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:05:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:05:53,275 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:05:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:05:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:05:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:05:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:05:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:05:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:05:53,276 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:05:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:05:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:05:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:05:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:05:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:05:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:05:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:05:53,277 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:05:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:05:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:05:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:05:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:05:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:05:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:05:53,278 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:05:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:05:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:05:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:05:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:05:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:05:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:05:53,279 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:05:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:05:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:05:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:05:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:05:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:05:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:05:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:05:53,280 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:05:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:05:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:05:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:05:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:05:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:05:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:05:53,281 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:05:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:05:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:05:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:05:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:05:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:05:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:05:53,282 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:05:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:05:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:05:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:05:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:05:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:05:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:05:53,283 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:05:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:05:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:05:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:05:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:05:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:05:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:05:53,284 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:05:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:05:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:05:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:05:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:05:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:05:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:05:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:05:53,285 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:05:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:05:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:05:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:05:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:05:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:05:53,286 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:05:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:05:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:05:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:05:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:05:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2020-07-29 01:05:53,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:05:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2020-07-29 01:05:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2020-07-29 01:05:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-07-29 01:05:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2020-07-29 01:05:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2020-07-29 01:05:53,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:05:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2020-07-29 01:05:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-29 01:05:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2020-07-29 01:05:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:05:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2020-07-29 01:05:53,289 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2020-07-29 01:05:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2020-07-29 01:05:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:05:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2020-07-29 01:05:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2020-07-29 01:05:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2020-07-29 01:05:53,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2020-07-29 01:05:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2020-07-29 01:05:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2020-07-29 01:05:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:05:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2020-07-29 01:05:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2020-07-29 01:05:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2020-07-29 01:05:53,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2020-07-29 01:05:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2020-07-29 01:05:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-29 01:05:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-29 01:05:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2020-07-29 01:05:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2020-07-29 01:05:53,292 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2020-07-29 01:05:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2020-07-29 01:05:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2020-07-29 01:05:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2020-07-29 01:05:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2020-07-29 01:05:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2020-07-29 01:05:53,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2020-07-29 01:05:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2020-07-29 01:05:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2020-07-29 01:05:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2020-07-29 01:05:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2020-07-29 01:05:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2020-07-29 01:05:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2020-07-29 01:05:53,294 INFO L130 BoogieDeclarations]: Found specification of procedure f [2020-07-29 01:05:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure g [2020-07-29 01:05:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2020-07-29 01:05:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:05:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:05:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:05:53,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-29 01:05:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:05:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:05:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2020-07-29 01:05:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2020-07-29 01:05:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-07-29 01:05:53,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2020-07-29 01:05:54,170 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 01:05:54,671 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 01:05:55,134 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:05:55,134 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-29 01:05:55,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:05:55 BoogieIcfgContainer [2020-07-29 01:05:55,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:05:55,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:05:55,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:05:55,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:05:55,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:05:52" (1/3) ... [2020-07-29 01:05:55,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1928e6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:05:55, skipping insertion in model container [2020-07-29 01:05:55,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:05:53" (2/3) ... [2020-07-29 01:05:55,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1928e6bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:05:55, skipping insertion in model container [2020-07-29 01:05:55,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:05:55" (3/3) ... [2020-07-29 01:05:55,148 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test4-1.i [2020-07-29 01:05:55,160 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:05:55,170 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 74 error locations. [2020-07-29 01:05:55,185 INFO L251 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2020-07-29 01:05:55,210 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:05:55,210 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:05:55,211 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:05:55,211 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:05:55,211 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:05:55,211 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:05:55,212 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:05:55,212 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:05:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-07-29 01:05:55,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:05:55,242 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:05:55,243 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:05:55,245 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:05:55,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:05:55,252 INFO L82 PathProgramCache]: Analyzing trace with hash 927863930, now seen corresponding path program 1 times [2020-07-29 01:05:55,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:05:55,269 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375007159] [2020-07-29 01:05:55,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-29 01:05:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:05:55,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:05:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:05:55,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:05:55,545 INFO L263 TraceCheckUtils]: 0: Hoare triple {101#true} call ULTIMATE.init(); {101#true} is VALID [2020-07-29 01:05:55,546 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#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); {101#true} is VALID [2020-07-29 01:05:55,547 INFO L280 TraceCheckUtils]: 2: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-29 01:05:55,547 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {101#true} {101#true} #452#return; {101#true} is VALID [2020-07-29 01:05:55,548 INFO L263 TraceCheckUtils]: 4: Hoare triple {101#true} call main(); {101#true} is VALID [2020-07-29 01:05:55,548 INFO L263 TraceCheckUtils]: 5: Hoare triple {101#true} call entry_point(); {101#true} is VALID [2020-07-29 01:05:55,548 INFO L263 TraceCheckUtils]: 6: Hoare triple {101#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {101#true} is VALID [2020-07-29 01:05:55,549 INFO L280 TraceCheckUtils]: 7: Hoare triple {101#true} ~size := #in~size; {101#true} is VALID [2020-07-29 01:05:55,550 INFO L280 TraceCheckUtils]: 8: Hoare triple {101#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; {130#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2020-07-29 01:05:55,551 INFO L280 TraceCheckUtils]: 9: Hoare triple {130#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {130#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2020-07-29 01:05:55,553 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {130#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {101#true} #440#return; {137#(not (= |entry_point_#t~ret38.base| (_ bv0 32)))} is VALID [2020-07-29 01:05:55,554 INFO L280 TraceCheckUtils]: 11: Hoare triple {137#(not (= |entry_point_#t~ret38.base| (_ bv0 32)))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {141#(not (= entry_point_~p~0.base (_ bv0 32)))} is VALID [2020-07-29 01:05:55,555 INFO L280 TraceCheckUtils]: 12: Hoare triple {141#(not (= entry_point_~p~0.base (_ bv0 32)))} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {102#false} is VALID [2020-07-29 01:05:55,555 INFO L280 TraceCheckUtils]: 13: Hoare triple {102#false} assume true; {102#false} is VALID [2020-07-29 01:05:55,556 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {102#false} {101#true} #414#return; {102#false} is VALID [2020-07-29 01:05:55,556 INFO L280 TraceCheckUtils]: 15: Hoare triple {102#false} assume !(#valid == old(#valid)); {102#false} is VALID [2020-07-29 01:05:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:05:55,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:05:55,694 INFO L280 TraceCheckUtils]: 15: Hoare triple {102#false} assume !(#valid == old(#valid)); {102#false} is VALID [2020-07-29 01:05:55,695 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {102#false} {101#true} #414#return; {102#false} is VALID [2020-07-29 01:05:55,695 INFO L280 TraceCheckUtils]: 13: Hoare triple {102#false} assume true; {102#false} is VALID [2020-07-29 01:05:55,699 INFO L280 TraceCheckUtils]: 12: Hoare triple {141#(not (= entry_point_~p~0.base (_ bv0 32)))} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {102#false} is VALID [2020-07-29 01:05:55,700 INFO L280 TraceCheckUtils]: 11: Hoare triple {137#(not (= |entry_point_#t~ret38.base| (_ bv0 32)))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {141#(not (= entry_point_~p~0.base (_ bv0 32)))} is VALID [2020-07-29 01:05:55,702 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {130#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {101#true} #440#return; {137#(not (= |entry_point_#t~ret38.base| (_ bv0 32)))} is VALID [2020-07-29 01:05:55,703 INFO L280 TraceCheckUtils]: 9: Hoare triple {130#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {130#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2020-07-29 01:05:55,705 INFO L280 TraceCheckUtils]: 8: Hoare triple {101#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; {130#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2020-07-29 01:05:55,705 INFO L280 TraceCheckUtils]: 7: Hoare triple {101#true} ~size := #in~size; {101#true} is VALID [2020-07-29 01:05:55,706 INFO L263 TraceCheckUtils]: 6: Hoare triple {101#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {101#true} is VALID [2020-07-29 01:05:55,706 INFO L263 TraceCheckUtils]: 5: Hoare triple {101#true} call entry_point(); {101#true} is VALID [2020-07-29 01:05:55,707 INFO L263 TraceCheckUtils]: 4: Hoare triple {101#true} call main(); {101#true} is VALID [2020-07-29 01:05:55,708 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {101#true} {101#true} #452#return; {101#true} is VALID [2020-07-29 01:05:55,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-29 01:05:55,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#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); {101#true} is VALID [2020-07-29 01:05:55,709 INFO L263 TraceCheckUtils]: 0: Hoare triple {101#true} call ULTIMATE.init(); {101#true} is VALID [2020-07-29 01:05:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:05:55,712 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375007159] [2020-07-29 01:05:55,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:05:55,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-07-29 01:05:55,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853868488] [2020-07-29 01:05:55,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-29 01:05:55,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:05:55,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:05:55,767 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:05:55,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:05:55,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:05:55,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:05:55,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:05:55,784 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 5 states. [2020-07-29 01:05:55,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:05:55,989 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-07-29 01:05:55,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:05:55,990 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-29 01:05:55,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:05:55,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:05:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2020-07-29 01:05:56,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:05:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2020-07-29 01:05:56,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2020-07-29 01:05:56,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:05:56,098 INFO L225 Difference]: With dead ends: 42 [2020-07-29 01:05:56,099 INFO L226 Difference]: Without dead ends: 39 [2020-07-29 01:05:56,101 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:05:56,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-29 01:05:56,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2020-07-29 01:05:56,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:05:56,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 29 states. [2020-07-29 01:05:56,180 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 29 states. [2020-07-29 01:05:56,180 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 29 states. [2020-07-29 01:05:56,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:05:56,188 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-29 01:05:56,188 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-29 01:05:56,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:05:56,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:05:56,189 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 39 states. [2020-07-29 01:05:56,190 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 39 states. [2020-07-29 01:05:56,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:05:56,196 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-29 01:05:56,196 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-29 01:05:56,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:05:56,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:05:56,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:05:56,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:05:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 01:05:56,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2020-07-29 01:05:56,203 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 16 [2020-07-29 01:05:56,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:05:56,204 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2020-07-29 01:05:56,204 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:05:56,204 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2020-07-29 01:05:56,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-29 01:05:56,205 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:05:56,206 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:05:56,429 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-29 01:05:56,430 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:05:56,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:05:56,433 INFO L82 PathProgramCache]: Analyzing trace with hash -1624293031, now seen corresponding path program 1 times [2020-07-29 01:05:56,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:05:56,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425940647] [2020-07-29 01:05:56,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-29 01:05:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:05:56,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:05:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:05:56,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:05:56,593 INFO L263 TraceCheckUtils]: 0: Hoare triple {350#true} call ULTIMATE.init(); {350#true} is VALID [2020-07-29 01:05:56,594 INFO L280 TraceCheckUtils]: 1: Hoare triple {350#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); {350#true} is VALID [2020-07-29 01:05:56,594 INFO L280 TraceCheckUtils]: 2: Hoare triple {350#true} assume true; {350#true} is VALID [2020-07-29 01:05:56,594 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {350#true} {350#true} #452#return; {350#true} is VALID [2020-07-29 01:05:56,595 INFO L263 TraceCheckUtils]: 4: Hoare triple {350#true} call main(); {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,596 INFO L263 TraceCheckUtils]: 5: Hoare triple {367#(= |#valid| |old(#valid)|)} call entry_point(); {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,597 INFO L263 TraceCheckUtils]: 6: Hoare triple {367#(= |#valid| |old(#valid)|)} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,598 INFO L280 TraceCheckUtils]: 7: Hoare triple {367#(= |#valid| |old(#valid)|)} ~size := #in~size; {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,598 INFO L280 TraceCheckUtils]: 8: Hoare triple {367#(= |#valid| |old(#valid)|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,599 INFO L280 TraceCheckUtils]: 9: Hoare triple {367#(= |#valid| |old(#valid)|)} assume true; {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,601 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {367#(= |#valid| |old(#valid)|)} {367#(= |#valid| |old(#valid)|)} #440#return; {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,601 INFO L280 TraceCheckUtils]: 11: Hoare triple {367#(= |#valid| |old(#valid)|)} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,602 INFO L280 TraceCheckUtils]: 12: Hoare triple {367#(= |#valid| |old(#valid)|)} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,603 INFO L280 TraceCheckUtils]: 13: Hoare triple {367#(= |#valid| |old(#valid)|)} assume true; {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,604 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {367#(= |#valid| |old(#valid)|)} {367#(= |#valid| |old(#valid)|)} #414#return; {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,604 INFO L280 TraceCheckUtils]: 15: Hoare triple {367#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {351#false} is VALID [2020-07-29 01:05:56,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:05:56,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:05:56,694 INFO L280 TraceCheckUtils]: 15: Hoare triple {367#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {351#false} is VALID [2020-07-29 01:05:56,695 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {367#(= |#valid| |old(#valid)|)} {367#(= |#valid| |old(#valid)|)} #414#return; {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,696 INFO L280 TraceCheckUtils]: 13: Hoare triple {367#(= |#valid| |old(#valid)|)} assume true; {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,696 INFO L280 TraceCheckUtils]: 12: Hoare triple {367#(= |#valid| |old(#valid)|)} assume !(~p~0.base != 0bv32 || ~p~0.offset != 0bv32); {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,697 INFO L280 TraceCheckUtils]: 11: Hoare triple {367#(= |#valid| |old(#valid)|)} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,699 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {367#(= |#valid| |old(#valid)|)} {367#(= |#valid| |old(#valid)|)} #440#return; {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,699 INFO L280 TraceCheckUtils]: 9: Hoare triple {367#(= |#valid| |old(#valid)|)} assume true; {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,700 INFO L280 TraceCheckUtils]: 8: Hoare triple {367#(= |#valid| |old(#valid)|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,701 INFO L280 TraceCheckUtils]: 7: Hoare triple {367#(= |#valid| |old(#valid)|)} ~size := #in~size; {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,702 INFO L263 TraceCheckUtils]: 6: Hoare triple {367#(= |#valid| |old(#valid)|)} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,703 INFO L263 TraceCheckUtils]: 5: Hoare triple {367#(= |#valid| |old(#valid)|)} call entry_point(); {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,704 INFO L263 TraceCheckUtils]: 4: Hoare triple {350#true} call main(); {367#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:05:56,704 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {350#true} {350#true} #452#return; {350#true} is VALID [2020-07-29 01:05:56,704 INFO L280 TraceCheckUtils]: 2: Hoare triple {350#true} assume true; {350#true} is VALID [2020-07-29 01:05:56,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {350#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); {350#true} is VALID [2020-07-29 01:05:56,705 INFO L263 TraceCheckUtils]: 0: Hoare triple {350#true} call ULTIMATE.init(); {350#true} is VALID [2020-07-29 01:05:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:05:56,706 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425940647] [2020-07-29 01:05:56,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:05:56,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-29 01:05:56,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385296328] [2020-07-29 01:05:56,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-29 01:05:56,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:05:56,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:05:56,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:05:56,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-29 01:05:56,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:05:56,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:05:56,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:05:56,742 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2020-07-29 01:05:56,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:05:56,885 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-29 01:05:56,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:05:56,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-29 01:05:56,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:05:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:05:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2020-07-29 01:05:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:05:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2020-07-29 01:05:56,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 45 transitions. [2020-07-29 01:05:56,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:05:56,959 INFO L225 Difference]: With dead ends: 40 [2020-07-29 01:05:56,959 INFO L226 Difference]: Without dead ends: 37 [2020-07-29 01:05:56,960 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:05:56,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-29 01:05:56,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2020-07-29 01:05:56,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:05:56,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 25 states. [2020-07-29 01:05:56,965 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 25 states. [2020-07-29 01:05:56,965 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 25 states. [2020-07-29 01:05:56,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:05:56,969 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-29 01:05:56,969 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-29 01:05:56,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:05:56,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:05:56,970 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 37 states. [2020-07-29 01:05:56,970 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 37 states. [2020-07-29 01:05:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:05:56,974 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-29 01:05:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-29 01:05:56,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:05:56,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:05:56,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:05:56,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:05:56,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 01:05:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-07-29 01:05:56,977 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 16 [2020-07-29 01:05:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:05:56,977 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-07-29 01:05:56,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-29 01:05:56,978 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-29 01:05:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-29 01:05:56,978 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:05:56,979 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:05:57,191 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-29 01:05:57,192 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:05:57,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:05:57,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1911181477, now seen corresponding path program 1 times [2020-07-29 01:05:57,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:05:57,193 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096586179] [2020-07-29 01:05:57,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-29 01:05:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:05:57,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:05:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:05:57,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:05:57,360 INFO L263 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2020-07-29 01:05:57,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {587#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); {587#true} is VALID [2020-07-29 01:05:57,360 INFO L280 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-29 01:05:57,361 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {587#true} {587#true} #452#return; {587#true} is VALID [2020-07-29 01:05:57,361 INFO L263 TraceCheckUtils]: 4: Hoare triple {587#true} call main(); {587#true} is VALID [2020-07-29 01:05:57,361 INFO L263 TraceCheckUtils]: 5: Hoare triple {587#true} call entry_point(); {587#true} is VALID [2020-07-29 01:05:57,362 INFO L263 TraceCheckUtils]: 6: Hoare triple {587#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {587#true} is VALID [2020-07-29 01:05:57,362 INFO L280 TraceCheckUtils]: 7: Hoare triple {587#true} ~size := #in~size; {587#true} is VALID [2020-07-29 01:05:57,362 INFO L280 TraceCheckUtils]: 8: Hoare triple {587#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; {587#true} is VALID [2020-07-29 01:05:57,362 INFO L280 TraceCheckUtils]: 9: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-29 01:05:57,363 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {587#true} {587#true} #440#return; {587#true} is VALID [2020-07-29 01:05:57,363 INFO L280 TraceCheckUtils]: 11: Hoare triple {587#true} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {587#true} is VALID [2020-07-29 01:05:57,363 INFO L280 TraceCheckUtils]: 12: Hoare triple {587#true} assume ~p~0.base != 0bv32 || ~p~0.offset != 0bv32; {587#true} is VALID [2020-07-29 01:05:57,363 INFO L263 TraceCheckUtils]: 13: Hoare triple {587#true} call #t~ret39.base, #t~ret39.offset := ldv_malloc(4bv32); {587#true} is VALID [2020-07-29 01:05:57,364 INFO L280 TraceCheckUtils]: 14: Hoare triple {587#true} ~size := #in~size; {587#true} is VALID [2020-07-29 01:05:57,366 INFO L280 TraceCheckUtils]: 15: Hoare triple {587#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; {637#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:05:57,366 INFO L280 TraceCheckUtils]: 16: Hoare triple {637#(= (_ bv0 32) |ldv_malloc_#res.offset|)} assume true; {637#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:05:57,367 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {637#(= (_ bv0 32) |ldv_malloc_#res.offset|)} {587#true} #442#return; {644#(= |entry_point_#t~ret39.offset| (_ bv0 32))} is VALID [2020-07-29 01:05:57,368 INFO L280 TraceCheckUtils]: 18: Hoare triple {644#(= |entry_point_#t~ret39.offset| (_ bv0 32))} ~q~0.base, ~q~0.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {648#(= (_ bv0 32) entry_point_~q~0.offset)} is VALID [2020-07-29 01:05:57,369 INFO L280 TraceCheckUtils]: 19: Hoare triple {648#(= (_ bv0 32) entry_point_~q~0.offset)} assume !(0bv32 == ~q~0.offset); {588#false} is VALID [2020-07-29 01:05:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:05:57,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:05:57,471 INFO L280 TraceCheckUtils]: 19: Hoare triple {648#(= (_ bv0 32) entry_point_~q~0.offset)} assume !(0bv32 == ~q~0.offset); {588#false} is VALID [2020-07-29 01:05:57,472 INFO L280 TraceCheckUtils]: 18: Hoare triple {644#(= |entry_point_#t~ret39.offset| (_ bv0 32))} ~q~0.base, ~q~0.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {648#(= (_ bv0 32) entry_point_~q~0.offset)} is VALID [2020-07-29 01:05:57,473 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {637#(= (_ bv0 32) |ldv_malloc_#res.offset|)} {587#true} #442#return; {644#(= |entry_point_#t~ret39.offset| (_ bv0 32))} is VALID [2020-07-29 01:05:57,473 INFO L280 TraceCheckUtils]: 16: Hoare triple {637#(= (_ bv0 32) |ldv_malloc_#res.offset|)} assume true; {637#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:05:57,474 INFO L280 TraceCheckUtils]: 15: Hoare triple {587#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; {637#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:05:57,474 INFO L280 TraceCheckUtils]: 14: Hoare triple {587#true} ~size := #in~size; {587#true} is VALID [2020-07-29 01:05:57,475 INFO L263 TraceCheckUtils]: 13: Hoare triple {587#true} call #t~ret39.base, #t~ret39.offset := ldv_malloc(4bv32); {587#true} is VALID [2020-07-29 01:05:57,475 INFO L280 TraceCheckUtils]: 12: Hoare triple {587#true} assume ~p~0.base != 0bv32 || ~p~0.offset != 0bv32; {587#true} is VALID [2020-07-29 01:05:57,475 INFO L280 TraceCheckUtils]: 11: Hoare triple {587#true} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {587#true} is VALID [2020-07-29 01:05:57,475 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {587#true} {587#true} #440#return; {587#true} is VALID [2020-07-29 01:05:57,476 INFO L280 TraceCheckUtils]: 9: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-29 01:05:57,476 INFO L280 TraceCheckUtils]: 8: Hoare triple {587#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; {587#true} is VALID [2020-07-29 01:05:57,476 INFO L280 TraceCheckUtils]: 7: Hoare triple {587#true} ~size := #in~size; {587#true} is VALID [2020-07-29 01:05:57,476 INFO L263 TraceCheckUtils]: 6: Hoare triple {587#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {587#true} is VALID [2020-07-29 01:05:57,477 INFO L263 TraceCheckUtils]: 5: Hoare triple {587#true} call entry_point(); {587#true} is VALID [2020-07-29 01:05:57,477 INFO L263 TraceCheckUtils]: 4: Hoare triple {587#true} call main(); {587#true} is VALID [2020-07-29 01:05:57,477 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {587#true} {587#true} #452#return; {587#true} is VALID [2020-07-29 01:05:57,478 INFO L280 TraceCheckUtils]: 2: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-29 01:05:57,478 INFO L280 TraceCheckUtils]: 1: Hoare triple {587#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); {587#true} is VALID [2020-07-29 01:05:57,478 INFO L263 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2020-07-29 01:05:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:05:57,482 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096586179] [2020-07-29 01:05:57,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:05:57,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-07-29 01:05:57,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653034059] [2020-07-29 01:05:57,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-29 01:05:57,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:05:57,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:05:57,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:05:57,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:05:57,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:05:57,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:05:57,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:05:57,511 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 5 states. [2020-07-29 01:05:57,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:05:57,629 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-29 01:05:57,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:05:57,630 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-29 01:05:57,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:05:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:05:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2020-07-29 01:05:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:05:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2020-07-29 01:05:57,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2020-07-29 01:05:57,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:05:57,679 INFO L225 Difference]: With dead ends: 24 [2020-07-29 01:05:57,679 INFO L226 Difference]: Without dead ends: 24 [2020-07-29 01:05:57,680 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:05:57,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-29 01:05:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-29 01:05:57,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:05:57,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-29 01:05:57,683 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-29 01:05:57,683 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-29 01:05:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:05:57,685 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-29 01:05:57,685 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-29 01:05:57,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:05:57,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:05:57,686 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-29 01:05:57,686 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-29 01:05:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:05:57,689 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2020-07-29 01:05:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-29 01:05:57,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:05:57,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:05:57,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:05:57,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:05:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:05:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-29 01:05:57,691 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2020-07-29 01:05:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:05:57,692 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-29 01:05:57,692 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:05:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-29 01:05:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-29 01:05:57,693 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:05:57,693 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:05:57,904 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-29 01:05:57,906 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:05:57,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:05:57,907 INFO L82 PathProgramCache]: Analyzing trace with hash 882916751, now seen corresponding path program 1 times [2020-07-29 01:05:57,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:05:57,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877511633] [2020-07-29 01:05:57,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-29 01:05:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:05:58,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:05:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:05:58,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:05:58,512 INFO L263 TraceCheckUtils]: 0: Hoare triple {807#true} call ULTIMATE.init(); {807#true} is VALID [2020-07-29 01:05:58,513 INFO L280 TraceCheckUtils]: 1: Hoare triple {807#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); {815#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:05:58,515 INFO L280 TraceCheckUtils]: 2: Hoare triple {815#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume true; {815#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:05:58,516 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {815#(bvult (_ bv0 32) |#StackHeapBarrier|)} {807#true} #452#return; {815#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:05:58,516 INFO L263 TraceCheckUtils]: 4: Hoare triple {815#(bvult (_ bv0 32) |#StackHeapBarrier|)} call main(); {815#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:05:58,517 INFO L263 TraceCheckUtils]: 5: Hoare triple {815#(bvult (_ bv0 32) |#StackHeapBarrier|)} call entry_point(); {815#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:05:58,519 INFO L263 TraceCheckUtils]: 6: Hoare triple {815#(bvult (_ bv0 32) |#StackHeapBarrier|)} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {815#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:05:58,520 INFO L280 TraceCheckUtils]: 7: Hoare triple {815#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {815#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:05:58,524 INFO L280 TraceCheckUtils]: 8: Hoare triple {815#(bvult (_ bv0 32) |#StackHeapBarrier|)} 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; {837#(exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|)))} is VALID [2020-07-29 01:05:58,525 INFO L280 TraceCheckUtils]: 9: Hoare triple {837#(exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|)))} assume true; {837#(exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|)))} is VALID [2020-07-29 01:05:58,526 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {837#(exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|)))} {815#(bvult (_ bv0 32) |#StackHeapBarrier|)} #440#return; {837#(exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|)))} is VALID [2020-07-29 01:05:58,527 INFO L280 TraceCheckUtils]: 11: Hoare triple {837#(exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|)))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {837#(exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|)))} is VALID [2020-07-29 01:05:58,528 INFO L280 TraceCheckUtils]: 12: Hoare triple {837#(exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|)))} assume ~p~0.base != 0bv32 || ~p~0.offset != 0bv32; {837#(exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|)))} is VALID [2020-07-29 01:05:58,529 INFO L263 TraceCheckUtils]: 13: Hoare triple {837#(exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|)))} call #t~ret39.base, #t~ret39.offset := ldv_malloc(4bv32); {837#(exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|)))} is VALID [2020-07-29 01:05:58,530 INFO L280 TraceCheckUtils]: 14: Hoare triple {837#(exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|)))} ~size := #in~size; {837#(exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|)))} is VALID [2020-07-29 01:05:58,544 INFO L280 TraceCheckUtils]: 15: Hoare triple {837#(exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|)))} 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; {859#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|))))} is VALID [2020-07-29 01:05:58,545 INFO L280 TraceCheckUtils]: 16: Hoare triple {859#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|))))} assume true; {859#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|))))} is VALID [2020-07-29 01:05:58,547 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {859#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|))))} {837#(exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|)))} #442#return; {866#(and (bvult |entry_point_#t~ret39.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|))))} is VALID [2020-07-29 01:05:58,548 INFO L280 TraceCheckUtils]: 18: Hoare triple {866#(and (bvult |entry_point_#t~ret39.base| |#StackHeapBarrier|) (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|))))} ~q~0.base, ~q~0.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {870#(and (bvult entry_point_~q~0.base |#StackHeapBarrier|) (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|))))} is VALID [2020-07-29 01:05:58,549 INFO L280 TraceCheckUtils]: 19: Hoare triple {870#(and (bvult entry_point_~q~0.base |#StackHeapBarrier|) (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|))))} assume 0bv32 == ~q~0.offset; {870#(and (bvult entry_point_~q~0.base |#StackHeapBarrier|) (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|))))} is VALID [2020-07-29 01:05:58,549 INFO L280 TraceCheckUtils]: 20: Hoare triple {870#(and (bvult entry_point_~q~0.base |#StackHeapBarrier|) (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (not (= |ldv_malloc_#t~malloc12.base| (_ bv0 32))) (bvult |ldv_malloc_#t~malloc12.base| |#StackHeapBarrier|))))} assume !~bvult32(~q~0.base, #StackHeapBarrier); {808#false} is VALID [2020-07-29 01:05:58,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:05:58,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:05:58,768 INFO L280 TraceCheckUtils]: 20: Hoare triple {877#(bvult entry_point_~q~0.base |#StackHeapBarrier|)} assume !~bvult32(~q~0.base, #StackHeapBarrier); {808#false} is VALID [2020-07-29 01:05:58,770 INFO L280 TraceCheckUtils]: 19: Hoare triple {877#(bvult entry_point_~q~0.base |#StackHeapBarrier|)} assume 0bv32 == ~q~0.offset; {877#(bvult entry_point_~q~0.base |#StackHeapBarrier|)} is VALID [2020-07-29 01:05:58,771 INFO L280 TraceCheckUtils]: 18: Hoare triple {884#(bvult |entry_point_#t~ret39.base| |#StackHeapBarrier|)} ~q~0.base, ~q~0.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {877#(bvult entry_point_~q~0.base |#StackHeapBarrier|)} is VALID [2020-07-29 01:05:58,776 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {891#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} {807#true} #442#return; {884#(bvult |entry_point_#t~ret39.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:05:58,780 INFO L280 TraceCheckUtils]: 16: Hoare triple {891#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} assume true; {891#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:05:58,781 INFO L280 TraceCheckUtils]: 15: Hoare triple {807#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; {891#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:05:58,781 INFO L280 TraceCheckUtils]: 14: Hoare triple {807#true} ~size := #in~size; {807#true} is VALID [2020-07-29 01:05:58,781 INFO L263 TraceCheckUtils]: 13: Hoare triple {807#true} call #t~ret39.base, #t~ret39.offset := ldv_malloc(4bv32); {807#true} is VALID [2020-07-29 01:05:58,781 INFO L280 TraceCheckUtils]: 12: Hoare triple {807#true} assume ~p~0.base != 0bv32 || ~p~0.offset != 0bv32; {807#true} is VALID [2020-07-29 01:05:58,782 INFO L280 TraceCheckUtils]: 11: Hoare triple {807#true} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {807#true} is VALID [2020-07-29 01:05:58,782 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {807#true} {807#true} #440#return; {807#true} is VALID [2020-07-29 01:05:58,782 INFO L280 TraceCheckUtils]: 9: Hoare triple {807#true} assume true; {807#true} is VALID [2020-07-29 01:05:58,782 INFO L280 TraceCheckUtils]: 8: Hoare triple {807#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; {807#true} is VALID [2020-07-29 01:05:58,782 INFO L280 TraceCheckUtils]: 7: Hoare triple {807#true} ~size := #in~size; {807#true} is VALID [2020-07-29 01:05:58,782 INFO L263 TraceCheckUtils]: 6: Hoare triple {807#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {807#true} is VALID [2020-07-29 01:05:58,783 INFO L263 TraceCheckUtils]: 5: Hoare triple {807#true} call entry_point(); {807#true} is VALID [2020-07-29 01:05:58,783 INFO L263 TraceCheckUtils]: 4: Hoare triple {807#true} call main(); {807#true} is VALID [2020-07-29 01:05:58,783 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {807#true} {807#true} #452#return; {807#true} is VALID [2020-07-29 01:05:58,783 INFO L280 TraceCheckUtils]: 2: Hoare triple {807#true} assume true; {807#true} is VALID [2020-07-29 01:05:58,783 INFO L280 TraceCheckUtils]: 1: Hoare triple {807#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); {807#true} is VALID [2020-07-29 01:05:58,783 INFO L263 TraceCheckUtils]: 0: Hoare triple {807#true} call ULTIMATE.init(); {807#true} is VALID [2020-07-29 01:05:58,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:05:58,785 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877511633] [2020-07-29 01:05:58,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:05:58,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2020-07-29 01:05:58,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079641133] [2020-07-29 01:05:58,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-07-29 01:05:58,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:05:58,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:05:58,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:05:58,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-29 01:05:58,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:05:58,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:05:58,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:05:58,886 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 10 states. [2020-07-29 01:05:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:05:59,704 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-29 01:05:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:05:59,704 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-07-29 01:05:59,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:05:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:05:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2020-07-29 01:05:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:05:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 44 transitions. [2020-07-29 01:05:59,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 44 transitions. [2020-07-29 01:05:59,839 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:05:59,842 INFO L225 Difference]: With dead ends: 38 [2020-07-29 01:05:59,842 INFO L226 Difference]: Without dead ends: 38 [2020-07-29 01:05:59,842 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:05:59,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-29 01:05:59,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 23. [2020-07-29 01:05:59,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:05:59,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 23 states. [2020-07-29 01:05:59,848 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 23 states. [2020-07-29 01:05:59,848 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 23 states. [2020-07-29 01:05:59,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:05:59,851 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-29 01:05:59,852 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-29 01:05:59,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:05:59,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:05:59,853 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 38 states. [2020-07-29 01:05:59,853 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 38 states. [2020-07-29 01:05:59,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:05:59,856 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2020-07-29 01:05:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2020-07-29 01:05:59,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:05:59,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:05:59,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:05:59,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:05:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 01:05:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-29 01:05:59,860 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 21 [2020-07-29 01:05:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:05:59,861 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-29 01:05:59,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-29 01:05:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-29 01:05:59,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-29 01:05:59,862 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:05:59,863 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:06:00,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-29 01:06:00,076 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:00,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:00,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1600615901, now seen corresponding path program 1 times [2020-07-29 01:06:00,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:06:00,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389142125] [2020-07-29 01:06:00,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-29 01:06:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:00,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:06:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:00,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:06:00,302 INFO L384 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 [2020-07-29 01:06:00,303 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:06:00,307 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:06:00,308 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:06:00,308 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-29 01:06:00,312 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:06:00,312 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_167|]. (= |#valid| (store |v_#valid_167| |ldv_malloc_#res.base| (_ bv1 1))) [2020-07-29 01:06:00,313 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) [2020-07-29 01:06:00,349 INFO L263 TraceCheckUtils]: 0: Hoare triple {1079#true} call ULTIMATE.init(); {1079#true} is VALID [2020-07-29 01:06:00,350 INFO L280 TraceCheckUtils]: 1: Hoare triple {1079#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); {1079#true} is VALID [2020-07-29 01:06:00,350 INFO L280 TraceCheckUtils]: 2: Hoare triple {1079#true} assume true; {1079#true} is VALID [2020-07-29 01:06:00,350 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1079#true} {1079#true} #452#return; {1079#true} is VALID [2020-07-29 01:06:00,351 INFO L263 TraceCheckUtils]: 4: Hoare triple {1079#true} call main(); {1079#true} is VALID [2020-07-29 01:06:00,351 INFO L263 TraceCheckUtils]: 5: Hoare triple {1079#true} call entry_point(); {1079#true} is VALID [2020-07-29 01:06:00,351 INFO L263 TraceCheckUtils]: 6: Hoare triple {1079#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1079#true} is VALID [2020-07-29 01:06:00,351 INFO L280 TraceCheckUtils]: 7: Hoare triple {1079#true} ~size := #in~size; {1079#true} is VALID [2020-07-29 01:06:00,352 INFO L280 TraceCheckUtils]: 8: Hoare triple {1079#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; {1079#true} is VALID [2020-07-29 01:06:00,352 INFO L280 TraceCheckUtils]: 9: Hoare triple {1079#true} assume true; {1079#true} is VALID [2020-07-29 01:06:00,352 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1079#true} {1079#true} #440#return; {1079#true} is VALID [2020-07-29 01:06:00,352 INFO L280 TraceCheckUtils]: 11: Hoare triple {1079#true} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {1079#true} is VALID [2020-07-29 01:06:00,353 INFO L280 TraceCheckUtils]: 12: Hoare triple {1079#true} assume ~p~0.base != 0bv32 || ~p~0.offset != 0bv32; {1079#true} is VALID [2020-07-29 01:06:00,353 INFO L263 TraceCheckUtils]: 13: Hoare triple {1079#true} call #t~ret39.base, #t~ret39.offset := ldv_malloc(4bv32); {1079#true} is VALID [2020-07-29 01:06:00,353 INFO L280 TraceCheckUtils]: 14: Hoare triple {1079#true} ~size := #in~size; {1079#true} is VALID [2020-07-29 01:06:00,355 INFO L280 TraceCheckUtils]: 15: Hoare triple {1079#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; {1129#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:00,356 INFO L280 TraceCheckUtils]: 16: Hoare triple {1129#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} assume true; {1129#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:00,358 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1129#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} {1079#true} #442#return; {1136#(= (bvadd (select |#valid| |entry_point_#t~ret39.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:00,359 INFO L280 TraceCheckUtils]: 18: Hoare triple {1136#(= (bvadd (select |#valid| |entry_point_#t~ret39.base|) (_ bv1 1)) (_ bv0 1))} ~q~0.base, ~q~0.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {1140#(= (_ bv1 1) (select |#valid| entry_point_~q~0.base))} is VALID [2020-07-29 01:06:00,359 INFO L280 TraceCheckUtils]: 19: Hoare triple {1140#(= (_ bv1 1) (select |#valid| entry_point_~q~0.base))} assume 0bv32 == ~q~0.offset; {1140#(= (_ bv1 1) (select |#valid| entry_point_~q~0.base))} is VALID [2020-07-29 01:06:00,360 INFO L280 TraceCheckUtils]: 20: Hoare triple {1140#(= (_ bv1 1) (select |#valid| entry_point_~q~0.base))} assume ~bvult32(~q~0.base, #StackHeapBarrier); {1140#(= (_ bv1 1) (select |#valid| entry_point_~q~0.base))} is VALID [2020-07-29 01:06:00,361 INFO L280 TraceCheckUtils]: 21: Hoare triple {1140#(= (_ bv1 1) (select |#valid| entry_point_~q~0.base))} assume !(0bv32 == ~q~0.base || 1bv1 == #valid[~q~0.base]); {1080#false} is VALID [2020-07-29 01:06:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:06:00,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:06:00,441 INFO L280 TraceCheckUtils]: 21: Hoare triple {1140#(= (_ bv1 1) (select |#valid| entry_point_~q~0.base))} assume !(0bv32 == ~q~0.base || 1bv1 == #valid[~q~0.base]); {1080#false} is VALID [2020-07-29 01:06:00,442 INFO L280 TraceCheckUtils]: 20: Hoare triple {1140#(= (_ bv1 1) (select |#valid| entry_point_~q~0.base))} assume ~bvult32(~q~0.base, #StackHeapBarrier); {1140#(= (_ bv1 1) (select |#valid| entry_point_~q~0.base))} is VALID [2020-07-29 01:06:00,442 INFO L280 TraceCheckUtils]: 19: Hoare triple {1140#(= (_ bv1 1) (select |#valid| entry_point_~q~0.base))} assume 0bv32 == ~q~0.offset; {1140#(= (_ bv1 1) (select |#valid| entry_point_~q~0.base))} is VALID [2020-07-29 01:06:00,443 INFO L280 TraceCheckUtils]: 18: Hoare triple {1136#(= (bvadd (select |#valid| |entry_point_#t~ret39.base|) (_ bv1 1)) (_ bv0 1))} ~q~0.base, ~q~0.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {1140#(= (_ bv1 1) (select |#valid| entry_point_~q~0.base))} is VALID [2020-07-29 01:06:00,444 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1129#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} {1079#true} #442#return; {1136#(= (bvadd (select |#valid| |entry_point_#t~ret39.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:00,444 INFO L280 TraceCheckUtils]: 16: Hoare triple {1129#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} assume true; {1129#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:00,446 INFO L280 TraceCheckUtils]: 15: Hoare triple {1079#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; {1129#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:06:00,446 INFO L280 TraceCheckUtils]: 14: Hoare triple {1079#true} ~size := #in~size; {1079#true} is VALID [2020-07-29 01:06:00,446 INFO L263 TraceCheckUtils]: 13: Hoare triple {1079#true} call #t~ret39.base, #t~ret39.offset := ldv_malloc(4bv32); {1079#true} is VALID [2020-07-29 01:06:00,446 INFO L280 TraceCheckUtils]: 12: Hoare triple {1079#true} assume ~p~0.base != 0bv32 || ~p~0.offset != 0bv32; {1079#true} is VALID [2020-07-29 01:06:00,447 INFO L280 TraceCheckUtils]: 11: Hoare triple {1079#true} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {1079#true} is VALID [2020-07-29 01:06:00,447 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1079#true} {1079#true} #440#return; {1079#true} is VALID [2020-07-29 01:06:00,447 INFO L280 TraceCheckUtils]: 9: Hoare triple {1079#true} assume true; {1079#true} is VALID [2020-07-29 01:06:00,447 INFO L280 TraceCheckUtils]: 8: Hoare triple {1079#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; {1079#true} is VALID [2020-07-29 01:06:00,447 INFO L280 TraceCheckUtils]: 7: Hoare triple {1079#true} ~size := #in~size; {1079#true} is VALID [2020-07-29 01:06:00,448 INFO L263 TraceCheckUtils]: 6: Hoare triple {1079#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1079#true} is VALID [2020-07-29 01:06:00,448 INFO L263 TraceCheckUtils]: 5: Hoare triple {1079#true} call entry_point(); {1079#true} is VALID [2020-07-29 01:06:00,448 INFO L263 TraceCheckUtils]: 4: Hoare triple {1079#true} call main(); {1079#true} is VALID [2020-07-29 01:06:00,448 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1079#true} {1079#true} #452#return; {1079#true} is VALID [2020-07-29 01:06:00,448 INFO L280 TraceCheckUtils]: 2: Hoare triple {1079#true} assume true; {1079#true} is VALID [2020-07-29 01:06:00,449 INFO L280 TraceCheckUtils]: 1: Hoare triple {1079#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); {1079#true} is VALID [2020-07-29 01:06:00,449 INFO L263 TraceCheckUtils]: 0: Hoare triple {1079#true} call ULTIMATE.init(); {1079#true} is VALID [2020-07-29 01:06:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:06:00,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389142125] [2020-07-29 01:06:00,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:06:00,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-07-29 01:06:00,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132784188] [2020-07-29 01:06:00,451 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-29 01:06:00,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:06:00,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:06:00,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:00,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:06:00,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:06:00,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:06:00,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:06:00,484 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 5 states. [2020-07-29 01:06:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:00,637 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-29 01:06:00,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:06:00,638 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-29 01:06:00,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:06:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:06:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-29 01:06:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:06:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-29 01:06:00,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2020-07-29 01:06:00,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:00,691 INFO L225 Difference]: With dead ends: 29 [2020-07-29 01:06:00,691 INFO L226 Difference]: Without dead ends: 29 [2020-07-29 01:06:00,692 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:06:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-29 01:06:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-29 01:06:00,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:06:00,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-29 01:06:00,696 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-29 01:06:00,696 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-29 01:06:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:00,699 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-29 01:06:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-29 01:06:00,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:00,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:00,700 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-29 01:06:00,700 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-29 01:06:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:00,702 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2020-07-29 01:06:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-29 01:06:00,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:00,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:00,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:06:00,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:06:00,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-29 01:06:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2020-07-29 01:06:00,705 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 22 [2020-07-29 01:06:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:06:00,706 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2020-07-29 01:06:00,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:06:00,706 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2020-07-29 01:06:00,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-29 01:06:00,707 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:06:00,707 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:06:00,918 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-29 01:06:00,919 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:00,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:00,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1806847714, now seen corresponding path program 1 times [2020-07-29 01:06:00,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:06:00,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198973640] [2020-07-29 01:06:00,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-07-29 01:06:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:01,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:06:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:06:01,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:06:01,093 INFO L263 TraceCheckUtils]: 0: Hoare triple {1331#true} call ULTIMATE.init(); {1331#true} is VALID [2020-07-29 01:06:01,093 INFO L280 TraceCheckUtils]: 1: Hoare triple {1331#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); {1331#true} is VALID [2020-07-29 01:06:01,093 INFO L280 TraceCheckUtils]: 2: Hoare triple {1331#true} assume true; {1331#true} is VALID [2020-07-29 01:06:01,094 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1331#true} {1331#true} #452#return; {1331#true} is VALID [2020-07-29 01:06:01,094 INFO L263 TraceCheckUtils]: 4: Hoare triple {1331#true} call main(); {1331#true} is VALID [2020-07-29 01:06:01,095 INFO L263 TraceCheckUtils]: 5: Hoare triple {1331#true} call entry_point(); {1331#true} is VALID [2020-07-29 01:06:01,095 INFO L263 TraceCheckUtils]: 6: Hoare triple {1331#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1331#true} is VALID [2020-07-29 01:06:01,095 INFO L280 TraceCheckUtils]: 7: Hoare triple {1331#true} ~size := #in~size; {1331#true} is VALID [2020-07-29 01:06:01,095 INFO L280 TraceCheckUtils]: 8: Hoare triple {1331#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; {1331#true} is VALID [2020-07-29 01:06:01,096 INFO L280 TraceCheckUtils]: 9: Hoare triple {1331#true} assume true; {1331#true} is VALID [2020-07-29 01:06:01,096 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1331#true} {1331#true} #440#return; {1331#true} is VALID [2020-07-29 01:06:01,096 INFO L280 TraceCheckUtils]: 11: Hoare triple {1331#true} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {1331#true} is VALID [2020-07-29 01:06:01,096 INFO L280 TraceCheckUtils]: 12: Hoare triple {1331#true} assume ~p~0.base != 0bv32 || ~p~0.offset != 0bv32; {1331#true} is VALID [2020-07-29 01:06:01,097 INFO L263 TraceCheckUtils]: 13: Hoare triple {1331#true} call #t~ret39.base, #t~ret39.offset := ldv_malloc(4bv32); {1331#true} is VALID [2020-07-29 01:06:01,097 INFO L280 TraceCheckUtils]: 14: Hoare triple {1331#true} ~size := #in~size; {1331#true} is VALID [2020-07-29 01:06:01,098 INFO L280 TraceCheckUtils]: 15: Hoare triple {1331#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1381#(= |ldv_malloc_#res.base| (_ bv0 32))} is VALID [2020-07-29 01:06:01,098 INFO L280 TraceCheckUtils]: 16: Hoare triple {1381#(= |ldv_malloc_#res.base| (_ bv0 32))} assume true; {1381#(= |ldv_malloc_#res.base| (_ bv0 32))} is VALID [2020-07-29 01:06:01,100 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1381#(= |ldv_malloc_#res.base| (_ bv0 32))} {1331#true} #442#return; {1388#(= |entry_point_#t~ret39.base| (_ bv0 32))} is VALID [2020-07-29 01:06:01,101 INFO L280 TraceCheckUtils]: 18: Hoare triple {1388#(= |entry_point_#t~ret39.base| (_ bv0 32))} ~q~0.base, ~q~0.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {1392#(= (_ bv0 32) entry_point_~q~0.base)} is VALID [2020-07-29 01:06:01,102 INFO L280 TraceCheckUtils]: 19: Hoare triple {1392#(= (_ bv0 32) entry_point_~q~0.base)} assume 0bv32 == ~q~0.offset; {1392#(= (_ bv0 32) entry_point_~q~0.base)} is VALID [2020-07-29 01:06:01,102 INFO L280 TraceCheckUtils]: 20: Hoare triple {1392#(= (_ bv0 32) entry_point_~q~0.base)} assume ~bvult32(~q~0.base, #StackHeapBarrier); {1392#(= (_ bv0 32) entry_point_~q~0.base)} is VALID [2020-07-29 01:06:01,103 INFO L280 TraceCheckUtils]: 21: Hoare triple {1392#(= (_ bv0 32) entry_point_~q~0.base)} assume !(0bv32 == ~q~0.base || 1bv1 == #valid[~q~0.base]); {1332#false} is VALID [2020-07-29 01:06:01,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:06:01,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:06:01,172 INFO L280 TraceCheckUtils]: 21: Hoare triple {1392#(= (_ bv0 32) entry_point_~q~0.base)} assume !(0bv32 == ~q~0.base || 1bv1 == #valid[~q~0.base]); {1332#false} is VALID [2020-07-29 01:06:01,173 INFO L280 TraceCheckUtils]: 20: Hoare triple {1392#(= (_ bv0 32) entry_point_~q~0.base)} assume ~bvult32(~q~0.base, #StackHeapBarrier); {1392#(= (_ bv0 32) entry_point_~q~0.base)} is VALID [2020-07-29 01:06:01,173 INFO L280 TraceCheckUtils]: 19: Hoare triple {1392#(= (_ bv0 32) entry_point_~q~0.base)} assume 0bv32 == ~q~0.offset; {1392#(= (_ bv0 32) entry_point_~q~0.base)} is VALID [2020-07-29 01:06:01,174 INFO L280 TraceCheckUtils]: 18: Hoare triple {1388#(= |entry_point_#t~ret39.base| (_ bv0 32))} ~q~0.base, ~q~0.offset := #t~ret39.base, #t~ret39.offset;havoc #t~ret39.base, #t~ret39.offset; {1392#(= (_ bv0 32) entry_point_~q~0.base)} is VALID [2020-07-29 01:06:01,175 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {1381#(= |ldv_malloc_#res.base| (_ bv0 32))} {1331#true} #442#return; {1388#(= |entry_point_#t~ret39.base| (_ bv0 32))} is VALID [2020-07-29 01:06:01,176 INFO L280 TraceCheckUtils]: 16: Hoare triple {1381#(= |ldv_malloc_#res.base| (_ bv0 32))} assume true; {1381#(= |ldv_malloc_#res.base| (_ bv0 32))} is VALID [2020-07-29 01:06:01,176 INFO L280 TraceCheckUtils]: 15: Hoare triple {1331#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1381#(= |ldv_malloc_#res.base| (_ bv0 32))} is VALID [2020-07-29 01:06:01,177 INFO L280 TraceCheckUtils]: 14: Hoare triple {1331#true} ~size := #in~size; {1331#true} is VALID [2020-07-29 01:06:01,177 INFO L263 TraceCheckUtils]: 13: Hoare triple {1331#true} call #t~ret39.base, #t~ret39.offset := ldv_malloc(4bv32); {1331#true} is VALID [2020-07-29 01:06:01,177 INFO L280 TraceCheckUtils]: 12: Hoare triple {1331#true} assume ~p~0.base != 0bv32 || ~p~0.offset != 0bv32; {1331#true} is VALID [2020-07-29 01:06:01,177 INFO L280 TraceCheckUtils]: 11: Hoare triple {1331#true} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {1331#true} is VALID [2020-07-29 01:06:01,177 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1331#true} {1331#true} #440#return; {1331#true} is VALID [2020-07-29 01:06:01,178 INFO L280 TraceCheckUtils]: 9: Hoare triple {1331#true} assume true; {1331#true} is VALID [2020-07-29 01:06:01,178 INFO L280 TraceCheckUtils]: 8: Hoare triple {1331#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; {1331#true} is VALID [2020-07-29 01:06:01,178 INFO L280 TraceCheckUtils]: 7: Hoare triple {1331#true} ~size := #in~size; {1331#true} is VALID [2020-07-29 01:06:01,178 INFO L263 TraceCheckUtils]: 6: Hoare triple {1331#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1331#true} is VALID [2020-07-29 01:06:01,178 INFO L263 TraceCheckUtils]: 5: Hoare triple {1331#true} call entry_point(); {1331#true} is VALID [2020-07-29 01:06:01,179 INFO L263 TraceCheckUtils]: 4: Hoare triple {1331#true} call main(); {1331#true} is VALID [2020-07-29 01:06:01,179 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1331#true} {1331#true} #452#return; {1331#true} is VALID [2020-07-29 01:06:01,179 INFO L280 TraceCheckUtils]: 2: Hoare triple {1331#true} assume true; {1331#true} is VALID [2020-07-29 01:06:01,180 INFO L280 TraceCheckUtils]: 1: Hoare triple {1331#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); {1331#true} is VALID [2020-07-29 01:06:01,180 INFO L263 TraceCheckUtils]: 0: Hoare triple {1331#true} call ULTIMATE.init(); {1331#true} is VALID [2020-07-29 01:06:01,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:06:01,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198973640] [2020-07-29 01:06:01,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:06:01,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-07-29 01:06:01,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551343627] [2020-07-29 01:06:01,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-29 01:06:01,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:06:01,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:06:01,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:01,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:06:01,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:06:01,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:06:01,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:06:01,218 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 5 states. [2020-07-29 01:06:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:01,356 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-29 01:06:01,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:06:01,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-07-29 01:06:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:06:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:06:01,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-29 01:06:01,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:06:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-29 01:06:01,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-29 01:06:01,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:06:01,406 INFO L225 Difference]: With dead ends: 30 [2020-07-29 01:06:01,407 INFO L226 Difference]: Without dead ends: 30 [2020-07-29 01:06:01,407 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:06:01,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-29 01:06:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2020-07-29 01:06:01,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:06:01,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 22 states. [2020-07-29 01:06:01,411 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 22 states. [2020-07-29 01:06:01,411 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 22 states. [2020-07-29 01:06:01,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:01,413 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-29 01:06:01,413 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-29 01:06:01,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:01,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:01,414 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 30 states. [2020-07-29 01:06:01,414 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 30 states. [2020-07-29 01:06:01,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:06:01,416 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-29 01:06:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-29 01:06:01,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:06:01,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:06:01,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:06:01,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:06:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:06:01,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-29 01:06:01,419 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 22 [2020-07-29 01:06:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:06:01,419 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-29 01:06:01,419 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:06:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-29 01:06:01,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-29 01:06:01,420 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:06:01,420 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:06:01,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-07-29 01:06:01,638 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:06:01,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:06:01,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1221784944, now seen corresponding path program 1 times [2020-07-29 01:06:01,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:06:01,639 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500660441] [2020-07-29 01:06:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-07-29 01:06:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:06:01,769 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:06:01,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:06:01,800 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:06:01,865 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-07-29 01:06:01,866 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-29 01:06:02,085 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-07-29 01:06:02,102 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-07-29 01:06:02,108 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 7bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2020-07-29 01:06:02,108 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 3bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2020-07-29 01:06:02,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:06:02 BoogieIcfgContainer [2020-07-29 01:06:02,120 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:06:02,120 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:06:02,120 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:06:02,120 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:06:02,121 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:05:55" (3/4) ... [2020-07-29 01:06:02,124 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:06:02,124 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:06:02,126 INFO L168 Benchmark]: Toolchain (without parser) took 10098.74 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.5 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -102.7 MB). Peak memory consumption was 220.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:06:02,127 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:06:02,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1013.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -133.0 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:06:02,128 INFO L168 Benchmark]: Boogie Preprocessor took 157.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:06:02,129 INFO L168 Benchmark]: RCFGBuilder took 1936.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 913.8 MB in the end (delta: 168.6 MB). Peak memory consumption was 168.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:06:02,130 INFO L168 Benchmark]: TraceAbstraction took 6979.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:06:02,130 INFO L168 Benchmark]: Witness Printer took 3.95 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:06:02,134 INFO L336 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1013.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -133.0 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 157.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1936.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 913.8 MB in the end (delta: 168.6 MB). Peak memory consumption was 168.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6979.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 187.7 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.95 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 7bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 3bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 764]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 764. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={-1879048185:0}] [L765] CALL entry_point() VAL [ldv_global_msg_list={-1879048185:0}] [L758] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, ldv_global_msg_list={-1879048185:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [\old(size)=4, \result={-2147483643:0}, ldv_global_msg_list={-1879048185:0}, malloc(size)={-2147483643:0}, size=4] [L758] RET, EXPR ldv_malloc(sizeof(int)) VAL [ldv_global_msg_list={-1879048185:0}, ldv_malloc(sizeof(int))={-2147483643:0}] [L758] int *p = (int *)ldv_malloc(sizeof(int)); [L759] COND TRUE \read(*p) VAL [ldv_global_msg_list={-1879048185:0}, p={-2147483643:0}] [L760] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, ldv_global_msg_list={-1879048185:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); VAL [\old(size)=4, \result={5:0}, ldv_global_msg_list={-1879048185:0}, malloc(size)={5:0}, size=4] [L760] RET, EXPR ldv_malloc(sizeof(int)) VAL [ldv_global_msg_list={-1879048185:0}, ldv_malloc(sizeof(int))={5:0}, p={-2147483643:0}] [L760] int *q = (int *)ldv_malloc(sizeof(int)); [L761] free(q) VAL [ldv_global_msg_list={-1879048185:0}, p={-2147483643:0}, q={5:0}] [L761] free(q) VAL [ldv_global_msg_list={-1879048185:0}, p={-2147483643:0}, q={5:0}] [L761] free(q) [L765] RET entry_point() VAL [ldv_global_msg_list={-1879048185:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 338 locations, 74 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.8s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 161 SDtfs, 47 SDslu, 348 SDs, 0 SdLazy, 165 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 45 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 142 NumberOfCodeBlocks, 142 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 222 ConstructedInterpolants, 12 QuantifiedInterpolants, 10074 SizeOfPredicates, 6 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 32/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...