./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7c71bc25 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_test17_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 902bca7b1502ca5dcb44bb7e7d9bc6d169c57d43 ............................................................................................................................ 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_test17_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 902bca7b1502ca5dcb44bb7e7d9bc6d169c57d43 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- This is Ultimate 0.1.24-7c71bc2 [2019-11-25 13:52:32,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:52:32,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:52:32,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:52:32,355 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:52:32,356 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:52:32,358 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:52:32,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:52:32,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:52:32,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:52:32,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:52:32,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:52:32,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:52:32,366 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:52:32,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:52:32,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:52:32,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:52:32,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:52:32,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:52:32,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:52:32,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:52:32,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:52:32,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:52:32,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:52:32,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:52:32,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:52:32,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:52:32,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:52:32,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:52:32,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:52:32,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:52:32,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:52:32,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:52:32,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:52:32,399 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:52:32,399 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:52:32,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:52:32,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:52:32,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:52:32,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:52:32,402 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:52:32,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-25 13:52:32,433 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:52:32,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:52:32,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:52:32,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:52:32,439 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:52:32,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:52:32,439 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 13:52:32,440 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:52:32,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:52:32,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 13:52:32,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:52:32,442 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:52:32,442 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:52:32,443 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:52:32,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:52:32,443 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:52:32,443 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 13:52:32,444 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:52:32,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:52:32,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:52:32,445 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:52:32,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:52:32,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:52:32,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:52:32,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:52:32,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 13:52:32,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 13:52:32,447 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 -> 902bca7b1502ca5dcb44bb7e7d9bc6d169c57d43 [2019-11-25 13:52:32,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:52:32,756 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:52:32,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:52:32,761 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:52:32,761 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:52:32,762 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2019-11-25 13:52:32,838 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/517eaabe7/f0910c8928d84c8eb26861c13d85e516/FLAG442b1dec3 [2019-11-25 13:52:33,443 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:52:33,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2019-11-25 13:52:33,459 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/517eaabe7/f0910c8928d84c8eb26861c13d85e516/FLAG442b1dec3 [2019-11-25 13:52:33,699 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/517eaabe7/f0910c8928d84c8eb26861c13d85e516 [2019-11-25 13:52:33,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:52:33,704 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:52:33,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:52:33,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:52:33,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:52:33,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:52:33" (1/1) ... [2019-11-25 13:52:33,713 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cff6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:33, skipping insertion in model container [2019-11-25 13:52:33,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:52:33" (1/1) ... [2019-11-25 13:52:33,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:52:33,772 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:52:34,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:52:34,360 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-25 13:52:34,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5fbdf5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:34, skipping insertion in model container [2019-11-25 13:52:34,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:52:34,362 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-25 13:52:34,365 INFO L168 Benchmark]: Toolchain (without parser) took 659.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-25 13:52:34,367 INFO L168 Benchmark]: CDTParser took 0.28 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-25 13:52:34,369 INFO L168 Benchmark]: CACSL2BoogieTranslator took 656.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 953.6 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 13:52:34,373 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.28 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 656.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 953.6 MB in the beginning and 1.1 GB in the end (delta: -146.9 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: 577]: 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-7c71bc2 [2019-11-25 13:52:36,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:52:36,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:52:36,109 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:52:36,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:52:36,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:52:36,112 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:52:36,114 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:52:36,116 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:52:36,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:52:36,118 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:52:36,119 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:52:36,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:52:36,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:52:36,122 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:52:36,123 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:52:36,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:52:36,125 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:52:36,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:52:36,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:52:36,131 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:52:36,133 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:52:36,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:52:36,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:52:36,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:52:36,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:52:36,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:52:36,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:52:36,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:52:36,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:52:36,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:52:36,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:52:36,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:52:36,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:52:36,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:52:36,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:52:36,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:52:36,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:52:36,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:52:36,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:52:36,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:52:36,150 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-25 13:52:36,166 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:52:36,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:52:36,168 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:52:36,168 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:52:36,168 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:52:36,169 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:52:36,169 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 13:52:36,169 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:52:36,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:52:36,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 13:52:36,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:52:36,171 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:52:36,171 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:52:36,171 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:52:36,171 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:52:36,172 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:52:36,172 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 13:52:36,172 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 13:52:36,172 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 13:52:36,173 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:52:36,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:52:36,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:52:36,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:52:36,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:52:36,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:52:36,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:52:36,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:52:36,175 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 13:52:36,176 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 13:52:36,176 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 13:52:36,176 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 -> 902bca7b1502ca5dcb44bb7e7d9bc6d169c57d43 [2019-11-25 13:52:36,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:52:36,537 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:52:36,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:52:36,541 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:52:36,541 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:52:36,542 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2019-11-25 13:52:36,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d667075c2/fa8c9fd45a684cfa89a9393e862942d8/FLAGe31f2fbeb [2019-11-25 13:52:37,185 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:52:37,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2019-11-25 13:52:37,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d667075c2/fa8c9fd45a684cfa89a9393e862942d8/FLAGe31f2fbeb [2019-11-25 13:52:37,453 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d667075c2/fa8c9fd45a684cfa89a9393e862942d8 [2019-11-25 13:52:37,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:52:37,458 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:52:37,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:52:37,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:52:37,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:52:37,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:52:37" (1/1) ... [2019-11-25 13:52:37,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7109c780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:37, skipping insertion in model container [2019-11-25 13:52:37,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:52:37" (1/1) ... [2019-11-25 13:52:37,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:52:37,548 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:52:38,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:52:38,186 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-25 13:52:38,206 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:52:38,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:52:38,321 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 13:52:38,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:52:38,509 INFO L208 MainTranslator]: Completed translation [2019-11-25 13:52:38,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:38 WrapperNode [2019-11-25 13:52:38,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:52:38,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 13:52:38,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 13:52:38,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 13:52:38,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:38" (1/1) ... [2019-11-25 13:52:38,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:38" (1/1) ... [2019-11-25 13:52:38,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:38" (1/1) ... [2019-11-25 13:52:38,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:38" (1/1) ... [2019-11-25 13:52:38,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:38" (1/1) ... [2019-11-25 13:52:38,601 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:38" (1/1) ... [2019-11-25 13:52:38,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:38" (1/1) ... [2019-11-25 13:52:38,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 13:52:38,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 13:52:38,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 13:52:38,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 13:52:38,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:38" (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-25 13:52:38,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 13:52:38,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 13:52:38,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:52:38,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:52:38,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 13:52:38,693 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 13:52:38,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-25 13:52:38,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-25 13:52:38,694 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-25 13:52:38,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-25 13:52:38,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-25 13:52:38,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-25 13:52:38,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-25 13:52:38,696 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-25 13:52:38,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-25 13:52:38,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-25 13:52:38,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-25 13:52:38,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-25 13:52:38,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-25 13:52:38,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-25 13:52:38,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-25 13:52:38,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-25 13:52:38,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-25 13:52:38,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-25 13:52:38,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-25 13:52:38,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-25 13:52:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-25 13:52:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-25 13:52:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-25 13:52:38,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-25 13:52:38,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-25 13:52:38,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-25 13:52:38,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-25 13:52:38,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-25 13:52:38,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-25 13:52:38,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-25 13:52:38,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-25 13:52:38,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-25 13:52:38,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-25 13:52:38,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-25 13:52:38,702 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-25 13:52:38,702 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-25 13:52:38,702 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_17 [2019-11-25 13:52:38,702 INFO L138 BoogieDeclarations]: Found implementation of procedure free_17 [2019-11-25 13:52:38,702 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-25 13:52:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 13:52:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-25 13:52:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 13:52:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-25 13:52:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 13:52:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 13:52:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 13:52:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 13:52:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 13:52:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 13:52:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 13:52:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 13:52:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 13:52:38,705 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 13:52:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 13:52:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 13:52:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 13:52:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 13:52:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 13:52:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 13:52:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 13:52:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 13:52:38,707 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-25 13:52:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-25 13:52:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-25 13:52:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 13:52:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 13:52:38,708 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 13:52:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 13:52:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 13:52:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 13:52:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 13:52:38,709 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 13:52:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 13:52:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 13:52:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 13:52:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 13:52:38,710 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 13:52:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 13:52:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 13:52:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 13:52:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 13:52:38,711 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 13:52:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 13:52:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 13:52:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 13:52:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 13:52:38,712 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 13:52:38,713 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 13:52:38,713 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 13:52:38,713 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 13:52:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 13:52:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 13:52:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 13:52:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 13:52:38,714 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 13:52:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 13:52:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 13:52:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 13:52:38,715 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 13:52:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 13:52:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 13:52:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 13:52:38,716 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 13:52:38,717 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 13:52:38,717 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 13:52:38,717 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 13:52:38,717 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 13:52:38,718 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 13:52:38,718 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 13:52:38,718 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 13:52:38,719 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 13:52:38,719 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 13:52:38,719 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 13:52:38,719 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 13:52:38,720 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 13:52:38,720 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 13:52:38,720 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 13:52:38,720 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 13:52:38,720 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 13:52:38,721 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 13:52:38,722 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 13:52:38,725 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 13:52:38,726 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 13:52:38,726 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 13:52:38,726 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 13:52:38,726 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 13:52:38,727 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 13:52:38,728 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 13:52:38,728 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 13:52:38,728 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 13:52:38,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 13:52:38,728 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 13:52:38,729 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 13:52:38,737 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 13:52:38,738 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 13:52:38,738 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 13:52:38,738 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 13:52:38,738 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 13:52:38,738 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 13:52:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 13:52:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 13:52:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 13:52:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 13:52:38,739 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 13:52:38,740 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 13:52:38,740 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 13:52:38,740 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 13:52:38,740 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 13:52:38,740 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 13:52:38,741 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 13:52:38,741 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-25 13:52:38,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 13:52:38,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-25 13:52:38,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-25 13:52:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-25 13:52:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-25 13:52:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-25 13:52:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-25 13:52:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 13:52:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-25 13:52:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 13:52:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-25 13:52:38,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 13:52:38,744 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-25 13:52:38,744 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-25 13:52:38,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-25 13:52:38,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 13:52:38,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-25 13:52:38,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-25 13:52:38,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-25 13:52:38,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-25 13:52:38,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-25 13:52:38,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-25 13:52:38,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 13:52:38,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-25 13:52:38,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-25 13:52:38,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-25 13:52:38,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-25 13:52:38,747 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-25 13:52:38,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 13:52:38,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 13:52:38,748 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-25 13:52:38,748 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-25 13:52:38,748 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:52:38,748 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-25 13:52:38,748 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-25 13:52:38,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-25 13:52:38,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-25 13:52:38,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-25 13:52:38,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-25 13:52:38,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-25 13:52:38,749 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-25 13:52:38,750 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-25 13:52:38,750 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-25 13:52:38,750 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-25 13:52:38,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-25 13:52:38,750 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-25 13:52:38,751 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-25 13:52:38,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-25 13:52:38,752 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_17 [2019-11-25 13:52:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure free_17 [2019-11-25 13:52:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-25 13:52:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 13:52:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 13:52:38,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 13:52:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 13:52:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 13:52:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:52:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-25 13:52:38,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-25 13:52:38,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-25 13:52:38,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-25 13:52:39,428 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 13:52:39,845 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 13:52:40,357 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 13:52:40,358 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-25 13:52:40,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:52:40 BoogieIcfgContainer [2019-11-25 13:52:40,359 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 13:52:40,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 13:52:40,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 13:52:40,364 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 13:52:40,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 01:52:37" (1/3) ... [2019-11-25 13:52:40,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3724c66b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:52:40, skipping insertion in model container [2019-11-25 13:52:40,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:38" (2/3) ... [2019-11-25 13:52:40,366 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3724c66b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:52:40, skipping insertion in model container [2019-11-25 13:52:40,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:52:40" (3/3) ... [2019-11-25 13:52:40,369 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2-2.i [2019-11-25 13:52:40,379 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 13:52:40,388 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 90 error locations. [2019-11-25 13:52:40,400 INFO L249 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2019-11-25 13:52:40,421 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 13:52:40,422 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 13:52:40,422 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 13:52:40,422 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 13:52:40,422 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 13:52:40,422 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 13:52:40,423 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 13:52:40,423 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 13:52:40,444 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-11-25 13:52:40,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 13:52:40,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:40,456 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-25 13:52:40,458 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:40,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:40,464 INFO L82 PathProgramCache]: Analyzing trace with hash 78607545, now seen corresponding path program 1 times [2019-11-25 13:52:40,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:40,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943092037] [2019-11-25 13:52:40,475 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-25 13:52:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:40,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:52:40,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:40,759 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-25 13:52:40,759 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:52:40,770 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:52:40,770 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:52:40,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:52:40,801 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-25 13:52:40,801 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:40,867 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-25 13:52:40,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943092037] [2019-11-25 13:52:40,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:40,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 13:52:40,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89865090] [2019-11-25 13:52:40,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:52:40,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:40,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:52:40,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:52:40,896 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 5 states. [2019-11-25 13:52:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:41,164 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2019-11-25 13:52:41,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:52:41,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-25 13:52:41,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:41,186 INFO L225 Difference]: With dead ends: 93 [2019-11-25 13:52:41,187 INFO L226 Difference]: Without dead ends: 90 [2019-11-25 13:52:41,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:52:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-25 13:52:41,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2019-11-25 13:52:41,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-25 13:52:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2019-11-25 13:52:41,300 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 22 [2019-11-25 13:52:41,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:41,301 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2019-11-25 13:52:41,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:52:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2019-11-25 13:52:41,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 13:52:41,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:41,306 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-25 13:52:41,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 13:52:41,527 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:41,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:41,532 INFO L82 PathProgramCache]: Analyzing trace with hash 78607546, now seen corresponding path program 1 times [2019-11-25 13:52:41,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:41,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [385401879] [2019-11-25 13:52:41,534 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-25 13:52:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:41,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-25 13:52:41,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:41,779 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-25 13:52:41,779 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:52:41,789 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:52:41,790 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:52:41,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:52:41,996 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-25 13:52:41,996 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:42,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:52:43,309 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-25 13:52:43,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [385401879] [2019-11-25 13:52:43,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:43,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 17 [2019-11-25 13:52:43,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145436605] [2019-11-25 13:52:43,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 13:52:43,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:43,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 13:52:43,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-11-25 13:52:43,314 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 18 states. [2019-11-25 13:52:44,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:44,897 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2019-11-25 13:52:44,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 13:52:44,898 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-11-25 13:52:44,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:44,900 INFO L225 Difference]: With dead ends: 98 [2019-11-25 13:52:44,900 INFO L226 Difference]: Without dead ends: 98 [2019-11-25 13:52:44,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2019-11-25 13:52:44,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-25 13:52:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2019-11-25 13:52:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-25 13:52:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-11-25 13:52:44,911 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 22 [2019-11-25 13:52:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:44,912 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-11-25 13:52:44,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 13:52:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-11-25 13:52:44,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 13:52:44,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:44,913 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-25 13:52:45,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 13:52:45,114 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:45,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:45,115 INFO L82 PathProgramCache]: Analyzing trace with hash 966111226, now seen corresponding path program 1 times [2019-11-25 13:52:45,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:45,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865583132] [2019-11-25 13:52:45,116 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-25 13:52:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:45,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 13:52:45,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:45,266 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-25 13:52:45,267 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:45,309 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-25 13:52:45,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865583132] [2019-11-25 13:52:45,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:45,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 13:52:45,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805122145] [2019-11-25 13:52:45,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:52:45,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:45,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:52:45,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:52:45,311 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 5 states. [2019-11-25 13:52:45,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:45,371 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2019-11-25 13:52:45,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:52:45,374 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-25 13:52:45,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:45,375 INFO L225 Difference]: With dead ends: 90 [2019-11-25 13:52:45,376 INFO L226 Difference]: Without dead ends: 90 [2019-11-25 13:52:45,376 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-25 13:52:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-25 13:52:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-11-25 13:52:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-25 13:52:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2019-11-25 13:52:45,385 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 22 [2019-11-25 13:52:45,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:45,386 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2019-11-25 13:52:45,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:52:45,386 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2019-11-25 13:52:45,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 13:52:45,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:45,387 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] [2019-11-25 13:52:45,599 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 13:52:45,600 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:45,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:45,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1857306545, now seen corresponding path program 1 times [2019-11-25 13:52:45,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:45,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1572303739] [2019-11-25 13:52:45,603 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-25 13:52:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:45,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:52:45,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:45,737 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-25 13:52:45,738 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:45,817 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-25 13:52:45,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1572303739] [2019-11-25 13:52:45,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:45,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 13:52:45,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954938603] [2019-11-25 13:52:45,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:52:45,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:45,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:52:45,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:52:45,819 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 5 states. [2019-11-25 13:52:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:45,865 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2019-11-25 13:52:45,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:52:45,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-25 13:52:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:45,867 INFO L225 Difference]: With dead ends: 90 [2019-11-25 13:52:45,867 INFO L226 Difference]: Without dead ends: 90 [2019-11-25 13:52:45,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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-25 13:52:45,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-25 13:52:45,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-11-25 13:52:45,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-25 13:52:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-11-25 13:52:45,876 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 23 [2019-11-25 13:52:45,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:45,877 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-11-25 13:52:45,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:52:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-11-25 13:52:45,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 13:52:45,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:45,878 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] [2019-11-25 13:52:46,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 13:52:46,081 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:46,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:46,082 INFO L82 PathProgramCache]: Analyzing trace with hash -114496210, now seen corresponding path program 1 times [2019-11-25 13:52:46,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:46,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774536200] [2019-11-25 13:52:46,083 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-25 13:52:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:46,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 13:52:46,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:46,241 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-25 13:52:46,241 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:46,293 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-25 13:52:46,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774536200] [2019-11-25 13:52:46,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:46,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 13:52:46,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555037212] [2019-11-25 13:52:46,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 13:52:46,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:46,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 13:52:46,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 13:52:46,295 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 3 states. [2019-11-25 13:52:46,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:46,434 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2019-11-25 13:52:46,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 13:52:46,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-25 13:52:46,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:46,436 INFO L225 Difference]: With dead ends: 126 [2019-11-25 13:52:46,436 INFO L226 Difference]: Without dead ends: 121 [2019-11-25 13:52:46,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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-25 13:52:46,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-25 13:52:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2019-11-25 13:52:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-25 13:52:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2019-11-25 13:52:46,445 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 23 [2019-11-25 13:52:46,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:46,446 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2019-11-25 13:52:46,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 13:52:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2019-11-25 13:52:46,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 13:52:46,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:46,447 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:52:46,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 13:52:46,655 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:46,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:46,656 INFO L82 PathProgramCache]: Analyzing trace with hash -121920454, now seen corresponding path program 1 times [2019-11-25 13:52:46,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:46,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992076244] [2019-11-25 13:52:46,657 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-25 13:52:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:46,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-25 13:52:46,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:46,851 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-25 13:52:46,851 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:52:46,857 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:52:46,858 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:52:46,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:52:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:47,232 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:48,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-25 13:52:48,887 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-25 13:52:49,311 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:49,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992076244] [2019-11-25 13:52:49,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:52:49,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2019-11-25 13:52:49,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154846410] [2019-11-25 13:52:49,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-25 13:52:49,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:49,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-25 13:52:49,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-11-25 13:52:49,314 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 24 states. [2019-11-25 13:52:51,024 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-25 13:52:51,364 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 28 [2019-11-25 13:52:51,769 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-25 13:52:52,043 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-11-25 13:52:53,140 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-11-25 13:52:53,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:53,689 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2019-11-25 13:52:53,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-25 13:52:53,691 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2019-11-25 13:52:53,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:53,692 INFO L225 Difference]: With dead ends: 101 [2019-11-25 13:52:53,692 INFO L226 Difference]: Without dead ends: 101 [2019-11-25 13:52:53,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2019-11-25 13:52:53,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-25 13:52:53,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2019-11-25 13:52:53,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-25 13:52:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2019-11-25 13:52:53,704 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 28 [2019-11-25 13:52:53,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:53,704 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2019-11-25 13:52:53,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-25 13:52:53,705 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2019-11-25 13:52:53,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 13:52:53,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:53,706 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, 1, 1, 1] [2019-11-25 13:52:53,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 13:52:53,913 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:53,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:53,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1984551823, now seen corresponding path program 1 times [2019-11-25 13:52:53,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:53,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1075080259] [2019-11-25 13:52:53,915 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-25 13:52:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:54,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 13:52:54,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:54,057 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-25 13:52:54,058 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:52:54,061 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:52:54,061 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:52:54,061 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:52:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 13:52:54,133 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:54,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 13:52:54,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1075080259] [2019-11-25 13:52:54,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:54,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-25 13:52:54,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830906819] [2019-11-25 13:52:54,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 13:52:54,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:54,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 13:52:54,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-25 13:52:54,212 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 9 states. [2019-11-25 13:52:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:54,947 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2019-11-25 13:52:54,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 13:52:54,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-25 13:52:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:54,950 INFO L225 Difference]: With dead ends: 165 [2019-11-25 13:52:54,950 INFO L226 Difference]: Without dead ends: 165 [2019-11-25 13:52:54,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2019-11-25 13:52:54,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-25 13:52:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 115. [2019-11-25 13:52:54,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-25 13:52:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 134 transitions. [2019-11-25 13:52:54,978 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 134 transitions. Word has length 35 [2019-11-25 13:52:54,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:54,982 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 134 transitions. [2019-11-25 13:52:54,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 13:52:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2019-11-25 13:52:54,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 13:52:54,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:54,984 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, 1, 1, 1] [2019-11-25 13:52:55,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 13:52:55,185 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:55,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:55,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1984551822, now seen corresponding path program 1 times [2019-11-25 13:52:55,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:55,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379706430] [2019-11-25 13:52:55,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-25 13:52:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:55,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-25 13:52:55,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:55,359 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-25 13:52:55,359 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:52:55,364 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:52:55,364 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:52:55,364 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:52:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:55,663 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:55,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:52:56,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:56,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379706430] [2019-11-25 13:52:56,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 13:52:56,706 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2019-11-25 13:52:56,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782061904] [2019-11-25 13:52:56,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:52:56,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:56,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:52:56,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-11-25 13:52:56,708 INFO L87 Difference]: Start difference. First operand 115 states and 134 transitions. Second operand 10 states. [2019-11-25 13:53:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:02,592 INFO L93 Difference]: Finished difference Result 151 states and 177 transitions. [2019-11-25 13:53:02,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 13:53:02,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-11-25 13:53:02,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:02,595 INFO L225 Difference]: With dead ends: 151 [2019-11-25 13:53:02,595 INFO L226 Difference]: Without dead ends: 151 [2019-11-25 13:53:02,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2019-11-25 13:53:02,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-25 13:53:02,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 134. [2019-11-25 13:53:02,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-25 13:53:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 161 transitions. [2019-11-25 13:53:02,606 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 161 transitions. Word has length 35 [2019-11-25 13:53:02,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:02,607 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 161 transitions. [2019-11-25 13:53:02,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:53:02,607 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 161 transitions. [2019-11-25 13:53:02,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 13:53:02,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:02,609 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:02,812 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 13:53:02,813 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:02,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1643543858, now seen corresponding path program 1 times [2019-11-25 13:53:02,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:02,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559214238] [2019-11-25 13:53:02,815 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-25 13:53:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:02,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-25 13:53:02,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:02,979 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-25 13:53:02,980 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:02,983 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:02,983 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:02,983 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:53:03,077 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:03,078 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-25 13:53:03,079 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:03,109 INFO L588 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-25 13:53:03,110 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:53:03,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-25 13:53:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 13:53:03,140 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:07,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 13:53:07,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559214238] [2019-11-25 13:53:07,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:53:07,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-25 13:53:07,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198307170] [2019-11-25 13:53:07,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-25 13:53:07,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:07,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 13:53:07,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=229, Unknown=1, NotChecked=0, Total=272 [2019-11-25 13:53:07,609 INFO L87 Difference]: Start difference. First operand 134 states and 161 transitions. Second operand 17 states. [2019-11-25 13:53:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:11,444 INFO L93 Difference]: Finished difference Result 179 states and 212 transitions. [2019-11-25 13:53:11,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 13:53:11,445 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-11-25 13:53:11,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:11,447 INFO L225 Difference]: With dead ends: 179 [2019-11-25 13:53:11,447 INFO L226 Difference]: Without dead ends: 179 [2019-11-25 13:53:11,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=94, Invalid=457, Unknown=1, NotChecked=0, Total=552 [2019-11-25 13:53:11,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-25 13:53:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 143. [2019-11-25 13:53:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-25 13:53:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 177 transitions. [2019-11-25 13:53:11,455 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 177 transitions. Word has length 35 [2019-11-25 13:53:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:11,456 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 177 transitions. [2019-11-25 13:53:11,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-25 13:53:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions. [2019-11-25 13:53:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 13:53:11,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:11,458 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:11,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-25 13:53:11,666 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:11,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:11,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1643543857, now seen corresponding path program 1 times [2019-11-25 13:53:11,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:11,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839419917] [2019-11-25 13:53:11,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-25 13:53:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:11,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-25 13:53:11,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:11,873 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-25 13:53:11,873 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:11,882 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:11,893 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-25 13:53:11,893 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:11,900 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:11,901 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:11,901 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-25 13:53:14,318 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:14,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-25 13:53:14,319 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:14,365 INFO L588 ElimStorePlain]: treesize reduction 3, result has 91.2 percent of original size [2019-11-25 13:53:14,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-25 13:53:14,371 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:14,397 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:14,397 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:53:14,398 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:21 [2019-11-25 13:53:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:53:14,453 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:14,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:53:15,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:53:15,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:53:15,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:53:24,156 WARN L192 SmtUtils]: Spent 4.72 s on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-11-25 13:53:24,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:53:29,227 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_249|], 2=[|v_#length_204|]} [2019-11-25 13:53:29,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:53:29,262 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:29,262 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:29,263 INFO L476 ElimStorePlain]: Eliminatee |v_#length_204| vanished before elimination [2019-11-25 13:53:29,263 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:29,263 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:30, output treesize:1 [2019-11-25 13:53:29,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:53:29,888 INFO L404 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-25 13:53:29,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-25 13:53:29,896 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:29,918 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:29,923 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 13:53:29,924 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:29,943 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:29,944 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:53:29,944 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:34, output treesize:17 [2019-11-25 13:53:30,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:53:30,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839419917] [2019-11-25 13:53:30,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:53:30,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 29 [2019-11-25 13:53:30,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164550502] [2019-11-25 13:53:30,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-25 13:53:30,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:30,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-25 13:53:30,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=770, Unknown=2, NotChecked=0, Total=870 [2019-11-25 13:53:30,149 INFO L87 Difference]: Start difference. First operand 143 states and 177 transitions. Second operand 30 states. [2019-11-25 13:54:02,623 WARN L192 SmtUtils]: Spent 10.50 s on a formula simplification that was a NOOP. DAG size: 54 [2019-11-25 13:54:12,634 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-25 13:54:15,806 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-25 13:54:20,974 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-25 13:54:24,623 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 16 [2019-11-25 13:54:39,798 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul c_alloc_17_~i~0 (_ bv4 32)))) (let ((.cse0 (bvadd .cse4 c_alloc_17_~array.offset (_ bv4 32)))) (let ((.cse3 (bvule (bvadd .cse4 c_alloc_17_~array.offset) .cse0))) (and (bvule .cse0 (select |c_#length| c_alloc_17_~array.base)) (forall ((v_alloc_17_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_4 (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_41| (_ BitVec 32))) (let ((.cse1 (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse2 (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (exists ((v_ldv_malloc_~size_45 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_40| (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_40| v_ldv_malloc_~size_45) v_alloc_17_~array.base_BEFORE_CALL_4))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_40|) (_ bv0 1)))) (not (bvule (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2) .cse2)) (bvule .cse2 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_41| ldv_malloc_~size) v_alloc_17_~array.base_BEFORE_CALL_4)) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_41|))))))) .cse3 (forall ((v_ldv_malloc_~size_45 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_40| (_ BitVec 32))) (or (bvule (bvadd (bvmul c_alloc_17_~i~0 (_ bv4 32)) c_alloc_17_~array.offset (_ bv4 32)) (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_40| v_ldv_malloc_~size_45) c_alloc_17_~array.base)) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_40|) (_ bv0 1))))) (or .cse3 (forall ((|v_ldv_malloc_#t~malloc12.base_40| (_ BitVec 32))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_40|) (_ bv0 1))))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))))))) is different from false [2019-11-25 13:54:44,934 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-11-25 13:54:57,905 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-25 13:54:59,391 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-25 13:55:25,189 WARN L192 SmtUtils]: Spent 22.52 s on a formula simplification that was a NOOP. DAG size: 111 [2019-11-25 13:55:41,493 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-25 13:55:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:55:46,811 INFO L93 Difference]: Finished difference Result 328 states and 407 transitions. [2019-11-25 13:55:46,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-25 13:55:46,812 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 35 [2019-11-25 13:55:46,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:55:46,815 INFO L225 Difference]: With dead ends: 328 [2019-11-25 13:55:46,815 INFO L226 Difference]: Without dead ends: 328 [2019-11-25 13:55:46,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 84.8s TimeCoverageRelationStatistics Valid=282, Invalid=2266, Unknown=6, NotChecked=98, Total=2652 [2019-11-25 13:55:46,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-11-25 13:55:46,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 210. [2019-11-25 13:55:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-25 13:55:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 286 transitions. [2019-11-25 13:55:46,830 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 286 transitions. Word has length 35 [2019-11-25 13:55:46,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:55:46,830 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 286 transitions. [2019-11-25 13:55:46,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-25 13:55:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 286 transitions. [2019-11-25 13:55:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 13:55:46,832 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:55:46,832 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, 1, 1, 1, 1] [2019-11-25 13:55:47,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-25 13:55:47,037 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:55:47,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:55:47,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1391563981, now seen corresponding path program 1 times [2019-11-25 13:55:47,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:55:47,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574281056] [2019-11-25 13:55:47,039 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-25 13:55:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:55:47,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 13:55:47,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:55:47,214 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 11 treesize of output 7 [2019-11-25 13:55:47,214 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:55:47,218 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:47,219 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:47,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-25 13:55:47,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-25 13:55:47,264 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:55:47,266 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:47,266 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:47,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-25 13:55:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:55:47,279 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:55:47,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-25 13:55:47,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-25 13:55:47,398 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:55:47,400 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:47,401 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:47,403 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:47,404 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:55:47,404 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:7 [2019-11-25 13:55:47,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:55:47,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574281056] [2019-11-25 13:55:47,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:55:47,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-25 13:55:47,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94270133] [2019-11-25 13:55:47,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 13:55:47,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:55:47,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 13:55:47,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:55:47,432 INFO L87 Difference]: Start difference. First operand 210 states and 286 transitions. Second operand 11 states. [2019-11-25 13:55:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:55:48,559 INFO L93 Difference]: Finished difference Result 309 states and 409 transitions. [2019-11-25 13:55:48,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 13:55:48,561 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-25 13:55:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:55:48,563 INFO L225 Difference]: With dead ends: 309 [2019-11-25 13:55:48,563 INFO L226 Difference]: Without dead ends: 309 [2019-11-25 13:55:48,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-11-25 13:55:48,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-25 13:55:48,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 242. [2019-11-25 13:55:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-25 13:55:48,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 332 transitions. [2019-11-25 13:55:48,575 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 332 transitions. Word has length 36 [2019-11-25 13:55:48,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:55:48,576 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 332 transitions. [2019-11-25 13:55:48,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 13:55:48,576 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 332 transitions. [2019-11-25 13:55:48,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 13:55:48,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:55:48,577 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, 1, 1, 1, 1, 1] [2019-11-25 13:55:48,798 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-25 13:55:48,799 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:55:48,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:55:48,800 INFO L82 PathProgramCache]: Analyzing trace with hash -188809999, now seen corresponding path program 1 times [2019-11-25 13:55:48,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:55:48,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816406818] [2019-11-25 13:55:48,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-25 13:55:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:55:48,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 13:55:48,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:55:48,964 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 11 treesize of output 7 [2019-11-25 13:55:48,965 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:55:48,969 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:48,970 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:48,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-25 13:55:49,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-25 13:55:49,041 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:55:49,047 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:49,047 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:49,047 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-11-25 13:55:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:55:49,064 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:55:49,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2019-11-25 13:55:49,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2019-11-25 13:55:49,208 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:55:49,240 INFO L588 ElimStorePlain]: treesize reduction 9, result has 62.5 percent of original size [2019-11-25 13:55:49,240 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 13:55:49,254 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:49,255 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-25 13:55:49,255 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:15 [2019-11-25 13:55:49,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:55:49,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816406818] [2019-11-25 13:55:49,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:55:49,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-25 13:55:49,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41745662] [2019-11-25 13:55:49,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-25 13:55:49,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:55:49,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-25 13:55:49,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-25 13:55:49,321 INFO L87 Difference]: Start difference. First operand 242 states and 332 transitions. Second operand 15 states. [2019-11-25 13:55:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:55:51,591 INFO L93 Difference]: Finished difference Result 328 states and 411 transitions. [2019-11-25 13:55:51,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 13:55:51,592 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2019-11-25 13:55:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:55:51,594 INFO L225 Difference]: With dead ends: 328 [2019-11-25 13:55:51,594 INFO L226 Difference]: Without dead ends: 328 [2019-11-25 13:55:51,594 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2019-11-25 13:55:51,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-11-25 13:55:51,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 254. [2019-11-25 13:55:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-25 13:55:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 349 transitions. [2019-11-25 13:55:51,611 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 349 transitions. Word has length 37 [2019-11-25 13:55:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:55:51,612 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 349 transitions. [2019-11-25 13:55:51,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-25 13:55:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 349 transitions. [2019-11-25 13:55:51,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 13:55:51,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:55:51,615 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:55:51,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-25 13:55:51,819 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:55:51,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:55:51,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1102273563, now seen corresponding path program 1 times [2019-11-25 13:55:51,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:55:51,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446443043] [2019-11-25 13:55:51,820 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-25 13:55:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:55:51,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:55:51,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:55:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 13:55:51,971 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:55:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 13:55:52,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446443043] [2019-11-25 13:55:52,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:55:52,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 13:55:52,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363485145] [2019-11-25 13:55:52,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:55:52,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:55:52,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:55:52,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:55:52,012 INFO L87 Difference]: Start difference. First operand 254 states and 349 transitions. Second operand 5 states. [2019-11-25 13:55:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:55:52,068 INFO L93 Difference]: Finished difference Result 277 states and 377 transitions. [2019-11-25 13:55:52,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 13:55:52,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-25 13:55:52,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:55:52,071 INFO L225 Difference]: With dead ends: 277 [2019-11-25 13:55:52,071 INFO L226 Difference]: Without dead ends: 277 [2019-11-25 13:55:52,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 13:55:52,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-25 13:55:52,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 258. [2019-11-25 13:55:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-25 13:55:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 351 transitions. [2019-11-25 13:55:52,082 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 351 transitions. Word has length 37 [2019-11-25 13:55:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:55:52,083 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 351 transitions. [2019-11-25 13:55:52,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:55:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 351 transitions. [2019-11-25 13:55:52,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-25 13:55:52,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:55:52,084 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:55:52,294 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-25 13:55:52,295 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:55:52,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:55:52,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1449883398, now seen corresponding path program 1 times [2019-11-25 13:55:52,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:55:52,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847018411] [2019-11-25 13:55:52,297 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-25 13:55:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:55:52,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 13:55:52,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:55:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 13:55:52,459 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:55:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 13:55:52,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847018411] [2019-11-25 13:55:52,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:55:52,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 13:55:52,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386469747] [2019-11-25 13:55:52,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 13:55:52,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:55:52,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 13:55:52,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 13:55:52,492 INFO L87 Difference]: Start difference. First operand 258 states and 351 transitions. Second operand 6 states. [2019-11-25 13:55:52,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:55:52,602 INFO L93 Difference]: Finished difference Result 232 states and 299 transitions. [2019-11-25 13:55:52,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:55:52,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-25 13:55:52,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:55:52,605 INFO L225 Difference]: With dead ends: 232 [2019-11-25 13:55:52,605 INFO L226 Difference]: Without dead ends: 232 [2019-11-25 13:55:52,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 13:55:52,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-25 13:55:52,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 223. [2019-11-25 13:55:52,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-25 13:55:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 291 transitions. [2019-11-25 13:55:52,614 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 291 transitions. Word has length 37 [2019-11-25 13:55:52,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:55:52,614 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 291 transitions. [2019-11-25 13:55:52,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 13:55:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 291 transitions. [2019-11-25 13:55:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 13:55:52,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:55:52,615 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, 1, 1, 1, 1, 1, 1] [2019-11-25 13:55:52,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-25 13:55:52,827 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:55:52,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:55:52,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1559450878, now seen corresponding path program 1 times [2019-11-25 13:55:52,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:55:52,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290765600] [2019-11-25 13:55:52,829 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-25 13:55:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:55:52,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 13:55:52,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:55:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 13:55:53,113 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:55:53,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 13:55:53,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290765600] [2019-11-25 13:55:53,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:55:53,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2019-11-25 13:55:53,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441975393] [2019-11-25 13:55:53,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:55:53,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:55:53,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:55:53,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:55:53,239 INFO L87 Difference]: Start difference. First operand 223 states and 291 transitions. Second operand 10 states. [2019-11-25 13:55:53,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:55:53,581 INFO L93 Difference]: Finished difference Result 226 states and 293 transitions. [2019-11-25 13:55:53,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 13:55:53,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-11-25 13:55:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:55:53,585 INFO L225 Difference]: With dead ends: 226 [2019-11-25 13:55:53,585 INFO L226 Difference]: Without dead ends: 224 [2019-11-25 13:55:53,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:55:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-25 13:55:53,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2019-11-25 13:55:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-25 13:55:53,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 291 transitions. [2019-11-25 13:55:53,601 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 291 transitions. Word has length 38 [2019-11-25 13:55:53,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:55:53,602 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 291 transitions. [2019-11-25 13:55:53,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:55:53,602 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 291 transitions. [2019-11-25 13:55:53,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 13:55:53,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:55:53,604 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:55:53,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-25 13:55:53,825 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, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:55:53,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:55:53,825 INFO L82 PathProgramCache]: Analyzing trace with hash -2061012070, now seen corresponding path program 1 times [2019-11-25 13:55:53,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:55:53,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467354940] [2019-11-25 13:55:53,826 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-25 13:55:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:55:53,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 13:55:53,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:55:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-25 13:55:53,994 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:55:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-25 13:55:54,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467354940] [2019-11-25 13:55:54,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:55:54,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 13:55:54,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499262250] [2019-11-25 13:55:54,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:55:54,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:55:54,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:55:54,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:55:54,040 INFO L87 Difference]: Start difference. First operand 224 states and 291 transitions. Second operand 5 states. [2019-11-25 13:55:54,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:55:54,075 INFO L93 Difference]: Finished difference Result 207 states and 255 transitions. [2019-11-25 13:55:54,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:55:54,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-25 13:55:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:55:54,079 INFO L225 Difference]: With dead ends: 207 [2019-11-25 13:55:54,079 INFO L226 Difference]: Without dead ends: 207 [2019-11-25 13:55:54,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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-25 13:55:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-11-25 13:55:54,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-11-25 13:55:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-25 13:55:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 251 transitions. [2019-11-25 13:55:54,087 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 251 transitions. Word has length 38 [2019-11-25 13:55:54,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:55:54,088 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 251 transitions. [2019-11-25 13:55:54,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:55:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 251 transitions. [2019-11-25 13:55:54,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-25 13:55:54,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:55:54,089 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:55:54,300 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-25 13:55:54,301 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:55:54,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:55:54,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1392141398, now seen corresponding path program 1 times [2019-11-25 13:55:54,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:55:54,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229765796] [2019-11-25 13:55:54,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-25 13:55:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:55:54,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-25 13:55:54,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:55:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 13:55:54,565 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:55:54,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 13:55:54,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229765796] [2019-11-25 13:55:54,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:55:54,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-25 13:55:54,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871607893] [2019-11-25 13:55:54,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-25 13:55:54,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:55:54,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-25 13:55:54,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-11-25 13:55:54,812 INFO L87 Difference]: Start difference. First operand 203 states and 251 transitions. Second operand 15 states. [2019-11-25 13:55:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:55:55,121 INFO L93 Difference]: Finished difference Result 202 states and 243 transitions. [2019-11-25 13:55:55,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 13:55:55,121 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2019-11-25 13:55:55,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:55:55,123 INFO L225 Difference]: With dead ends: 202 [2019-11-25 13:55:55,123 INFO L226 Difference]: Without dead ends: 196 [2019-11-25 13:55:55,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2019-11-25 13:55:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-25 13:55:55,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 179. [2019-11-25 13:55:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-25 13:55:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 218 transitions. [2019-11-25 13:55:55,132 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 218 transitions. Word has length 41 [2019-11-25 13:55:55,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:55:55,132 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 218 transitions. [2019-11-25 13:55:55,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-25 13:55:55,132 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 218 transitions. [2019-11-25 13:55:55,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-25 13:55:55,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:55:55,133 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:55:55,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-25 13:55:55,345 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:55:55,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:55:55,345 INFO L82 PathProgramCache]: Analyzing trace with hash -41475270, now seen corresponding path program 2 times [2019-11-25 13:55:55,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:55:55,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2147377646] [2019-11-25 13:55:55,346 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 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-25 13:55:55,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 13:55:55,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:55:55,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 13:55:55,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:55:55,532 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-25 13:55:55,533 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:55:55,544 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:55,544 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:55,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:55:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:55:56,259 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:55:58,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:59,488 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:55:59,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2147377646] [2019-11-25 13:55:59,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:55:59,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 29 [2019-11-25 13:55:59,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844702277] [2019-11-25 13:55:59,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-25 13:55:59,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:55:59,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-25 13:55:59,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2019-11-25 13:55:59,490 INFO L87 Difference]: Start difference. First operand 179 states and 218 transitions. Second operand 30 states. [2019-11-25 13:56:04,884 WARN L192 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2019-11-25 13:56:05,746 WARN L192 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 28 [2019-11-25 13:56:08,054 WARN L192 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2019-11-25 13:56:09,451 WARN L192 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 28 [2019-11-25 13:56:11,572 WARN L192 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-11-25 13:56:12,987 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 27 [2019-11-25 13:56:15,203 WARN L192 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-11-25 13:56:16,358 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-11-25 13:56:17,917 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-11-25 13:56:18,841 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2019-11-25 13:56:19,590 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-25 13:56:20,227 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-11-25 13:56:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:56:22,350 INFO L93 Difference]: Finished difference Result 213 states and 290 transitions. [2019-11-25 13:56:22,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-25 13:56:22,352 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2019-11-25 13:56:22,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:56:22,353 INFO L225 Difference]: With dead ends: 213 [2019-11-25 13:56:22,353 INFO L226 Difference]: Without dead ends: 213 [2019-11-25 13:56:22,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=746, Invalid=2676, Unknown=0, NotChecked=0, Total=3422 [2019-11-25 13:56:22,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-11-25 13:56:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 203. [2019-11-25 13:56:22,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-25 13:56:22,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 250 transitions. [2019-11-25 13:56:22,370 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 250 transitions. Word has length 40 [2019-11-25 13:56:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:56:22,370 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 250 transitions. [2019-11-25 13:56:22,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-25 13:56:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2019-11-25 13:56:22,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-25 13:56:22,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:56:22,372 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:56:22,573 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-25 13:56:22,574 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:56:22,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:56:22,574 INFO L82 PathProgramCache]: Analyzing trace with hash -541551801, now seen corresponding path program 1 times [2019-11-25 13:56:22,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:56:22,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256123814] [2019-11-25 13:56:22,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-25 13:56:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:56:22,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-25 13:56:22,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:56:22,769 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-25 13:56:22,770 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:56:22,775 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:56:22,776 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:56:22,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:56:23,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:56:23,145 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:56:23,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:56:23,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-25 13:56:23,929 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:283) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:351) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-25 13:56:23,936 INFO L168 Benchmark]: Toolchain (without parser) took 226479.17 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.7 MB). Free memory was 956.3 MB in the beginning and 942.4 MB in the end (delta: 13.9 MB). Peak memory consumption was 330.6 MB. Max. memory is 11.5 GB. [2019-11-25 13:56:23,937 INFO L168 Benchmark]: CDTParser took 0.13 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-25 13:56:23,937 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1051.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -156.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-25 13:56:23,937 INFO L168 Benchmark]: Boogie Preprocessor took 110.15 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-25 13:56:23,941 INFO L168 Benchmark]: RCFGBuilder took 1738.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.7 MB in the end (delta: 123.1 MB). Peak memory consumption was 123.1 MB. Max. memory is 11.5 GB. [2019-11-25 13:56:23,946 INFO L168 Benchmark]: TraceAbstraction took 223574.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.9 MB). Free memory was 982.7 MB in the beginning and 942.4 MB in the end (delta: 40.3 MB). Peak memory consumption was 200.2 MB. Max. memory is 11.5 GB. [2019-11-25 13:56:23,949 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.13 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 1051.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.8 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -156.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.15 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1738.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.7 MB in the end (delta: 123.1 MB). Peak memory consumption was 123.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 223574.40 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.9 MB). Free memory was 982.7 MB in the beginning and 942.4 MB in the end (delta: 40.3 MB). Peak memory consumption was 200.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:283) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...