./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5758efa3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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_test22_3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 64bit --witnessprinter.graph.data.programhash e977fbeb632c2e5a16902a6c2250cf608217c650 ......................................................................................................................... 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 -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_test22_3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 64bit --witnessprinter.graph.data.programhash e977fbeb632c2e5a16902a6c2250cf608217c650 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-5758efa [2019-11-26 20:40:10,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 20:40:10,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 20:40:10,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 20:40:10,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 20:40:10,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 20:40:10,720 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 20:40:10,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 20:40:10,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 20:40:10,740 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 20:40:10,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 20:40:10,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 20:40:10,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 20:40:10,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 20:40:10,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 20:40:10,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 20:40:10,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 20:40:10,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 20:40:10,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 20:40:10,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 20:40:10,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 20:40:10,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 20:40:10,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 20:40:10,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 20:40:10,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 20:40:10,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 20:40:10,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 20:40:10,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 20:40:10,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 20:40:10,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 20:40:10,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 20:40:10,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 20:40:10,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 20:40:10,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 20:40:10,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 20:40:10,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 20:40:10,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 20:40:10,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 20:40:10,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 20:40:10,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 20:40:10,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 20:40:10,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-26 20:40:10,830 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 20:40:10,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 20:40:10,834 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 20:40:10,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 20:40:10,836 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 20:40:10,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 20:40:10,837 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 20:40:10,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 20:40:10,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 20:40:10,839 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 20:40:10,840 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 20:40:10,840 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 20:40:10,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 20:40:10,840 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 20:40:10,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 20:40:10,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 20:40:10,842 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 20:40:10,843 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 20:40:10,843 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 20:40:10,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 20:40:10,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 20:40:10,844 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 20:40:10,844 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-26 20:40:10,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 20:40:10,845 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e977fbeb632c2e5a16902a6c2250cf608217c650 [2019-11-26 20:40:11,199 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 20:40:11,212 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 20:40:11,216 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 20:40:11,217 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 20:40:11,218 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 20:40:11,219 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-26 20:40:11,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ace8e64b1/10c15a024f594b92878036726560c865/FLAG64c93dd5c [2019-11-26 20:40:11,849 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 20:40:11,850 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-26 20:40:11,869 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ace8e64b1/10c15a024f594b92878036726560c865/FLAG64c93dd5c [2019-11-26 20:40:12,123 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ace8e64b1/10c15a024f594b92878036726560c865 [2019-11-26 20:40:12,126 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 20:40:12,127 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 20:40:12,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 20:40:12,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 20:40:12,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 20:40:12,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:40:12" (1/1) ... [2019-11-26 20:40:12,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74112e7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:40:12, skipping insertion in model container [2019-11-26 20:40:12,138 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:40:12" (1/1) ... [2019-11-26 20:40:12,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 20:40:12,220 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 20:40:12,796 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:40:12,825 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) [2019-11-26 20:40:12,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@c0ef514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:40:12, skipping insertion in model container [2019-11-26 20:40:12,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 20:40:12,827 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-26 20:40:12,831 INFO L168 Benchmark]: Toolchain (without parser) took 701.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-26 20:40:12,832 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 20:40:12,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-26 20:40:12,838 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 699.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 20.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.24-5758efa [2019-11-26 20:40:14,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 20:40:14,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 20:40:14,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 20:40:14,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 20:40:14,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 20:40:14,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 20:40:14,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 20:40:14,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 20:40:14,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 20:40:14,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 20:40:14,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 20:40:14,631 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 20:40:14,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 20:40:14,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 20:40:14,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 20:40:14,639 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 20:40:14,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 20:40:14,647 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 20:40:14,649 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 20:40:14,650 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 20:40:14,651 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 20:40:14,652 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 20:40:14,653 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 20:40:14,655 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 20:40:14,656 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 20:40:14,656 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 20:40:14,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 20:40:14,658 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 20:40:14,659 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 20:40:14,659 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 20:40:14,660 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 20:40:14,660 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 20:40:14,661 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 20:40:14,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 20:40:14,663 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 20:40:14,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 20:40:14,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 20:40:14,664 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 20:40:14,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 20:40:14,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 20:40:14,671 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-26 20:40:14,698 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 20:40:14,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 20:40:14,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 20:40:14,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 20:40:14,702 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 20:40:14,704 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 20:40:14,704 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 20:40:14,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 20:40:14,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 20:40:14,707 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 20:40:14,707 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 20:40:14,707 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 20:40:14,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 20:40:14,708 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 20:40:14,708 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 20:40:14,708 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 20:40:14,708 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 20:40:14,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 20:40:14,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 20:40:14,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 20:40:14,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 20:40:14,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 20:40:14,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 20:40:14,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 20:40:14,711 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-26 20:40:14,713 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 20:40:14,714 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 20:40:14,714 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e977fbeb632c2e5a16902a6c2250cf608217c650 [2019-11-26 20:40:15,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 20:40:15,047 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 20:40:15,053 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 20:40:15,054 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 20:40:15,054 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 20:40:15,055 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-26 20:40:15,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68dba2bd7/89db5085a45b4b6b91bd18545add4ea4/FLAGd2c4272ea [2019-11-26 20:40:15,676 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 20:40:15,677 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-26 20:40:15,695 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68dba2bd7/89db5085a45b4b6b91bd18545add4ea4/FLAGd2c4272ea [2019-11-26 20:40:15,961 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68dba2bd7/89db5085a45b4b6b91bd18545add4ea4 [2019-11-26 20:40:15,965 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 20:40:15,967 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 20:40:15,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 20:40:15,969 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 20:40:15,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 20:40:15,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:40:15" (1/1) ... [2019-11-26 20:40:15,976 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d2d80b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:40:15, skipping insertion in model container [2019-11-26 20:40:15,977 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 08:40:15" (1/1) ... [2019-11-26 20:40:15,985 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 20:40:16,026 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 20:40:16,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:40:16,569 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-26 20:40:16,590 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 20:40:16,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:40:16,670 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 20:40:16,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 20:40:16,812 INFO L208 MainTranslator]: Completed translation [2019-11-26 20:40:16,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:40:16 WrapperNode [2019-11-26 20:40:16,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 20:40:16,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 20:40:16,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 20:40:16,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 20:40:16,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:40:16" (1/1) ... [2019-11-26 20:40:16,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:40:16" (1/1) ... [2019-11-26 20:40:16,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:40:16" (1/1) ... [2019-11-26 20:40:16,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:40:16" (1/1) ... [2019-11-26 20:40:16,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:40:16" (1/1) ... [2019-11-26 20:40:16,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:40:16" (1/1) ... [2019-11-26 20:40:16,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:40:16" (1/1) ... [2019-11-26 20:40:16,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 20:40:16,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 20:40:16,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 20:40:16,924 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 20:40:16,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:40:16" (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 [2019-11-26 20:40:17,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-26 20:40:17,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 20:40:17,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-26 20:40:17,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 20:40:17,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-26 20:40:17,011 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-26 20:40:17,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-26 20:40:17,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-26 20:40:17,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-26 20:40:17,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-26 20:40:17,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-26 20:40:17,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-26 20:40:17,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-26 20:40:17,014 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-26 20:40:17,015 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-26 20:40:17,016 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-26 20:40:17,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-26 20:40:17,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-26 20:40:17,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-26 20:40:17,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-26 20:40:17,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-26 20:40:17,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-26 20:40:17,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-26 20:40:17,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-26 20:40:17,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-26 20:40:17,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-26 20:40:17,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-26 20:40:17,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-26 20:40:17,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-26 20:40:17,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-26 20:40:17,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-26 20:40:17,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-26 20:40:17,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-26 20:40:17,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-26 20:40:17,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-26 20:40:17,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-26 20:40:17,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-26 20:40:17,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-26 20:40:17,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-26 20:40:17,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-26 20:40:17,024 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-26 20:40:17,024 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-26 20:40:17,024 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-26 20:40:17,025 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-26 20:40:17,025 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-26 20:40:17,025 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-26 20:40:17,025 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-26 20:40:17,025 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-26 20:40:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-26 20:40:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-26 20:40:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-26 20:40:17,026 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-26 20:40:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-26 20:40:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-26 20:40:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-26 20:40:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-26 20:40:17,027 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-26 20:40:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-26 20:40:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-26 20:40:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-26 20:40:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-26 20:40:17,028 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-26 20:40:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-26 20:40:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-26 20:40:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-26 20:40:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-26 20:40:17,029 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-26 20:40:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-26 20:40:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-26 20:40:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-26 20:40:17,030 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-26 20:40:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-26 20:40:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-26 20:40:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-26 20:40:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-26 20:40:17,031 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-26 20:40:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-26 20:40:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-26 20:40:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-26 20:40:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-26 20:40:17,032 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-26 20:40:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-26 20:40:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-26 20:40:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-26 20:40:17,033 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-26 20:40:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-26 20:40:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-26 20:40:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-26 20:40:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-26 20:40:17,034 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-26 20:40:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-26 20:40:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-26 20:40:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-26 20:40:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-26 20:40:17,035 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-26 20:40:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-26 20:40:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-26 20:40:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-26 20:40:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-26 20:40:17,036 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-26 20:40:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-26 20:40:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-26 20:40:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-26 20:40:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-26 20:40:17,037 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-26 20:40:17,038 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-26 20:40:17,038 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-26 20:40:17,038 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-26 20:40:17,038 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-26 20:40:17,038 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-26 20:40:17,039 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-26 20:40:17,039 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-26 20:40:17,039 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-26 20:40:17,039 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-26 20:40:17,039 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-26 20:40:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-26 20:40:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-26 20:40:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-26 20:40:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-26 20:40:17,040 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-26 20:40:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-26 20:40:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-26 20:40:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-26 20:40:17,041 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-26 20:40:17,042 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-26 20:40:17,042 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-26 20:40:17,042 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-26 20:40:17,042 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-26 20:40:17,042 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-26 20:40:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-26 20:40:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-26 20:40:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-26 20:40:17,043 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-26 20:40:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-26 20:40:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-26 20:40:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-26 20:40:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-26 20:40:17,044 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-26 20:40:17,045 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-26 20:40:17,045 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-26 20:40:17,045 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-26 20:40:17,045 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-26 20:40:17,046 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-26 20:40:17,046 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-26 20:40:17,046 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-26 20:40:17,046 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-26 20:40:17,047 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-26 20:40:17,047 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-26 20:40:17,047 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-26 20:40:17,047 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-26 20:40:17,047 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-26 20:40:17,048 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-26 20:40:17,048 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-26 20:40:17,048 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-26 20:40:17,048 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-26 20:40:17,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-26 20:40:17,049 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-26 20:40:17,049 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-26 20:40:17,049 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-26 20:40:17,050 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-26 20:40:17,050 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-26 20:40:17,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 20:40:17,050 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-26 20:40:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-26 20:40:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-26 20:40:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 20:40:17,051 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-26 20:40:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-26 20:40:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-26 20:40:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 20:40:17,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-26 20:40:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-26 20:40:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-26 20:40:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-26 20:40:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-26 20:40:17,053 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-26 20:40:17,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 20:40:17,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-26 20:40:17,054 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-26 20:40:17,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-26 20:40:17,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-26 20:40:17,055 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-26 20:40:17,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 20:40:17,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 20:40:17,056 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-26 20:40:17,056 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-26 20:40:17,056 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-26 20:40:17,056 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-26 20:40:17,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-26 20:40:17,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-26 20:40:17,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-26 20:40:17,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-26 20:40:17,057 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-26 20:40:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-26 20:40:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-26 20:40:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-26 20:40:17,058 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-26 20:40:17,059 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-26 20:40:17,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-26 20:40:17,059 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-26 20:40:17,059 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-26 20:40:17,059 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-26 20:40:17,060 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-26 20:40:17,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-26 20:40:17,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 20:40:17,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 20:40:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 20:40:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 20:40:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-26 20:40:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-26 20:40:17,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-26 20:40:17,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-26 20:40:17,775 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 20:40:18,168 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 20:40:18,541 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 20:40:18,541 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-26 20:40:18,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:40:18 BoogieIcfgContainer [2019-11-26 20:40:18,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 20:40:18,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 20:40:18,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 20:40:18,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 20:40:18,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 08:40:15" (1/3) ... [2019-11-26 20:40:18,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25288c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 08:40:18, skipping insertion in model container [2019-11-26 20:40:18,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 08:40:16" (2/3) ... [2019-11-26 20:40:18,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25288c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 08:40:18, skipping insertion in model container [2019-11-26 20:40:18,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:40:18" (3/3) ... [2019-11-26 20:40:18,553 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-2.i [2019-11-26 20:40:18,563 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 20:40:18,575 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-26 20:40:18,585 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-26 20:40:18,603 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 20:40:18,603 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 20:40:18,603 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 20:40:18,603 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 20:40:18,603 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 20:40:18,603 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 20:40:18,604 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 20:40:18,604 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 20:40:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-26 20:40:18,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 20:40:18,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:18,638 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:18,639 INFO L410 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:18,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:18,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1484999723, now seen corresponding path program 1 times [2019-11-26 20:40:18,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:18,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26104833] [2019-11-26 20:40:18,659 INFO L94 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 [2019-11-26 20:40:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:18,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 20:40:18,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:19,039 INFO L377 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 [2019-11-26 20:40:19,040 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:40:19,055 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:40:19,055 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:40:19,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 20:40:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:19,114 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:19,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26104833] [2019-11-26 20:40:19,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:19,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 20:40:19,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136305818] [2019-11-26 20:40:19,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 20:40:19,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:19,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 20:40:19,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:40:19,259 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2019-11-26 20:40:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:19,654 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-11-26 20:40:19,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:40:19,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-26 20:40:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:19,672 INFO L225 Difference]: With dead ends: 133 [2019-11-26 20:40:19,673 INFO L226 Difference]: Without dead ends: 130 [2019-11-26 20:40:19,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:40:19,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-26 20:40:19,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2019-11-26 20:40:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-26 20:40:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2019-11-26 20:40:19,732 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 17 [2019-11-26 20:40:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:19,733 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2019-11-26 20:40:19,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 20:40:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2019-11-26 20:40:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 20:40:19,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:19,735 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:19,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-26 20:40:19,937 INFO L410 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:19,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:19,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1484999724, now seen corresponding path program 1 times [2019-11-26 20:40:19,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:19,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535679155] [2019-11-26 20:40:19,940 INFO L94 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 [2019-11-26 20:40:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:20,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 20:40:20,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:20,098 INFO L377 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 [2019-11-26 20:40:20,099 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:40:20,106 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:40:20,106 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:40:20,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 20:40:20,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:20,156 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:20,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535679155] [2019-11-26 20:40:20,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:20,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-26 20:40:20,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652852759] [2019-11-26 20:40:20,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 20:40:20,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:20,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 20:40:20,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-26 20:40:20,507 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 10 states. [2019-11-26 20:40:21,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:21,180 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2019-11-26 20:40:21,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 20:40:21,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-26 20:40:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:21,186 INFO L225 Difference]: With dead ends: 129 [2019-11-26 20:40:21,186 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 20:40:21,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:40:21,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 20:40:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2019-11-26 20:40:21,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-26 20:40:21,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-11-26 20:40:21,201 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 17 [2019-11-26 20:40:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:21,202 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-11-26 20:40:21,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 20:40:21,202 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-11-26 20:40:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 20:40:21,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:21,203 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:21,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-26 20:40:21,408 INFO L410 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:21,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:21,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1513628874, now seen corresponding path program 1 times [2019-11-26 20:40:21,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:21,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274831842] [2019-11-26 20:40:21,410 INFO L94 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 [2019-11-26 20:40:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:21,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 20:40:21,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:21,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:21,630 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:21,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274831842] [2019-11-26 20:40:21,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:21,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-26 20:40:21,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681107642] [2019-11-26 20:40:21,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 20:40:21,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:21,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 20:40:21,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:40:21,683 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 5 states. [2019-11-26 20:40:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:21,721 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2019-11-26 20:40:21,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:40:21,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-26 20:40:21,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:21,724 INFO L225 Difference]: With dead ends: 123 [2019-11-26 20:40:21,726 INFO L226 Difference]: Without dead ends: 123 [2019-11-26 20:40:21,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:40:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-26 20:40:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-11-26 20:40:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-26 20:40:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2019-11-26 20:40:21,750 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 17 [2019-11-26 20:40:21,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:21,751 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2019-11-26 20:40:21,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 20:40:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2019-11-26 20:40:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-26 20:40:21,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:21,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:21,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-26 20:40:21,967 INFO L410 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:21,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:21,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1578542280, now seen corresponding path program 1 times [2019-11-26 20:40:21,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:21,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19269936] [2019-11-26 20:40:21,971 INFO L94 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 [2019-11-26 20:40:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:22,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 20:40:22,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:22,127 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:22,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19269936] [2019-11-26 20:40:22,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:22,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-26 20:40:22,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506254476] [2019-11-26 20:40:22,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 20:40:22,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:22,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 20:40:22,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:40:22,213 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 5 states. [2019-11-26 20:40:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:22,245 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2019-11-26 20:40:22,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 20:40:22,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-26 20:40:22,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:22,249 INFO L225 Difference]: With dead ends: 123 [2019-11-26 20:40:22,251 INFO L226 Difference]: Without dead ends: 123 [2019-11-26 20:40:22,251 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 20:40:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-26 20:40:22,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-11-26 20:40:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-26 20:40:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-11-26 20:40:22,271 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 29 [2019-11-26 20:40:22,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:22,271 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-11-26 20:40:22,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 20:40:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2019-11-26 20:40:22,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-26 20:40:22,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:22,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:22,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-26 20:40:22,476 INFO L410 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:22,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:22,477 INFO L82 PathProgramCache]: Analyzing trace with hash 581469927, now seen corresponding path program 1 times [2019-11-26 20:40:22,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:22,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153673316] [2019-11-26 20:40:22,477 INFO L94 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 [2019-11-26 20:40:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:22,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 20:40:22,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:22,689 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:22,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153673316] [2019-11-26 20:40:22,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:22,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-26 20:40:22,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399671033] [2019-11-26 20:40:22,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 20:40:22,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:22,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 20:40:22,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:40:22,740 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 7 states. [2019-11-26 20:40:22,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:22,810 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2019-11-26 20:40:22,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 20:40:22,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-11-26 20:40:22,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:22,815 INFO L225 Difference]: With dead ends: 134 [2019-11-26 20:40:22,815 INFO L226 Difference]: Without dead ends: 134 [2019-11-26 20:40:22,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:40:22,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-26 20:40:22,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2019-11-26 20:40:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-26 20:40:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2019-11-26 20:40:22,834 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 29 [2019-11-26 20:40:22,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:22,837 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2019-11-26 20:40:22,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 20:40:22,838 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2019-11-26 20:40:22,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 20:40:22,839 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:22,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:23,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-26 20:40:23,040 INFO L410 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:23,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:23,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1899216601, now seen corresponding path program 1 times [2019-11-26 20:40:23,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:23,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111249278] [2019-11-26 20:40:23,041 INFO L94 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 [2019-11-26 20:40:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:23,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 20:40:23,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:23,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:23,180 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:23,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111249278] [2019-11-26 20:40:23,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:23,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-26 20:40:23,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267862921] [2019-11-26 20:40:23,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 20:40:23,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:23,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 20:40:23,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 20:40:23,241 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 6 states. [2019-11-26 20:40:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:23,298 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2019-11-26 20:40:23,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 20:40:23,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-26 20:40:23,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:23,301 INFO L225 Difference]: With dead ends: 136 [2019-11-26 20:40:23,301 INFO L226 Difference]: Without dead ends: 132 [2019-11-26 20:40:23,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-26 20:40:23,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-26 20:40:23,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-11-26 20:40:23,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-26 20:40:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2019-11-26 20:40:23,311 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 32 [2019-11-26 20:40:23,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:23,311 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2019-11-26 20:40:23,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 20:40:23,312 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2019-11-26 20:40:23,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-26 20:40:23,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:23,313 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:23,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-26 20:40:23,522 INFO L410 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:23,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:23,523 INFO L82 PathProgramCache]: Analyzing trace with hash -2034413241, now seen corresponding path program 1 times [2019-11-26 20:40:23,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:23,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234547841] [2019-11-26 20:40:23,524 INFO L94 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 [2019-11-26 20:40:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:23,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 20:40:23,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:23,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:23,714 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:23,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234547841] [2019-11-26 20:40:23,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:40:23,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-26 20:40:23,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537127097] [2019-11-26 20:40:23,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 20:40:23,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:23,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 20:40:23,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-26 20:40:23,869 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 10 states. [2019-11-26 20:40:24,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:24,105 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-11-26 20:40:24,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:40:24,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-26 20:40:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:24,110 INFO L225 Difference]: With dead ends: 140 [2019-11-26 20:40:24,110 INFO L226 Difference]: Without dead ends: 136 [2019-11-26 20:40:24,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-26 20:40:24,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-26 20:40:24,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-11-26 20:40:24,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-26 20:40:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2019-11-26 20:40:24,125 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 34 [2019-11-26 20:40:24,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:24,125 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2019-11-26 20:40:24,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 20:40:24,126 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2019-11-26 20:40:24,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 20:40:24,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:24,127 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:24,327 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-26 20:40:24,328 INFO L410 AbstractCegarLoop]: === Iteration 8 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:24,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash 76391075, now seen corresponding path program 1 times [2019-11-26 20:40:24,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:24,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275688562] [2019-11-26 20:40:24,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-26 20:40:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:24,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 20:40:24,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:24,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 20:40:24,486 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:24,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 20:40:24,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275688562] [2019-11-26 20:40:24,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:24,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 20:40:24,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342191101] [2019-11-26 20:40:24,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 20:40:24,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:24,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 20:40:24,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 20:40:24,668 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 3 states. [2019-11-26 20:40:24,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:24,863 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2019-11-26 20:40:24,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 20:40:24,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-26 20:40:24,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:24,865 INFO L225 Difference]: With dead ends: 147 [2019-11-26 20:40:24,865 INFO L226 Difference]: Without dead ends: 131 [2019-11-26 20:40:24,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 20:40:24,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-26 20:40:24,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2019-11-26 20:40:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-26 20:40:24,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2019-11-26 20:40:24,873 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 32 [2019-11-26 20:40:24,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:24,873 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2019-11-26 20:40:24,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 20:40:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2019-11-26 20:40:24,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 20:40:24,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:24,875 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:25,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-26 20:40:25,076 INFO L410 AbstractCegarLoop]: === Iteration 9 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:25,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:25,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1051272825, now seen corresponding path program 2 times [2019-11-26 20:40:25,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:25,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691676108] [2019-11-26 20:40:25,077 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-26 20:40:25,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-26 20:40:25,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 20:40:25,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 20:40:25,226 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:25,234 INFO L377 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 [2019-11-26 20:40:25,234 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:40:25,236 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:40:25,236 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:40:25,236 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 20:40:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-26 20:40:25,389 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-26 20:40:25,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691676108] [2019-11-26 20:40:25,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:25,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-26 20:40:25,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459541906] [2019-11-26 20:40:25,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 20:40:25,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:25,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 20:40:25,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:40:25,488 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 12 states. [2019-11-26 20:40:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:26,394 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2019-11-26 20:40:26,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 20:40:26,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-26 20:40:26,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:26,396 INFO L225 Difference]: With dead ends: 146 [2019-11-26 20:40:26,396 INFO L226 Difference]: Without dead ends: 146 [2019-11-26 20:40:26,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-26 20:40:26,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-26 20:40:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2019-11-26 20:40:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-26 20:40:26,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2019-11-26 20:40:26,404 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 38 [2019-11-26 20:40:26,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:26,405 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2019-11-26 20:40:26,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 20:40:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2019-11-26 20:40:26,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 20:40:26,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:26,406 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:26,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-26 20:40:26,616 INFO L410 AbstractCegarLoop]: === Iteration 10 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:26,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:26,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1051272824, now seen corresponding path program 1 times [2019-11-26 20:40:26,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:26,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772771736] [2019-11-26 20:40:26,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-26 20:40:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:26,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 20:40:26,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:26,856 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:26,856 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:27,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772771736] [2019-11-26 20:40:27,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:40:27,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-26 20:40:27,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000527551] [2019-11-26 20:40:27,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-26 20:40:27,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:27,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-26 20:40:27,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-26 20:40:27,245 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 18 states. [2019-11-26 20:40:28,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:28,177 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2019-11-26 20:40:28,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 20:40:28,179 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-26 20:40:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:28,181 INFO L225 Difference]: With dead ends: 134 [2019-11-26 20:40:28,181 INFO L226 Difference]: Without dead ends: 130 [2019-11-26 20:40:28,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-26 20:40:28,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-26 20:40:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-26 20:40:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-26 20:40:28,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2019-11-26 20:40:28,188 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 38 [2019-11-26 20:40:28,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:28,188 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2019-11-26 20:40:28,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-26 20:40:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2019-11-26 20:40:28,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-26 20:40:28,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:28,190 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:28,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-26 20:40:28,402 INFO L410 AbstractCegarLoop]: === Iteration 11 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:28,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:28,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2061530616, now seen corresponding path program 2 times [2019-11-26 20:40:28,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:28,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841962716] [2019-11-26 20:40:28,404 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-26 20:40:28,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-26 20:40:28,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 20:40:28,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 20:40:28,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:28,559 INFO L377 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 [2019-11-26 20:40:28,560 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:40:28,568 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:40:28,569 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:40:28,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 20:40:28,801 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-26 20:40:28,801 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-26 20:40:29,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841962716] [2019-11-26 20:40:29,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:29,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-26 20:40:29,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157222170] [2019-11-26 20:40:29,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 20:40:29,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:29,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 20:40:29,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-26 20:40:29,640 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 23 states. [2019-11-26 20:40:32,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:32,207 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-11-26 20:40:32,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 20:40:32,208 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-26 20:40:32,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:32,209 INFO L225 Difference]: With dead ends: 129 [2019-11-26 20:40:32,209 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 20:40:32,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-26 20:40:32,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 20:40:32,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-11-26 20:40:32,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-26 20:40:32,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2019-11-26 20:40:32,215 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 46 [2019-11-26 20:40:32,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:32,215 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2019-11-26 20:40:32,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 20:40:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2019-11-26 20:40:32,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 20:40:32,217 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:32,217 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:32,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-26 20:40:32,421 INFO L410 AbstractCegarLoop]: === Iteration 12 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:32,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731192, now seen corresponding path program 1 times [2019-11-26 20:40:32,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:32,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036555137] [2019-11-26 20:40:32,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-26 20:40:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:32,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 20:40:32,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:32,831 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:32,831 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:32,944 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-26 20:40:33,921 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:40:33,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036555137] [2019-11-26 20:40:33,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:40:33,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-26 20:40:33,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11621945] [2019-11-26 20:40:33,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-26 20:40:33,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:33,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-26 20:40:33,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2019-11-26 20:40:33,925 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 34 states. [2019-11-26 20:40:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:37,943 INFO L93 Difference]: Finished difference Result 147 states and 165 transitions. [2019-11-26 20:40:37,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-26 20:40:37,944 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-26 20:40:37,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:37,946 INFO L225 Difference]: With dead ends: 147 [2019-11-26 20:40:37,946 INFO L226 Difference]: Without dead ends: 143 [2019-11-26 20:40:37,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=736, Invalid=1426, Unknown=0, NotChecked=0, Total=2162 [2019-11-26 20:40:37,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-26 20:40:37,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-11-26 20:40:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-26 20:40:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 149 transitions. [2019-11-26 20:40:37,953 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 149 transitions. Word has length 51 [2019-11-26 20:40:37,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:37,953 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 149 transitions. [2019-11-26 20:40:37,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-26 20:40:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 149 transitions. [2019-11-26 20:40:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-26 20:40:37,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:37,955 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:38,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-26 20:40:38,168 INFO L410 AbstractCegarLoop]: === Iteration 13 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:38,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:38,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1576372504, now seen corresponding path program 2 times [2019-11-26 20:40:38,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:38,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698640711] [2019-11-26 20:40:38,169 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-26 20:40:38,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-26 20:40:38,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 20:40:38,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 20:40:38,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:38,322 INFO L377 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 [2019-11-26 20:40:38,322 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:40:38,325 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:40:38,325 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:40:38,325 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 20:40:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:38,514 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:38,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698640711] [2019-11-26 20:40:38,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:38,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-26 20:40:38,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702541000] [2019-11-26 20:40:38,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 20:40:38,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:38,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 20:40:38,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 20:40:38,583 INFO L87 Difference]: Start difference. First operand 143 states and 149 transitions. Second operand 12 states. [2019-11-26 20:40:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:39,441 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2019-11-26 20:40:39,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 20:40:39,441 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-11-26 20:40:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:39,442 INFO L225 Difference]: With dead ends: 165 [2019-11-26 20:40:39,443 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 20:40:39,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 114 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-26 20:40:39,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 20:40:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 141. [2019-11-26 20:40:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-26 20:40:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 147 transitions. [2019-11-26 20:40:39,453 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 147 transitions. Word has length 65 [2019-11-26 20:40:39,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:39,454 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 147 transitions. [2019-11-26 20:40:39,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 20:40:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 147 transitions. [2019-11-26 20:40:39,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-26 20:40:39,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:39,455 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:39,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-26 20:40:39,656 INFO L410 AbstractCegarLoop]: === Iteration 14 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:39,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:39,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1576372505, now seen corresponding path program 1 times [2019-11-26 20:40:39,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:39,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112189080] [2019-11-26 20:40:39,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-26 20:40:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:39,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 20:40:39,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:39,907 INFO L377 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 [2019-11-26 20:40:39,907 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:40:39,912 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:40:39,912 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:40:39,913 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 20:40:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:40,155 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:41,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112189080] [2019-11-26 20:40:41,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:41,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-26 20:40:41,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107964561] [2019-11-26 20:40:41,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 20:40:41,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:41,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 20:40:41,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-26 20:40:41,027 INFO L87 Difference]: Start difference. First operand 141 states and 147 transitions. Second operand 23 states. [2019-11-26 20:40:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:43,420 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-11-26 20:40:43,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 20:40:43,420 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 65 [2019-11-26 20:40:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:43,422 INFO L225 Difference]: With dead ends: 139 [2019-11-26 20:40:43,422 INFO L226 Difference]: Without dead ends: 139 [2019-11-26 20:40:43,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-26 20:40:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-26 20:40:43,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-11-26 20:40:43,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-26 20:40:43,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 145 transitions. [2019-11-26 20:40:43,428 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 145 transitions. Word has length 65 [2019-11-26 20:40:43,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:43,428 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 145 transitions. [2019-11-26 20:40:43,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 20:40:43,429 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 145 transitions. [2019-11-26 20:40:43,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-26 20:40:43,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:43,430 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:43,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-26 20:40:43,643 INFO L410 AbstractCegarLoop]: === Iteration 15 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:43,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:43,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2045209795, now seen corresponding path program 1 times [2019-11-26 20:40:43,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:43,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523049646] [2019-11-26 20:40:43,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-26 20:40:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:43,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 20:40:43,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:43,895 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:43,895 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:44,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523049646] [2019-11-26 20:40:44,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:44,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-26 20:40:44,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868119885] [2019-11-26 20:40:44,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 20:40:44,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:44,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 20:40:44,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-26 20:40:44,036 INFO L87 Difference]: Start difference. First operand 139 states and 145 transitions. Second operand 8 states. [2019-11-26 20:40:44,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:44,087 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2019-11-26 20:40:44,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 20:40:44,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-11-26 20:40:44,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:44,093 INFO L225 Difference]: With dead ends: 141 [2019-11-26 20:40:44,094 INFO L226 Difference]: Without dead ends: 139 [2019-11-26 20:40:44,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-26 20:40:44,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-26 20:40:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-11-26 20:40:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-26 20:40:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 144 transitions. [2019-11-26 20:40:44,099 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 144 transitions. Word has length 70 [2019-11-26 20:40:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:44,099 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 144 transitions. [2019-11-26 20:40:44,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 20:40:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 144 transitions. [2019-11-26 20:40:44,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-26 20:40:44,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:44,101 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:44,308 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-26 20:40:44,309 INFO L410 AbstractCegarLoop]: === Iteration 16 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:44,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:44,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1679548014, now seen corresponding path program 1 times [2019-11-26 20:40:44,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:44,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124807755] [2019-11-26 20:40:44,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-26 20:40:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:44,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 20:40:44,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:44,635 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:44,635 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:44,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:40:44,924 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:44,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124807755] [2019-11-26 20:40:44,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:44,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-26 20:40:44,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693593242] [2019-11-26 20:40:44,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 20:40:44,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:44,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 20:40:44,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:40:44,927 INFO L87 Difference]: Start difference. First operand 139 states and 144 transitions. Second operand 11 states. [2019-11-26 20:40:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:45,054 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2019-11-26 20:40:45,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 20:40:45,054 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 75 [2019-11-26 20:40:45,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:45,056 INFO L225 Difference]: With dead ends: 143 [2019-11-26 20:40:45,056 INFO L226 Difference]: Without dead ends: 139 [2019-11-26 20:40:45,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-26 20:40:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-26 20:40:45,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-11-26 20:40:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-26 20:40:45,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2019-11-26 20:40:45,065 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 75 [2019-11-26 20:40:45,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:45,065 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2019-11-26 20:40:45,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 20:40:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2019-11-26 20:40:45,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-26 20:40:45,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:45,067 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:45,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-26 20:40:45,283 INFO L410 AbstractCegarLoop]: === Iteration 17 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:45,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1133243519, now seen corresponding path program 1 times [2019-11-26 20:40:45,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:45,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736761498] [2019-11-26 20:40:45,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-26 20:40:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:45,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-26 20:40:45,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:45,573 INFO L377 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 [2019-11-26 20:40:45,573 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:40:45,575 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:40:45,575 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:40:45,576 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 20:40:45,788 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:45,788 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:45,981 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:45,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736761498] [2019-11-26 20:40:45,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:45,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-26 20:40:45,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106392942] [2019-11-26 20:40:45,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-26 20:40:45,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:45,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-26 20:40:45,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-26 20:40:45,984 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 17 states. [2019-11-26 20:40:47,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:47,427 INFO L93 Difference]: Finished difference Result 190 states and 210 transitions. [2019-11-26 20:40:47,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-26 20:40:47,427 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 86 [2019-11-26 20:40:47,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:47,429 INFO L225 Difference]: With dead ends: 190 [2019-11-26 20:40:47,429 INFO L226 Difference]: Without dead ends: 190 [2019-11-26 20:40:47,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 151 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-26 20:40:47,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-26 20:40:47,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 166. [2019-11-26 20:40:47,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-26 20:40:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 178 transitions. [2019-11-26 20:40:47,438 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 178 transitions. Word has length 86 [2019-11-26 20:40:47,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:47,439 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 178 transitions. [2019-11-26 20:40:47,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-26 20:40:47,439 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2019-11-26 20:40:47,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-26 20:40:47,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:47,440 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:47,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-26 20:40:47,649 INFO L410 AbstractCegarLoop]: === Iteration 18 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:47,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:47,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1133243518, now seen corresponding path program 1 times [2019-11-26 20:40:47,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:47,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253442828] [2019-11-26 20:40:47,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-26 20:40:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:47,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-26 20:40:47,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:47,924 INFO L377 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 [2019-11-26 20:40:47,925 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:40:47,929 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:40:47,929 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:40:47,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 20:40:48,487 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:48,488 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:50,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253442828] [2019-11-26 20:40:50,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:50,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-26 20:40:50,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380072907] [2019-11-26 20:40:50,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-26 20:40:50,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:50,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-26 20:40:50,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-26 20:40:50,128 INFO L87 Difference]: Start difference. First operand 166 states and 178 transitions. Second operand 33 states. [2019-11-26 20:40:53,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:53,683 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2019-11-26 20:40:53,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 20:40:53,683 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 86 [2019-11-26 20:40:53,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:53,684 INFO L225 Difference]: With dead ends: 164 [2019-11-26 20:40:53,685 INFO L226 Difference]: Without dead ends: 164 [2019-11-26 20:40:53,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 136 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-26 20:40:53,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-26 20:40:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-26 20:40:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-26 20:40:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2019-11-26 20:40:53,692 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 86 [2019-11-26 20:40:53,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:53,692 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2019-11-26 20:40:53,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-26 20:40:53,693 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2019-11-26 20:40:53,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-26 20:40:53,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:53,694 INFO L410 BasicCegarLoop]: trace histogram [28, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:53,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-26 20:40:53,897 INFO L410 AbstractCegarLoop]: === Iteration 19 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:53,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:53,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1389139913, now seen corresponding path program 1 times [2019-11-26 20:40:53,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:53,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352349275] [2019-11-26 20:40:53,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-26 20:40:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:54,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 20:40:54,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:54,223 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2019-11-26 20:40:54,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352349275] [2019-11-26 20:40:54,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-26 20:40:54,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 11 [2019-11-26 20:40:54,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153698952] [2019-11-26 20:40:54,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 20:40:54,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:54,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 20:40:54,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-26 20:40:54,495 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 10 states. [2019-11-26 20:40:54,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:54,604 INFO L93 Difference]: Finished difference Result 165 states and 171 transitions. [2019-11-26 20:40:54,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 20:40:54,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 89 [2019-11-26 20:40:54,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:54,606 INFO L225 Difference]: With dead ends: 165 [2019-11-26 20:40:54,606 INFO L226 Difference]: Without dead ends: 161 [2019-11-26 20:40:54,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-26 20:40:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-26 20:40:54,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-11-26 20:40:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-11-26 20:40:54,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 167 transitions. [2019-11-26 20:40:54,612 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 167 transitions. Word has length 89 [2019-11-26 20:40:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:54,613 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 167 transitions. [2019-11-26 20:40:54,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 20:40:54,613 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 167 transitions. [2019-11-26 20:40:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-26 20:40:54,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:54,614 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:54,821 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-26 20:40:54,822 INFO L410 AbstractCegarLoop]: === Iteration 20 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:54,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:54,822 INFO L82 PathProgramCache]: Analyzing trace with hash 58682880, now seen corresponding path program 1 times [2019-11-26 20:40:54,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:54,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [223272075] [2019-11-26 20:40:54,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-26 20:40:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:55,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-26 20:40:55,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:55,134 INFO L377 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 [2019-11-26 20:40:55,134 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:40:55,136 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:40:55,136 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:40:55,136 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 20:40:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:55,518 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:40:55,734 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:55,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [223272075] [2019-11-26 20:40:55,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:40:55,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 20 [2019-11-26 20:40:55,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014390740] [2019-11-26 20:40:55,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-26 20:40:55,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:40:55,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-26 20:40:55,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-26 20:40:55,737 INFO L87 Difference]: Start difference. First operand 161 states and 167 transitions. Second operand 21 states. [2019-11-26 20:40:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:40:57,428 INFO L93 Difference]: Finished difference Result 192 states and 208 transitions. [2019-11-26 20:40:57,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-26 20:40:57,429 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 99 [2019-11-26 20:40:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:40:57,430 INFO L225 Difference]: With dead ends: 192 [2019-11-26 20:40:57,430 INFO L226 Difference]: Without dead ends: 192 [2019-11-26 20:40:57,431 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 169 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-11-26 20:40:57,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-26 20:40:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 167. [2019-11-26 20:40:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-26 20:40:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 177 transitions. [2019-11-26 20:40:57,445 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 177 transitions. Word has length 99 [2019-11-26 20:40:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:40:57,447 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 177 transitions. [2019-11-26 20:40:57,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-26 20:40:57,447 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 177 transitions. [2019-11-26 20:40:57,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-26 20:40:57,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:40:57,448 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:40:57,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-26 20:40:57,662 INFO L410 AbstractCegarLoop]: === Iteration 21 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:40:57,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:40:57,662 INFO L82 PathProgramCache]: Analyzing trace with hash 58682881, now seen corresponding path program 1 times [2019-11-26 20:40:57,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:40:57,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668886255] [2019-11-26 20:40:57,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-26 20:40:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:40:57,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-26 20:40:57,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:40:57,989 INFO L377 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 [2019-11-26 20:40:57,990 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:40:57,995 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:40:57,996 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:40:57,996 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 20:40:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:40:58,610 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:41:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:41:00,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668886255] [2019-11-26 20:41:00,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:41:00,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 20] imperfect sequences [] total 40 [2019-11-26 20:41:00,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130646450] [2019-11-26 20:41:00,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-26 20:41:00,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:41:00,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-26 20:41:00,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-11-26 20:41:00,928 INFO L87 Difference]: Start difference. First operand 167 states and 177 transitions. Second operand 41 states. [2019-11-26 20:41:05,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:41:05,961 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2019-11-26 20:41:05,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 20:41:05,962 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 99 [2019-11-26 20:41:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:41:05,963 INFO L225 Difference]: With dead ends: 165 [2019-11-26 20:41:05,964 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 20:41:05,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 152 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-11-26 20:41:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 20:41:05,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-11-26 20:41:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-26 20:41:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 174 transitions. [2019-11-26 20:41:05,970 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 174 transitions. Word has length 99 [2019-11-26 20:41:05,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:41:05,971 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 174 transitions. [2019-11-26 20:41:05,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-26 20:41:05,971 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 174 transitions. [2019-11-26 20:41:05,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-26 20:41:05,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:41:05,972 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:41:06,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-26 20:41:06,185 INFO L410 AbstractCegarLoop]: === Iteration 22 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:41:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:41:06,185 INFO L82 PathProgramCache]: Analyzing trace with hash 170255789, now seen corresponding path program 1 times [2019-11-26 20:41:06,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:41:06,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110504173] [2019-11-26 20:41:06,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-11-26 20:41:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:41:06,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 20:41:06,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:41:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:41:07,584 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:41:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-26 20:41:08,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110504173] [2019-11-26 20:41:08,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 20:41:08,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 19] imperfect sequences [] total 39 [2019-11-26 20:41:08,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634306265] [2019-11-26 20:41:08,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-26 20:41:08,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:41:08,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-26 20:41:08,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2019-11-26 20:41:08,505 INFO L87 Difference]: Start difference. First operand 165 states and 174 transitions. Second operand 40 states. [2019-11-26 20:41:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:41:10,493 INFO L93 Difference]: Finished difference Result 164 states and 173 transitions. [2019-11-26 20:41:10,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 20:41:10,500 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 102 [2019-11-26 20:41:10,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:41:10,501 INFO L225 Difference]: With dead ends: 164 [2019-11-26 20:41:10,501 INFO L226 Difference]: Without dead ends: 164 [2019-11-26 20:41:10,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 160 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2019-11-26 20:41:10,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-26 20:41:10,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-26 20:41:10,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-26 20:41:10,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2019-11-26 20:41:10,508 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 102 [2019-11-26 20:41:10,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:41:10,509 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2019-11-26 20:41:10,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-26 20:41:10,509 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2019-11-26 20:41:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-26 20:41:10,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 20:41:10,510 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 20:41:10,722 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-26 20:41:10,723 INFO L410 AbstractCegarLoop]: === Iteration 23 === [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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 20:41:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 20:41:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash -265833724, now seen corresponding path program 1 times [2019-11-26 20:41:10,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 20:41:10,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701823378] [2019-11-26 20:41:10,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-11-26 20:41:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 20:41:11,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-26 20:41:11,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 20:41:11,600 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 14 treesize of output 10 [2019-11-26 20:41:11,600 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:41:11,608 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:41:11,608 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:41:11,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-26 20:41:11,684 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:41:11,685 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 54 [2019-11-26 20:41:11,685 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:41:11,720 INFO L588 ElimStorePlain]: treesize reduction 29, result has 48.2 percent of original size [2019-11-26 20:41:11,721 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:41:11,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-26 20:41:24,231 WARN L192 SmtUtils]: Spent 12.42 s on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-11-26 20:41:24,232 INFO L343 Elim1Store]: treesize reduction 32, result has 66.0 percent of original size [2019-11-26 20:41:24,233 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 81 [2019-11-26 20:41:24,233 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:41:24,296 INFO L588 ElimStorePlain]: treesize reduction 50, result has 41.9 percent of original size [2019-11-26 20:41:24,297 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:41:24,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-26 20:41:24,458 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-26 20:41:24,459 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 50 [2019-11-26 20:41:24,459 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 20:41:24,480 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:41:24,481 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:41:24,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-26 20:41:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:41:25,512 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 20:41:26,514 WARN L192 SmtUtils]: Spent 969.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-26 20:41:28,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:28,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:31,705 WARN L192 SmtUtils]: Spent 831.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-26 20:41:31,820 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:41:31,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:41:31,973 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-26 20:41:31,974 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-26 20:41:31,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 85 [2019-11-26 20:41:31,983 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-26 20:41:31,983 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 21 [2019-11-26 20:41:31,984 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:41:31,985 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:41:31,985 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:41:31,986 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 20:41:31,986 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:41:31,986 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-26 20:41:34,150 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 20:41:34,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 20:41:34,588 WARN L192 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-26 20:41:34,589 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-26 20:41:34,589 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 197 [2019-11-26 20:41:34,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,856 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-26 20:41:34,857 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-26 20:41:34,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 193 treesize of output 229 [2019-11-26 20:41:34,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 20:41:34,864 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 20:41:35,042 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-11-26 20:41:35,043 INFO L588 ElimStorePlain]: treesize reduction 206, result has 35.0 percent of original size [2019-11-26 20:41:35,044 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:41:35,090 INFO L588 ElimStorePlain]: treesize reduction 83, result has 27.8 percent of original size [2019-11-26 20:41:35,091 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 20:41:35,091 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:32 [2019-11-26 20:41:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 20:41:38,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701823378] [2019-11-26 20:41:38,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 20:41:38,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 79 [2019-11-26 20:41:38,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123135508] [2019-11-26 20:41:38,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-11-26 20:41:38,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 20:41:38,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-11-26 20:41:38,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=5859, Unknown=0, NotChecked=0, Total=6162 [2019-11-26 20:41:38,336 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 79 states. [2019-11-26 20:41:50,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 20:41:50,676 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-11-26 20:41:50,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-26 20:41:50,677 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 105 [2019-11-26 20:41:50,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 20:41:50,678 INFO L225 Difference]: With dead ends: 72 [2019-11-26 20:41:50,678 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 20:41:50,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=354, Invalid=6786, Unknown=0, NotChecked=0, Total=7140 [2019-11-26 20:41:50,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 20:41:50,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 20:41:50,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 20:41:50,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 20:41:50,681 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2019-11-26 20:41:50,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 20:41:50,681 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 20:41:50,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-11-26 20:41:50,682 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 20:41:50,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 20:41:50,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-26 20:41:50,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 08:41:50 BoogieIcfgContainer [2019-11-26 20:41:50,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 20:41:50,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 20:41:50,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 20:41:50,890 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 20:41:50,890 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 08:40:18" (3/4) ... [2019-11-26 20:41:50,893 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 20:41:50,900 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-26 20:41:50,900 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 20:41:50,901 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-26 20:41:50,901 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-26 20:41:50,901 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-26 20:41:50,901 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-26 20:41:50,901 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-26 20:41:50,901 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-26 20:41:50,901 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-26 20:41:50,902 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-26 20:41:50,902 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-26 20:41:50,902 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-26 20:41:50,902 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-26 20:41:50,902 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-26 20:41:50,902 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-26 20:41:50,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-26 20:41:50,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-26 20:41:50,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-26 20:41:50,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-26 20:41:50,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-26 20:41:50,903 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-26 20:41:50,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-26 20:41:50,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-26 20:41:50,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-26 20:41:50,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-26 20:41:50,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-26 20:41:50,904 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-26 20:41:50,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-26 20:41:50,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-26 20:41:50,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-26 20:41:50,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-26 20:41:50,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-26 20:41:50,905 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-26 20:41:50,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-26 20:41:50,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-26 20:41:50,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-26 20:41:50,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-26 20:41:50,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-26 20:41:50,906 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-26 20:41:50,907 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-26 20:41:50,907 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-26 20:41:50,907 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-26 20:41:50,907 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-26 20:41:50,907 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-26 20:41:50,907 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-26 20:41:50,908 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-26 20:41:50,915 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2019-11-26 20:41:50,916 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-26 20:41:50,916 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 20:41:50,917 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 20:41:50,917 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 20:41:50,971 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-26 20:41:50,972 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 20:41:50,973 INFO L168 Benchmark]: Toolchain (without parser) took 95006.68 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 489.2 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -292.9 MB). Peak memory consumption was 196.3 MB. Max. memory is 11.5 GB. [2019-11-26 20:41:50,974 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 20:41:50,974 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 951.0 MB in the beginning and 1.0 GB in the end (delta: -81.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-26 20:41:50,974 INFO L168 Benchmark]: Boogie Preprocessor took 109.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-26 20:41:50,975 INFO L168 Benchmark]: RCFGBuilder took 1620.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 915.8 MB in the end (delta: 109.8 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. [2019-11-26 20:41:50,975 INFO L168 Benchmark]: TraceAbstraction took 92344.50 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 410.0 MB). Free memory was 915.8 MB in the beginning and 1.2 GB in the end (delta: -328.3 MB). Peak memory consumption was 81.7 MB. Max. memory is 11.5 GB. [2019-11-26 20:41:50,976 INFO L168 Benchmark]: Witness Printer took 82.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 239.4 kB). Peak memory consumption was 239.4 kB. Max. memory is 11.5 GB. [2019-11-26 20:41:50,978 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 844.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 79.2 MB). Free memory was 951.0 MB in the beginning and 1.0 GB in the end (delta: -81.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1620.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 915.8 MB in the end (delta: 109.8 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 92344.50 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 410.0 MB). Free memory was 915.8 MB in the beginning and 1.2 GB in the end (delta: -328.3 MB). Peak memory consumption was 81.7 MB. Max. memory is 11.5 GB. * Witness Printer took 82.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 239.4 kB). Peak memory consumption was 239.4 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 763]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 332 locations, 71 error locations. Result: SAFE, OverallTime: 92.2s, OverallIterations: 23, TraceHistogramMax: 28, AutomataDifference: 39.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2367 SDtfs, 1324 SDslu, 18762 SDs, 0 SdLazy, 12674 SolverSat, 478 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 28.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2703 GetRequests, 2183 SyntacticMatches, 48 SemanticMatches, 472 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2777 ImplicationChecksByTransitivity, 28.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 124 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 42.6s InterpolantComputationTime, 1321 NumberOfCodeBlocks, 1273 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2596 ConstructedInterpolants, 390 QuantifiedInterpolants, 875668 SizeOfPredicates, 140 NumberOfNonLiveVariables, 5827 ConjunctsInSsa, 404 ConjunctsInUnsatCore, 46 InterpolantComputations, 37 PerfectInterpolantSequences, 8385/9458 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...