./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 c9c8a757 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 771ea31dfbd697ea24d6820053320d940f30ec07 ............................................................................................................................ 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 771ea31dfbd697ea24d6820053320d940f30ec07 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-c9c8a75 [2019-11-28 10:02:56,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 10:02:56,290 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 10:02:56,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 10:02:56,303 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 10:02:56,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 10:02:56,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 10:02:56,308 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 10:02:56,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 10:02:56,311 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 10:02:56,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 10:02:56,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 10:02:56,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 10:02:56,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 10:02:56,324 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 10:02:56,325 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 10:02:56,327 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 10:02:56,328 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 10:02:56,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 10:02:56,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 10:02:56,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 10:02:56,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 10:02:56,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 10:02:56,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 10:02:56,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 10:02:56,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 10:02:56,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 10:02:56,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 10:02:56,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 10:02:56,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 10:02:56,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 10:02:56,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 10:02:56,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 10:02:56,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 10:02:56,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 10:02:56,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 10:02:56,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 10:02:56,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 10:02:56,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 10:02:56,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 10:02:56,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 10:02:56,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 10:02:56,365 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 10:02:56,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 10:02:56,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 10:02:56,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 10:02:56,367 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 10:02:56,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 10:02:56,368 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 10:02:56,368 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 10:02:56,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 10:02:56,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 10:02:56,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 10:02:56,369 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 10:02:56,369 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 10:02:56,370 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 10:02:56,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 10:02:56,370 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 10:02:56,370 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 10:02:56,370 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 10:02:56,371 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 10:02:56,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 10:02:56,371 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 10:02:56,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 10:02:56,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 10:02:56,372 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 10:02:56,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 10:02:56,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 10:02:56,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 10:02:56,373 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 -> 771ea31dfbd697ea24d6820053320d940f30ec07 [2019-11-28 10:02:56,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 10:02:56,694 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 10:02:56,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 10:02:56,700 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 10:02:56,700 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 10:02:56,701 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-28 10:02:56,783 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c17c5484/2368996cc68e47d1b403d8d53fc73d9e/FLAG36a437e93 [2019-11-28 10:02:57,388 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 10:02:57,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2019-11-28 10:02:57,407 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c17c5484/2368996cc68e47d1b403d8d53fc73d9e/FLAG36a437e93 [2019-11-28 10:02:57,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c17c5484/2368996cc68e47d1b403d8d53fc73d9e [2019-11-28 10:02:57,652 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 10:02:57,653 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 10:02:57,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 10:02:57,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 10:02:57,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 10:02:57,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:02:57" (1/1) ... [2019-11-28 10:02:57,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76576ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:02:57, skipping insertion in model container [2019-11-28 10:02:57,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:02:57" (1/1) ... [2019-11-28 10:02:57,671 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 10:02:57,731 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 10:02:58,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:02:58,267 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-28 10:02:58,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5c668d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:02:58, skipping insertion in model container [2019-11-28 10:02:58,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 10:02:58,268 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-28 10:02:58,271 INFO L168 Benchmark]: Toolchain (without parser) took 616.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -165.2 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-11-28 10:02:58,271 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 10:02:58,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2019-11-28 10:02:58,275 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 613.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-c9c8a75 [2019-11-28 10:02:59,990 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 10:02:59,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 10:03:00,006 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 10:03:00,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 10:03:00,007 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 10:03:00,008 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 10:03:00,010 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 10:03:00,012 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 10:03:00,013 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 10:03:00,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 10:03:00,016 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 10:03:00,016 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 10:03:00,017 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 10:03:00,018 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 10:03:00,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 10:03:00,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 10:03:00,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 10:03:00,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 10:03:00,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 10:03:00,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 10:03:00,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 10:03:00,030 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 10:03:00,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 10:03:00,034 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 10:03:00,034 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 10:03:00,035 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 10:03:00,036 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 10:03:00,036 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 10:03:00,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 10:03:00,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 10:03:00,039 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 10:03:00,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 10:03:00,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 10:03:00,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 10:03:00,042 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 10:03:00,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 10:03:00,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 10:03:00,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 10:03:00,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 10:03:00,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 10:03:00,047 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-28 10:03:00,063 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 10:03:00,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 10:03:00,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 10:03:00,065 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 10:03:00,065 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 10:03:00,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 10:03:00,065 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 10:03:00,066 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 10:03:00,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 10:03:00,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 10:03:00,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 10:03:00,067 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 10:03:00,067 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 10:03:00,067 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 10:03:00,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 10:03:00,067 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 10:03:00,068 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 10:03:00,068 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 10:03:00,068 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 10:03:00,068 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 10:03:00,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 10:03:00,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 10:03:00,069 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 10:03:00,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 10:03:00,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 10:03:00,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 10:03:00,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 10:03:00,070 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 10:03:00,071 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 10:03:00,071 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 10:03:00,071 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 -> 771ea31dfbd697ea24d6820053320d940f30ec07 [2019-11-28 10:03:00,386 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 10:03:00,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 10:03:00,407 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 10:03:00,409 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 10:03:00,410 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 10:03:00,411 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-28 10:03:00,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c674f4a1/b35b8e87b65c478aa861e039ada5a375/FLAG9b1c36b5e [2019-11-28 10:03:01,020 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 10:03:01,021 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2019-11-28 10:03:01,039 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c674f4a1/b35b8e87b65c478aa861e039ada5a375/FLAG9b1c36b5e [2019-11-28 10:03:01,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c674f4a1/b35b8e87b65c478aa861e039ada5a375 [2019-11-28 10:03:01,295 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 10:03:01,297 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 10:03:01,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 10:03:01,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 10:03:01,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 10:03:01,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:03:01" (1/1) ... [2019-11-28 10:03:01,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b4d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:01, skipping insertion in model container [2019-11-28 10:03:01,307 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:03:01" (1/1) ... [2019-11-28 10:03:01,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 10:03:01,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 10:03:02,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:03:02,055 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-28 10:03:02,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 10:03:02,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:03:02,200 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 10:03:02,294 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:03:02,385 INFO L208 MainTranslator]: Completed translation [2019-11-28 10:03:02,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:02 WrapperNode [2019-11-28 10:03:02,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 10:03:02,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 10:03:02,387 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 10:03:02,387 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 10:03:02,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:02" (1/1) ... [2019-11-28 10:03:02,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:02" (1/1) ... [2019-11-28 10:03:02,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:02" (1/1) ... [2019-11-28 10:03:02,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:02" (1/1) ... [2019-11-28 10:03:02,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:02" (1/1) ... [2019-11-28 10:03:02,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:02" (1/1) ... [2019-11-28 10:03:02,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:02" (1/1) ... [2019-11-28 10:03:02,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 10:03:02,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 10:03:02,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 10:03:02,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 10:03:02,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:02" (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-28 10:03:02,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 10:03:02,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 10:03:02,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-28 10:03:02,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 10:03:02,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 10:03:02,579 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 10:03:02,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 10:03:02,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 10:03:02,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 10:03:02,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-28 10:03:02,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-28 10:03:02,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-28 10:03:02,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-28 10:03:02,581 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-28 10:03:02,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-28 10:03:02,581 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-28 10:03:02,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-28 10:03:02,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-28 10:03:02,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-28 10:03:02,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-28 10:03:02,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-28 10:03:02,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-28 10:03:02,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-28 10:03:02,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-28 10:03:02,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-28 10:03:02,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-28 10:03:02,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-28 10:03:02,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-28 10:03:02,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-28 10:03:02,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-28 10:03:02,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-28 10:03:02,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-28 10:03:02,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-28 10:03:02,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-28 10:03:02,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-28 10:03:02,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-28 10:03:02,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-28 10:03:02,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-28 10:03:02,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-28 10:03:02,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-28 10:03:02,585 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-28 10:03:02,585 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-28 10:03:02,585 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_17 [2019-11-28 10:03:02,585 INFO L138 BoogieDeclarations]: Found implementation of procedure free_17 [2019-11-28 10:03:02,585 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-28 10:03:02,585 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 10:03:02,585 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-28 10:03:02,585 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-28 10:03:02,586 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-28 10:03:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 10:03:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 10:03:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 10:03:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 10:03:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 10:03:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 10:03:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 10:03:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 10:03:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 10:03:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 10:03:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 10:03:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 10:03:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 10:03:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 10:03:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 10:03:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 10:03:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 10:03:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 10:03:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 10:03:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 10:03:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 10:03:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 10:03:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 10:03:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 10:03:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 10:03:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 10:03:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 10:03:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 10:03:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 10:03:02,594 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 10:03:02,594 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 10:03:02,595 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 10:03:02,595 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 10:03:02,595 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 10:03:02,595 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 10:03:02,595 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 10:03:02,595 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 10:03:02,596 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 10:03:02,596 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 10:03:02,596 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 10:03:02,596 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 10:03:02,596 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 10:03:02,596 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 10:03:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 10:03:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 10:03:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 10:03:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 10:03:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 10:03:02,597 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 10:03:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 10:03:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 10:03:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 10:03:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 10:03:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 10:03:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 10:03:02,598 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 10:03:02,599 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 10:03:02,599 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 10:03:02,599 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 10:03:02,599 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 10:03:02,599 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 10:03:02,600 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 10:03:02,600 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 10:03:02,600 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 10:03:02,601 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 10:03:02,601 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 10:03:02,601 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 10:03:02,602 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 10:03:02,602 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 10:03:02,602 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 10:03:02,602 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 10:03:02,602 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 10:03:02,602 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 10:03:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 10:03:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 10:03:02,603 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 10:03:02,604 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 10:03:02,605 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 10:03:02,608 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 10:03:02,608 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 10:03:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 10:03:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 10:03:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 10:03:02,609 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 10:03:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 10:03:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 10:03:02,610 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 10:03:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 10:03:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 10:03:02,611 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 10:03:02,619 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 10:03:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 10:03:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 10:03:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 10:03:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 10:03:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 10:03:02,620 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 10:03:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 10:03:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 10:03:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 10:03:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 10:03:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 10:03:02,621 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 10:03:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 10:03:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 10:03:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 10:03:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 10:03:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-28 10:03:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 10:03:02,622 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-28 10:03:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-28 10:03:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-28 10:03:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-28 10:03:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-28 10:03:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 10:03:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-28 10:03:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-28 10:03:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-28 10:03:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 10:03:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-28 10:03:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-28 10:03:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-28 10:03:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 10:03:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-28 10:03:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-28 10:03:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-28 10:03:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-28 10:03:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-28 10:03:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-28 10:03:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 10:03:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-28 10:03:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-28 10:03:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-28 10:03:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-28 10:03:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-28 10:03:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 10:03:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 10:03:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-28 10:03:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-28 10:03:02,626 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-28 10:03:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-28 10:03:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-28 10:03:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-28 10:03:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-28 10:03:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-28 10:03:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-28 10:03:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-28 10:03:02,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-28 10:03:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-28 10:03:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-28 10:03:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-28 10:03:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-28 10:03:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-28 10:03:02,628 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-28 10:03:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-28 10:03:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_17 [2019-11-28 10:03:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure free_17 [2019-11-28 10:03:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-28 10:03:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 10:03:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 10:03:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 10:03:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 10:03:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 10:03:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 10:03:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-28 10:03:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-28 10:03:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-28 10:03:02,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-28 10:03:03,295 WARN L757 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 10:03:03,708 WARN L757 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 10:03:04,251 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 10:03:04,252 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 10:03:04,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:03:04 BoogieIcfgContainer [2019-11-28 10:03:04,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 10:03:04,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 10:03:04,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 10:03:04,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 10:03:04,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:03:01" (1/3) ... [2019-11-28 10:03:04,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264b1819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:03:04, skipping insertion in model container [2019-11-28 10:03:04,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:02" (2/3) ... [2019-11-28 10:03:04,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264b1819 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:03:04, skipping insertion in model container [2019-11-28 10:03:04,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:03:04" (3/3) ... [2019-11-28 10:03:04,263 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2-2.i [2019-11-28 10:03:04,274 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 10:03:04,284 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 90 error locations. [2019-11-28 10:03:04,299 INFO L249 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2019-11-28 10:03:04,324 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 10:03:04,325 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 10:03:04,325 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 10:03:04,325 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 10:03:04,325 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 10:03:04,326 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 10:03:04,326 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 10:03:04,326 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 10:03:04,351 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-11-28 10:03:04,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 10:03:04,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:04,365 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-28 10:03:04,366 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-28 10:03:04,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:04,374 INFO L82 PathProgramCache]: Analyzing trace with hash 78607545, now seen corresponding path program 1 times [2019-11-28 10:03:04,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:04,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931181903] [2019-11-28 10:03:04,390 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-28 10:03:04,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:04,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 10:03:04,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:04,679 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-28 10:03:04,680 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:04,691 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:04,692 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:04,693 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:03:04,720 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-28 10:03:04,720 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:04,790 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-28 10:03:04,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931181903] [2019-11-28 10:03:04,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:04,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 10:03:04,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100510075] [2019-11-28 10:03:04,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:03:04,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:04,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:03:04,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:03:04,821 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 5 states. [2019-11-28 10:03:05,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:05,119 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2019-11-28 10:03:05,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:03:05,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 10:03:05,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:05,135 INFO L225 Difference]: With dead ends: 93 [2019-11-28 10:03:05,135 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 10:03:05,137 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-28 10:03:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 10:03:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2019-11-28 10:03:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-28 10:03:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2019-11-28 10:03:05,198 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 22 [2019-11-28 10:03:05,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:05,199 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2019-11-28 10:03:05,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:03:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2019-11-28 10:03:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 10:03:05,202 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:05,202 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-28 10:03:05,413 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 10:03:05,415 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-28 10:03:05,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:05,416 INFO L82 PathProgramCache]: Analyzing trace with hash 78607546, now seen corresponding path program 1 times [2019-11-28 10:03:05,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:05,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765868765] [2019-11-28 10:03:05,417 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-28 10:03:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:05,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 10:03:05,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:05,642 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-28 10:03:05,642 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:05,651 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:05,652 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:05,652 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 10:03:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:05,911 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:06,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:03:07,226 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-28 10:03:07,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765868765] [2019-11-28 10:03:07,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:07,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 8] imperfect sequences [] total 17 [2019-11-28 10:03:07,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480125077] [2019-11-28 10:03:07,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 10:03:07,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:07,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 10:03:07,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-11-28 10:03:07,231 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 18 states. [2019-11-28 10:03:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:08,908 INFO L93 Difference]: Finished difference Result 98 states and 113 transitions. [2019-11-28 10:03:08,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 10:03:08,909 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-11-28 10:03:08,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:08,912 INFO L225 Difference]: With dead ends: 98 [2019-11-28 10:03:08,913 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 10:03:08,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2019-11-28 10:03:08,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 10:03:08,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2019-11-28 10:03:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-28 10:03:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2019-11-28 10:03:08,926 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 22 [2019-11-28 10:03:08,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:08,926 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2019-11-28 10:03:08,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 10:03:08,926 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2019-11-28 10:03:08,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 10:03:08,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:08,927 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-28 10:03:09,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 10:03:09,130 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-28 10:03:09,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:09,132 INFO L82 PathProgramCache]: Analyzing trace with hash 966111226, now seen corresponding path program 1 times [2019-11-28 10:03:09,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:09,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743905908] [2019-11-28 10:03:09,134 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-28 10:03:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:09,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 10:03:09,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:09,287 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-28 10:03:09,287 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:09,329 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-28 10:03:09,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743905908] [2019-11-28 10:03:09,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:09,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 10:03:09,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896214343] [2019-11-28 10:03:09,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:03:09,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:09,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:03:09,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:03:09,331 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 5 states. [2019-11-28 10:03:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:09,381 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2019-11-28 10:03:09,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:03:09,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-28 10:03:09,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:09,384 INFO L225 Difference]: With dead ends: 90 [2019-11-28 10:03:09,384 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 10:03:09,384 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-28 10:03:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 10:03:09,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-11-28 10:03:09,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 10:03:09,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 98 transitions. [2019-11-28 10:03:09,394 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 98 transitions. Word has length 22 [2019-11-28 10:03:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:09,395 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 98 transitions. [2019-11-28 10:03:09,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:03:09,395 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 98 transitions. [2019-11-28 10:03:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 10:03:09,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:09,397 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-28 10:03:09,617 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 10:03:09,618 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-28 10:03:09,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:09,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1857306545, now seen corresponding path program 1 times [2019-11-28 10:03:09,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:09,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090439187] [2019-11-28 10:03:09,620 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-28 10:03:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:09,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 10:03:09,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:09,785 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-28 10:03:09,785 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:09,883 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-28 10:03:09,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090439187] [2019-11-28 10:03:09,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:09,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 10:03:09,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248997504] [2019-11-28 10:03:09,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:03:09,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:09,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:03:09,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:03:09,886 INFO L87 Difference]: Start difference. First operand 88 states and 98 transitions. Second operand 5 states. [2019-11-28 10:03:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:09,953 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2019-11-28 10:03:09,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:03:09,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-11-28 10:03:09,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:09,956 INFO L225 Difference]: With dead ends: 90 [2019-11-28 10:03:09,956 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 10:03:09,956 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-28 10:03:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 10:03:09,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2019-11-28 10:03:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 10:03:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-11-28 10:03:09,971 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 23 [2019-11-28 10:03:09,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:09,972 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-11-28 10:03:09,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:03:09,972 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-11-28 10:03:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 10:03:09,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:09,973 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-28 10:03:10,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 10:03:10,175 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-28 10:03:10,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:10,176 INFO L82 PathProgramCache]: Analyzing trace with hash -114496210, now seen corresponding path program 1 times [2019-11-28 10:03:10,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:10,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675636480] [2019-11-28 10:03:10,177 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-28 10:03:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:10,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 10:03:10,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:10,307 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-28 10:03:10,307 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:10,363 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-28 10:03:10,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675636480] [2019-11-28 10:03:10,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:10,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 10:03:10,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746165283] [2019-11-28 10:03:10,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 10:03:10,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:10,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 10:03:10,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 10:03:10,366 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 3 states. [2019-11-28 10:03:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:10,506 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2019-11-28 10:03:10,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 10:03:10,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 10:03:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:10,508 INFO L225 Difference]: With dead ends: 126 [2019-11-28 10:03:10,508 INFO L226 Difference]: Without dead ends: 121 [2019-11-28 10:03:10,509 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-28 10:03:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-28 10:03:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2019-11-28 10:03:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-28 10:03:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2019-11-28 10:03:10,517 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 23 [2019-11-28 10:03:10,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:10,517 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2019-11-28 10:03:10,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 10:03:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2019-11-28 10:03:10,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 10:03:10,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:10,519 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-28 10:03:10,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 10:03:10,733 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-28 10:03:10,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash -121920454, now seen corresponding path program 1 times [2019-11-28 10:03:10,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:10,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336146465] [2019-11-28 10:03:10,735 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-28 10:03:10,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:10,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 10:03:10,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:10,906 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-28 10:03:10,906 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:10,911 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:10,912 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:10,912 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 10:03:11,304 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-28 10:03:11,305 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:12,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:03:13,098 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-28 10:03:13,551 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-28 10:03:13,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336146465] [2019-11-28 10:03:13,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:03:13,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 23 [2019-11-28 10:03:13,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163248153] [2019-11-28 10:03:13,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 10:03:13,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:13,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 10:03:13,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2019-11-28 10:03:13,555 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand 24 states. [2019-11-28 10:03:15,381 WARN L192 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-28 10:03:15,727 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 28 [2019-11-28 10:03:16,185 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-28 10:03:16,477 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-11-28 10:03:17,576 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-11-28 10:03:18,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:18,157 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2019-11-28 10:03:18,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 10:03:18,158 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 28 [2019-11-28 10:03:18,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:18,160 INFO L225 Difference]: With dead ends: 101 [2019-11-28 10:03:18,160 INFO L226 Difference]: Without dead ends: 101 [2019-11-28 10:03:18,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=252, Invalid=938, Unknown=0, NotChecked=0, Total=1190 [2019-11-28 10:03:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-28 10:03:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2019-11-28 10:03:18,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-28 10:03:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2019-11-28 10:03:18,169 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 28 [2019-11-28 10:03:18,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:18,169 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2019-11-28 10:03:18,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 10:03:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2019-11-28 10:03:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 10:03:18,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:18,171 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-28 10:03:18,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 10:03:18,376 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-28 10:03:18,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:18,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1984551823, now seen corresponding path program 1 times [2019-11-28 10:03:18,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:18,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1238665447] [2019-11-28 10:03:18,378 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-28 10:03:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:18,513 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 10:03:18,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:18,524 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-28 10:03:18,524 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:18,526 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:18,527 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:18,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:03:18,588 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-28 10:03:18,588 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:18,694 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-28 10:03:18,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1238665447] [2019-11-28 10:03:18,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:18,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-28 10:03:18,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516469113] [2019-11-28 10:03:18,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 10:03:18,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:18,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 10:03:18,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:03:18,698 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand 9 states. [2019-11-28 10:03:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:19,500 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2019-11-28 10:03:19,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 10:03:19,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-28 10:03:19,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:19,504 INFO L225 Difference]: With dead ends: 165 [2019-11-28 10:03:19,504 INFO L226 Difference]: Without dead ends: 165 [2019-11-28 10:03:19,505 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-28 10:03:19,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-28 10:03:19,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 115. [2019-11-28 10:03:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-28 10:03:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 134 transitions. [2019-11-28 10:03:19,532 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 134 transitions. Word has length 35 [2019-11-28 10:03:19,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:19,533 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 134 transitions. [2019-11-28 10:03:19,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 10:03:19,535 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2019-11-28 10:03:19,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 10:03:19,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:19,540 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-28 10:03:19,741 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 10:03:19,741 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-28 10:03:19,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:19,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1984551822, now seen corresponding path program 1 times [2019-11-28 10:03:19,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:19,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771447815] [2019-11-28 10:03:19,743 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-28 10:03:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:19,960 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 10:03:19,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:20,014 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-28 10:03:20,014 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:20,024 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:20,025 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:20,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 10:03:20,364 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-28 10:03:20,364 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:20,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:03:21,489 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-28 10:03:21,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771447815] [2019-11-28 10:03:21,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 10:03:21,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2019-11-28 10:03:21,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132250543] [2019-11-28 10:03:21,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 10:03:21,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:21,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 10:03:21,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-11-28 10:03:21,492 INFO L87 Difference]: Start difference. First operand 115 states and 134 transitions. Second operand 10 states. [2019-11-28 10:03:26,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:26,246 INFO L93 Difference]: Finished difference Result 185 states and 216 transitions. [2019-11-28 10:03:26,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 10:03:26,248 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-11-28 10:03:26,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:26,249 INFO L225 Difference]: With dead ends: 185 [2019-11-28 10:03:26,249 INFO L226 Difference]: Without dead ends: 185 [2019-11-28 10:03:26,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2019-11-28 10:03:26,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-28 10:03:26,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 159. [2019-11-28 10:03:26,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-28 10:03:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 203 transitions. [2019-11-28 10:03:26,271 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 203 transitions. Word has length 35 [2019-11-28 10:03:26,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:26,273 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 203 transitions. [2019-11-28 10:03:26,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 10:03:26,274 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 203 transitions. [2019-11-28 10:03:26,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 10:03:26,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:26,275 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-28 10:03:26,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 10:03:26,476 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-28 10:03:26,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:26,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1643543858, now seen corresponding path program 1 times [2019-11-28 10:03:26,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:26,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547873738] [2019-11-28 10:03:26,479 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-28 10:03:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:26,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 10:03:26,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:26,651 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-28 10:03:26,651 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:26,653 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:26,653 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:26,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:03:26,768 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:26,769 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-28 10:03:26,770 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:26,788 INFO L588 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-28 10:03:26,789 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-28 10:03:26,790 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-28 10:03:26,826 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-28 10:03:26,827 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:29,233 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-28 10:03:29,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547873738] [2019-11-28 10:03:29,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:03:29,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-28 10:03:29,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421275369] [2019-11-28 10:03:29,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 10:03:29,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:29,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 10:03:29,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-11-28 10:03:29,236 INFO L87 Difference]: Start difference. First operand 159 states and 203 transitions. Second operand 17 states. [2019-11-28 10:03:49,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:49,227 INFO L93 Difference]: Finished difference Result 273 states and 335 transitions. [2019-11-28 10:03:49,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 10:03:49,227 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-11-28 10:03:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:49,230 INFO L225 Difference]: With dead ends: 273 [2019-11-28 10:03:49,231 INFO L226 Difference]: Without dead ends: 273 [2019-11-28 10:03:49,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=133, Invalid=623, Unknown=0, NotChecked=0, Total=756 [2019-11-28 10:03:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-28 10:03:49,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 168. [2019-11-28 10:03:49,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-28 10:03:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 220 transitions. [2019-11-28 10:03:49,243 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 220 transitions. Word has length 35 [2019-11-28 10:03:49,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:49,243 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 220 transitions. [2019-11-28 10:03:49,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 10:03:49,244 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 220 transitions. [2019-11-28 10:03:49,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 10:03:49,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:49,245 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-28 10:03:49,447 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 10:03:49,448 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-28 10:03:49,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:49,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1643543857, now seen corresponding path program 1 times [2019-11-28 10:03:49,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:49,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198307170] [2019-11-28 10:03:49,451 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-28 10:03:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:49,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 10:03:49,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:49,653 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-28 10:03:49,653 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:49,662 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:49,669 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-28 10:03:49,669 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:49,677 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:49,678 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:49,678 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-28 10:03:52,141 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:52,142 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-28 10:03:52,143 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:52,202 INFO L588 ElimStorePlain]: treesize reduction 3, result has 91.2 percent of original size [2019-11-28 10:03:52,208 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-28 10:03:52,208 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:52,235 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:52,236 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-28 10:03:52,236 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:42, output treesize:21 [2019-11-28 10:03:52,335 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-28 10:03:52,335 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:52,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:03:52,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:03:52,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:03:52,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:03:58,847 WARN L192 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-11-28 10:03:58,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:04:03,819 WARN L192 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-11-28 10:04:06,140 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_249|], 2=[|v_#length_204|]} [2019-11-28 10:04:06,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:06,152 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:06,153 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:06,153 INFO L476 ElimStorePlain]: Eliminatee |v_#length_204| vanished before elimination [2019-11-28 10:04:06,153 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-28 10:04:06,153 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:30, output treesize:1 [2019-11-28 10:04:06,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:04:06,726 INFO L404 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-28 10:04:06,733 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-28 10:04:06,734 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:06,750 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:06,752 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 10:04:06,753 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:06,771 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:06,772 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-28 10:04:06,772 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:34, output treesize:17 [2019-11-28 10:04:06,983 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-28 10:04:06,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198307170] [2019-11-28 10:04:06,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:04:06,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 29 [2019-11-28 10:04:06,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257451840] [2019-11-28 10:04:06,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-28 10:04:06,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:04:06,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-28 10:04:06,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=769, Unknown=3, NotChecked=0, Total=870 [2019-11-28 10:04:06,986 INFO L87 Difference]: Start difference. First operand 168 states and 220 transitions. Second operand 30 states. [2019-11-28 10:04:21,046 WARN L838 $PredicateComparison]: unable to prove that (and (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 ((.cse0 (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse1 (bvadd .cse0 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 .cse0 v_alloc_17_~array.offset_BEFORE_CALL_2) .cse1)) (bvule .cse1 (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|))))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= (_ bv0 32) |c_ldv_malloc_#res.offset|) (= (bvadd (select |c_#valid| |c_ldv_malloc_#res.base|) (_ bv1 1)) (_ 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|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|)) is different from false [2019-11-28 10:04:24,496 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-28 10:04:27,483 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-28 10:04:32,757 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-28 10:04:36,554 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 16 [2019-11-28 10:04:54,173 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-11-28 10:05:04,078 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-28 10:05:08,284 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-28 10:05:19,676 WARN L192 SmtUtils]: Spent 8.39 s on a formula simplification that was a NOOP. DAG size: 111 [2019-11-28 10:05:53,736 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-28 10:05:54,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:05:54,752 INFO L93 Difference]: Finished difference Result 354 states and 445 transitions. [2019-11-28 10:05:54,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-11-28 10:05:54,753 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 35 [2019-11-28 10:05:54,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:05:54,756 INFO L225 Difference]: With dead ends: 354 [2019-11-28 10:05:54,756 INFO L226 Difference]: Without dead ends: 354 [2019-11-28 10:05:54,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 49.1s TimeCoverageRelationStatistics Valid=279, Invalid=2271, Unknown=4, NotChecked=98, Total=2652 [2019-11-28 10:05:54,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-28 10:05:54,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 245. [2019-11-28 10:05:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-11-28 10:05:54,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 342 transitions. [2019-11-28 10:05:54,771 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 342 transitions. Word has length 35 [2019-11-28 10:05:54,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:05:54,771 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 342 transitions. [2019-11-28 10:05:54,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-28 10:05:54,771 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 342 transitions. [2019-11-28 10:05:54,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 10:05:54,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:05:54,773 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-28 10:05:54,984 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-28 10:05:54,985 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-28 10:05:54,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:05:54,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1391563981, now seen corresponding path program 1 times [2019-11-28 10:05:54,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:05:54,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793277460] [2019-11-28 10:05:54,987 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-28 10:05:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:05:55,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 10:05:55,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:05:55,134 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-28 10:05:55,135 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:05:55,137 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:05:55,137 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:05:55,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-28 10:05:55,181 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-28 10:05:55,182 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:05:55,183 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:05:55,183 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-28 10:05:55,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-28 10:05:55,194 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-28 10:05:55,195 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:05:55,266 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-28 10:05:55,268 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-28 10:05:55,268 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:05:55,270 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:05:55,270 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:05:55,273 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:05:55,274 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-28 10:05:55,274 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:7 [2019-11-28 10:05:55,300 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-28 10:05:55,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793277460] [2019-11-28 10:05:55,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:05:55,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-28 10:05:55,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155129025] [2019-11-28 10:05:55,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 10:05:55,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:05:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 10:05:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-28 10:05:55,303 INFO L87 Difference]: Start difference. First operand 245 states and 342 transitions. Second operand 11 states. [2019-11-28 10:05:56,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:05:56,223 INFO L93 Difference]: Finished difference Result 370 states and 506 transitions. [2019-11-28 10:05:56,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 10:05:56,225 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-28 10:05:56,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:05:56,228 INFO L225 Difference]: With dead ends: 370 [2019-11-28 10:05:56,228 INFO L226 Difference]: Without dead ends: 370 [2019-11-28 10:05:56,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2019-11-28 10:05:56,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-11-28 10:05:56,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 310. [2019-11-28 10:05:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-11-28 10:05:56,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 438 transitions. [2019-11-28 10:05:56,244 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 438 transitions. Word has length 36 [2019-11-28 10:05:56,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:05:56,245 INFO L462 AbstractCegarLoop]: Abstraction has 310 states and 438 transitions. [2019-11-28 10:05:56,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 10:05:56,245 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 438 transitions. [2019-11-28 10:05:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 10:05:56,246 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:05:56,247 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-28 10:05:56,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-28 10:05:56,456 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-28 10:05:56,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:05:56,457 INFO L82 PathProgramCache]: Analyzing trace with hash -188809999, now seen corresponding path program 1 times [2019-11-28 10:05:56,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:05:56,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1491707144] [2019-11-28 10:05:56,458 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-28 10:05:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:05:56,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 10:05:56,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:05:56,618 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-28 10:05:56,619 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:05:56,623 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:05:56,624 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:05:56,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-28 10:05:56,704 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-28 10:05:56,705 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:05:56,711 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:05:56,711 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-28 10:05:56,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-11-28 10:05:56,736 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-28 10:05:56,736 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:05:56,967 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-28 10:05:56,973 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-28 10:05:56,974 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-28 10:05:57,009 INFO L588 ElimStorePlain]: treesize reduction 9, result has 62.5 percent of original size [2019-11-28 10:05:57,010 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-28 10:05:57,027 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:05:57,028 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-28 10:05:57,028 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:14, output treesize:15 [2019-11-28 10:05:57,101 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-28 10:05:57,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1491707144] [2019-11-28 10:05:57,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:05:57,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-28 10:05:57,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302998249] [2019-11-28 10:05:57,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 10:05:57,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:05:57,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 10:05:57,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-28 10:05:57,113 INFO L87 Difference]: Start difference. First operand 310 states and 438 transitions. Second operand 15 states. [2019-11-28 10:05:59,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:05:59,258 INFO L93 Difference]: Finished difference Result 420 states and 561 transitions. [2019-11-28 10:05:59,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 10:05:59,259 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2019-11-28 10:05:59,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:05:59,262 INFO L225 Difference]: With dead ends: 420 [2019-11-28 10:05:59,262 INFO L226 Difference]: Without dead ends: 420 [2019-11-28 10:05:59,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2019-11-28 10:05:59,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-11-28 10:05:59,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 330. [2019-11-28 10:05:59,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-11-28 10:05:59,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 468 transitions. [2019-11-28 10:05:59,287 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 468 transitions. Word has length 37 [2019-11-28 10:05:59,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:05:59,288 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 468 transitions. [2019-11-28 10:05:59,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 10:05:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 468 transitions. [2019-11-28 10:05:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 10:05:59,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:05:59,294 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-28 10:05:59,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-28 10:05:59,500 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-28 10:05:59,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:05:59,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1102273563, now seen corresponding path program 1 times [2019-11-28 10:05:59,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:05:59,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121962897] [2019-11-28 10:05:59,502 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-28 10:05:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:05:59,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 10:05:59,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:05:59,647 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-28 10:05:59,647 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:05:59,680 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-28 10:05:59,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121962897] [2019-11-28 10:05:59,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:05:59,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 10:05:59,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998911865] [2019-11-28 10:05:59,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:05:59,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:05:59,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:05:59,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:05:59,683 INFO L87 Difference]: Start difference. First operand 330 states and 468 transitions. Second operand 5 states. [2019-11-28 10:05:59,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:05:59,735 INFO L93 Difference]: Finished difference Result 277 states and 379 transitions. [2019-11-28 10:05:59,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 10:05:59,736 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-11-28 10:05:59,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:05:59,739 INFO L225 Difference]: With dead ends: 277 [2019-11-28 10:05:59,739 INFO L226 Difference]: Without dead ends: 277 [2019-11-28 10:05:59,739 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-28 10:05:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-28 10:05:59,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 264. [2019-11-28 10:05:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-11-28 10:05:59,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 363 transitions. [2019-11-28 10:05:59,749 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 363 transitions. Word has length 37 [2019-11-28 10:05:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:05:59,750 INFO L462 AbstractCegarLoop]: Abstraction has 264 states and 363 transitions. [2019-11-28 10:05:59,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:05:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 363 transitions. [2019-11-28 10:05:59,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 10:05:59,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:05:59,751 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-28 10:05:59,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-28 10:05:59,962 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-28 10:05:59,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:05:59,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1449883398, now seen corresponding path program 1 times [2019-11-28 10:05:59,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:05:59,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183403672] [2019-11-28 10:05:59,964 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-28 10:06:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:06:00,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 10:06:00,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:06:00,105 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-28 10:06:00,105 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:06:00,137 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-28 10:06:00,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183403672] [2019-11-28 10:06:00,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:06:00,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 10:06:00,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534672346] [2019-11-28 10:06:00,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 10:06:00,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:06:00,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 10:06:00,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 10:06:00,138 INFO L87 Difference]: Start difference. First operand 264 states and 363 transitions. Second operand 6 states. [2019-11-28 10:06:00,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:06:00,261 INFO L93 Difference]: Finished difference Result 241 states and 316 transitions. [2019-11-28 10:06:00,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:06:00,265 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-28 10:06:00,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:06:00,266 INFO L225 Difference]: With dead ends: 241 [2019-11-28 10:06:00,267 INFO L226 Difference]: Without dead ends: 241 [2019-11-28 10:06:00,267 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-28 10:06:00,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-28 10:06:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 229. [2019-11-28 10:06:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-11-28 10:06:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 304 transitions. [2019-11-28 10:06:00,277 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 304 transitions. Word has length 37 [2019-11-28 10:06:00,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:06:00,277 INFO L462 AbstractCegarLoop]: Abstraction has 229 states and 304 transitions. [2019-11-28 10:06:00,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 10:06:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 304 transitions. [2019-11-28 10:06:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 10:06:00,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:06:00,278 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-28 10:06:00,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-28 10:06:00,497 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-28 10:06:00,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:06:00,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1559450878, now seen corresponding path program 1 times [2019-11-28 10:06:00,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:06:00,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210785987] [2019-11-28 10:06:00,498 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-28 10:06:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:06:00,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 10:06:00,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:06:00,776 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-28 10:06:00,777 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:06:00,877 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-28 10:06:00,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210785987] [2019-11-28 10:06:00,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:06:00,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 4] imperfect sequences [] total 9 [2019-11-28 10:06:00,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739756839] [2019-11-28 10:06:00,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 10:06:00,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:06:00,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 10:06:00,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-28 10:06:00,879 INFO L87 Difference]: Start difference. First operand 229 states and 304 transitions. Second operand 10 states. [2019-11-28 10:06:01,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:06:01,140 INFO L93 Difference]: Finished difference Result 232 states and 306 transitions. [2019-11-28 10:06:01,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:06:01,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-11-28 10:06:01,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:06:01,145 INFO L225 Difference]: With dead ends: 232 [2019-11-28 10:06:01,145 INFO L226 Difference]: Without dead ends: 230 [2019-11-28 10:06:01,145 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-28 10:06:01,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-28 10:06:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2019-11-28 10:06:01,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-11-28 10:06:01,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 304 transitions. [2019-11-28 10:06:01,161 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 304 transitions. Word has length 38 [2019-11-28 10:06:01,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:06:01,162 INFO L462 AbstractCegarLoop]: Abstraction has 230 states and 304 transitions. [2019-11-28 10:06:01,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 10:06:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 304 transitions. [2019-11-28 10:06:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 10:06:01,164 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:06:01,164 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-28 10:06:01,375 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-28 10:06:01,375 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-28 10:06:01,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:06:01,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2061012070, now seen corresponding path program 1 times [2019-11-28 10:06:01,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:06:01,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24403352] [2019-11-28 10:06:01,376 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-28 10:06:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:06:01,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 10:06:01,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:06:01,536 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-28 10:06:01,536 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:06:01,611 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-28 10:06:01,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24403352] [2019-11-28 10:06:01,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:06:01,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 10:06:01,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561751873] [2019-11-28 10:06:01,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:06:01,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:06:01,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:06:01,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:06:01,613 INFO L87 Difference]: Start difference. First operand 230 states and 304 transitions. Second operand 5 states. [2019-11-28 10:06:01,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:06:01,637 INFO L93 Difference]: Finished difference Result 168 states and 203 transitions. [2019-11-28 10:06:01,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:06:01,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-11-28 10:06:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:06:01,642 INFO L225 Difference]: With dead ends: 168 [2019-11-28 10:06:01,642 INFO L226 Difference]: Without dead ends: 168 [2019-11-28 10:06:01,643 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-28 10:06:01,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-28 10:06:01,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2019-11-28 10:06:01,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-28 10:06:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 198 transitions. [2019-11-28 10:06:01,649 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 198 transitions. Word has length 38 [2019-11-28 10:06:01,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:06:01,649 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 198 transitions. [2019-11-28 10:06:01,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:06:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 198 transitions. [2019-11-28 10:06:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 10:06:01,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:06:01,651 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-28 10:06:01,868 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-28 10:06:01,868 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-28 10:06:01,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:06:01,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1392141398, now seen corresponding path program 1 times [2019-11-28 10:06:01,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:06:01,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736648066] [2019-11-28 10:06:01,869 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-28 10:06:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:06:02,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 10:06:02,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:06:02,134 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-28 10:06:02,134 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:06:02,340 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-28 10:06:02,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736648066] [2019-11-28 10:06:02,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:06:02,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-28 10:06:02,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920618411] [2019-11-28 10:06:02,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 10:06:02,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:06:02,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 10:06:02,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-11-28 10:06:02,342 INFO L87 Difference]: Start difference. First operand 164 states and 198 transitions. Second operand 15 states. [2019-11-28 10:06:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:06:02,727 INFO L93 Difference]: Finished difference Result 183 states and 221 transitions. [2019-11-28 10:06:02,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 10:06:02,728 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2019-11-28 10:06:02,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:06:02,730 INFO L225 Difference]: With dead ends: 183 [2019-11-28 10:06:02,730 INFO L226 Difference]: Without dead ends: 177 [2019-11-28 10:06:02,730 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-28 10:06:02,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-28 10:06:02,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 160. [2019-11-28 10:06:02,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-28 10:06:02,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 192 transitions. [2019-11-28 10:06:02,739 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 192 transitions. Word has length 41 [2019-11-28 10:06:02,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:06:02,740 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 192 transitions. [2019-11-28 10:06:02,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 10:06:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 192 transitions. [2019-11-28 10:06:02,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-28 10:06:02,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:06:02,742 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-28 10:06:02,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-28 10:06:02,956 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-28 10:06:02,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:06:02,957 INFO L82 PathProgramCache]: Analyzing trace with hash -41475270, now seen corresponding path program 2 times [2019-11-28 10:06:02,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:06:02,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682283449] [2019-11-28 10:06:02,958 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-28 10:06:03,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 10:06:03,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:06:03,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 10:06:03,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:06:03,198 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-28 10:06:03,198 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:03,206 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:03,206 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:06:03,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 10:06:03,645 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-28 10:06:03,645 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:06:05,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:06,620 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-28 10:06:06,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682283449] [2019-11-28 10:06:06,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:06:06,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 29 [2019-11-28 10:06:06,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404625461] [2019-11-28 10:06:06,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-28 10:06:06,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:06:06,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-28 10:06:06,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2019-11-28 10:06:06,623 INFO L87 Difference]: Start difference. First operand 160 states and 192 transitions. Second operand 30 states. [2019-11-28 10:06:11,769 WARN L192 SmtUtils]: Spent 838.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2019-11-28 10:06:12,545 WARN L192 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 28 [2019-11-28 10:06:14,251 WARN L192 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2019-11-28 10:06:15,595 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 28 [2019-11-28 10:06:17,793 WARN L192 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-11-28 10:06:19,497 WARN L192 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 27 [2019-11-28 10:06:21,555 WARN L192 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-11-28 10:06:22,794 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-11-28 10:06:24,359 WARN L192 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-11-28 10:06:25,316 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2019-11-28 10:06:25,975 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-28 10:06:26,589 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-11-28 10:06:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:06:28,485 INFO L93 Difference]: Finished difference Result 194 states and 264 transitions. [2019-11-28 10:06:28,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-28 10:06:28,493 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 40 [2019-11-28 10:06:28,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:06:28,494 INFO L225 Difference]: With dead ends: 194 [2019-11-28 10:06:28,495 INFO L226 Difference]: Without dead ends: 194 [2019-11-28 10:06:28,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=746, Invalid=2676, Unknown=0, NotChecked=0, Total=3422 [2019-11-28 10:06:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-28 10:06:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 184. [2019-11-28 10:06:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-28 10:06:28,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 224 transitions. [2019-11-28 10:06:28,512 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 224 transitions. Word has length 40 [2019-11-28 10:06:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:06:28,513 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 224 transitions. [2019-11-28 10:06:28,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-28 10:06:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 224 transitions. [2019-11-28 10:06:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 10:06:28,514 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:06:28,514 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:06:28,715 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-28 10:06:28,716 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-28 10:06:28,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:06:28,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2022535294, now seen corresponding path program 1 times [2019-11-28 10:06:28,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:06:28,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701749045] [2019-11-28 10:06:28,718 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-28 10:06:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:06:28,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 10:06:28,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:06:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 10:06:29,039 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:06:29,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:29,441 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 8 treesize of output 6 [2019-11-28 10:06:29,441 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 10:06:29,456 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:29,456 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-28 10:06:29,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-11-28 10:06:29,641 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:29,641 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 19 treesize of output 23 [2019-11-28 10:06:29,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:29,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:29,643 INFO L508 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 10:06:29,689 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:29,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:29,690 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 10:06:29,691 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:29 [2019-11-28 10:06:29,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:29,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:30,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:30,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:30,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 10:06:31,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701749045] [2019-11-28 10:06:31,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:06:31,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-11-28 10:06:31,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199007179] [2019-11-28 10:06:31,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 10:06:31,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:06:31,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 10:06:31,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-11-28 10:06:31,055 INFO L87 Difference]: Start difference. First operand 184 states and 224 transitions. Second operand 18 states. [2019-11-28 10:06:32,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:06:32,690 INFO L93 Difference]: Finished difference Result 225 states and 270 transitions. [2019-11-28 10:06:32,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 10:06:32,692 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-28 10:06:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:06:32,693 INFO L225 Difference]: With dead ends: 225 [2019-11-28 10:06:32,693 INFO L226 Difference]: Without dead ends: 225 [2019-11-28 10:06:32,693 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-11-28 10:06:32,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-28 10:06:32,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 189. [2019-11-28 10:06:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-28 10:06:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 230 transitions. [2019-11-28 10:06:32,705 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 230 transitions. Word has length 45 [2019-11-28 10:06:32,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:06:32,705 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 230 transitions. [2019-11-28 10:06:32,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 10:06:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 230 transitions. [2019-11-28 10:06:32,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 10:06:32,707 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:06:32,707 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-11-28 10:06:32,917 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-28 10:06:32,919 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, 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-28 10:06:32,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:06:32,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1931424037, now seen corresponding path program 1 times [2019-11-28 10:06:32,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:06:32,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807483387] [2019-11-28 10:06:32,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-28 10:06:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:06:33,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 10:06:33,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:06:33,215 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 10:06:33,215 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:06:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 10:06:33,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807483387] [2019-11-28 10:06:33,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:06:33,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-28 10:06:33,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350346023] [2019-11-28 10:06:33,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 10:06:33,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:06:33,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 10:06:33,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-11-28 10:06:33,448 INFO L87 Difference]: Start difference. First operand 189 states and 230 transitions. Second operand 18 states. [2019-11-28 10:06:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:06:33,997 INFO L93 Difference]: Finished difference Result 223 states and 270 transitions. [2019-11-28 10:06:33,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 10:06:33,999 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 45 [2019-11-28 10:06:33,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:06:34,000 INFO L225 Difference]: With dead ends: 223 [2019-11-28 10:06:34,000 INFO L226 Difference]: Without dead ends: 223 [2019-11-28 10:06:34,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-11-28 10:06:34,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-11-28 10:06:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 208. [2019-11-28 10:06:34,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-28 10:06:34,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 251 transitions. [2019-11-28 10:06:34,007 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 251 transitions. Word has length 45 [2019-11-28 10:06:34,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:06:34,008 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 251 transitions. [2019-11-28 10:06:34,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 10:06:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 251 transitions. [2019-11-28 10:06:34,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 10:06:34,009 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:06:34,009 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:06:34,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-28 10:06:34,227 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, 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-28 10:06:34,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:06:34,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1725914969, now seen corresponding path program 1 times [2019-11-28 10:06:34,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:06:34,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481342640] [2019-11-28 10:06:34,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-28 10:06:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:06:34,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 10:06:34,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:06:34,502 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-28 10:06:34,502 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:34,504 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:34,505 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:06:34,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-11-28 10:06:34,572 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-28 10:06:34,572 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:34,574 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:34,575 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-28 10:06:34,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-28 10:06:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 10:06:34,594 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:06:34,743 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 36 treesize of output 32 [2019-11-28 10:06:34,744 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-28 10:06:34,758 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:34,758 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-28 10:06:34,759 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2019-11-28 10:06:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 10:06:34,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481342640] [2019-11-28 10:06:34,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:06:34,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-11-28 10:06:34,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938708445] [2019-11-28 10:06:34,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 10:06:34,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:06:34,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 10:06:34,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-11-28 10:06:34,915 INFO L87 Difference]: Start difference. First operand 208 states and 251 transitions. Second operand 15 states. [2019-11-28 10:06:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:06:35,669 INFO L93 Difference]: Finished difference Result 284 states and 338 transitions. [2019-11-28 10:06:35,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 10:06:35,670 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 46 [2019-11-28 10:06:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:06:35,672 INFO L225 Difference]: With dead ends: 284 [2019-11-28 10:06:35,672 INFO L226 Difference]: Without dead ends: 284 [2019-11-28 10:06:35,672 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2019-11-28 10:06:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-28 10:06:35,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 250. [2019-11-28 10:06:35,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-11-28 10:06:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 315 transitions. [2019-11-28 10:06:35,680 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 315 transitions. Word has length 46 [2019-11-28 10:06:35,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:06:35,681 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 315 transitions. [2019-11-28 10:06:35,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 10:06:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 315 transitions. [2019-11-28 10:06:35,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 10:06:35,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:06:35,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:06:35,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-28 10:06:35,897 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, 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-28 10:06:35,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:06:35,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1963756035, now seen corresponding path program 1 times [2019-11-28 10:06:35,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:06:35,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138293938] [2019-11-28 10:06:35,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-11-28 10:06:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:06:36,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 10:06:36,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:06:36,225 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-28 10:06:36,226 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:36,241 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:36,242 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-28 10:06:36,242 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:15 [2019-11-28 10:06:36,414 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-28 10:06:36,414 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:36,431 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:36,431 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 10:06:36,432 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:22, output treesize:11 [2019-11-28 10:06:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 10:06:36,491 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:06:36,828 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 36 treesize of output 32 [2019-11-28 10:06:36,829 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 10:06:36,871 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:36,871 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 10:06:36,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2019-11-28 10:06:37,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:06:37,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:37,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:37,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:37,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 10:06:37,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 10:06:37,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138293938] [2019-11-28 10:06:37,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:06:37,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2019-11-28 10:06:37,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122715971] [2019-11-28 10:06:37,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 10:06:37,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:06:37,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 10:06:37,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2019-11-28 10:06:37,289 INFO L87 Difference]: Start difference. First operand 250 states and 315 transitions. Second operand 22 states. [2019-11-28 10:06:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:06:39,900 INFO L93 Difference]: Finished difference Result 283 states and 336 transitions. [2019-11-28 10:06:39,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 10:06:39,904 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2019-11-28 10:06:39,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:06:39,906 INFO L225 Difference]: With dead ends: 283 [2019-11-28 10:06:39,906 INFO L226 Difference]: Without dead ends: 283 [2019-11-28 10:06:39,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2019-11-28 10:06:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-11-28 10:06:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 252. [2019-11-28 10:06:39,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-28 10:06:39,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 317 transitions. [2019-11-28 10:06:39,915 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 317 transitions. Word has length 47 [2019-11-28 10:06:39,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:06:39,916 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 317 transitions. [2019-11-28 10:06:39,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 10:06:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 317 transitions. [2019-11-28 10:06:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 10:06:39,917 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:06:39,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:06:40,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-28 10:06:40,130 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, 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-28 10:06:40,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:06:40,130 INFO L82 PathProgramCache]: Analyzing trace with hash -746894487, now seen corresponding path program 1 times [2019-11-28 10:06:40,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:06:40,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355938278] [2019-11-28 10:06:40,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-11-28 10:06:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:06:40,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 10:06:40,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:06:40,302 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-28 10:06:40,302 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:40,305 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:40,305 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:06:40,305 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:06:40,354 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-28 10:06:40,354 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:40,360 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:40,360 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:06:40,360 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:11 [2019-11-28 10:06:40,445 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 19 treesize of output 11 [2019-11-28 10:06:40,445 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:40,447 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:40,447 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-28 10:06:40,447 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-11-28 10:06:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 10:06:40,464 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:06:40,638 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 40 treesize of output 36 [2019-11-28 10:06:40,638 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 10:06:40,672 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:40,673 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 10:06:40,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:36 [2019-11-28 10:06:41,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 10:06:41,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355938278] [2019-11-28 10:06:41,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:06:41,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2019-11-28 10:06:41,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420753496] [2019-11-28 10:06:41,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-28 10:06:41,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:06:41,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-28 10:06:41,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-11-28 10:06:41,054 INFO L87 Difference]: Start difference. First operand 252 states and 317 transitions. Second operand 15 states. [2019-11-28 10:06:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:06:42,121 INFO L93 Difference]: Finished difference Result 256 states and 321 transitions. [2019-11-28 10:06:42,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 10:06:42,121 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2019-11-28 10:06:42,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:06:42,122 INFO L225 Difference]: With dead ends: 256 [2019-11-28 10:06:42,123 INFO L226 Difference]: Without dead ends: 256 [2019-11-28 10:06:42,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-11-28 10:06:42,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-28 10:06:42,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 231. [2019-11-28 10:06:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-28 10:06:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 289 transitions. [2019-11-28 10:06:42,130 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 289 transitions. Word has length 48 [2019-11-28 10:06:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:06:42,131 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 289 transitions. [2019-11-28 10:06:42,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-28 10:06:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 289 transitions. [2019-11-28 10:06:42,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-28 10:06:42,132 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:06:42,132 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 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] [2019-11-28 10:06:42,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-28 10:06:42,345 INFO L410 AbstractCegarLoop]: === Iteration 24 === [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-28 10:06:42,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:06:42,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1961189369, now seen corresponding path program 2 times [2019-11-28 10:06:42,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:06:42,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1538585315] [2019-11-28 10:06:42,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 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-11-28 10:06:42,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 10:06:42,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:06:42,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-28 10:06:42,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:06:42,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 10:06:42,574 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:42,583 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:42,586 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-28 10:06:42,586 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:42,594 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:42,594 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:06:42,594 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-28 10:06:45,266 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:45,266 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 11 treesize of output 15 [2019-11-28 10:06:45,267 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:45,326 INFO L588 ElimStorePlain]: treesize reduction 3, result has 92.7 percent of original size [2019-11-28 10:06:45,331 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 21 treesize of output 21 [2019-11-28 10:06:45,332 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:45,362 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:45,363 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-28 10:06:45,363 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:47, output treesize:28 [2019-11-28 10:06:45,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:06:45,597 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 21 treesize of output 21 [2019-11-28 10:06:45,598 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:45,672 INFO L588 ElimStorePlain]: treesize reduction 3, result has 93.8 percent of original size [2019-11-28 10:06:45,687 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:45,688 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 11 treesize of output 15 [2019-11-28 10:06:45,688 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:45,720 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:45,721 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-28 10:06:45,721 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:30 [2019-11-28 10:06:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 10:06:45,814 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:06:46,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:46,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:46,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:46,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:51,682 WARN L192 SmtUtils]: Spent 4.38 s on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-11-28 10:06:51,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:59,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:06:59,223 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:59,223 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-28 10:06:59,224 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:59,247 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:59,248 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-28 10:06:59,248 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 10:06:59,299 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:06:59,300 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-28 10:06:59,301 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:53, output treesize:31 [2019-11-28 10:06:59,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:07:00,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:07:00,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:07:00,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:07:12,831 WARN L192 SmtUtils]: Spent 5.63 s on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-11-28 10:07:12,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:07:21,717 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-11-28 10:07:24,912 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_446|], 2=[|v_#length_393|]} [2019-11-28 10:07:24,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:07:24,916 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:07:24,917 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:07:24,917 INFO L476 ElimStorePlain]: Eliminatee |v_#length_393| vanished before elimination [2019-11-28 10:07:24,917 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-28 10:07:24,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:1 [2019-11-28 10:07:24,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:07:25,663 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-28 10:07:26,047 INFO L404 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-28 10:07:26,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:07:26,056 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:07:26,057 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:07:26,057 INFO L476 ElimStorePlain]: Eliminatee |#length| vanished before elimination [2019-11-28 10:07:26,057 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:07:26,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:34, output treesize:1 [2019-11-28 10:07:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:07:26,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1538585315] [2019-11-28 10:07:26,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:07:26,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2019-11-28 10:07:26,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636756339] [2019-11-28 10:07:26,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-28 10:07:26,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:07:26,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-28 10:07:26,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1266, Unknown=8, NotChecked=0, Total=1406 [2019-11-28 10:07:26,103 INFO L87 Difference]: Start difference. First operand 231 states and 289 transitions. Second operand 38 states. [2019-11-28 10:07:42,341 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#t~malloc12.base_134| (_ BitVec 32)) (v_alloc_17_~i~0_BEFORE_CALL_18 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_14 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32)) (v_ldv_malloc_~size_132 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_16 (_ BitVec 32))) (let ((.cse1 (bvmul v_alloc_17_~i~0_BEFORE_CALL_18 (_ bv4 32)))) (let ((.cse0 (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_14 (_ bv8 32)))) (or (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_134|) (_ bv0 1))) (bvule .cse0 (select (store (store |c_#length| |v_ldv_malloc_#t~malloc12.base_134| ldv_malloc_~size) v_prenex_14 v_ldv_malloc_~size_132) v_alloc_17_~array.base_BEFORE_CALL_16)) (not (bvule (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_14 (_ bv4 32)) .cse0)) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_18 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_14 (_ bv8 32)) (select (store |c_old(#length)| v_prenex_15 v_prenex_16) v_alloc_17_~array.base_BEFORE_CALL_16))) (= (select |c_old(#valid)| v_prenex_15) (_ bv0 1)))) (= v_prenex_14 v_alloc_17_~array.base_BEFORE_CALL_16))))) (forall ((v_alloc_17_~i~0_BEFORE_CALL_18 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_14 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32)) (v_ldv_malloc_~size_132 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_16 (_ BitVec 32))) (let ((.cse2 (bvmul v_alloc_17_~i~0_BEFORE_CALL_18 (_ bv4 32)))) (let ((.cse3 (bvadd .cse2 v_alloc_17_~array.offset_BEFORE_CALL_14 (_ bv8 32)))) (or (not (bvule (bvadd .cse2 v_alloc_17_~array.offset_BEFORE_CALL_14 (_ bv4 32)) .cse3)) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_18 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_14 (_ bv8 32)) (select (store |c_old(#length)| v_prenex_15 v_prenex_16) v_alloc_17_~array.base_BEFORE_CALL_16))) (= (select |c_old(#valid)| v_prenex_15) (_ bv0 1)))) (bvule .cse3 (select (store |c_#length| v_prenex_14 v_ldv_malloc_~size_132) v_alloc_17_~array.base_BEFORE_CALL_16)) (= v_prenex_14 v_alloc_17_~array.base_BEFORE_CALL_16))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= (_ bv0 32) |c_ldv_malloc_#res.offset|) (= (bvadd (select |c_#valid| |c_ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1)) (exists ((|v_ldv_malloc_#t~malloc12.base_129| (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_129|))) (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|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (forall ((v_alloc_17_~i~0_BEFORE_CALL_17 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_13 (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_15 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_130| (_ BitVec 32))) (let ((.cse5 (bvmul v_alloc_17_~i~0_BEFORE_CALL_17 (_ bv4 32)))) (let ((.cse4 (bvadd .cse5 v_alloc_17_~array.offset_BEFORE_CALL_13 (_ bv4 32)))) (or (exists ((|v_ldv_malloc_#t~malloc12.base_129| (_ BitVec 32)) (v_ldv_malloc_~size_132 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_129|)) (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_17 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_13 (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_129| v_ldv_malloc_~size_132) v_alloc_17_~array.base_BEFORE_CALL_15))))) (bvule .cse4 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_130| ldv_malloc_~size) v_alloc_17_~array.base_BEFORE_CALL_15)) (not (bvule (bvadd .cse5 v_alloc_17_~array.offset_BEFORE_CALL_13) .cse4)) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_130|) (_ bv0 1)))))))) is different from false [2019-11-28 10:08:07,020 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 25 [2019-11-28 10:08:09,555 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd (select |c_#valid| |c_entry_point_#t~ret45.base|) (_ bv1 1)) (_ bv0 1)) (bvslt c_entry_point_~len~0 (_ bv16777216 32)) (forall ((v_alloc_17_~i~0_BEFORE_CALL_18 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_14 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32)) (v_ldv_malloc_~size_132 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_16 (_ BitVec 32))) (let ((.cse0 (bvmul v_alloc_17_~i~0_BEFORE_CALL_18 (_ bv4 32)))) (let ((.cse1 (bvadd .cse0 v_alloc_17_~array.offset_BEFORE_CALL_14 (_ bv8 32)))) (or (not (bvule (bvadd .cse0 v_alloc_17_~array.offset_BEFORE_CALL_14 (_ bv4 32)) .cse1)) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_18 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_14 (_ bv8 32)) (select (store |c_old(#length)| v_prenex_15 v_prenex_16) v_alloc_17_~array.base_BEFORE_CALL_16))) (= (select |c_old(#valid)| v_prenex_15) (_ bv0 1)))) (bvule .cse1 (select (store |c_#length| v_prenex_14 v_ldv_malloc_~size_132) v_alloc_17_~array.base_BEFORE_CALL_16)) (= v_prenex_14 v_alloc_17_~array.base_BEFORE_CALL_16))))) (exists ((|v_ldv_malloc_#t~malloc12.base_129| (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_129|))) (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|))) (bvsgt c_entry_point_~len~0 (_ bv0 32)) (= |c_entry_point_#t~ret45.offset| (_ bv0 32)) (= (bvmul (_ bv4 32) c_entry_point_~len~0) (select |c_#length| |c_entry_point_#t~ret45.base|))) is different from false [2019-11-28 10:08:19,639 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-28 10:08:23,531 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-11-28 10:08:29,407 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-28 10:08:50,390 WARN L192 SmtUtils]: Spent 2.99 s on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-28 10:09:15,414 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-28 10:09:22,864 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2019-11-28 10:09:39,998 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-28 10:09:41,915 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-11-28 10:09:54,253 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-28 10:10:09,481 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_alloc_17_~i~0_BEFORE_CALL_18 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_14 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32)) (v_ldv_malloc_~size_132 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_16 (_ BitVec 32))) (let ((.cse0 (bvmul v_alloc_17_~i~0_BEFORE_CALL_18 (_ bv4 32)))) (let ((.cse1 (bvadd .cse0 v_alloc_17_~array.offset_BEFORE_CALL_14 (_ bv8 32)))) (or (not (bvule (bvadd .cse0 v_alloc_17_~array.offset_BEFORE_CALL_14 (_ bv4 32)) .cse1)) (exists ((v_prenex_15 (_ BitVec 32)) (v_prenex_16 (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_18 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_14 (_ bv8 32)) (select (store |c_old(#length)| v_prenex_15 v_prenex_16) v_alloc_17_~array.base_BEFORE_CALL_16))) (= (select |c_old(#valid)| v_prenex_15) (_ bv0 1)))) (bvule .cse1 (select (store |c_#length| v_prenex_14 v_ldv_malloc_~size_132) v_alloc_17_~array.base_BEFORE_CALL_16)) (= v_prenex_14 v_alloc_17_~array.base_BEFORE_CALL_16))))) (exists ((|v_ldv_malloc_#t~malloc12.base_129| (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_129|))) (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|))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#length)| |c_#length|)) is different from false [2019-11-28 10:10:42,821 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 10:10:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:10:47,934 INFO L93 Difference]: Finished difference Result 315 states and 381 transitions. [2019-11-28 10:10:47,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-28 10:10:47,948 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 48 [2019-11-28 10:10:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:10:47,950 INFO L225 Difference]: With dead ends: 315 [2019-11-28 10:10:47,950 INFO L226 Difference]: Without dead ends: 315 [2019-11-28 10:10:47,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 109.7s TimeCoverageRelationStatistics Valid=330, Invalid=3080, Unknown=24, NotChecked=348, Total=3782 [2019-11-28 10:10:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-28 10:10:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 234. [2019-11-28 10:10:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-28 10:10:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 292 transitions. [2019-11-28 10:10:47,959 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 292 transitions. Word has length 48 [2019-11-28 10:10:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:10:47,960 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 292 transitions. [2019-11-28 10:10:47,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-28 10:10:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 292 transitions. [2019-11-28 10:10:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 10:10:47,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:10:47,961 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:10:48,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-11-28 10:10:48,162 INFO L410 AbstractCegarLoop]: === Iteration 25 === [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-28 10:10:48,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:10:48,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1870553237, now seen corresponding path program 1 times [2019-11-28 10:10:48,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:10:48,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658406447] [2019-11-28 10:10:48,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-11-28 10:10:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:10:48,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 10:10:48,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:10:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 10:10:48,499 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:10:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 10:10:48,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658406447] [2019-11-28 10:10:48,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:10:48,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2019-11-28 10:10:48,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968706218] [2019-11-28 10:10:48,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 10:10:48,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:10:48,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 10:10:48,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-11-28 10:10:48,738 INFO L87 Difference]: Start difference. First operand 234 states and 292 transitions. Second operand 18 states. [2019-11-28 10:10:49,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:10:49,272 INFO L93 Difference]: Finished difference Result 252 states and 310 transitions. [2019-11-28 10:10:49,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 10:10:49,274 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-11-28 10:10:49,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:10:49,276 INFO L225 Difference]: With dead ends: 252 [2019-11-28 10:10:49,276 INFO L226 Difference]: Without dead ends: 252 [2019-11-28 10:10:49,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2019-11-28 10:10:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-11-28 10:10:49,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2019-11-28 10:10:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-11-28 10:10:49,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 304 transitions. [2019-11-28 10:10:49,285 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 304 transitions. Word has length 50 [2019-11-28 10:10:49,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:10:49,285 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 304 transitions. [2019-11-28 10:10:49,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 10:10:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 304 transitions. [2019-11-28 10:10:49,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 10:10:49,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:10:49,287 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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-28 10:10:49,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-11-28 10:10:49,508 INFO L410 AbstractCegarLoop]: === Iteration 26 === [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-28 10:10:49,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:10:49,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1764542414, now seen corresponding path program 1 times [2019-11-28 10:10:49,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:10:49,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401141051] [2019-11-28 10:10:49,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-11-28 10:10:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:10:49,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 10:10:49,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:10:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 10:10:49,810 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:10:50,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:10:50,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:10:50,335 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 11 treesize of output 9 [2019-11-28 10:10:50,335 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 10:10:50,374 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:10:50,375 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-28 10:10:50,375 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-11-28 10:10:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 10:10:50,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401141051] [2019-11-28 10:10:50,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:10:50,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2019-11-28 10:10:50,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361920559] [2019-11-28 10:10:50,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 10:10:50,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:10:50,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 10:10:50,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-11-28 10:10:50,976 INFO L87 Difference]: Start difference. First operand 246 states and 304 transitions. Second operand 20 states. [2019-11-28 10:10:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:10:54,916 INFO L93 Difference]: Finished difference Result 257 states and 305 transitions. [2019-11-28 10:10:54,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 10:10:54,918 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2019-11-28 10:10:54,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:10:54,919 INFO L225 Difference]: With dead ends: 257 [2019-11-28 10:10:54,919 INFO L226 Difference]: Without dead ends: 257 [2019-11-28 10:10:54,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2019-11-28 10:10:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-28 10:10:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 235. [2019-11-28 10:10:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-11-28 10:10:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 288 transitions. [2019-11-28 10:10:54,928 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 288 transitions. Word has length 50 [2019-11-28 10:10:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:10:54,929 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 288 transitions. [2019-11-28 10:10:54,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 10:10:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 288 transitions. [2019-11-28 10:10:54,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 10:10:54,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:10:54,930 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1] [2019-11-28 10:10:55,147 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-11-28 10:10:55,148 INFO L410 AbstractCegarLoop]: === Iteration 27 === [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-28 10:10:55,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:10:55,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1133760208, now seen corresponding path program 1 times [2019-11-28 10:10:55,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:10:55,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972303905] [2019-11-28 10:10:55,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-11-28 10:10:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:10:55,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 10:10:55,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:10:55,328 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 15 treesize of output 11 [2019-11-28 10:10:55,328 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:10:55,336 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:10:55,337 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:10:55,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-28 10:10:55,422 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-28 10:10:55,422 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:10:55,423 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:10:55,424 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-28 10:10:55,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-28 10:10:55,438 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 10:10:55,438 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:10:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 10:10:55,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972303905] [2019-11-28 10:10:55,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:10:55,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-28 10:10:55,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296681340] [2019-11-28 10:10:55,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 10:10:55,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:10:55,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 10:10:55,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-28 10:10:55,590 INFO L87 Difference]: Start difference. First operand 235 states and 288 transitions. Second operand 16 states. [2019-11-28 10:10:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:10:57,154 INFO L93 Difference]: Finished difference Result 262 states and 310 transitions. [2019-11-28 10:10:57,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 10:10:57,156 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2019-11-28 10:10:57,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:10:57,157 INFO L225 Difference]: With dead ends: 262 [2019-11-28 10:10:57,157 INFO L226 Difference]: Without dead ends: 262 [2019-11-28 10:10:57,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 10:10:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-28 10:10:57,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 237. [2019-11-28 10:10:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-11-28 10:10:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 290 transitions. [2019-11-28 10:10:57,164 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 290 transitions. Word has length 51 [2019-11-28 10:10:57,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:10:57,164 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 290 transitions. [2019-11-28 10:10:57,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 10:10:57,165 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 290 transitions. [2019-11-28 10:10:57,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 10:10:57,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:10:57,166 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1] [2019-11-28 10:10:57,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-11-28 10:10:57,375 INFO L410 AbstractCegarLoop]: === Iteration 28 === [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-28 10:10:57,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:10:57,375 INFO L82 PathProgramCache]: Analyzing trace with hash 786828369, now seen corresponding path program 1 times [2019-11-28 10:10:57,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:10:57,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349149111] [2019-11-28 10:10:57,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-11-28 10:10:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:10:57,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 10:10:57,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:10:57,679 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 15 treesize of output 11 [2019-11-28 10:10:57,679 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:10:57,700 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:10:57,700 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-28 10:10:57,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:22 [2019-11-28 10:10:57,919 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-28 10:10:57,919 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:10:57,931 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:10:57,932 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 10:10:57,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:22, output treesize:11 [2019-11-28 10:10:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 10:10:57,988 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:10:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-28 10:10:58,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349149111] [2019-11-28 10:10:58,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:10:58,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2019-11-28 10:10:58,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180741000] [2019-11-28 10:10:58,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 10:10:58,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:10:58,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 10:10:58,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-11-28 10:10:58,328 INFO L87 Difference]: Start difference. First operand 237 states and 290 transitions. Second operand 20 states. [2019-11-28 10:11:05,801 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-11-28 10:11:06,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:06,216 INFO L93 Difference]: Finished difference Result 262 states and 309 transitions. [2019-11-28 10:11:06,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 10:11:06,218 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 52 [2019-11-28 10:11:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:06,221 INFO L225 Difference]: With dead ends: 262 [2019-11-28 10:11:06,221 INFO L226 Difference]: Without dead ends: 262 [2019-11-28 10:11:06,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=268, Invalid=1137, Unknown=1, NotChecked=0, Total=1406 [2019-11-28 10:11:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-28 10:11:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 241. [2019-11-28 10:11:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-28 10:11:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 293 transitions. [2019-11-28 10:11:06,229 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 293 transitions. Word has length 52 [2019-11-28 10:11:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:06,229 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 293 transitions. [2019-11-28 10:11:06,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 10:11:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 293 transitions. [2019-11-28 10:11:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 10:11:06,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:06,231 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 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, 1, 1, 1] [2019-11-28 10:11:06,442 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-11-28 10:11:06,442 INFO L410 AbstractCegarLoop]: === Iteration 29 === [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-28 10:11:06,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:06,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1378124046, now seen corresponding path program 1 times [2019-11-28 10:11:06,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:11:06,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263225487] [2019-11-28 10:11:06,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-11-28 10:11:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:06,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 10:11:06,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:11:06,614 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-28 10:11:06,614 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:11:06,618 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:11:06,618 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:11:06,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:11:06,646 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 15 treesize of output 11 [2019-11-28 10:11:06,647 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:11:06,659 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:11:06,659 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:11:06,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-28 10:11:06,709 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 11 treesize of output 5 [2019-11-28 10:11:06,710 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:11:06,712 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:11:06,712 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:11:06,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-28 10:11:06,765 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 19 treesize of output 11 [2019-11-28 10:11:06,765 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:11:06,767 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:11:06,768 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-28 10:11:06,768 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-11-28 10:11:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 10:11:06,799 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:11:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 10:11:07,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263225487] [2019-11-28 10:11:07,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:11:07,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2019-11-28 10:11:07,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442360212] [2019-11-28 10:11:07,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 10:11:07,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:11:07,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 10:11:07,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-11-28 10:11:07,068 INFO L87 Difference]: Start difference. First operand 241 states and 293 transitions. Second operand 17 states. [2019-11-28 10:11:15,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:15,275 INFO L93 Difference]: Finished difference Result 261 states and 314 transitions. [2019-11-28 10:11:15,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 10:11:15,277 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2019-11-28 10:11:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:15,279 INFO L225 Difference]: With dead ends: 261 [2019-11-28 10:11:15,279 INFO L226 Difference]: Without dead ends: 261 [2019-11-28 10:11:15,280 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=755, Unknown=0, NotChecked=0, Total=870 [2019-11-28 10:11:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-28 10:11:15,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 243. [2019-11-28 10:11:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-11-28 10:11:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 295 transitions. [2019-11-28 10:11:15,287 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 295 transitions. Word has length 53 [2019-11-28 10:11:15,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:15,288 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 295 transitions. [2019-11-28 10:11:15,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 10:11:15,288 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 295 transitions. [2019-11-28 10:11:15,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 10:11:15,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:15,289 INFO L410 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:15,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-11-28 10:11:15,508 INFO L410 AbstractCegarLoop]: === Iteration 30 === [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-28 10:11:15,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:15,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2111285695, now seen corresponding path program 2 times [2019-11-28 10:11:15,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:11:15,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353674497] [2019-11-28 10:11:15,510 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 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2019-11-28 10:11:15,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 10:11:15,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:11:15,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 10:11:15,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:11:15,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-28 10:11:15,828 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:11:15,840 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:11:15,840 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:11:15,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-28 10:11:15,914 INFO L343 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-28 10:11:15,914 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 21 treesize of output 20 [2019-11-28 10:11:15,915 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:11:15,928 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:11:15,929 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:11:15,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-28 10:11:16,047 INFO L343 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-28 10:11:16,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-28 10:11:16,048 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:11:16,055 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:11:16,055 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:11:16,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:13 [2019-11-28 10:11:16,082 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 12 treesize of output 14 [2019-11-28 10:11:16,083 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:11:16,093 INFO L588 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-28 10:11:16,093 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:11:16,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2019-11-28 10:11:16,123 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 10:11:16,123 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:11:16,243 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 25 treesize of output 21 [2019-11-28 10:11:16,244 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:11:16,246 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:11:16,246 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:11:16,246 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:8 [2019-11-28 10:11:16,451 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 23 treesize of output 21 [2019-11-28 10:11:16,455 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 74 treesize of output 72 [2019-11-28 10:11:16,455 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-28 10:11:16,513 INFO L588 ElimStorePlain]: treesize reduction 46, result has 31.3 percent of original size [2019-11-28 10:11:16,513 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-11-28 10:11:16,524 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:11:16,524 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-28 10:11:16,525 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:21 [2019-11-28 10:11:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 10:11:16,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353674497] [2019-11-28 10:11:16,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:11:16,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2019-11-28 10:11:16,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096112378] [2019-11-28 10:11:16,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 10:11:16,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:11:16,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 10:11:16,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-11-28 10:11:16,605 INFO L87 Difference]: Start difference. First operand 243 states and 295 transitions. Second operand 23 states. [2019-11-28 10:11:21,742 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2019-11-28 10:11:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:11:31,692 INFO L93 Difference]: Finished difference Result 316 states and 371 transitions. [2019-11-28 10:11:31,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-28 10:11:31,693 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-28 10:11:31,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:11:31,695 INFO L225 Difference]: With dead ends: 316 [2019-11-28 10:11:31,696 INFO L226 Difference]: Without dead ends: 316 [2019-11-28 10:11:31,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=338, Invalid=2014, Unknown=0, NotChecked=0, Total=2352 [2019-11-28 10:11:31,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-11-28 10:11:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 266. [2019-11-28 10:11:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-28 10:11:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 327 transitions. [2019-11-28 10:11:31,704 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 327 transitions. Word has length 53 [2019-11-28 10:11:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:11:31,704 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 327 transitions. [2019-11-28 10:11:31,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 10:11:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 327 transitions. [2019-11-28 10:11:31,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 10:11:31,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:11:31,706 INFO L410 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:11:31,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2019-11-28 10:11:31,915 INFO L410 AbstractCegarLoop]: === Iteration 31 === [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-28 10:11:31,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:11:31,915 INFO L82 PathProgramCache]: Analyzing trace with hash 2111285696, now seen corresponding path program 1 times [2019-11-28 10:11:31,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:11:31,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855618910] [2019-11-28 10:11:31,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-11-28 10:11:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:11:32,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-28 10:11:32,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:11:32,137 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-28 10:11:32,138 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:11:32,146 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:11:32,147 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:11:32,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 10:11:32,587 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:11:32,587 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:11:33,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:11:33,598 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2019-11-28 10:11:33,600 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.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) 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-28 10:11:33,605 INFO L168 Benchmark]: Toolchain (without parser) took 512308.51 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 269.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -177.6 MB). Peak memory consumption was 91.3 MB. Max. memory is 11.5 GB. [2019-11-28 10:11:33,606 INFO L168 Benchmark]: CDTParser took 0.38 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-28 10:11:33,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1088.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -130.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 10:11:33,607 INFO L168 Benchmark]: Boogie Preprocessor took 124.39 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 10:11:33,607 INFO L168 Benchmark]: RCFGBuilder took 1742.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 961.3 MB in the end (delta: 119.2 MB). Peak memory consumption was 119.2 MB. Max. memory is 11.5 GB. [2019-11-28 10:11:33,608 INFO L168 Benchmark]: TraceAbstraction took 509348.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.5 MB). Free memory was 961.3 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 10:11:33,610 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.38 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 1088.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -130.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 124.39 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1742.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 961.3 MB in the end (delta: 119.2 MB). Peak memory consumption was 119.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 509348.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 129.5 MB). Free memory was 961.3 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). There was no memory consumed. 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...