./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7c71bc25 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9181148b15e14afa3f85d7f56edfe966974a0845 ............................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9181148b15e14afa3f85d7f56edfe966974a0845 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-7c71bc2 [2019-11-25 13:52:35,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:52:35,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:52:35,380 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:52:35,380 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:52:35,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:52:35,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:52:35,385 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:52:35,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:52:35,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:52:35,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:52:35,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:52:35,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:52:35,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:52:35,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:52:35,395 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:52:35,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:52:35,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:52:35,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:52:35,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:52:35,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:52:35,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:52:35,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:52:35,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:52:35,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:52:35,421 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:52:35,421 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:52:35,424 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:52:35,425 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:52:35,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:52:35,426 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:52:35,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:52:35,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:52:35,431 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:52:35,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:52:35,433 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:52:35,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:52:35,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:52:35,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:52:35,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:52:35,441 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:52:35,442 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-25 13:52:35,473 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:52:35,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:52:35,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:52:35,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:52:35,476 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:52:35,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:52:35,476 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 13:52:35,477 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:52:35,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:52:35,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 13:52:35,478 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:52:35,479 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:52:35,479 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:52:35,479 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:52:35,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:52:35,480 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:52:35,480 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 13:52:35,481 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:52:35,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:52:35,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:52:35,481 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:52:35,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:52:35,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:52:35,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:52:35,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:52:35,483 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 13:52:35,483 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 13:52:35,483 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 -> 9181148b15e14afa3f85d7f56edfe966974a0845 [2019-11-25 13:52:35,792 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:52:35,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:52:35,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:52:35,810 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:52:35,811 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:52:35,812 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-25 13:52:35,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d616866/80314943e3b54add9272609ca41330f9/FLAGcbe202d60 [2019-11-25 13:52:36,469 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:52:36,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-25 13:52:36,487 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d616866/80314943e3b54add9272609ca41330f9/FLAGcbe202d60 [2019-11-25 13:52:36,738 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68d616866/80314943e3b54add9272609ca41330f9 [2019-11-25 13:52:36,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:52:36,744 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:52:36,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:52:36,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:52:36,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:52:36,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:52:36" (1/1) ... [2019-11-25 13:52:36,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf693b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:36, skipping insertion in model container [2019-11-25 13:52:36,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:52:36" (1/1) ... [2019-11-25 13:52:36,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:52:36,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:52:37,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:52:37,443 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-11-25 13:52:37,444 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7c59a9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:37, skipping insertion in model container [2019-11-25 13:52:37,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:52:37,445 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-25 13:52:37,449 INFO L168 Benchmark]: Toolchain (without parser) took 703.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-25 13:52:37,451 INFO L168 Benchmark]: CDTParser took 0.27 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-25 13:52:37,452 INFO L168 Benchmark]: CACSL2BoogieTranslator took 700.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-25 13:52:37,457 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.27 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 700.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 577]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-7c71bc2 [2019-11-25 13:52:39,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:52:39,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:52:39,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:52:39,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:52:39,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:52:39,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:52:39,328 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:52:39,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:52:39,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:52:39,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:52:39,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:52:39,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:52:39,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:52:39,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:52:39,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:52:39,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:52:39,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:52:39,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:52:39,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:52:39,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:52:39,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:52:39,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:52:39,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:52:39,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:52:39,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:52:39,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:52:39,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:52:39,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:52:39,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:52:39,356 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:52:39,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:52:39,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:52:39,358 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:52:39,359 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:52:39,360 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:52:39,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:52:39,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:52:39,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:52:39,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:52:39,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:52:39,364 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-25 13:52:39,379 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:52:39,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:52:39,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:52:39,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:52:39,382 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:52:39,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:52:39,382 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 13:52:39,383 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:52:39,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:52:39,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 13:52:39,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:52:39,384 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:52:39,384 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:52:39,384 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:52:39,385 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:52:39,385 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:52:39,385 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 13:52:39,385 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 13:52:39,386 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 13:52:39,386 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:52:39,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:52:39,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:52:39,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:52:39,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:52:39,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:52:39,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:52:39,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:52:39,388 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 13:52:39,389 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 13:52:39,389 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 13:52:39,389 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 -> 9181148b15e14afa3f85d7f56edfe966974a0845 [2019-11-25 13:52:39,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:52:39,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:52:39,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:52:39,751 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:52:39,751 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:52:39,752 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-25 13:52:39,829 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2976533/f7fb194e6ea44c25bc602095abcfded3/FLAGd84f965af [2019-11-25 13:52:40,401 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:52:40,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_1-1.i [2019-11-25 13:52:40,417 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2976533/f7fb194e6ea44c25bc602095abcfded3/FLAGd84f965af [2019-11-25 13:52:40,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b2976533/f7fb194e6ea44c25bc602095abcfded3 [2019-11-25 13:52:40,708 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:52:40,710 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:52:40,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:52:40,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:52:40,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:52:40,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:52:40" (1/1) ... [2019-11-25 13:52:40,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7109c780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:40, skipping insertion in model container [2019-11-25 13:52:40,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:52:40" (1/1) ... [2019-11-25 13:52:40,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:52:40,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:52:41,262 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:52:41,285 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-25 13:52:41,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:52:41,393 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:52:41,403 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 13:52:41,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:52:41,567 INFO L208 MainTranslator]: Completed translation [2019-11-25 13:52:41,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:41 WrapperNode [2019-11-25 13:52:41,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:52:41,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 13:52:41,569 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 13:52:41,569 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 13:52:41,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:41" (1/1) ... [2019-11-25 13:52:41,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:41" (1/1) ... [2019-11-25 13:52:41,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:41" (1/1) ... [2019-11-25 13:52:41,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:41" (1/1) ... [2019-11-25 13:52:41,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:41" (1/1) ... [2019-11-25 13:52:41,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:41" (1/1) ... [2019-11-25 13:52:41,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:41" (1/1) ... [2019-11-25 13:52:41,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 13:52:41,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 13:52:41,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 13:52:41,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 13:52:41,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:52:41,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 13:52:41,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 13:52:41,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:52:41,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:52:41,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 13:52:41,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 13:52:41,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-25 13:52:41,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-25 13:52:41,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-25 13:52:41,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-25 13:52:41,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-25 13:52:41,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-25 13:52:41,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-25 13:52:41,772 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-25 13:52:41,772 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-25 13:52:41,773 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-25 13:52:41,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-25 13:52:41,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-25 13:52:41,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-25 13:52:41,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-25 13:52:41,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-25 13:52:41,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-25 13:52:41,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-25 13:52:41,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-25 13:52:41,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-25 13:52:41,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-25 13:52:41,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-25 13:52:41,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-25 13:52:41,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-25 13:52:41,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-25 13:52:41,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-25 13:52:41,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-25 13:52:41,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-25 13:52:41,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-25 13:52:41,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-25 13:52:41,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-25 13:52:41,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-25 13:52:41,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-25 13:52:41,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-25 13:52:41,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-25 13:52:41,783 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-25 13:52:41,783 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-25 13:52:41,783 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-25 13:52:41,784 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 13:52:41,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-25 13:52:41,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 13:52:41,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-25 13:52:41,785 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 13:52:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 13:52:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 13:52:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 13:52:41,786 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 13:52:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 13:52:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 13:52:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 13:52:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 13:52:41,788 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 13:52:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 13:52:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 13:52:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 13:52:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 13:52:41,789 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 13:52:41,790 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 13:52:41,791 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 13:52:41,791 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 13:52:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-25 13:52:41,792 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-25 13:52:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-25 13:52:41,793 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 13:52:41,795 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 13:52:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 13:52:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 13:52:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 13:52:41,796 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 13:52:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 13:52:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 13:52:41,797 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 13:52:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 13:52:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 13:52:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 13:52:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 13:52:41,798 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 13:52:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 13:52:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 13:52:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 13:52:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 13:52:41,799 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 13:52:41,800 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 13:52:41,800 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 13:52:41,800 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 13:52:41,800 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 13:52:41,800 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 13:52:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 13:52:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 13:52:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 13:52:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 13:52:41,801 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 13:52:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 13:52:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 13:52:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 13:52:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 13:52:41,802 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 13:52:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 13:52:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 13:52:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 13:52:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 13:52:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 13:52:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 13:52:41,804 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 13:52:41,804 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 13:52:41,808 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 13:52:41,808 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 13:52:41,808 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 13:52:41,809 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 13:52:41,809 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 13:52:41,809 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 13:52:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 13:52:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 13:52:41,810 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 13:52:41,811 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 13:52:41,811 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 13:52:41,811 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 13:52:41,811 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 13:52:41,811 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 13:52:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 13:52:41,812 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 13:52:41,813 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 13:52:41,817 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 13:52:41,817 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 13:52:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 13:52:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 13:52:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 13:52:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 13:52:41,818 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 13:52:41,819 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 13:52:41,819 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 13:52:41,819 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 13:52:41,819 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 13:52:41,820 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 13:52:41,829 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 13:52:41,829 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 13:52:41,829 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 13:52:41,830 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 13:52:41,830 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 13:52:41,830 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 13:52:41,830 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 13:52:41,830 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 13:52:41,831 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 13:52:41,832 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 13:52:41,832 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 13:52:41,832 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 13:52:41,833 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 13:52:41,833 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 13:52:41,833 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 13:52:41,833 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-25 13:52:41,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 13:52:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-25 13:52:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-25 13:52:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-25 13:52:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-25 13:52:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-25 13:52:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-25 13:52:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 13:52:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-25 13:52:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 13:52:41,837 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-25 13:52:41,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 13:52:41,837 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-25 13:52:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-25 13:52:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-25 13:52:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 13:52:41,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-25 13:52:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-25 13:52:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-25 13:52:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-25 13:52:41,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-25 13:52:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-25 13:52:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 13:52:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-25 13:52:41,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-25 13:52:41,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-25 13:52:41,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-25 13:52:41,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-25 13:52:41,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 13:52:41,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 13:52:41,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-25 13:52:41,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-25 13:52:41,842 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:52:41,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-25 13:52:41,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-25 13:52:41,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-25 13:52:41,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-25 13:52:41,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-25 13:52:41,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-25 13:52:41,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-25 13:52:41,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-25 13:52:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-25 13:52:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-25 13:52:41,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-25 13:52:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-25 13:52:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-25 13:52:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-25 13:52:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-25 13:52:41,848 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 13:52:41,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 13:52:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 13:52:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 13:52:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 13:52:41,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:52:41,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-25 13:52:41,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-25 13:52:41,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-25 13:52:41,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-25 13:52:42,516 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 13:52:42,909 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 13:52:43,282 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 13:52:43,282 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-25 13:52:43,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:52:43 BoogieIcfgContainer [2019-11-25 13:52:43,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 13:52:43,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 13:52:43,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 13:52:43,290 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 13:52:43,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 01:52:40" (1/3) ... [2019-11-25 13:52:43,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530e598a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:52:43, skipping insertion in model container [2019-11-25 13:52:43,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:52:41" (2/3) ... [2019-11-25 13:52:43,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530e598a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:52:43, skipping insertion in model container [2019-11-25 13:52:43,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:52:43" (3/3) ... [2019-11-25 13:52:43,297 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_1-1.i [2019-11-25 13:52:43,306 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 13:52:43,313 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-25 13:52:43,324 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-25 13:52:43,345 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 13:52:43,345 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 13:52:43,345 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 13:52:43,345 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 13:52:43,346 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 13:52:43,346 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 13:52:43,346 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 13:52:43,346 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 13:52:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states. [2019-11-25 13:52:43,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:52:43,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:43,386 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:52:43,387 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:43,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:43,393 INFO L82 PathProgramCache]: Analyzing trace with hash -580210168, now seen corresponding path program 1 times [2019-11-25 13:52:43,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:43,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012898169] [2019-11-25 13:52:43,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-25 13:52:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:43,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:52:43,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:43,677 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:52:43,678 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:52:43,689 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:52:43,689 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:52:43,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:52:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:43,728 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:43,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012898169] [2019-11-25 13:52:43,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:43,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 13:52:43,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81718904] [2019-11-25 13:52:43,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:52:43,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:43,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:52:43,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:52:43,823 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 5 states. [2019-11-25 13:52:44,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:44,210 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2019-11-25 13:52:44,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:52:44,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-25 13:52:44,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:44,245 INFO L225 Difference]: With dead ends: 156 [2019-11-25 13:52:44,245 INFO L226 Difference]: Without dead ends: 153 [2019-11-25 13:52:44,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:52:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-25 13:52:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2019-11-25 13:52:44,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-25 13:52:44,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2019-11-25 13:52:44,371 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 17 [2019-11-25 13:52:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:44,371 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2019-11-25 13:52:44,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:52:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2019-11-25 13:52:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:52:44,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:44,373 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:52:44,589 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 13:52:44,589 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:44,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:44,590 INFO L82 PathProgramCache]: Analyzing trace with hash -580210167, now seen corresponding path program 1 times [2019-11-25 13:52:44,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:44,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139050045] [2019-11-25 13:52:44,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-25 13:52:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:44,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 13:52:44,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:44,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:52:44,793 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:52:44,801 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:52:44,801 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:52:44,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:52:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:44,857 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:45,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:45,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139050045] [2019-11-25 13:52:45,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:45,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-25 13:52:45,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240981024] [2019-11-25 13:52:45,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:52:45,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:45,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:52:45,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:52:45,175 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 10 states. [2019-11-25 13:52:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:45,876 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2019-11-25 13:52:45,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 13:52:45,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-25 13:52:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:45,881 INFO L225 Difference]: With dead ends: 152 [2019-11-25 13:52:45,882 INFO L226 Difference]: Without dead ends: 152 [2019-11-25 13:52:45,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:52:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-25 13:52:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2019-11-25 13:52:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-11-25 13:52:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2019-11-25 13:52:45,900 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 17 [2019-11-25 13:52:45,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:45,900 INFO L462 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2019-11-25 13:52:45,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:52:45,901 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2019-11-25 13:52:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:52:45,902 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:45,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:52:46,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 13:52:46,117 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:46,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:46,118 INFO L82 PathProgramCache]: Analyzing trace with hash -551581017, now seen corresponding path program 1 times [2019-11-25 13:52:46,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:46,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714211976] [2019-11-25 13:52:46,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-25 13:52:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:46,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 13:52:46,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:46,268 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:46,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:46,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714211976] [2019-11-25 13:52:46,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:46,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 13:52:46,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037680311] [2019-11-25 13:52:46,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:52:46,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:46,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:52:46,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:52:46,313 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 5 states. [2019-11-25 13:52:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:46,339 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2019-11-25 13:52:46,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:52:46,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-25 13:52:46,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:46,341 INFO L225 Difference]: With dead ends: 146 [2019-11-25 13:52:46,342 INFO L226 Difference]: Without dead ends: 146 [2019-11-25 13:52:46,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:52:46,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-25 13:52:46,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-11-25 13:52:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-25 13:52:46,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2019-11-25 13:52:46,360 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 17 [2019-11-25 13:52:46,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:46,361 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2019-11-25 13:52:46,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:52:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2019-11-25 13:52:46,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 13:52:46,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:46,364 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] [2019-11-25 13:52:46,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 13:52:46,575 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:46,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash 180429038, now seen corresponding path program 1 times [2019-11-25 13:52:46,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:46,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1865135468] [2019-11-25 13:52:46,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-25 13:52:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:46,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:52:46,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:46,736 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:46,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1865135468] [2019-11-25 13:52:46,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:46,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 13:52:46,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492041624] [2019-11-25 13:52:46,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:52:46,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:46,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:52:46,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:52:46,821 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 5 states. [2019-11-25 13:52:46,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:46,852 INFO L93 Difference]: Finished difference Result 146 states and 153 transitions. [2019-11-25 13:52:46,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:52:46,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-25 13:52:46,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:46,854 INFO L225 Difference]: With dead ends: 146 [2019-11-25 13:52:46,854 INFO L226 Difference]: Without dead ends: 146 [2019-11-25 13:52:46,855 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:52:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-25 13:52:46,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2019-11-25 13:52:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-25 13:52:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 151 transitions. [2019-11-25 13:52:46,878 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 151 transitions. Word has length 27 [2019-11-25 13:52:46,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:46,878 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 151 transitions. [2019-11-25 13:52:46,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:52:46,878 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2019-11-25 13:52:46,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 13:52:46,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:46,881 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] [2019-11-25 13:52:47,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 13:52:47,084 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:47,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:47,085 INFO L82 PathProgramCache]: Analyzing trace with hash -330105139, now seen corresponding path program 1 times [2019-11-25 13:52:47,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:47,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519119846] [2019-11-25 13:52:47,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-25 13:52:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:47,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 13:52:47,222 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:47,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:47,286 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:47,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519119846] [2019-11-25 13:52:47,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:47,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-25 13:52:47,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832125726] [2019-11-25 13:52:47,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 13:52:47,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:47,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 13:52:47,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 13:52:47,340 INFO L87 Difference]: Start difference. First operand 144 states and 151 transitions. Second operand 7 states. [2019-11-25 13:52:47,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:47,417 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2019-11-25 13:52:47,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 13:52:47,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-25 13:52:47,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:47,425 INFO L225 Difference]: With dead ends: 160 [2019-11-25 13:52:47,426 INFO L226 Difference]: Without dead ends: 160 [2019-11-25 13:52:47,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 13:52:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-25 13:52:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 153. [2019-11-25 13:52:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-25 13:52:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2019-11-25 13:52:47,448 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 27 [2019-11-25 13:52:47,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:47,448 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2019-11-25 13:52:47,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 13:52:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2019-11-25 13:52:47,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 13:52:47,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:47,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:52:47,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 13:52:47,652 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:47,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:47,653 INFO L82 PathProgramCache]: Analyzing trace with hash 317366699, now seen corresponding path program 1 times [2019-11-25 13:52:47,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:47,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20134058] [2019-11-25 13:52:47,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-25 13:52:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:47,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 13:52:47,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:47,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:47,818 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:47,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-25 13:52:47,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20134058] [2019-11-25 13:52:47,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:47,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 13:52:47,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168943093] [2019-11-25 13:52:47,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 13:52:47,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:47,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 13:52:47,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 13:52:47,887 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand 6 states. [2019-11-25 13:52:47,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:47,938 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2019-11-25 13:52:47,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 13:52:47,939 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-25 13:52:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:47,941 INFO L225 Difference]: With dead ends: 159 [2019-11-25 13:52:47,941 INFO L226 Difference]: Without dead ends: 155 [2019-11-25 13:52:47,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-25 13:52:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-25 13:52:47,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-25 13:52:47,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-25 13:52:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2019-11-25 13:52:47,956 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 32 [2019-11-25 13:52:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:47,957 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2019-11-25 13:52:47,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 13:52:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2019-11-25 13:52:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 13:52:47,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:47,963 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:52:48,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 13:52:48,186 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:48,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1135828661, now seen corresponding path program 1 times [2019-11-25 13:52:48,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:48,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065007095] [2019-11-25 13:52:48,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-25 13:52:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:48,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:52:48,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:48,390 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:48,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065007095] [2019-11-25 13:52:48,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:52:48,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-25 13:52:48,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472600713] [2019-11-25 13:52:48,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:52:48,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:48,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:52:48,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:52:48,521 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand 10 states. [2019-11-25 13:52:48,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:48,748 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2019-11-25 13:52:48,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 13:52:48,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-25 13:52:48,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:48,751 INFO L225 Difference]: With dead ends: 163 [2019-11-25 13:52:48,751 INFO L226 Difference]: Without dead ends: 159 [2019-11-25 13:52:48,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-25 13:52:48,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-25 13:52:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-11-25 13:52:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-25 13:52:48,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 166 transitions. [2019-11-25 13:52:48,761 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 166 transitions. Word has length 34 [2019-11-25 13:52:48,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:48,762 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 166 transitions. [2019-11-25 13:52:48,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:52:48,762 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 166 transitions. [2019-11-25 13:52:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 13:52:48,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:48,763 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:52:48,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 13:52:48,979 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:48,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:48,980 INFO L82 PathProgramCache]: Analyzing trace with hash 591246760, now seen corresponding path program 1 times [2019-11-25 13:52:48,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:48,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333754435] [2019-11-25 13:52:48,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-25 13:52:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:49,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 13:52:49,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:49,211 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:49,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333754435] [2019-11-25 13:52:49,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:49,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-25 13:52:49,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123842631] [2019-11-25 13:52:49,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 13:52:49,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:49,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 13:52:49,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 13:52:49,299 INFO L87 Difference]: Start difference. First operand 159 states and 166 transitions. Second operand 7 states. [2019-11-25 13:52:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:49,372 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2019-11-25 13:52:49,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 13:52:49,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-11-25 13:52:49,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:49,376 INFO L225 Difference]: With dead ends: 169 [2019-11-25 13:52:49,376 INFO L226 Difference]: Without dead ends: 169 [2019-11-25 13:52:49,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 13:52:49,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-25 13:52:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2019-11-25 13:52:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-11-25 13:52:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 172 transitions. [2019-11-25 13:52:49,383 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 172 transitions. Word has length 36 [2019-11-25 13:52:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:49,407 INFO L462 AbstractCegarLoop]: Abstraction has 165 states and 172 transitions. [2019-11-25 13:52:49,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 13:52:49,407 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 172 transitions. [2019-11-25 13:52:49,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 13:52:49,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:49,408 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] [2019-11-25 13:52:49,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 13:52:49,624 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:49,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:49,625 INFO L82 PathProgramCache]: Analyzing trace with hash -212953728, now seen corresponding path program 1 times [2019-11-25 13:52:49,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:49,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135951008] [2019-11-25 13:52:49,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-25 13:52:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:49,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 13:52:49,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:49,775 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:49,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:49,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135951008] [2019-11-25 13:52:49,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:49,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 13:52:49,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278045361] [2019-11-25 13:52:49,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 13:52:49,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:49,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 13:52:49,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 13:52:49,903 INFO L87 Difference]: Start difference. First operand 165 states and 172 transitions. Second operand 3 states. [2019-11-25 13:52:50,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:50,099 INFO L93 Difference]: Finished difference Result 176 states and 182 transitions. [2019-11-25 13:52:50,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 13:52:50,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-25 13:52:50,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:50,102 INFO L225 Difference]: With dead ends: 176 [2019-11-25 13:52:50,102 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 13:52:50,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 13:52:50,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 13:52:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2019-11-25 13:52:50,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 13:52:50,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 152 transitions. [2019-11-25 13:52:50,111 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 152 transitions. Word has length 34 [2019-11-25 13:52:50,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:50,112 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 152 transitions. [2019-11-25 13:52:50,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 13:52:50,112 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 152 transitions. [2019-11-25 13:52:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 13:52:50,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:50,115 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:52:50,315 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-25 13:52:50,316 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:50,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:50,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1203345269, now seen corresponding path program 2 times [2019-11-25 13:52:50,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:50,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954938603] [2019-11-25 13:52:50,317 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-25 13:52:50,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 13:52:50,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:52:50,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 13:52:50,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:50,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:52:50,455 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:52:50,457 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:52:50,457 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:52:50,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:52:50,607 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-25 13:52:50,607 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-25 13:52:50,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954938603] [2019-11-25 13:52:50,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:50,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-25 13:52:50,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170516196] [2019-11-25 13:52:50,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 13:52:50,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:50,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 13:52:50,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 13:52:50,720 INFO L87 Difference]: Start difference. First operand 146 states and 152 transitions. Second operand 12 states. [2019-11-25 13:52:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:51,768 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2019-11-25 13:52:51,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 13:52:51,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-25 13:52:51,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:51,770 INFO L225 Difference]: With dead ends: 157 [2019-11-25 13:52:51,771 INFO L226 Difference]: Without dead ends: 157 [2019-11-25 13:52:51,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-25 13:52:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-25 13:52:51,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 145. [2019-11-25 13:52:51,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-25 13:52:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 151 transitions. [2019-11-25 13:52:51,777 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 151 transitions. Word has length 38 [2019-11-25 13:52:51,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:51,777 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 151 transitions. [2019-11-25 13:52:51,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 13:52:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 151 transitions. [2019-11-25 13:52:51,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 13:52:51,778 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:51,778 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:52:51,985 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-25 13:52:51,986 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:51,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:51,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1203345268, now seen corresponding path program 1 times [2019-11-25 13:52:51,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:51,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011409040] [2019-11-25 13:52:51,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-25 13:52:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:52,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 13:52:52,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:52,252 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:52,252 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:52,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011409040] [2019-11-25 13:52:52,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:52:52,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-25 13:52:52,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001683807] [2019-11-25 13:52:52,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 13:52:52,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:52,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 13:52:52,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-25 13:52:52,604 INFO L87 Difference]: Start difference. First operand 145 states and 151 transitions. Second operand 18 states. [2019-11-25 13:52:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:53,498 INFO L93 Difference]: Finished difference Result 157 states and 169 transitions. [2019-11-25 13:52:53,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 13:52:53,499 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-25 13:52:53,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:53,501 INFO L225 Difference]: With dead ends: 157 [2019-11-25 13:52:53,501 INFO L226 Difference]: Without dead ends: 153 [2019-11-25 13:52:53,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-25 13:52:53,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-25 13:52:53,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-25 13:52:53,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-25 13:52:53,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2019-11-25 13:52:53,507 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 38 [2019-11-25 13:52:53,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:53,507 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2019-11-25 13:52:53,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 13:52:53,507 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2019-11-25 13:52:53,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-25 13:52:53,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:53,508 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:52:53,712 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-25 13:52:53,713 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:53,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:53,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1038685964, now seen corresponding path program 2 times [2019-11-25 13:52:53,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:53,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371531498] [2019-11-25 13:52:53,715 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-25 13:52:53,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 13:52:53,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:52:53,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 13:52:53,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:53,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:52:53,890 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:52:53,896 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:52:53,897 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:52:53,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:52:54,128 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-25 13:52:54,128 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-25 13:52:55,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371531498] [2019-11-25 13:52:55,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:52:55,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-25 13:52:55,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318933179] [2019-11-25 13:52:55,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 13:52:55,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:55,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 13:52:55,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-25 13:52:55,065 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand 23 states. [2019-11-25 13:52:57,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:52:57,951 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2019-11-25 13:52:57,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 13:52:57,952 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-25 13:52:57,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:52:57,953 INFO L225 Difference]: With dead ends: 152 [2019-11-25 13:52:57,953 INFO L226 Difference]: Without dead ends: 152 [2019-11-25 13:52:57,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-25 13:52:57,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-25 13:52:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-25 13:52:57,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-25 13:52:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 158 transitions. [2019-11-25 13:52:57,959 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 158 transitions. Word has length 46 [2019-11-25 13:52:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:52:57,960 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 158 transitions. [2019-11-25 13:52:57,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 13:52:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2019-11-25 13:52:57,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 13:52:57,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:52:57,961 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:52:58,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-25 13:52:58,170 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:52:58,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:52:58,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1614588820, now seen corresponding path program 1 times [2019-11-25 13:52:58,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:52:58,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287477227] [2019-11-25 13:52:58,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-25 13:52:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:52:58,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 13:52:58,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:52:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:58,556 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:52:58,681 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-25 13:52:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:52:59,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287477227] [2019-11-25 13:52:59,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:52:59,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-25 13:52:59,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421275369] [2019-11-25 13:52:59,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-25 13:52:59,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:52:59,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-25 13:52:59,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-25 13:52:59,513 INFO L87 Difference]: Start difference. First operand 152 states and 158 transitions. Second operand 34 states. [2019-11-25 13:53:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:00,273 INFO L93 Difference]: Finished difference Result 158 states and 164 transitions. [2019-11-25 13:53:00,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 13:53:00,274 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-25 13:53:00,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:00,277 INFO L225 Difference]: With dead ends: 158 [2019-11-25 13:53:00,278 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 13:53:00,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-11-25 13:53:00,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 13:53:00,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-25 13:53:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-25 13:53:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 160 transitions. [2019-11-25 13:53:00,291 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 160 transitions. Word has length 51 [2019-11-25 13:53:00,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:00,292 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 160 transitions. [2019-11-25 13:53:00,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-25 13:53:00,292 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2019-11-25 13:53:00,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 13:53:00,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:00,293 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:00,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-25 13:53:00,501 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:00,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:00,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1256867828, now seen corresponding path program 2 times [2019-11-25 13:53:00,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:00,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140970218] [2019-11-25 13:53:00,504 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 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-25 13:53:00,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 13:53:00,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:53:00,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 13:53:00,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:00,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:53:00,655 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:00,658 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:00,658 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:00,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:53:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:00,827 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:00,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140970218] [2019-11-25 13:53:00,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:00,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-25 13:53:00,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832757540] [2019-11-25 13:53:00,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 13:53:00,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:00,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 13:53:00,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 13:53:00,896 INFO L87 Difference]: Start difference. First operand 154 states and 160 transitions. Second operand 12 states. [2019-11-25 13:53:01,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:01,818 INFO L93 Difference]: Finished difference Result 164 states and 169 transitions. [2019-11-25 13:53:01,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 13:53:01,818 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-25 13:53:01,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:01,820 INFO L225 Difference]: With dead ends: 164 [2019-11-25 13:53:01,820 INFO L226 Difference]: Without dead ends: 164 [2019-11-25 13:53:01,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-25 13:53:01,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-25 13:53:01,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-11-25 13:53:01,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-25 13:53:01,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 158 transitions. [2019-11-25 13:53:01,826 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 158 transitions. Word has length 53 [2019-11-25 13:53:01,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:01,826 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 158 transitions. [2019-11-25 13:53:01,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 13:53:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 158 transitions. [2019-11-25 13:53:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 13:53:01,827 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:01,827 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:02,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-25 13:53:02,038 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:02,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:02,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1256867829, now seen corresponding path program 1 times [2019-11-25 13:53:02,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:02,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078505671] [2019-11-25 13:53:02,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-25 13:53:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:02,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 13:53:02,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:02,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:53:02,249 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:02,254 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:02,254 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:02,254 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:53:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:02,485 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:03,287 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:03,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078505671] [2019-11-25 13:53:03,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:03,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-25 13:53:03,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293848633] [2019-11-25 13:53:03,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 13:53:03,289 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:03,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 13:53:03,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-25 13:53:03,290 INFO L87 Difference]: Start difference. First operand 152 states and 158 transitions. Second operand 23 states. [2019-11-25 13:53:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:05,984 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2019-11-25 13:53:05,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 13:53:05,985 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-25 13:53:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:05,986 INFO L225 Difference]: With dead ends: 150 [2019-11-25 13:53:05,986 INFO L226 Difference]: Without dead ends: 150 [2019-11-25 13:53:05,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-25 13:53:05,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-25 13:53:05,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-25 13:53:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-25 13:53:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 156 transitions. [2019-11-25 13:53:05,993 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 156 transitions. Word has length 53 [2019-11-25 13:53:05,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:05,993 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 156 transitions. [2019-11-25 13:53:05,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 13:53:05,994 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 156 transitions. [2019-11-25 13:53:05,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 13:53:05,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:05,995 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:06,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-25 13:53:06,206 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:06,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:06,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1782492395, now seen corresponding path program 1 times [2019-11-25 13:53:06,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:06,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470765743] [2019-11-25 13:53:06,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-25 13:53:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:06,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 13:53:06,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:06,402 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:06,402 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:06,550 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:06,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470765743] [2019-11-25 13:53:06,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:06,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-25 13:53:06,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224199362] [2019-11-25 13:53:06,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 13:53:06,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:06,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 13:53:06,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 13:53:06,552 INFO L87 Difference]: Start difference. First operand 150 states and 156 transitions. Second operand 8 states. [2019-11-25 13:53:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:06,599 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2019-11-25 13:53:06,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 13:53:06,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-11-25 13:53:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:06,603 INFO L225 Difference]: With dead ends: 152 [2019-11-25 13:53:06,603 INFO L226 Difference]: Without dead ends: 150 [2019-11-25 13:53:06,604 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-25 13:53:06,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-25 13:53:06,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-25 13:53:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-25 13:53:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 155 transitions. [2019-11-25 13:53:06,609 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 155 transitions. Word has length 56 [2019-11-25 13:53:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:06,610 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 155 transitions. [2019-11-25 13:53:06,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 13:53:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2019-11-25 13:53:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-25 13:53:06,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:06,611 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:06,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-25 13:53:06,824 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:06,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:06,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1924935738, now seen corresponding path program 1 times [2019-11-25 13:53:06,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:06,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216682058] [2019-11-25 13:53:06,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-25 13:53:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:07,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 13:53:07,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:07,069 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:07,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:53:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:07,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216682058] [2019-11-25 13:53:07,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:07,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-25 13:53:07,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243775852] [2019-11-25 13:53:07,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 13:53:07,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:07,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 13:53:07,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:53:07,306 INFO L87 Difference]: Start difference. First operand 150 states and 155 transitions. Second operand 11 states. [2019-11-25 13:53:07,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:07,402 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2019-11-25 13:53:07,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 13:53:07,403 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 61 [2019-11-25 13:53:07,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:07,404 INFO L225 Difference]: With dead ends: 154 [2019-11-25 13:53:07,404 INFO L226 Difference]: Without dead ends: 150 [2019-11-25 13:53:07,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-25 13:53:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-25 13:53:07,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-25 13:53:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-25 13:53:07,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2019-11-25 13:53:07,410 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 61 [2019-11-25 13:53:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:07,411 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2019-11-25 13:53:07,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 13:53:07,411 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2019-11-25 13:53:07,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-25 13:53:07,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:07,412 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:07,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-25 13:53:07,625 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:07,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:07,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1553235633, now seen corresponding path program 1 times [2019-11-25 13:53:07,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:07,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5304749] [2019-11-25 13:53:07,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-25 13:53:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:07,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-25 13:53:07,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:07,868 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:53:07,868 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:07,869 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:07,869 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:07,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:53:08,105 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:08,105 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:08,278 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:08,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5304749] [2019-11-25 13:53:08,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:08,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 13] imperfect sequences [] total 14 [2019-11-25 13:53:08,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843035941] [2019-11-25 13:53:08,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-25 13:53:08,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:08,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-25 13:53:08,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-25 13:53:08,280 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand 15 states. [2019-11-25 13:53:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:09,383 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-11-25 13:53:09,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 13:53:09,384 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-11-25 13:53:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:09,385 INFO L225 Difference]: With dead ends: 160 [2019-11-25 13:53:09,385 INFO L226 Difference]: Without dead ends: 160 [2019-11-25 13:53:09,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 125 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-25 13:53:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-25 13:53:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 148. [2019-11-25 13:53:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-25 13:53:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions. [2019-11-25 13:53:09,391 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 72 [2019-11-25 13:53:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:09,392 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions. [2019-11-25 13:53:09,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-25 13:53:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2019-11-25 13:53:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-25 13:53:09,393 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:09,393 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:09,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-25 13:53:09,601 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:09,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:09,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1553235634, now seen corresponding path program 1 times [2019-11-25 13:53:09,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:09,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900761174] [2019-11-25 13:53:09,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-25 13:53:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:09,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-25 13:53:09,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:09,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:53:09,843 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:09,850 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:09,851 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:09,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:53:10,269 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:10,270 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:11,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900761174] [2019-11-25 13:53:11,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:11,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 14] imperfect sequences [] total 28 [2019-11-25 13:53:11,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267043951] [2019-11-25 13:53:11,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-25 13:53:11,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:11,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-25 13:53:11,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=733, Unknown=0, NotChecked=0, Total=812 [2019-11-25 13:53:11,847 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand 29 states. [2019-11-25 13:53:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:15,801 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2019-11-25 13:53:15,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-25 13:53:15,801 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 72 [2019-11-25 13:53:15,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:15,803 INFO L225 Difference]: With dead ends: 146 [2019-11-25 13:53:15,803 INFO L226 Difference]: Without dead ends: 146 [2019-11-25 13:53:15,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2019-11-25 13:53:15,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-25 13:53:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-11-25 13:53:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 13:53:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2019-11-25 13:53:15,808 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 72 [2019-11-25 13:53:15,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:15,809 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2019-11-25 13:53:15,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-25 13:53:15,809 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2019-11-25 13:53:15,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-25 13:53:15,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:15,810 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:16,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-25 13:53:16,026 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:16,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:16,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1822676548, now seen corresponding path program 1 times [2019-11-25 13:53:16,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:16,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [717748174] [2019-11-25 13:53:16,027 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-25 13:53:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:16,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 13:53:16,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:16,315 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:16,315 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:16,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [717748174] [2019-11-25 13:53:16,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:16,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2019-11-25 13:53:16,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62829993] [2019-11-25 13:53:16,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 13:53:16,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:16,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 13:53:16,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:53:16,485 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand 11 states. [2019-11-25 13:53:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:16,604 INFO L93 Difference]: Finished difference Result 149 states and 152 transitions. [2019-11-25 13:53:16,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 13:53:16,605 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 81 [2019-11-25 13:53:16,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:16,606 INFO L225 Difference]: With dead ends: 149 [2019-11-25 13:53:16,606 INFO L226 Difference]: Without dead ends: 146 [2019-11-25 13:53:16,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-25 13:53:16,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-25 13:53:16,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-11-25 13:53:16,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 13:53:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 149 transitions. [2019-11-25 13:53:16,615 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 149 transitions. Word has length 81 [2019-11-25 13:53:16,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:16,616 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 149 transitions. [2019-11-25 13:53:16,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 13:53:16,616 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2019-11-25 13:53:16,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-25 13:53:16,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:16,618 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:16,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-25 13:53:16,824 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:16,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:16,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1759296345, now seen corresponding path program 1 times [2019-11-25 13:53:16,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:16,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321627561] [2019-11-25 13:53:16,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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-25 13:53:17,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:17,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-25 13:53:17,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:17,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:53:17,112 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:17,114 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:17,114 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:17,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:53:17,379 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:17,380 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:17,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321627561] [2019-11-25 13:53:17,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:17,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-25 13:53:17,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525572062] [2019-11-25 13:53:17,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-25 13:53:17,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:17,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 13:53:17,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-25 13:53:17,584 INFO L87 Difference]: Start difference. First operand 146 states and 149 transitions. Second operand 17 states. [2019-11-25 13:53:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:18,883 INFO L93 Difference]: Finished difference Result 160 states and 162 transitions. [2019-11-25 13:53:18,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 13:53:18,883 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 94 [2019-11-25 13:53:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:18,885 INFO L225 Difference]: With dead ends: 160 [2019-11-25 13:53:18,885 INFO L226 Difference]: Without dead ends: 160 [2019-11-25 13:53:18,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 165 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-25 13:53:18,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-25 13:53:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 144. [2019-11-25 13:53:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-25 13:53:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 147 transitions. [2019-11-25 13:53:18,889 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 147 transitions. Word has length 94 [2019-11-25 13:53:18,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:18,890 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 147 transitions. [2019-11-25 13:53:18,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-25 13:53:18,890 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 147 transitions. [2019-11-25 13:53:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-25 13:53:18,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:18,891 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:19,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-25 13:53:19,101 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:19,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:19,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1759296346, now seen corresponding path program 1 times [2019-11-25 13:53:19,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:19,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561865389] [2019-11-25 13:53:19,103 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-25 13:53:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:19,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 13:53:19,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:19,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:53:19,393 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:19,399 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:19,400 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:19,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:53:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:19,827 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:21,561 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:21,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561865389] [2019-11-25 13:53:21,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:21,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-25 13:53:21,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785900613] [2019-11-25 13:53:21,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-25 13:53:21,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:21,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-25 13:53:21,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-25 13:53:21,563 INFO L87 Difference]: Start difference. First operand 144 states and 147 transitions. Second operand 33 states. [2019-11-25 13:53:25,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:25,765 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-11-25 13:53:25,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 13:53:25,767 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2019-11-25 13:53:25,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:25,768 INFO L225 Difference]: With dead ends: 142 [2019-11-25 13:53:25,768 INFO L226 Difference]: Without dead ends: 142 [2019-11-25 13:53:25,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 150 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-25 13:53:25,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-25 13:53:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-11-25 13:53:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-25 13:53:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 145 transitions. [2019-11-25 13:53:25,773 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 145 transitions. Word has length 94 [2019-11-25 13:53:25,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:25,774 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 145 transitions. [2019-11-25 13:53:25,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-25 13:53:25,774 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 145 transitions. [2019-11-25 13:53:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-25 13:53:25,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:25,776 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:25,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-25 13:53:25,987 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:25,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:25,988 INFO L82 PathProgramCache]: Analyzing trace with hash -207269007, now seen corresponding path program 1 times [2019-11-25 13:53:25,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:25,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010817373] [2019-11-25 13:53:25,989 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-25 13:53:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:26,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 13:53:26,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:26,324 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:26,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010817373] [2019-11-25 13:53:26,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:26,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2019-11-25 13:53:26,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556829504] [2019-11-25 13:53:26,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 13:53:26,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:26,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 13:53:26,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:53:26,589 INFO L87 Difference]: Start difference. First operand 142 states and 145 transitions. Second operand 11 states. [2019-11-25 13:53:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:26,675 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2019-11-25 13:53:26,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 13:53:26,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 92 [2019-11-25 13:53:26,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:26,677 INFO L225 Difference]: With dead ends: 144 [2019-11-25 13:53:26,677 INFO L226 Difference]: Without dead ends: 142 [2019-11-25 13:53:26,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-25 13:53:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-25 13:53:26,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-11-25 13:53:26,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-25 13:53:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2019-11-25 13:53:26,681 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 92 [2019-11-25 13:53:26,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:26,681 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2019-11-25 13:53:26,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 13:53:26,682 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2019-11-25 13:53:26,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-25 13:53:26,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:26,683 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:26,894 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-25 13:53:26,895 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:26,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:26,895 INFO L82 PathProgramCache]: Analyzing trace with hash -889618677, now seen corresponding path program 1 times [2019-11-25 13:53:26,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:26,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967541897] [2019-11-25 13:53:26,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-25 13:53:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:27,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-25 13:53:27,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:27,270 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:53:27,271 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:27,273 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:27,273 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:27,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:53:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:27,626 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:27,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967541897] [2019-11-25 13:53:27,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:27,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 20 [2019-11-25 13:53:27,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441731117] [2019-11-25 13:53:27,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-25 13:53:27,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:27,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-25 13:53:27,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-25 13:53:27,895 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 21 states. [2019-11-25 13:53:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:29,559 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2019-11-25 13:53:29,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-25 13:53:29,560 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 107 [2019-11-25 13:53:29,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:29,561 INFO L225 Difference]: With dead ends: 152 [2019-11-25 13:53:29,561 INFO L226 Difference]: Without dead ends: 152 [2019-11-25 13:53:29,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 183 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-11-25 13:53:29,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-25 13:53:29,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2019-11-25 13:53:29,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-25 13:53:29,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2019-11-25 13:53:29,567 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 107 [2019-11-25 13:53:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:29,567 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2019-11-25 13:53:29,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-25 13:53:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2019-11-25 13:53:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-25 13:53:29,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:29,568 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:29,778 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-11-25 13:53:29,778 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:29,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:29,779 INFO L82 PathProgramCache]: Analyzing trace with hash -889618676, now seen corresponding path program 1 times [2019-11-25 13:53:29,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:29,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246274307] [2019-11-25 13:53:29,781 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-25 13:53:30,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:30,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-25 13:53:30,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:30,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:53:30,110 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:30,116 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:30,116 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:30,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:53:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:31,147 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:33,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246274307] [2019-11-25 13:53:33,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:33,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 20] imperfect sequences [] total 40 [2019-11-25 13:53:33,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768537578] [2019-11-25 13:53:33,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-25 13:53:33,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:33,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-25 13:53:33,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-11-25 13:53:33,627 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 41 states. [2019-11-25 13:53:39,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:39,061 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2019-11-25 13:53:39,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-25 13:53:39,062 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 107 [2019-11-25 13:53:39,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:39,063 INFO L225 Difference]: With dead ends: 138 [2019-11-25 13:53:39,063 INFO L226 Difference]: Without dead ends: 138 [2019-11-25 13:53:39,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 166 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-11-25 13:53:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-25 13:53:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-11-25 13:53:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-25 13:53:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2019-11-25 13:53:39,068 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 107 [2019-11-25 13:53:39,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:39,069 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2019-11-25 13:53:39,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-25 13:53:39,069 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2019-11-25 13:53:39,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-25 13:53:39,069 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:39,070 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:39,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-11-25 13:53:39,279 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:39,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:39,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1613444290, now seen corresponding path program 1 times [2019-11-25 13:53:39,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:39,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650343891] [2019-11-25 13:53:39,281 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-25 13:53:39,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:39,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 13:53:39,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:40,509 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:53:41,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650343891] [2019-11-25 13:53:41,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:53:41,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 19] imperfect sequences [] total 39 [2019-11-25 13:53:41,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733405012] [2019-11-25 13:53:41,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-25 13:53:41,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:53:41,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-25 13:53:41,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2019-11-25 13:53:41,315 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 40 states. [2019-11-25 13:53:43,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:53:43,794 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2019-11-25 13:53:43,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-25 13:53:43,795 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 110 [2019-11-25 13:53:43,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:53:43,795 INFO L225 Difference]: With dead ends: 137 [2019-11-25 13:53:43,795 INFO L226 Difference]: Without dead ends: 137 [2019-11-25 13:53:43,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 174 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2019-11-25 13:53:43,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-25 13:53:43,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-11-25 13:53:43,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-25 13:53:43,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2019-11-25 13:53:43,799 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 110 [2019-11-25 13:53:43,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:53:43,799 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2019-11-25 13:53:43,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-25 13:53:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2019-11-25 13:53:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-25 13:53:43,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:53:43,801 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:53:44,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-11-25 13:53:44,010 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, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:53:44,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:53:44,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1140166607, now seen corresponding path program 1 times [2019-11-25 13:53:44,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:53:44,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856648656] [2019-11-25 13:53:44,012 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-25 13:53:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:53:44,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-25 13:53:44,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:53:44,596 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-25 13:53:44,597 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:44,604 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:44,604 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:44,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-25 13:53:44,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:44,665 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 54 [2019-11-25 13:53:44,665 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:44,703 INFO L588 ElimStorePlain]: treesize reduction 29, result has 46.3 percent of original size [2019-11-25 13:53:44,703 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:44,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-25 13:53:57,122 WARN L192 SmtUtils]: Spent 12.35 s on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-11-25 13:53:57,123 INFO L343 Elim1Store]: treesize reduction 32, result has 66.0 percent of original size [2019-11-25 13:53:57,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 81 [2019-11-25 13:53:57,124 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:57,182 INFO L588 ElimStorePlain]: treesize reduction 50, result has 41.9 percent of original size [2019-11-25 13:53:57,183 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:57,183 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-25 13:53:57,308 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-25 13:53:57,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 50 [2019-11-25 13:53:57,309 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:53:57,330 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:53:57,331 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:53:57,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-25 13:53:58,253 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:53:58,253 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:53:58,639 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-25 13:54:00,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:00,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:02,646 WARN L192 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-25 13:54:02,744 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 13:54:02,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:54:02,911 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-25 13:54:02,912 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-25 13:54:02,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 85 [2019-11-25 13:54:02,922 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-25 13:54:02,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 21 [2019-11-25 13:54:02,922 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:54:02,923 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:54:02,923 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:54:02,924 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:54:02,924 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-25 13:54:02,924 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-25 13:54:04,617 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 13:54:04,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:54:05,056 WARN L192 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-25 13:54:05,057 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-25 13:54:05,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 197 [2019-11-25 13:54:05,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,345 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-25 13:54:05,346 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-25 13:54:05,346 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 193 treesize of output 229 [2019-11-25 13:54:05,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:05,354 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:54:05,589 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2019-11-25 13:54:05,590 INFO L588 ElimStorePlain]: treesize reduction 247, result has 28.4 percent of original size [2019-11-25 13:54:05,591 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:54:05,630 INFO L588 ElimStorePlain]: treesize reduction 69, result has 32.4 percent of original size [2019-11-25 13:54:05,630 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:54:05,630 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:33 [2019-11-25 13:54:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:54:07,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856648656] [2019-11-25 13:54:07,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:54:07,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2019-11-25 13:54:07,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782552511] [2019-11-25 13:54:07,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-25 13:54:07,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:07,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-25 13:54:07,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2019-11-25 13:54:07,139 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand 55 states. [2019-11-25 13:54:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:12,348 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-25 13:54:12,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-25 13:54:12,348 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 113 [2019-11-25 13:54:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:12,349 INFO L225 Difference]: With dead ends: 60 [2019-11-25 13:54:12,349 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 13:54:12,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2019-11-25 13:54:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 13:54:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 13:54:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 13:54:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 13:54:12,350 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2019-11-25 13:54:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:12,351 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 13:54:12,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-25 13:54:12,351 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 13:54:12,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 13:54:12,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-11-25 13:54:12,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 01:54:12 BoogieIcfgContainer [2019-11-25 13:54:12,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 13:54:12,562 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 13:54:12,562 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 13:54:12,562 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 13:54:12,563 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:52:43" (3/4) ... [2019-11-25 13:54:12,566 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 13:54:12,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-25 13:54:12,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:54:12,575 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-25 13:54:12,576 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-25 13:54:12,576 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-25 13:54:12,576 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-25 13:54:12,576 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-25 13:54:12,576 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-25 13:54:12,576 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-25 13:54:12,577 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 13:54:12,577 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-25 13:54:12,577 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-25 13:54:12,577 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-25 13:54:12,577 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-25 13:54:12,577 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-25 13:54:12,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:54:12,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-25 13:54:12,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-25 13:54:12,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-25 13:54:12,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-25 13:54:12,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 13:54:12,578 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-25 13:54:12,579 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-25 13:54:12,579 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-25 13:54:12,579 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-25 13:54:12,579 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-25 13:54:12,579 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-25 13:54:12,579 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-25 13:54:12,580 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-25 13:54:12,580 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-25 13:54:12,580 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-25 13:54:12,580 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-25 13:54:12,580 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-25 13:54:12,580 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-25 13:54:12,580 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-25 13:54:12,581 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-25 13:54:12,581 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-25 13:54:12,581 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-25 13:54:12,581 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-25 13:54:12,581 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 13:54:12,581 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-25 13:54:12,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-25 13:54:12,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-25 13:54:12,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-25 13:54:12,582 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-25 13:54:12,583 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-25 13:54:12,604 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2019-11-25 13:54:12,604 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-25 13:54:12,604 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 13:54:12,605 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 13:54:12,605 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 13:54:12,659 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 13:54:12,660 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 13:54:12,661 INFO L168 Benchmark]: Toolchain (without parser) took 91951.49 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 560.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -163.2 MB). Peak memory consumption was 397.3 MB. Max. memory is 11.5 GB. [2019-11-25 13:54:12,661 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:54:12,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 857.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -120.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 13:54:12,662 INFO L168 Benchmark]: Boogie Preprocessor took 126.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:54:12,663 INFO L168 Benchmark]: RCFGBuilder took 1588.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 962.9 MB in the end (delta: 112.3 MB). Peak memory consumption was 112.3 MB. Max. memory is 11.5 GB. [2019-11-25 13:54:12,663 INFO L168 Benchmark]: TraceAbstraction took 89273.36 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 432.5 MB). Free memory was 962.9 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 262.3 MB. Max. memory is 11.5 GB. [2019-11-25 13:54:12,663 INFO L168 Benchmark]: Witness Printer took 98.09 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2019-11-25 13:54:12,665 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.26 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 857.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -120.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 126.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1588.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 962.9 MB in the end (delta: 112.3 MB). Peak memory consumption was 112.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 89273.36 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 432.5 MB). Free memory was 962.9 MB in the beginning and 1.1 GB in the end (delta: -170.2 MB). Peak memory consumption was 262.3 MB. Max. memory is 11.5 GB. * Witness Printer took 98.09 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 683]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 683]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 745]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 745]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 659]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 659]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 764]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 667]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 667]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 669]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 669]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 333 locations, 71 error locations. Result: SAFE, OverallTime: 89.2s, OverallIterations: 27, TraceHistogramMax: 16, AutomataDifference: 36.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3248 SDtfs, 1486 SDslu, 25646 SDs, 0 SdLazy, 13929 SolverSat, 379 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3215 GetRequests, 2646 SyntacticMatches, 67 SemanticMatches, 502 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2635 ImplicationChecksByTransitivity, 24.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 27 MinimizatonAttempts, 98 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 40.8s InterpolantComputationTime, 1579 NumberOfCodeBlocks, 1543 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3104 ConstructedInterpolants, 478 QuantifiedInterpolants, 1043542 SizeOfPredicates, 165 NumberOfNonLiveVariables, 6724 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 54 InterpolantComputations, 46 PerfectInterpolantSequences, 3788/4318 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...