./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6692e4fc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a86b9fab61553f9a54467f5b62ac500f38719cf ............................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a86b9fab61553f9a54467f5b62ac500f38719cf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6692e4f [2019-11-25 17:48:23,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:48:23,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:48:23,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:48:23,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:48:23,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:48:23,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:48:23,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:48:23,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:48:23,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:48:23,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:48:23,404 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:48:23,405 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:48:23,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:48:23,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:48:23,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:48:23,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:48:23,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:48:23,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:48:23,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:48:23,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:48:23,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:48:23,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:48:23,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:48:23,436 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:48:23,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:48:23,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:48:23,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:48:23,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:48:23,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:48:23,440 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:48:23,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:48:23,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:48:23,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:48:23,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:48:23,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:48:23,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:48:23,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:48:23,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:48:23,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:48:23,449 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:48:23,450 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-25 17:48:23,478 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:48:23,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:48:23,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:48:23,480 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:48:23,480 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:48:23,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:48:23,481 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 17:48:23,481 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:48:23,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:48:23,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 17:48:23,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:48:23,482 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:48:23,482 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:48:23,482 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:48:23,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:48:23,483 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:48:23,483 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 17:48:23,483 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:48:23,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:48:23,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:48:23,484 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:48:23,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:48:23,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:48:23,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:48:23,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:48:23,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 17:48:23,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 17:48:23,486 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 -> 2a86b9fab61553f9a54467f5b62ac500f38719cf [2019-11-25 17:48:23,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:48:23,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:48:23,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:48:23,812 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:48:23,813 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:48:23,814 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-25 17:48:23,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b9dac44b/a55c80bd0dfc4209bfbf292582de3a67/FLAG266d4a792 [2019-11-25 17:48:24,431 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:48:24,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-25 17:48:24,448 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b9dac44b/a55c80bd0dfc4209bfbf292582de3a67/FLAG266d4a792 [2019-11-25 17:48:24,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b9dac44b/a55c80bd0dfc4209bfbf292582de3a67 [2019-11-25 17:48:24,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:48:24,704 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:48:24,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:48:24,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:48:24,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:48:24,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:48:24" (1/1) ... [2019-11-25 17:48:24,712 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c6d29e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:24, skipping insertion in model container [2019-11-25 17:48:24,713 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:48:24" (1/1) ... [2019-11-25 17:48:24,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:48:24,789 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:48:25,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:48:25,300 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 17:48:25,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3287d5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:25, skipping insertion in model container [2019-11-25 17:48:25,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:48:25,302 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-25 17:48:25,304 INFO L168 Benchmark]: Toolchain (without parser) took 599.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-25 17:48:25,305 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:48:25,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 596.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-25 17:48:25,308 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 596.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -187.8 MB). Peak memory consumption was 26.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-6692e4f [2019-11-25 17:48:27,095 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:48:27,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:48:27,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:48:27,117 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:48:27,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:48:27,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:48:27,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:48:27,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:48:27,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:48:27,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:48:27,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:48:27,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:48:27,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:48:27,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:48:27,140 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:48:27,141 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:48:27,142 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:48:27,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:48:27,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:48:27,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:48:27,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:48:27,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:48:27,150 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:48:27,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:48:27,153 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:48:27,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:48:27,154 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:48:27,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:48:27,155 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:48:27,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:48:27,156 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:48:27,157 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:48:27,158 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:48:27,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:48:27,159 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:48:27,160 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:48:27,160 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:48:27,160 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:48:27,161 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:48:27,162 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:48:27,163 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-25 17:48:27,177 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:48:27,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:48:27,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:48:27,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:48:27,179 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:48:27,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:48:27,180 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 17:48:27,180 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:48:27,180 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:48:27,181 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 17:48:27,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:48:27,181 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:48:27,181 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:48:27,181 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:48:27,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:48:27,182 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:48:27,182 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 17:48:27,182 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 17:48:27,182 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 17:48:27,183 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:48:27,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:48:27,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:48:27,183 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:48:27,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:48:27,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:48:27,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:48:27,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:48:27,184 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 17:48:27,185 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 17:48:27,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 17:48:27,185 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 -> 2a86b9fab61553f9a54467f5b62ac500f38719cf [2019-11-25 17:48:27,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:48:27,488 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:48:27,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:48:27,493 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:48:27,493 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:48:27,494 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-25 17:48:27,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b9a7c0a3/1e028ec2ccb44a94b9405608a85ad7a1/FLAG74d85a852 [2019-11-25 17:48:28,110 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:48:28,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-25 17:48:28,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b9a7c0a3/1e028ec2ccb44a94b9405608a85ad7a1/FLAG74d85a852 [2019-11-25 17:48:28,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b9a7c0a3/1e028ec2ccb44a94b9405608a85ad7a1 [2019-11-25 17:48:28,388 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:48:28,390 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:48:28,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:48:28,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:48:28,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:48:28,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:48:28" (1/1) ... [2019-11-25 17:48:28,399 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34aa0f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:28, skipping insertion in model container [2019-11-25 17:48:28,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:48:28" (1/1) ... [2019-11-25 17:48:28,414 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:48:28,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:48:28,988 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:48:29,010 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-25 17:48:29,032 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:48:29,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:48:29,104 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:48:29,187 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:48:29,282 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:48:29,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:29 WrapperNode [2019-11-25 17:48:29,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:48:29,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:48:29,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:48:29,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:48:29,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:29" (1/1) ... [2019-11-25 17:48:29,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:29" (1/1) ... [2019-11-25 17:48:29,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:29" (1/1) ... [2019-11-25 17:48:29,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:29" (1/1) ... [2019-11-25 17:48:29,364 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:29" (1/1) ... [2019-11-25 17:48:29,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:29" (1/1) ... [2019-11-25 17:48:29,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:29" (1/1) ... [2019-11-25 17:48:29,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:48:29,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:48:29,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:48:29,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:48:29,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:29" (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 17:48:29,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:48:29,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:48:29,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 17:48:29,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 17:48:29,451 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 17:48:29,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 17:48:29,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-25 17:48:29,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-25 17:48:29,452 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-25 17:48:29,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-25 17:48:29,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-25 17:48:29,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-25 17:48:29,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-25 17:48:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-25 17:48:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-25 17:48:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-25 17:48:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-25 17:48:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-25 17:48:29,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-25 17:48:29,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-25 17:48:29,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-25 17:48:29,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-25 17:48:29,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-25 17:48:29,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-25 17:48:29,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-25 17:48:29,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-25 17:48:29,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-25 17:48:29,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-25 17:48:29,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-25 17:48:29,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-25 17:48:29,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-25 17:48:29,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-25 17:48:29,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-25 17:48:29,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-25 17:48:29,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-25 17:48:29,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-25 17:48:29,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-25 17:48:29,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-25 17:48:29,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-25 17:48:29,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-25 17:48:29,462 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-25 17:48:29,463 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-25 17:48:29,463 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-25 17:48:29,463 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:48:29,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-25 17:48:29,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 17:48:29,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-25 17:48:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 17:48:29,464 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 17:48:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 17:48:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 17:48:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 17:48:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 17:48:29,465 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 17:48:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 17:48:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 17:48:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 17:48:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 17:48:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 17:48:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 17:48:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 17:48:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 17:48:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 17:48:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 17:48:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 17:48:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-25 17:48:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-25 17:48:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-25 17:48:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 17:48:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 17:48:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 17:48:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 17:48:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 17:48:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 17:48:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 17:48:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 17:48:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 17:48:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 17:48:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 17:48:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 17:48:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 17:48:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 17:48:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 17:48:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 17:48:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 17:48:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 17:48:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 17:48:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 17:48:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 17:48:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 17:48:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 17:48:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 17:48:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 17:48:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 17:48:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 17:48:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 17:48:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 17:48:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 17:48:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 17:48:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 17:48:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 17:48:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 17:48:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 17:48:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:48:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 17:48:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:48:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 17:48:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 17:48:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 17:48:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 17:48:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 17:48:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 17:48:29,477 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 17:48:29,478 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 17:48:29,478 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 17:48:29,478 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 17:48:29,478 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 17:48:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 17:48:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 17:48:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 17:48:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 17:48:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 17:48:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 17:48:29,479 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 17:48:29,480 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 17:48:29,480 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 17:48:29,481 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 17:48:29,484 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 17:48:29,484 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 17:48:29,485 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 17:48:29,485 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 17:48:29,485 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 17:48:29,486 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 17:48:29,486 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 17:48:29,486 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 17:48:29,486 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 17:48:29,486 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 17:48:29,486 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 17:48:29,486 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 17:48:29,494 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 17:48:29,494 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 17:48:29,494 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 17:48:29,494 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 17:48:29,494 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 17:48:29,494 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 17:48:29,494 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 17:48:29,495 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 17:48:29,496 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 17:48:29,496 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 17:48:29,496 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 17:48:29,496 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 17:48:29,496 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 17:48:29,496 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 17:48:29,496 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 17:48:29,496 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-25 17:48:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 17:48:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-25 17:48:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-25 17:48:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-25 17:48:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-25 17:48:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-25 17:48:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-25 17:48:29,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:48:29,498 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-25 17:48:29,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 17:48:29,498 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-25 17:48:29,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 17:48:29,498 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-25 17:48:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-25 17:48:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-25 17:48:29,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 17:48:29,500 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-25 17:48:29,500 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-25 17:48:29,500 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-25 17:48:29,500 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-25 17:48:29,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-25 17:48:29,500 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-25 17:48:29,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:48:29,500 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-25 17:48:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-25 17:48:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-25 17:48:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-25 17:48:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-25 17:48:29,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 17:48:29,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 17:48:29,502 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-25 17:48:29,502 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-25 17:48:29,502 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 17:48:29,502 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-25 17:48:29,502 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-25 17:48:29,502 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-25 17:48:29,502 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-25 17:48:29,502 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-25 17:48:29,503 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-25 17:48:29,503 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-25 17:48:29,503 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-25 17:48:29,503 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-25 17:48:29,503 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-25 17:48:29,503 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-25 17:48:29,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-25 17:48:29,503 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-25 17:48:29,504 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-25 17:48:29,504 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-25 17:48:29,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:48:29,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:48:29,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 17:48:29,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 17:48:29,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:48:29,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 17:48:29,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-25 17:48:29,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-25 17:48:29,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-25 17:48:29,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-25 17:48:30,169 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 17:48:30,556 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 17:48:30,873 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:48:30,873 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-25 17:48:30,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:48:30 BoogieIcfgContainer [2019-11-25 17:48:30,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:48:30,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:48:30,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:48:30,880 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:48:30,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:48:28" (1/3) ... [2019-11-25 17:48:30,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29218444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:48:30, skipping insertion in model container [2019-11-25 17:48:30,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:48:29" (2/3) ... [2019-11-25 17:48:30,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29218444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:48:30, skipping insertion in model container [2019-11-25 17:48:30,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:48:30" (3/3) ... [2019-11-25 17:48:30,884 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-1.i [2019-11-25 17:48:30,894 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:48:30,903 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-25 17:48:30,914 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-25 17:48:30,936 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:48:30,936 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:48:30,936 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:48:30,936 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:48:30,937 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:48:30,937 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:48:30,937 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:48:30,937 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:48:30,955 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2019-11-25 17:48:30,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 17:48:30,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:30,966 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 17:48:30,967 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 17:48:30,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:30,974 INFO L82 PathProgramCache]: Analyzing trace with hash -896940051, now seen corresponding path program 1 times [2019-11-25 17:48:30,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:30,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072162023] [2019-11-25 17:48:30,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 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 17:48:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:48:31,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 17:48:31,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:31,257 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 17:48:31,257 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:48:31,266 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:48:31,266 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:48:31,267 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 17:48:31,294 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 17:48:31,295 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:31,365 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 17:48:31,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072162023] [2019-11-25 17:48:31,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:48:31,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 17:48:31,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508510151] [2019-11-25 17:48:31,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:48:31,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:48:31,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:48:31,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:48:31,400 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 5 states. [2019-11-25 17:48:31,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:48:31,612 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2019-11-25 17:48:31,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:48:31,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-25 17:48:31,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:48:31,642 INFO L225 Difference]: With dead ends: 74 [2019-11-25 17:48:31,647 INFO L226 Difference]: Without dead ends: 71 [2019-11-25 17:48:31,649 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 17:48:31,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-25 17:48:31,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2019-11-25 17:48:31,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-25 17:48:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2019-11-25 17:48:31,705 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 17 [2019-11-25 17:48:31,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:48:31,705 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2019-11-25 17:48:31,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:48:31,705 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2019-11-25 17:48:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 17:48:31,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:31,706 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 17:48:31,921 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 17:48:31,922 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 17:48:31,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:31,923 INFO L82 PathProgramCache]: Analyzing trace with hash -896940050, now seen corresponding path program 1 times [2019-11-25 17:48:31,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:31,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79277174] [2019-11-25 17:48:31,926 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 17:48:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:48:32,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 17:48:32,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:32,105 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 17:48:32,105 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:48:32,113 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:48:32,114 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:48:32,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:48:32,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:48:32,156 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:32,470 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 17:48:32,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79277174] [2019-11-25 17:48:32,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:48:32,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-25 17:48:32,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898734052] [2019-11-25 17:48:32,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:48:32,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:48:32,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:48:32,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:48:32,478 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 10 states. [2019-11-25 17:48:32,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:48:32,964 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2019-11-25 17:48:32,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:48:32,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-25 17:48:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:48:32,967 INFO L225 Difference]: With dead ends: 70 [2019-11-25 17:48:32,967 INFO L226 Difference]: Without dead ends: 70 [2019-11-25 17:48:32,968 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 17:48:32,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-25 17:48:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-11-25 17:48:32,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-25 17:48:32,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2019-11-25 17:48:32,978 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 17 [2019-11-25 17:48:32,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:48:32,979 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2019-11-25 17:48:32,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:48:32,979 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2019-11-25 17:48:32,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 17:48:32,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:32,980 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 17:48:33,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 17:48:33,189 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 17:48:33,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:33,190 INFO L82 PathProgramCache]: Analyzing trace with hash -868310900, now seen corresponding path program 1 times [2019-11-25 17:48:33,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:33,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692366399] [2019-11-25 17:48:33,193 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 17:48:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:48:33,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 17:48:33,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:33,393 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 17:48:33,396 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:33,441 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 17:48:33,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692366399] [2019-11-25 17:48:33,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:48:33,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 17:48:33,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672792875] [2019-11-25 17:48:33,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:48:33,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:48:33,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:48:33,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:48:33,443 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 5 states. [2019-11-25 17:48:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:48:33,467 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-11-25 17:48:33,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:48:33,469 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-25 17:48:33,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:48:33,470 INFO L225 Difference]: With dead ends: 64 [2019-11-25 17:48:33,470 INFO L226 Difference]: Without dead ends: 64 [2019-11-25 17:48:33,473 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 17:48:33,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-25 17:48:33,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-25 17:48:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-25 17:48:33,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-25 17:48:33,490 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 17 [2019-11-25 17:48:33,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:48:33,491 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-25 17:48:33,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:48:33,491 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-25 17:48:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 17:48:33,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:33,493 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:48:33,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 17:48:33,714 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 17:48:33,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:33,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2008128002, now seen corresponding path program 1 times [2019-11-25 17:48:33,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:33,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [358140872] [2019-11-25 17:48:33,715 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 17:48:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:48:33,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 17:48:33,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:33,871 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 17:48:33,872 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:34,008 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 17:48:34,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [358140872] [2019-11-25 17:48:34,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:48:34,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 17:48:34,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322487820] [2019-11-25 17:48:34,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:48:34,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:48:34,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:48:34,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:48:34,012 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2019-11-25 17:48:34,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:48:34,038 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-25 17:48:34,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:48:34,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-25 17:48:34,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:48:34,040 INFO L225 Difference]: With dead ends: 64 [2019-11-25 17:48:34,040 INFO L226 Difference]: Without dead ends: 64 [2019-11-25 17:48:34,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:48:34,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-25 17:48:34,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-25 17:48:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-25 17:48:34,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-11-25 17:48:34,059 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 22 [2019-11-25 17:48:34,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:48:34,060 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-11-25 17:48:34,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:48:34,060 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-11-25 17:48:34,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 17:48:34,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:34,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:48:34,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 17:48:34,282 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 17:48:34,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:34,283 INFO L82 PathProgramCache]: Analyzing trace with hash 211176643, now seen corresponding path program 1 times [2019-11-25 17:48:34,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:34,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217001315] [2019-11-25 17:48:34,283 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 17:48:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:48:34,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 17:48:34,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:34,416 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 17:48:34,416 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:34,543 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 17:48:34,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217001315] [2019-11-25 17:48:34,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:48:34,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 17:48:34,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453072055] [2019-11-25 17:48:34,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 17:48:34,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:48:34,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 17:48:34,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:48:34,547 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 3 states. [2019-11-25 17:48:34,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:48:34,656 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-11-25 17:48:34,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 17:48:34,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-25 17:48:34,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:48:34,658 INFO L225 Difference]: With dead ends: 68 [2019-11-25 17:48:34,658 INFO L226 Difference]: Without dead ends: 58 [2019-11-25 17:48:34,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:48:34,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-25 17:48:34,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-25 17:48:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-25 17:48:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-25 17:48:34,670 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 22 [2019-11-25 17:48:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:48:34,671 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-25 17:48:34,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 17:48:34,673 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-25 17:48:34,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 17:48:34,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:34,674 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 17:48:34,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 17:48:34,893 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 17:48:34,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:34,893 INFO L82 PathProgramCache]: Analyzing trace with hash -45428445, now seen corresponding path program 1 times [2019-11-25 17:48:34,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:34,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997970047] [2019-11-25 17:48:34,894 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 17:48:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:48:35,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 17:48:35,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:35,056 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 17:48:35,056 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:35,117 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 17:48:35,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997970047] [2019-11-25 17:48:35,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:48:35,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 17:48:35,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120697845] [2019-11-25 17:48:35,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:48:35,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:48:35,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:48:35,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:48:35,119 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 6 states. [2019-11-25 17:48:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:48:35,160 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-11-25 17:48:35,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:48:35,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-25 17:48:35,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:48:35,166 INFO L225 Difference]: With dead ends: 64 [2019-11-25 17:48:35,166 INFO L226 Difference]: Without dead ends: 60 [2019-11-25 17:48:35,167 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 17:48:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-25 17:48:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-25 17:48:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 17:48:35,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-25 17:48:35,172 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 32 [2019-11-25 17:48:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:48:35,172 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-25 17:48:35,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:48:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-25 17:48:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 17:48:35,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:35,173 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 17:48:35,389 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 17:48:35,390 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 17:48:35,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:35,390 INFO L82 PathProgramCache]: Analyzing trace with hash -792080061, now seen corresponding path program 1 times [2019-11-25 17:48:35,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:35,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742865415] [2019-11-25 17:48:35,391 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 17:48:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:48:35,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 17:48:35,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:35,566 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 17:48:35,567 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:35,707 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 17:48:35,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [742865415] [2019-11-25 17:48:35,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:48:35,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-25 17:48:35,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335585349] [2019-11-25 17:48:35,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 17:48:35,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:48:35,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 17:48:35,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-25 17:48:35,709 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2019-11-25 17:48:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:48:35,912 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-25 17:48:35,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:48:35,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-25 17:48:35,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:48:35,914 INFO L225 Difference]: With dead ends: 68 [2019-11-25 17:48:35,915 INFO L226 Difference]: Without dead ends: 64 [2019-11-25 17:48:35,915 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 17:48:35,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-25 17:48:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-25 17:48:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-25 17:48:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-11-25 17:48:35,920 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 34 [2019-11-25 17:48:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:48:35,921 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-11-25 17:48:35,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 17:48:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-11-25 17:48:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 17:48:35,922 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:35,922 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 17:48:36,133 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 17:48:36,134 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 17:48:36,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:36,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1102366333, now seen corresponding path program 2 times [2019-11-25 17:48:36,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:36,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789495968] [2019-11-25 17:48:36,136 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-25 17:48:36,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 17:48:36,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 17:48:36,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 17:48:36,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:36,308 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 17:48:36,308 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:48:36,310 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:48:36,311 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:48:36,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 17:48:36,487 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 17:48:36,487 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:36,596 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 17:48:36,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789495968] [2019-11-25 17:48:36,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:48:36,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-25 17:48:36,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62551408] [2019-11-25 17:48:36,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 17:48:36,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:48:36,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 17:48:36,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 17:48:36,598 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 12 states. [2019-11-25 17:48:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:48:37,156 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-25 17:48:37,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:48:37,156 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-25 17:48:37,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:48:37,157 INFO L225 Difference]: With dead ends: 63 [2019-11-25 17:48:37,157 INFO L226 Difference]: Without dead ends: 63 [2019-11-25 17:48:37,158 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 17:48:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-25 17:48:37,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-25 17:48:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-25 17:48:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-25 17:48:37,163 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 38 [2019-11-25 17:48:37,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:48:37,164 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-25 17:48:37,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 17:48:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-25 17:48:37,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 17:48:37,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:37,165 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 17:48:37,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 17:48:37,375 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 17:48:37,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:37,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1102366332, now seen corresponding path program 1 times [2019-11-25 17:48:37,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:37,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [721333550] [2019-11-25 17:48:37,377 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 17:48:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:48:37,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 17:48:37,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:37,616 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 17:48:37,616 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:38,004 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 17:48:38,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [721333550] [2019-11-25 17:48:38,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:48:38,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-25 17:48:38,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631155631] [2019-11-25 17:48:38,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 17:48:38,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:48:38,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 17:48:38,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-25 17:48:38,006 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 18 states. [2019-11-25 17:48:38,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:48:38,961 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-11-25 17:48:38,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 17:48:38,964 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-25 17:48:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:48:38,965 INFO L225 Difference]: With dead ends: 75 [2019-11-25 17:48:38,965 INFO L226 Difference]: Without dead ends: 71 [2019-11-25 17:48:38,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-25 17:48:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-25 17:48:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-25 17:48:38,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-25 17:48:38,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-11-25 17:48:38,971 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 38 [2019-11-25 17:48:38,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:48:38,971 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-11-25 17:48:38,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 17:48:38,971 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-11-25 17:48:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-25 17:48:38,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:38,972 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 17:48:39,181 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-25 17:48:39,182 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 17:48:39,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:39,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2064886276, now seen corresponding path program 2 times [2019-11-25 17:48:39,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:39,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977634979] [2019-11-25 17:48:39,185 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 17:48:39,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 17:48:39,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 17:48:39,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 17:48:39,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:39,338 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 17:48:39,339 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:48:39,345 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:48:39,345 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:48:39,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:48:39,592 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 17:48:39,592 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:40,400 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 17:48:40,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977634979] [2019-11-25 17:48:40,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:48:40,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-25 17:48:40,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553713077] [2019-11-25 17:48:40,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 17:48:40,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:48:40,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 17:48:40,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-25 17:48:40,403 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 23 states. [2019-11-25 17:48:41,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:48:41,735 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-11-25 17:48:41,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 17:48:41,736 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-25 17:48:41,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:48:41,737 INFO L225 Difference]: With dead ends: 70 [2019-11-25 17:48:41,737 INFO L226 Difference]: Without dead ends: 70 [2019-11-25 17:48:41,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-25 17:48:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-25 17:48:41,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-25 17:48:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-25 17:48:41,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-11-25 17:48:41,743 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 46 [2019-11-25 17:48:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:48:41,743 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-11-25 17:48:41,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 17:48:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-11-25 17:48:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 17:48:41,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:41,746 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 17:48:41,952 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-25 17:48:41,954 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 17:48:41,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:41,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1743926468, now seen corresponding path program 1 times [2019-11-25 17:48:41,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:41,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057291306] [2019-11-25 17:48:41,957 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 17:48:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:48:42,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 17:48:42,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:42,391 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 17:48:42,392 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:42,516 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-25 17:48:43,340 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 17:48:43,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057291306] [2019-11-25 17:48:43,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:48:43,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-25 17:48:43,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355461855] [2019-11-25 17:48:43,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-25 17:48:43,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:48:43,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-25 17:48:43,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-25 17:48:43,343 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 34 states. [2019-11-25 17:48:44,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:48:44,124 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-11-25 17:48:44,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 17:48:44,125 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-25 17:48:44,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:48:44,126 INFO L225 Difference]: With dead ends: 76 [2019-11-25 17:48:44,126 INFO L226 Difference]: Without dead ends: 72 [2019-11-25 17:48:44,128 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 17:48:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-25 17:48:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-25 17:48:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-25 17:48:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-11-25 17:48:44,133 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 51 [2019-11-25 17:48:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:48:44,134 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-11-25 17:48:44,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-25 17:48:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-11-25 17:48:44,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 17:48:44,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:44,136 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 17:48:44,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-25 17:48:44,350 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 17:48:44,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:44,351 INFO L82 PathProgramCache]: Analyzing trace with hash 845780764, now seen corresponding path program 2 times [2019-11-25 17:48:44,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:44,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340919670] [2019-11-25 17:48:44,351 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 17:48:44,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 17:48:44,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 17:48:44,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 17:48:44,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:44,503 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 17:48:44,503 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:48:44,506 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:48:44,506 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:48:44,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 17:48:44,680 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 17:48:44,680 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:44,737 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 17:48:44,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340919670] [2019-11-25 17:48:44,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:48:44,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-25 17:48:44,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182427178] [2019-11-25 17:48:44,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 17:48:44,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:48:44,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 17:48:44,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 17:48:44,739 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 12 states. [2019-11-25 17:48:45,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:48:45,242 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-11-25 17:48:45,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 17:48:45,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-25 17:48:45,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:48:45,244 INFO L225 Difference]: With dead ends: 70 [2019-11-25 17:48:45,244 INFO L226 Difference]: Without dead ends: 70 [2019-11-25 17:48:45,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-25 17:48:45,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-25 17:48:45,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-25 17:48:45,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-25 17:48:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-11-25 17:48:45,253 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 53 [2019-11-25 17:48:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:48:45,253 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-11-25 17:48:45,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 17:48:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-11-25 17:48:45,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 17:48:45,254 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:45,255 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 17:48:45,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-25 17:48:45,466 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 17:48:45,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:45,466 INFO L82 PathProgramCache]: Analyzing trace with hash 845780765, now seen corresponding path program 1 times [2019-11-25 17:48:45,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:45,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071771487] [2019-11-25 17:48:45,468 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 17:48:45,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:48:45,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 17:48:45,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:45,693 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 17:48:45,694 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:48:45,701 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:48:45,701 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:48:45,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:48:45,963 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 17:48:45,963 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:46,742 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 17:48:46,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071771487] [2019-11-25 17:48:46,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:48:46,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-25 17:48:46,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863322877] [2019-11-25 17:48:46,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 17:48:46,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:48:46,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 17:48:46,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-25 17:48:46,744 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 23 states. [2019-11-25 17:48:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:48:48,072 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-11-25 17:48:48,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 17:48:48,073 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-25 17:48:48,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:48:48,074 INFO L225 Difference]: With dead ends: 68 [2019-11-25 17:48:48,074 INFO L226 Difference]: Without dead ends: 68 [2019-11-25 17:48:48,075 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 17:48:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-25 17:48:48,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-25 17:48:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-25 17:48:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-11-25 17:48:48,079 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 53 [2019-11-25 17:48:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:48:48,079 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-11-25 17:48:48,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 17:48:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-11-25 17:48:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 17:48:48,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:48,081 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:48:48,290 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-25 17:48:48,291 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 17:48:48,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:48,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1516815243, now seen corresponding path program 1 times [2019-11-25 17:48:48,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:48,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829093268] [2019-11-25 17:48:48,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-25 17:48:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:48:48,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 17:48:48,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:48,520 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 17:48:48,521 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:48,709 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 17:48:48,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829093268] [2019-11-25 17:48:48,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:48:48,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-25 17:48:48,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533241994] [2019-11-25 17:48:48,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 17:48:48,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:48:48,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 17:48:48,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:48:48,711 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 8 states. [2019-11-25 17:48:48,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:48:48,793 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-11-25 17:48:48,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 17:48:48,794 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-25 17:48:48,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:48:48,795 INFO L225 Difference]: With dead ends: 70 [2019-11-25 17:48:48,795 INFO L226 Difference]: Without dead ends: 68 [2019-11-25 17:48:48,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-25 17:48:48,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-25 17:48:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-25 17:48:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-25 17:48:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-11-25 17:48:48,799 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 51 [2019-11-25 17:48:48,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:48:48,800 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-11-25 17:48:48,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 17:48:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-11-25 17:48:48,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 17:48:48,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:48,802 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 17:48:49,011 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-25 17:48:49,011 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 17:48:49,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:49,012 INFO L82 PathProgramCache]: Analyzing trace with hash 240473020, now seen corresponding path program 1 times [2019-11-25 17:48:49,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:49,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082158660] [2019-11-25 17:48:49,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 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 17:48:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:48:49,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 17:48:49,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:49,228 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 17:48:49,228 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:49,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:49,590 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 17:48:49,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082158660] [2019-11-25 17:48:49,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:48:49,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-25 17:48:49,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021994346] [2019-11-25 17:48:49,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 17:48:49,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:48:49,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 17:48:49,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-25 17:48:49,592 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 11 states. [2019-11-25 17:48:49,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:48:49,692 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-11-25 17:48:49,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 17:48:49,693 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-11-25 17:48:49,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:48:49,694 INFO L225 Difference]: With dead ends: 72 [2019-11-25 17:48:49,694 INFO L226 Difference]: Without dead ends: 68 [2019-11-25 17:48:49,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-25 17:48:49,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-25 17:48:49,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-25 17:48:49,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-25 17:48:49,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-11-25 17:48:49,698 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 56 [2019-11-25 17:48:49,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:48:49,698 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-11-25 17:48:49,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 17:48:49,699 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-11-25 17:48:49,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-25 17:48:49,699 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:48:49,700 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:48:49,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-25 17:48:49,910 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 17:48:49,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:48:49,911 INFO L82 PathProgramCache]: Analyzing trace with hash 214334517, now seen corresponding path program 1 times [2019-11-25 17:48:49,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:48:49,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132662005] [2019-11-25 17:48:49,912 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 17:48:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:48:50,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-25 17:48:50,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:48:50,306 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 17:48:50,307 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:48:50,315 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:48:50,315 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:48:50,316 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-25 17:48:50,376 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:48:50,376 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 17:48:50,377 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:48:50,412 INFO L588 ElimStorePlain]: treesize reduction 29, result has 48.2 percent of original size [2019-11-25 17:48:50,412 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:48:50,412 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-25 17:48:50,516 INFO L343 Elim1Store]: treesize reduction 66, result has 22.4 percent of original size [2019-11-25 17:48:50,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2019-11-25 17:48:50,517 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:48:50,543 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:48:50,543 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:48:50,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-25 17:48:50,723 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-25 17:48:50,723 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 17:48:50,724 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:48:50,746 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:48:50,746 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:48:50,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-25 17:48:51,489 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 17:48:51,490 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:48:51,888 WARN L192 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-25 17:48:52,645 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-25 17:48:54,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:54,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:56,720 WARN L192 SmtUtils]: Spent 388.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-25 17:48:56,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:48:56,784 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:48:56,929 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-25 17:48:56,930 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-25 17:48:56,930 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 17:48:56,937 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-25 17:48:56,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 23 [2019-11-25 17:48:56,938 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:48:56,939 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:48:56,939 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:48:56,939 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:48:56,939 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 17:48:56,940 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-25 17:48:58,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:48:58,545 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:48:58,987 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-25 17:48:58,988 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-25 17:48:58,988 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 17:48:58,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:58,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:58,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:58,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:58,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:58,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:58,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:58,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:58,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:58,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:58,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:58,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:58,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:58,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,290 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-25 17:48:59,291 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-25 17:48:59,292 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 17:48:59,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:48:59,305 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:48:59,480 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-11-25 17:48:59,480 INFO L588 ElimStorePlain]: treesize reduction 193, result has 34.8 percent of original size [2019-11-25 17:48:59,481 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:48:59,537 INFO L588 ElimStorePlain]: treesize reduction 70, result has 34.6 percent of original size [2019-11-25 17:48:59,538 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:48:59,538 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:37 [2019-11-25 17:49:01,012 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 17:49:01,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132662005] [2019-11-25 17:49:01,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:49:01,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2019-11-25 17:49:01,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395814262] [2019-11-25 17:49:01,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-25 17:49:01,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:49:01,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-25 17:49:01,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2019-11-25 17:49:01,016 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 55 states. [2019-11-25 17:49:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:49:06,318 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-25 17:49:06,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-25 17:49:06,319 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 67 [2019-11-25 17:49:06,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:49:06,320 INFO L225 Difference]: With dead ends: 60 [2019-11-25 17:49:06,320 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 17:49:06,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2019-11-25 17:49:06,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 17:49:06,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 17:49:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 17:49:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 17:49:06,322 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2019-11-25 17:49:06,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:49:06,322 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 17:49:06,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-25 17:49:06,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 17:49:06,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 17:49:06,522 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-25 17:49:06,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:49:06 BoogieIcfgContainer [2019-11-25 17:49:06,531 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 17:49:06,531 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 17:49:06,531 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 17:49:06,532 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 17:49:06,532 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:48:30" (3/4) ... [2019-11-25 17:49:06,536 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 17:49:06,544 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-25 17:49:06,545 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 17:49:06,545 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-25 17:49:06,545 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-25 17:49:06,545 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-25 17:49:06,545 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-25 17:49:06,545 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-25 17:49:06,546 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-25 17:49:06,546 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-25 17:49:06,546 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 17:49:06,546 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-25 17:49:06,546 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-25 17:49:06,546 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-25 17:49:06,547 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-25 17:49:06,547 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-25 17:49:06,547 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-25 17:49:06,547 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-25 17:49:06,547 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-25 17:49:06,547 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-25 17:49:06,548 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-25 17:49:06,548 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 17:49:06,548 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-25 17:49:06,548 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-25 17:49:06,548 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-25 17:49:06,548 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-25 17:49:06,549 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-25 17:49:06,549 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-25 17:49:06,549 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-25 17:49:06,549 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-25 17:49:06,549 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-25 17:49:06,549 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-25 17:49:06,550 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-25 17:49:06,550 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-25 17:49:06,550 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-25 17:49:06,550 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-25 17:49:06,550 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-25 17:49:06,550 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-25 17:49:06,550 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-25 17:49:06,551 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-25 17:49:06,551 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 17:49:06,551 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-25 17:49:06,551 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-25 17:49:06,551 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-25 17:49:06,551 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-25 17:49:06,552 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-25 17:49:06,552 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-25 17:49:06,558 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2019-11-25 17:49:06,559 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-25 17:49:06,559 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 17:49:06,559 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 17:49:06,560 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 17:49:06,605 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 17:49:06,606 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 17:49:06,607 INFO L168 Benchmark]: Toolchain (without parser) took 38218.33 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 435.2 MB). Free memory was 951.0 MB in the beginning and 1.3 GB in the end (delta: -369.4 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. [2019-11-25 17:49:06,608 INFO L168 Benchmark]: CDTParser took 0.30 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 17:49:06,608 INFO L168 Benchmark]: CACSL2BoogieTranslator took 894.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-25 17:49:06,608 INFO L168 Benchmark]: Boogie Preprocessor took 104.13 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 17:49:06,609 INFO L168 Benchmark]: RCFGBuilder took 1484.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.1 MB in the end (delta: 110.5 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. [2019-11-25 17:49:06,609 INFO L168 Benchmark]: TraceAbstraction took 35654.29 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 297.3 MB). Free memory was 982.1 MB in the beginning and 1.3 GB in the end (delta: -350.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:49:06,610 INFO L168 Benchmark]: Witness Printer took 74.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-25 17:49:06,611 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 894.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -141.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 104.13 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 1484.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.1 MB in the end (delta: 110.5 MB). Peak memory consumption was 110.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 35654.29 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 297.3 MB). Free memory was 982.1 MB in the beginning and 1.3 GB in the end (delta: -350.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 74.78 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 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: 762]: 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, 330 locations, 71 error locations. Result: SAFE, OverallTime: 35.5s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 792 SDtfs, 441 SDslu, 5182 SDs, 0 SdLazy, 3843 SolverSat, 219 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1248 GetRequests, 985 SyntacticMatches, 19 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 17.2s InterpolantComputationTime, 614 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1196 ConstructedInterpolants, 80 QuantifiedInterpolants, 271329 SizeOfPredicates, 60 NumberOfNonLiveVariables, 2597 ConjunctsInSsa, 205 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 1340/1870 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...