./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c4d407f41629f864eb5689f703f67280cbb5237 ............................................................................................................................ 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_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c4d407f41629f864eb5689f703f67280cbb5237 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 21:23:10,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 21:23:10,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 21:23:10,704 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 21:23:10,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 21:23:10,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 21:23:10,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 21:23:10,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 21:23:10,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 21:23:10,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 21:23:10,713 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 21:23:10,714 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 21:23:10,714 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 21:23:10,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 21:23:10,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 21:23:10,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 21:23:10,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 21:23:10,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 21:23:10,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 21:23:10,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 21:23:10,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 21:23:10,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 21:23:10,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 21:23:10,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 21:23:10,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 21:23:10,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 21:23:10,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 21:23:10,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 21:23:10,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 21:23:10,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 21:23:10,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 21:23:10,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 21:23:10,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 21:23:10,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 21:23:10,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 21:23:10,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 21:23:10,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 21:23:10,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 21:23:10,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 21:23:10,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 21:23:10,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 21:23:10,741 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-26 21:23:10,756 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 21:23:10,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 21:23:10,757 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 21:23:10,757 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 21:23:10,758 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 21:23:10,758 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 21:23:10,758 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 21:23:10,758 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 21:23:10,758 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 21:23:10,759 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 21:23:10,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 21:23:10,759 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 21:23:10,759 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 21:23:10,759 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 21:23:10,760 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 21:23:10,760 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 21:23:10,760 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 21:23:10,760 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 21:23:10,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 21:23:10,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 21:23:10,761 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 21:23:10,761 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 21:23:10,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 21:23:10,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 21:23:10,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 21:23:10,762 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-26 21:23:10,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 21:23:10,763 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c4d407f41629f864eb5689f703f67280cbb5237 [2019-11-26 21:23:11,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 21:23:11,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 21:23:11,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 21:23:11,068 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 21:23:11,069 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 21:23:11,070 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-26 21:23:11,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285c35aae/1596cd9abbae4dcc85c1408a0b590c35/FLAG6cd902fad [2019-11-26 21:23:11,723 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 21:23:11,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-26 21:23:11,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285c35aae/1596cd9abbae4dcc85c1408a0b590c35/FLAG6cd902fad [2019-11-26 21:23:12,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/285c35aae/1596cd9abbae4dcc85c1408a0b590c35 [2019-11-26 21:23:12,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 21:23:12,009 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 21:23:12,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 21:23:12,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 21:23:12,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 21:23:12,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:23:12" (1/1) ... [2019-11-26 21:23:12,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a793136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:12, skipping insertion in model container [2019-11-26 21:23:12,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:23:12" (1/1) ... [2019-11-26 21:23:12,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 21:23:12,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:23:12,551 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:23:12,571 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 21:23:12,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5e83da1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:12, skipping insertion in model container [2019-11-26 21:23:12,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 21:23:12,572 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-26 21:23:12,574 INFO L168 Benchmark]: Toolchain (without parser) took 564.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-26 21:23:12,575 INFO L168 Benchmark]: CDTParser took 0.20 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 21:23:12,576 INFO L168 Benchmark]: CACSL2BoogieTranslator took 561.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-26 21:23:12,578 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.20 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 561.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 20.7 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 21:23:14,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 21:23:14,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 21:23:14,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 21:23:14,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 21:23:14,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 21:23:14,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 21:23:14,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 21:23:14,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 21:23:14,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 21:23:14,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 21:23:14,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 21:23:14,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 21:23:14,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 21:23:14,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 21:23:14,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 21:23:14,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 21:23:14,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 21:23:14,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 21:23:14,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 21:23:14,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 21:23:14,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 21:23:14,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 21:23:14,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 21:23:14,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 21:23:14,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 21:23:14,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 21:23:14,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 21:23:14,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 21:23:14,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 21:23:14,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 21:23:14,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 21:23:14,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 21:23:14,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 21:23:14,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 21:23:14,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 21:23:14,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 21:23:14,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 21:23:14,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 21:23:14,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 21:23:14,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 21:23:14,291 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-26 21:23:14,311 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 21:23:14,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 21:23:14,317 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 21:23:14,317 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 21:23:14,317 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 21:23:14,318 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 21:23:14,318 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 21:23:14,318 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 21:23:14,318 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 21:23:14,319 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 21:23:14,319 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 21:23:14,319 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 21:23:14,319 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 21:23:14,319 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 21:23:14,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 21:23:14,323 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 21:23:14,323 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 21:23:14,324 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 21:23:14,324 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 21:23:14,324 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 21:23:14,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 21:23:14,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 21:23:14,325 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 21:23:14,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 21:23:14,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 21:23:14,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 21:23:14,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 21:23:14,326 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-26 21:23:14,326 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 21:23:14,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 21:23:14,326 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c4d407f41629f864eb5689f703f67280cbb5237 [2019-11-26 21:23:14,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 21:23:14,648 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 21:23:14,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 21:23:14,658 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 21:23:14,659 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 21:23:14,660 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-26 21:23:14,741 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2204dea1c/c1489e66c7cb42309013288515751fb6/FLAG6c1a98e3e [2019-11-26 21:23:15,250 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 21:23:15,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-26 21:23:15,281 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2204dea1c/c1489e66c7cb42309013288515751fb6/FLAG6c1a98e3e [2019-11-26 21:23:15,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2204dea1c/c1489e66c7cb42309013288515751fb6 [2019-11-26 21:23:15,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 21:23:15,551 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 21:23:15,556 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 21:23:15,556 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 21:23:15,560 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 21:23:15,561 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:23:15" (1/1) ... [2019-11-26 21:23:15,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e3ff98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:15, skipping insertion in model container [2019-11-26 21:23:15,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:23:15" (1/1) ... [2019-11-26 21:23:15,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 21:23:15,645 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:23:16,164 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:23:16,195 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-26 21:23:16,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:23:16,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:23:16,271 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 21:23:16,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:23:16,406 INFO L208 MainTranslator]: Completed translation [2019-11-26 21:23:16,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:16 WrapperNode [2019-11-26 21:23:16,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 21:23:16,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 21:23:16,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 21:23:16,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 21:23:16,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:16" (1/1) ... [2019-11-26 21:23:16,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:16" (1/1) ... [2019-11-26 21:23:16,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:16" (1/1) ... [2019-11-26 21:23:16,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:16" (1/1) ... [2019-11-26 21:23:16,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:16" (1/1) ... [2019-11-26 21:23:16,495 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:16" (1/1) ... [2019-11-26 21:23:16,502 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:16" (1/1) ... [2019-11-26 21:23:16,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 21:23:16,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 21:23:16,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 21:23:16,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 21:23:16,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23: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 21:23:16,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-26 21:23:16,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 21:23:16,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-26 21:23:16,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 21:23:16,577 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-26 21:23:16,577 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-26 21:23:16,577 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-26 21:23:16,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-26 21:23:16,578 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-26 21:23:16,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-26 21:23:16,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-26 21:23:16,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-26 21:23:16,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-26 21:23:16,579 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-26 21:23:16,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-26 21:23:16,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-26 21:23:16,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-26 21:23:16,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-26 21:23:16,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-26 21:23:16,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-26 21:23:16,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-26 21:23:16,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-26 21:23:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-26 21:23:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-26 21:23:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-26 21:23:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-26 21:23:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-26 21:23:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-26 21:23:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-26 21:23:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-26 21:23:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-26 21:23:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-26 21:23:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-26 21:23:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-26 21:23:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-26 21:23:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-26 21:23:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-26 21:23:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-26 21:23:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-26 21:23:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-26 21:23:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-26 21:23:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-26 21:23:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-26 21:23:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-26 21:23:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-26 21:23:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-26 21:23:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-26 21:23:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-26 21:23:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-26 21:23:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-26 21:23:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-26 21:23:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-26 21:23:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-26 21:23:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-26 21:23:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-26 21:23:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-26 21:23:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-26 21:23:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-26 21:23:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-26 21:23:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-26 21:23:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-26 21:23:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-26 21:23:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-26 21:23:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-26 21:23:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-26 21:23:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-26 21:23:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-26 21:23:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-26 21:23:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-26 21:23:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-26 21:23:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-26 21:23:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-26 21:23:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-26 21:23:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-26 21:23:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-26 21:23:16,592 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-26 21:23:16,592 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-26 21:23:16,592 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-26 21:23:16,592 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-26 21:23:16,592 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-26 21:23:16,592 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-26 21:23:16,592 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-26 21:23:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-26 21:23:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-26 21:23:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-26 21:23:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-26 21:23:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-26 21:23:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-26 21:23:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-26 21:23:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-26 21:23:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-26 21:23:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-26 21:23:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-26 21:23:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-26 21:23:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-26 21:23:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-26 21:23:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-26 21:23:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-26 21:23:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-26 21:23:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-26 21:23:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-26 21:23:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-26 21:23:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-26 21:23:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-26 21:23:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-26 21:23:16,595 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-26 21:23:16,596 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-26 21:23:16,596 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-26 21:23:16,596 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-26 21:23:16,596 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-26 21:23:16,596 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-26 21:23:16,596 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-26 21:23:16,596 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-26 21:23:16,596 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-26 21:23:16,597 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-26 21:23:16,597 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-26 21:23:16,597 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-26 21:23:16,597 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-26 21:23:16,597 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-26 21:23:16,597 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-26 21:23:16,597 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-26 21:23:16,597 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-26 21:23:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-26 21:23:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-26 21:23:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-26 21:23:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-26 21:23:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-26 21:23:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-26 21:23:16,598 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-26 21:23:16,599 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-26 21:23:16,599 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-26 21:23:16,599 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-26 21:23:16,599 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-26 21:23:16,599 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-26 21:23:16,599 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-26 21:23:16,600 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-26 21:23:16,600 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-26 21:23:16,600 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-26 21:23:16,600 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-26 21:23:16,600 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-26 21:23:16,600 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-26 21:23:16,600 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-26 21:23:16,600 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-26 21:23:16,601 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-26 21:23:16,601 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-26 21:23:16,601 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-26 21:23:16,601 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-26 21:23:16,601 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-26 21:23:16,601 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-26 21:23:16,601 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-26 21:23:16,602 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-26 21:23:16,602 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-26 21:23:16,602 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-26 21:23:16,602 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-26 21:23:16,602 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-26 21:23:16,602 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-26 21:23:16,602 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-26 21:23:16,603 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-26 21:23:16,603 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-26 21:23:16,603 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-26 21:23:16,603 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-26 21:23:16,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 21:23:16,603 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-26 21:23:16,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-26 21:23:16,604 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-26 21:23:16,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 21:23:16,604 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-26 21:23:16,604 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-26 21:23:16,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-26 21:23:16,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 21:23:16,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-26 21:23:16,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-26 21:23:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-26 21:23:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-26 21:23:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-26 21:23:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-26 21:23:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 21:23:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-26 21:23:16,605 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-26 21:23:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-26 21:23:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-26 21:23:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-26 21:23:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 21:23:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 21:23:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-26 21:23:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-26 21:23:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-26 21:23:16,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-26 21:23:16,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-26 21:23:16,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-26 21:23:16,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-26 21:23:16,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-26 21:23:16,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-26 21:23:16,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-26 21:23:16,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-26 21:23:16,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-26 21:23:16,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-26 21:23:16,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-26 21:23:16,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-26 21:23:16,608 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-26 21:23:16,609 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-26 21:23:16,609 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-26 21:23:16,609 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-26 21:23:16,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-26 21:23:16,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 21:23:16,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 21:23:16,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 21:23:16,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 21:23:16,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-26 21:23:16,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-26 21:23:16,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-26 21:23:16,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-26 21:23:17,349 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 21:23:17,750 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 21:23:18,151 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 21:23:18,151 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-26 21:23:18,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:23:18 BoogieIcfgContainer [2019-11-26 21:23:18,153 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 21:23:18,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 21:23:18,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 21:23:18,160 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 21:23:18,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 09:23:15" (1/3) ... [2019-11-26 21:23:18,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be8bfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:23:18, skipping insertion in model container [2019-11-26 21:23:18,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:16" (2/3) ... [2019-11-26 21:23:18,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6be8bfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:23:18, skipping insertion in model container [2019-11-26 21:23:18,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:23:18" (3/3) ... [2019-11-26 21:23:18,165 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-1.i [2019-11-26 21:23:18,175 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 21:23:18,187 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-26 21:23:18,200 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-26 21:23:18,234 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 21:23:18,235 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 21:23:18,235 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 21:23:18,235 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 21:23:18,235 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 21:23:18,236 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 21:23:18,236 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 21:23:18,236 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 21:23:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2019-11-26 21:23:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 21:23:18,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:18,269 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 21:23:18,270 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 21:23:18,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:18,276 INFO L82 PathProgramCache]: Analyzing trace with hash -896940051, now seen corresponding path program 1 times [2019-11-26 21:23:18,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:18,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279823642] [2019-11-26 21:23:18,288 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 21:23:18,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:18,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 21:23:18,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:18,542 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 21:23:18,543 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:18,553 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:18,553 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:18,554 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:23:18,589 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 21:23:18,589 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:18,650 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 21:23:18,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279823642] [2019-11-26 21:23:18,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:18,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 21:23:18,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224829539] [2019-11-26 21:23:18,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:23:18,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:18,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:23:18,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:23:18,677 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 5 states. [2019-11-26 21:23:18,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:18,883 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2019-11-26 21:23:18,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:23:18,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-26 21:23:18,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:18,902 INFO L225 Difference]: With dead ends: 74 [2019-11-26 21:23:18,902 INFO L226 Difference]: Without dead ends: 71 [2019-11-26 21:23:18,904 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 21:23:18,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-26 21:23:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2019-11-26 21:23:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-26 21:23:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2019-11-26 21:23:18,958 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 17 [2019-11-26 21:23:18,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:18,959 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2019-11-26 21:23:18,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:23:18,959 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2019-11-26 21:23:18,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 21:23:18,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:18,960 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 21:23:19,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-26 21:23:19,182 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 21:23:19,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:19,182 INFO L82 PathProgramCache]: Analyzing trace with hash -896940050, now seen corresponding path program 1 times [2019-11-26 21:23:19,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:19,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274815765] [2019-11-26 21:23:19,184 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 21:23:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:19,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 21:23:19,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:19,384 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 21:23:19,385 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:19,397 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:19,397 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:19,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:23:19,460 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 21:23:19,461 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:19,822 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 21:23:19,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274815765] [2019-11-26 21:23:19,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:19,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-26 21:23:19,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201777383] [2019-11-26 21:23:19,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 21:23:19,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:19,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 21:23:19,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-26 21:23:19,827 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 10 states. [2019-11-26 21:23:20,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:20,364 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2019-11-26 21:23:20,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 21:23:20,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-26 21:23:20,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:20,367 INFO L225 Difference]: With dead ends: 70 [2019-11-26 21:23:20,367 INFO L226 Difference]: Without dead ends: 70 [2019-11-26 21:23:20,368 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 21:23:20,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-26 21:23:20,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-11-26 21:23:20,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-26 21:23:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2019-11-26 21:23:20,378 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 17 [2019-11-26 21:23:20,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:20,378 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2019-11-26 21:23:20,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 21:23:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2019-11-26 21:23:20,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 21:23:20,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:20,380 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 21:23:20,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-26 21:23:20,586 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 21:23:20,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:20,587 INFO L82 PathProgramCache]: Analyzing trace with hash -868310900, now seen corresponding path program 1 times [2019-11-26 21:23:20,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:20,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045867844] [2019-11-26 21:23:20,589 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 21:23:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:20,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 21:23:20,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:20,759 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 21:23:20,760 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:20,807 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 21:23:20,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045867844] [2019-11-26 21:23:20,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:20,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-26 21:23:20,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263344347] [2019-11-26 21:23:20,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:23:20,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:20,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:23:20,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:23:20,811 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 5 states. [2019-11-26 21:23:20,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:20,838 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-11-26 21:23:20,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:23:20,839 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-26 21:23:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:20,840 INFO L225 Difference]: With dead ends: 64 [2019-11-26 21:23:20,841 INFO L226 Difference]: Without dead ends: 64 [2019-11-26 21:23:20,844 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 21:23:20,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-26 21:23:20,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-26 21:23:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-26 21:23:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-26 21:23:20,855 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 17 [2019-11-26 21:23:20,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:20,855 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-26 21:23:20,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:23:20,856 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-26 21:23:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-26 21:23:20,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:20,857 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] [2019-11-26 21:23:21,074 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-26 21:23:21,076 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 21:23:21,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:21,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2008128002, now seen corresponding path program 1 times [2019-11-26 21:23:21,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:21,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522351214] [2019-11-26 21:23:21,078 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 21:23:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:21,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 21:23:21,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:21,244 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 21:23:21,245 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:21,376 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 21:23:21,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522351214] [2019-11-26 21:23:21,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:21,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-26 21:23:21,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473429905] [2019-11-26 21:23:21,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:23:21,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:21,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:23:21,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:23:21,380 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2019-11-26 21:23:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:21,407 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-26 21:23:21,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:23:21,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-26 21:23:21,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:21,411 INFO L225 Difference]: With dead ends: 64 [2019-11-26 21:23:21,411 INFO L226 Difference]: Without dead ends: 64 [2019-11-26 21:23:21,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:23:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-26 21:23:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-26 21:23:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-26 21:23:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-11-26 21:23:21,427 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 22 [2019-11-26 21:23:21,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:21,427 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-11-26 21:23:21,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:23:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-11-26 21:23:21,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-26 21:23:21,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:21,430 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] [2019-11-26 21:23:21,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-26 21:23:21,643 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 21:23:21,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:21,644 INFO L82 PathProgramCache]: Analyzing trace with hash 211176643, now seen corresponding path program 1 times [2019-11-26 21:23:21,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:21,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921886578] [2019-11-26 21:23:21,645 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 21:23:21,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:21,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 21:23:21,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:21,794 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 21:23:21,795 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:21,911 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 21:23:21,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921886578] [2019-11-26 21:23:21,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:21,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 21:23:21,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698808519] [2019-11-26 21:23:21,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 21:23:21,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:21,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 21:23:21,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 21:23:21,915 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 3 states. [2019-11-26 21:23:22,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:22,034 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-11-26 21:23:22,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 21:23:22,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-26 21:23:22,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:22,036 INFO L225 Difference]: With dead ends: 68 [2019-11-26 21:23:22,036 INFO L226 Difference]: Without dead ends: 58 [2019-11-26 21:23:22,037 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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 21:23:22,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-26 21:23:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-26 21:23:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-26 21:23:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-26 21:23:22,048 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 22 [2019-11-26 21:23:22,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:22,051 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-26 21:23:22,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 21:23:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-26 21:23:22,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 21:23:22,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:22,053 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 21:23:22,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-26 21:23:22,270 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 21:23:22,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:22,270 INFO L82 PathProgramCache]: Analyzing trace with hash -45428445, now seen corresponding path program 1 times [2019-11-26 21:23:22,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:22,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203491047] [2019-11-26 21:23:22,271 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 21:23:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:22,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 21:23:22,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:22,428 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 21:23:22,428 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:22,486 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 21:23:22,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203491047] [2019-11-26 21:23:22,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:22,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-26 21:23:22,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181753223] [2019-11-26 21:23:22,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 21:23:22,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:22,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 21:23:22,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 21:23:22,489 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 6 states. [2019-11-26 21:23:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:22,544 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-11-26 21:23:22,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 21:23:22,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-26 21:23:22,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:22,549 INFO L225 Difference]: With dead ends: 64 [2019-11-26 21:23:22,549 INFO L226 Difference]: Without dead ends: 60 [2019-11-26 21:23:22,551 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 21:23:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-26 21:23:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-26 21:23:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-26 21:23:22,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-26 21:23:22,559 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 32 [2019-11-26 21:23:22,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:22,559 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-26 21:23:22,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 21:23:22,560 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-26 21:23:22,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-26 21:23:22,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:22,561 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 21:23:22,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-26 21:23:22,776 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 21:23:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:22,776 INFO L82 PathProgramCache]: Analyzing trace with hash -792080061, now seen corresponding path program 1 times [2019-11-26 21:23:22,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:22,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306743697] [2019-11-26 21:23:22,777 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 21:23:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:22,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 21:23:22,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:22,965 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 21:23:22,965 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:23,105 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 21:23:23,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306743697] [2019-11-26 21:23:23,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:23:23,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-26 21:23:23,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863544990] [2019-11-26 21:23:23,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 21:23:23,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:23,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 21:23:23,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-26 21:23:23,108 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2019-11-26 21:23:23,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:23,344 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-26 21:23:23,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 21:23:23,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-26 21:23:23,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:23,346 INFO L225 Difference]: With dead ends: 68 [2019-11-26 21:23:23,346 INFO L226 Difference]: Without dead ends: 64 [2019-11-26 21:23:23,346 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 21:23:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-26 21:23:23,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-26 21:23:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-26 21:23:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-11-26 21:23:23,351 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 34 [2019-11-26 21:23:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:23,352 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-11-26 21:23:23,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 21:23:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-11-26 21:23:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 21:23:23,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:23,354 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 21:23:23,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-26 21:23:23,565 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 21:23:23,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:23,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1102366333, now seen corresponding path program 2 times [2019-11-26 21:23:23,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:23,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282967525] [2019-11-26 21:23:23,566 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 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 21:23:23,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-26 21:23:23,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:23:23,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 21:23:23,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:23,740 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 21:23:23,741 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:23,743 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:23,744 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:23,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:23:23,901 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 21:23:23,901 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:24,038 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 21:23:24,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282967525] [2019-11-26 21:23:24,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:24,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-26 21:23:24,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065146167] [2019-11-26 21:23:24,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 21:23:24,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:24,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 21:23:24,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:23:24,040 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 12 states. [2019-11-26 21:23:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:24,587 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-26 21:23:24,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 21:23:24,587 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-26 21:23:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:24,588 INFO L225 Difference]: With dead ends: 63 [2019-11-26 21:23:24,589 INFO L226 Difference]: Without dead ends: 63 [2019-11-26 21:23:24,589 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 21:23:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-26 21:23:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-26 21:23:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-26 21:23:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-26 21:23:24,595 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 38 [2019-11-26 21:23:24,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:24,595 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-26 21:23:24,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 21:23:24,595 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-26 21:23:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 21:23:24,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:24,596 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 21:23:24,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-26 21:23:24,802 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 21:23:24,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:24,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1102366332, now seen corresponding path program 1 times [2019-11-26 21:23:24,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:24,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431014877] [2019-11-26 21:23:24,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:23:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:24,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 21:23:24,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:25,049 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 21:23:25,049 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:25,370 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 21:23:25,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431014877] [2019-11-26 21:23:25,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:23:25,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-26 21:23:25,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607881853] [2019-11-26 21:23:25,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-26 21:23:25,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:25,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-26 21:23:25,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-26 21:23:25,372 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 18 states. [2019-11-26 21:23:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:26,340 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-11-26 21:23:26,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 21:23:26,343 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-26 21:23:26,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:26,344 INFO L225 Difference]: With dead ends: 75 [2019-11-26 21:23:26,344 INFO L226 Difference]: Without dead ends: 71 [2019-11-26 21:23:26,344 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 21:23:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-26 21:23:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-26 21:23:26,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-26 21:23:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-11-26 21:23:26,349 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 38 [2019-11-26 21:23:26,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:26,350 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-11-26 21:23:26,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-26 21:23:26,350 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-11-26 21:23:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-26 21:23:26,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:26,352 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 21:23:26,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-26 21:23:26,560 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 21:23:26,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:26,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2064886276, now seen corresponding path program 2 times [2019-11-26 21:23:26,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:26,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591002861] [2019-11-26 21:23:26,564 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 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 21:23:26,704 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-26 21:23:26,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:23:26,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 21:23:26,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:26,724 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 21:23:26,724 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:26,729 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:26,729 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:26,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:23:26,981 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 21:23:26,981 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:27,851 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 21:23:27,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591002861] [2019-11-26 21:23:27,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:27,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-26 21:23:27,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566125419] [2019-11-26 21:23:27,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 21:23:27,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:27,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 21:23:27,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-26 21:23:27,854 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 23 states. [2019-11-26 21:23:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:29,318 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-11-26 21:23:29,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 21:23:29,319 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-26 21:23:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:29,320 INFO L225 Difference]: With dead ends: 70 [2019-11-26 21:23:29,321 INFO L226 Difference]: Without dead ends: 70 [2019-11-26 21:23:29,322 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 21:23:29,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-26 21:23:29,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-26 21:23:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-26 21:23:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-11-26 21:23:29,327 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 46 [2019-11-26 21:23:29,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:29,327 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-11-26 21:23:29,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 21:23:29,328 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-11-26 21:23:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 21:23:29,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:29,330 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 21:23:29,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-26 21:23:29,537 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 21:23:29,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:29,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1743926468, now seen corresponding path program 1 times [2019-11-26 21:23:29,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:29,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103731415] [2019-11-26 21:23:29,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:23:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:29,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 21:23:29,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:29,979 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 21:23:29,980 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:30,112 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-26 21:23:30,936 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 21:23:30,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103731415] [2019-11-26 21:23:30,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:23:30,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-26 21:23:30,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403580482] [2019-11-26 21:23:30,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-26 21:23:30,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:30,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-26 21:23:30,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-26 21:23:30,940 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 34 states. [2019-11-26 21:23:31,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:31,646 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-11-26 21:23:31,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-26 21:23:31,647 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-26 21:23:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:31,649 INFO L225 Difference]: With dead ends: 76 [2019-11-26 21:23:31,649 INFO L226 Difference]: Without dead ends: 72 [2019-11-26 21:23:31,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-11-26 21:23:31,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-26 21:23:31,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-26 21:23:31,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-26 21:23:31,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-11-26 21:23:31,655 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 51 [2019-11-26 21:23:31,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:31,655 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-11-26 21:23:31,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-26 21:23:31,655 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-11-26 21:23:31,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 21:23:31,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:31,657 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:31,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-26 21:23:31,869 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 21:23:31,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:31,870 INFO L82 PathProgramCache]: Analyzing trace with hash 845780764, now seen corresponding path program 2 times [2019-11-26 21:23:31,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:31,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533869087] [2019-11-26 21:23:31,871 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 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 21:23:32,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-26 21:23:32,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:23:32,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 21:23:32,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:32,027 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 21:23:32,027 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:32,036 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:32,036 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:32,036 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:23:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:32,206 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:32,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533869087] [2019-11-26 21:23:32,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:32,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-26 21:23:32,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763773412] [2019-11-26 21:23:32,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 21:23:32,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:32,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 21:23:32,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:23:32,266 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 12 states. [2019-11-26 21:23:32,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:32,788 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-11-26 21:23:32,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 21:23:32,789 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-26 21:23:32,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:32,790 INFO L225 Difference]: With dead ends: 70 [2019-11-26 21:23:32,790 INFO L226 Difference]: Without dead ends: 70 [2019-11-26 21:23:32,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-26 21:23:32,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-26 21:23:32,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-26 21:23:32,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-26 21:23:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-11-26 21:23:32,794 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 53 [2019-11-26 21:23:32,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:32,795 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-11-26 21:23:32,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 21:23:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-11-26 21:23:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 21:23:32,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:32,797 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:33,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-26 21:23:33,006 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 21:23:33,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:33,007 INFO L82 PathProgramCache]: Analyzing trace with hash 845780765, now seen corresponding path program 1 times [2019-11-26 21:23:33,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:33,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315349773] [2019-11-26 21:23:33,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 21:23:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:33,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 21:23:33,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:33,220 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 21:23:33,221 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:33,227 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:33,228 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:33,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:23:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:33,449 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:34,234 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:34,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315349773] [2019-11-26 21:23:34,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:34,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-26 21:23:34,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744661261] [2019-11-26 21:23:34,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 21:23:34,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:34,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 21:23:34,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-26 21:23:34,236 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 23 states. [2019-11-26 21:23:35,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:35,477 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-11-26 21:23:35,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 21:23:35,477 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-26 21:23:35,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:35,478 INFO L225 Difference]: With dead ends: 68 [2019-11-26 21:23:35,478 INFO L226 Difference]: Without dead ends: 68 [2019-11-26 21:23:35,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-26 21:23:35,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-26 21:23:35,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-26 21:23:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-26 21:23:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-11-26 21:23:35,484 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 53 [2019-11-26 21:23:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:35,484 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-11-26 21:23:35,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 21:23:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-11-26 21:23:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 21:23:35,486 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:35,486 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:35,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-26 21:23:35,697 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 21:23:35,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1516815243, now seen corresponding path program 1 times [2019-11-26 21:23:35,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:35,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880167470] [2019-11-26 21:23:35,701 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 21:23:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:35,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 21:23:35,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:35,922 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:36,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880167470] [2019-11-26 21:23:36,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:36,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-26 21:23:36,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108894218] [2019-11-26 21:23:36,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 21:23:36,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:36,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 21:23:36,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-26 21:23:36,120 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 8 states. [2019-11-26 21:23:36,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:36,218 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-11-26 21:23:36,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 21:23:36,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-26 21:23:36,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:36,220 INFO L225 Difference]: With dead ends: 70 [2019-11-26 21:23:36,220 INFO L226 Difference]: Without dead ends: 68 [2019-11-26 21:23:36,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 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 21:23:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-26 21:23:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-26 21:23:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-26 21:23:36,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-11-26 21:23:36,225 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 51 [2019-11-26 21:23:36,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:36,225 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-11-26 21:23:36,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 21:23:36,226 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-11-26 21:23:36,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-26 21:23:36,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:36,227 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:36,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-26 21:23:36,438 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 21:23:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:36,439 INFO L82 PathProgramCache]: Analyzing trace with hash 240473020, now seen corresponding path program 1 times [2019-11-26 21:23:36,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:36,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234372311] [2019-11-26 21:23:36,439 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 21:23:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:36,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 21:23:36,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:36,662 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:36,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:37,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234372311] [2019-11-26 21:23:37,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:37,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-26 21:23:37,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389262544] [2019-11-26 21:23:37,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 21:23:37,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:37,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 21:23:37,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:23:37,009 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 11 states. [2019-11-26 21:23:37,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:37,111 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-11-26 21:23:37,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:23:37,111 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-11-26 21:23:37,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:37,112 INFO L225 Difference]: With dead ends: 72 [2019-11-26 21:23:37,113 INFO L226 Difference]: Without dead ends: 68 [2019-11-26 21:23:37,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-26 21:23:37,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-26 21:23:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-26 21:23:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-26 21:23:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-11-26 21:23:37,117 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 56 [2019-11-26 21:23:37,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:37,118 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-11-26 21:23:37,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 21:23:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-11-26 21:23:37,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 21:23:37,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:37,119 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:37,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-26 21:23:37,323 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 21:23:37,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:37,324 INFO L82 PathProgramCache]: Analyzing trace with hash 214334517, now seen corresponding path program 1 times [2019-11-26 21:23:37,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:37,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700989839] [2019-11-26 21:23:37,325 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 21:23:37,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:37,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-26 21:23:37,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:37,712 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 21:23:37,712 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:37,721 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:37,721 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:37,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-26 21:23:37,787 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:37,787 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 21:23:37,788 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:37,822 INFO L588 ElimStorePlain]: treesize reduction 29, result has 48.2 percent of original size [2019-11-26 21:23:37,822 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:37,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-26 21:23:37,938 INFO L343 Elim1Store]: treesize reduction 66, result has 22.4 percent of original size [2019-11-26 21:23:37,939 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 35 treesize of output 37 [2019-11-26 21:23:37,939 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:37,957 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:37,957 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:37,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-26 21:23:38,127 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-26 21:23:38,128 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 21:23:38,129 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:38,149 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:38,149 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:38,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-26 21:23:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:38,876 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:39,269 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-26 21:23:40,024 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-26 21:23:41,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:41,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:43,998 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-26 21:23:44,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:23:44,065 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 21:23:44,206 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-26 21:23:44,206 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-26 21:23:44,207 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 21:23:44,220 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-26 21:23:44,220 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 53 treesize of output 23 [2019-11-26 21:23:44,221 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:44,221 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:44,222 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:44,222 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:44,222 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 21:23:44,222 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-26 21:23:45,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:23:45,880 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 21:23:46,303 WARN L192 SmtUtils]: Spent 420.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-26 21:23:46,305 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-26 21:23:46,305 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 21:23:46,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,606 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-26 21:23:46,606 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-26 21:23:46,607 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 21:23:46,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:46,618 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:46,790 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-11-26 21:23:46,791 INFO L588 ElimStorePlain]: treesize reduction 193, result has 34.8 percent of original size [2019-11-26 21:23:46,792 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:46,855 INFO L588 ElimStorePlain]: treesize reduction 70, result has 34.6 percent of original size [2019-11-26 21:23:46,855 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:46,856 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:37 [2019-11-26 21:23:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:48,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700989839] [2019-11-26 21:23:48,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:23:48,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2019-11-26 21:23:48,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274009579] [2019-11-26 21:23:48,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-26 21:23:48,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:48,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-26 21:23:48,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2019-11-26 21:23:48,314 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 55 states. [2019-11-26 21:23:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:53,690 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-26 21:23:53,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-26 21:23:53,691 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 67 [2019-11-26 21:23:53,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:53,691 INFO L225 Difference]: With dead ends: 60 [2019-11-26 21:23:53,691 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 21:23:53,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2019-11-26 21:23:53,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 21:23:53,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 21:23:53,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 21:23:53,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 21:23:53,693 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2019-11-26 21:23:53,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:53,693 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 21:23:53,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-26 21:23:53,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 21:23:53,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 21:23:53,894 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-26 21:23:53,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 09:23:53 BoogieIcfgContainer [2019-11-26 21:23:53,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 21:23:53,903 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 21:23:53,903 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 21:23:53,903 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 21:23:53,906 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:23:18" (3/4) ... [2019-11-26 21:23:53,910 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 21:23:53,916 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-26 21:23:53,916 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 21:23:53,916 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-26 21:23:53,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-26 21:23:53,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-26 21:23:53,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-26 21:23:53,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-26 21:23:53,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-26 21:23:53,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-26 21:23:53,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-26 21:23:53,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-26 21:23:53,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-26 21:23:53,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-26 21:23:53,917 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-26 21:23:53,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-26 21:23:53,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-26 21:23:53,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-26 21:23:53,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-26 21:23:53,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-26 21:23:53,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-26 21:23:53,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-26 21:23:53,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-26 21:23:53,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-26 21:23:53,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-26 21:23:53,918 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-26 21:23:53,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-26 21:23:53,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-26 21:23:53,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-26 21:23:53,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-26 21:23:53,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-26 21:23:53,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-26 21:23:53,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-26 21:23:53,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-26 21:23:53,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-26 21:23:53,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-26 21:23:53,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-26 21:23:53,919 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-26 21:23:53,920 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-26 21:23:53,920 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-26 21:23:53,920 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-26 21:23:53,920 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-26 21:23:53,920 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-26 21:23:53,920 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-26 21:23:53,920 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-26 21:23:53,920 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-26 21:23:53,921 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-26 21:23:53,928 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2019-11-26 21:23:53,928 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-26 21:23:53,929 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 21:23:53,929 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 21:23:53,929 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 21:23:53,974 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-26 21:23:53,974 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 21:23:53,976 INFO L168 Benchmark]: Toolchain (without parser) took 38425.23 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 445.6 MB). Free memory was 960.4 MB in the beginning and 1.3 GB in the end (delta: -383.0 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2019-11-26 21:23:53,976 INFO L168 Benchmark]: CDTParser took 0.62 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 21:23:53,976 INFO L168 Benchmark]: CACSL2BoogieTranslator took 850.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-11-26 21:23:53,977 INFO L168 Benchmark]: Boogie Preprocessor took 106.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-26 21:23:53,977 INFO L168 Benchmark]: RCFGBuilder took 1639.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 989.5 MB in the end (delta: 110.2 MB). Peak memory consumption was 110.2 MB. Max. memory is 11.5 GB. [2019-11-26 21:23:53,978 INFO L168 Benchmark]: TraceAbstraction took 35747.54 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.7 MB). Free memory was 989.5 MB in the beginning and 1.3 GB in the end (delta: -354.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:23:53,978 INFO L168 Benchmark]: Witness Printer took 71.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 725.2 kB). Peak memory consumption was 725.2 kB. Max. memory is 11.5 GB. [2019-11-26 21:23:53,980 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.62 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 850.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1639.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 989.5 MB in the end (delta: 110.2 MB). Peak memory consumption was 110.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35747.54 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 295.7 MB). Free memory was 989.5 MB in the beginning and 1.3 GB in the end (delta: -354.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 71.65 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 725.2 kB). Peak memory consumption was 725.2 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: 761]: 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, 330 locations, 71 error locations. Result: SAFE, OverallTime: 35.6s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 792 SDtfs, 441 SDslu, 5182 SDs, 0 SdLazy, 3843 SolverSat, 219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1248 GetRequests, 985 SyntacticMatches, 19 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.1s InterpolantComputationTime, 614 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1196 ConstructedInterpolants, 80 QuantifiedInterpolants, 271329 SizeOfPredicates, 60 NumberOfNonLiveVariables, 2597 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 1340/1870 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...