./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5758efa3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.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 fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd ............................................................................................................................ 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_5.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 fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-5758efa [2019-11-26 21:23:56,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 21:23:56,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 21:23:56,190 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 21:23:56,190 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 21:23:56,191 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 21:23:56,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 21:23:56,195 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 21:23:56,197 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 21:23:56,198 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 21:23:56,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 21:23:56,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 21:23:56,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 21:23:56,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 21:23:56,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 21:23:56,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 21:23:56,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 21:23:56,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 21:23:56,207 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 21:23:56,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 21:23:56,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 21:23:56,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 21:23:56,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 21:23:56,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 21:23:56,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 21:23:56,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 21:23:56,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 21:23:56,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 21:23:56,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 21:23:56,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 21:23:56,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 21:23:56,221 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 21:23:56,222 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 21:23:56,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 21:23:56,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 21:23:56,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 21:23:56,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 21:23:56,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 21:23:56,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 21:23:56,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 21:23:56,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 21:23:56,234 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-26 21:23:56,256 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 21:23:56,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 21:23:56,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 21:23:56,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 21:23:56,259 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 21:23:56,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 21:23:56,259 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 21:23:56,259 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 21:23:56,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 21:23:56,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 21:23:56,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 21:23:56,261 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 21:23:56,261 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 21:23:56,262 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 21:23:56,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 21:23:56,262 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 21:23:56,263 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 21:23:56,263 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 21:23:56,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 21:23:56,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 21:23:56,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 21:23:56,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 21:23:56,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 21:23:56,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 21:23:56,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 21:23:56,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-26 21:23:56,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 21:23:56,266 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 -> fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd [2019-11-26 21:23:56,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 21:23:56,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 21:23:56,586 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 21:23:56,588 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 21:23:56,589 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 21:23:56,589 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-26 21:23:56,663 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68f625244/62298324806f4d6ca283c0723c43755c/FLAG640410831 [2019-11-26 21:23:57,236 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 21:23:57,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-26 21:23:57,257 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68f625244/62298324806f4d6ca283c0723c43755c/FLAG640410831 [2019-11-26 21:23:57,514 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68f625244/62298324806f4d6ca283c0723c43755c [2019-11-26 21:23:57,518 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 21:23:57,519 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 21:23:57,521 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 21:23:57,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 21:23:57,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 21:23:57,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:23:57" (1/1) ... [2019-11-26 21:23:57,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af3dfac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:57, skipping insertion in model container [2019-11-26 21:23:57,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:23:57" (1/1) ... [2019-11-26 21:23:57,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 21:23:57,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:23:58,088 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:23:58,115 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-11-26 21:23:58,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@296de19d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:58, skipping insertion in model container [2019-11-26 21:23:58,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 21:23:58,117 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-26 21:23:58,120 INFO L168 Benchmark]: Toolchain (without parser) took 599.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -164.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-26 21:23:58,121 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-26 21:23:58,123 INFO L168 Benchmark]: CACSL2BoogieTranslator took 595.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-26 21:23:58,127 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 595.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -170.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-5758efa [2019-11-26 21:23:59,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 21:23:59,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 21:23:59,887 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 21:23:59,887 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 21:23:59,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 21:23:59,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 21:23:59,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 21:23:59,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 21:23:59,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 21:23:59,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 21:23:59,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 21:23:59,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 21:23:59,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 21:23:59,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 21:23:59,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 21:23:59,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 21:23:59,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 21:23:59,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 21:23:59,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 21:23:59,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 21:23:59,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 21:23:59,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 21:23:59,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 21:23:59,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 21:23:59,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 21:23:59,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 21:23:59,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 21:23:59,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 21:23:59,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 21:23:59,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 21:23:59,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 21:23:59,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 21:23:59,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 21:23:59,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 21:23:59,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 21:23:59,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 21:23:59,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 21:23:59,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 21:23:59,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 21:23:59,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 21:23:59,925 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-26 21:23:59,940 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 21:23:59,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 21:23:59,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 21:23:59,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 21:23:59,942 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 21:23:59,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 21:23:59,943 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 21:23:59,943 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 21:23:59,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 21:23:59,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 21:23:59,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 21:23:59,944 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 21:23:59,944 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 21:23:59,944 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 21:23:59,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 21:23:59,944 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 21:23:59,945 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 21:23:59,945 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 21:23:59,945 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 21:23:59,945 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 21:23:59,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 21:23:59,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 21:23:59,946 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 21:23:59,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 21:23:59,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 21:23:59,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 21:23:59,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 21:23:59,947 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-26 21:23:59,947 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 21:23:59,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 21:23:59,948 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 -> fd4ad7692f5709ff8aaeaf10c342a0f425eb83bd [2019-11-26 21:24:00,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 21:24:00,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 21:24:00,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 21:24:00,249 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 21:24:00,250 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 21:24:00,251 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-26 21:24:00,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda958484/aeedbd3c221f401a8876d7e1b6568695/FLAG9ecf77b39 [2019-11-26 21:24:00,848 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 21:24:00,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_5.i [2019-11-26 21:24:00,891 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda958484/aeedbd3c221f401a8876d7e1b6568695/FLAG9ecf77b39 [2019-11-26 21:24:01,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cda958484/aeedbd3c221f401a8876d7e1b6568695 [2019-11-26 21:24:01,141 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 21:24:01,143 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 21:24:01,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 21:24:01,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 21:24:01,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 21:24:01,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:24:01" (1/1) ... [2019-11-26 21:24:01,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7109c780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:24:01, skipping insertion in model container [2019-11-26 21:24:01,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:24:01" (1/1) ... [2019-11-26 21:24:01,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 21:24:01,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:24:01,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:24:01,711 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-26 21:24:01,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:24:01,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:24:01,817 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 21:24:01,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:24:01,968 INFO L208 MainTranslator]: Completed translation [2019-11-26 21:24:01,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:24:01 WrapperNode [2019-11-26 21:24:01,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 21:24:01,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 21:24:01,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 21:24:01,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 21:24:01,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:24:01" (1/1) ... [2019-11-26 21:24:01,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:24:01" (1/1) ... [2019-11-26 21:24:02,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:24:01" (1/1) ... [2019-11-26 21:24:02,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:24:01" (1/1) ... [2019-11-26 21:24:02,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:24:01" (1/1) ... [2019-11-26 21:24:02,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:24:01" (1/1) ... [2019-11-26 21:24:02,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:24:01" (1/1) ... [2019-11-26 21:24:02,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 21:24:02,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 21:24:02,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 21:24:02,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 21:24:02,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:24:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 21:24:02,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-26 21:24:02,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 21:24:02,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-26 21:24:02,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 21:24:02,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-26 21:24:02,162 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-26 21:24:02,162 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-26 21:24:02,162 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-26 21:24:02,162 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-26 21:24:02,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-26 21:24:02,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-26 21:24:02,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-26 21:24:02,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-26 21:24:02,165 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-26 21:24:02,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-26 21:24:02,166 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-26 21:24:02,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-26 21:24:02,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-26 21:24:02,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-26 21:24:02,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-26 21:24:02,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-26 21:24:02,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-26 21:24:02,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-26 21:24:02,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-26 21:24:02,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-26 21:24:02,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-26 21:24:02,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-26 21:24:02,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-26 21:24:02,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-26 21:24:02,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-26 21:24:02,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-26 21:24:02,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-26 21:24:02,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-26 21:24:02,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-26 21:24:02,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-26 21:24:02,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-26 21:24:02,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-26 21:24:02,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-26 21:24:02,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-26 21:24:02,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-26 21:24:02,170 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-26 21:24:02,171 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-26 21:24:02,171 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_get [2019-11-26 21:24:02,171 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_put [2019-11-26 21:24:02,172 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-26 21:24:02,172 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-26 21:24:02,172 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-26 21:24:02,172 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-26 21:24:02,172 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-26 21:24:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-26 21:24:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-26 21:24:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-26 21:24:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-26 21:24:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-26 21:24:02,173 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-26 21:24:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-26 21:24:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-26 21:24:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-26 21:24:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-26 21:24:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-26 21:24:02,174 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-26 21:24:02,175 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-26 21:24:02,175 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-26 21:24:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-26 21:24:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-26 21:24:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-26 21:24:02,176 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-26 21:24:02,177 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-26 21:24:02,177 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-26 21:24:02,178 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-26 21:24:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-26 21:24:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-26 21:24:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-26 21:24:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-26 21:24:02,179 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-26 21:24:02,180 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-26 21:24:02,180 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-26 21:24:02,180 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-26 21:24:02,180 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-26 21:24:02,180 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-26 21:24:02,180 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-26 21:24:02,180 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-26 21:24:02,180 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-26 21:24:02,181 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-26 21:24:02,181 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-26 21:24:02,181 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-26 21:24:02,181 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-26 21:24:02,181 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-26 21:24:02,181 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-26 21:24:02,181 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-26 21:24:02,182 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-26 21:24:02,182 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-26 21:24:02,182 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-26 21:24:02,182 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-26 21:24:02,182 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-26 21:24:02,182 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-26 21:24:02,182 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-26 21:24:02,182 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-26 21:24:02,183 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-26 21:24:02,183 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-26 21:24:02,183 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-26 21:24:02,183 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-26 21:24:02,183 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-26 21:24:02,183 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-26 21:24:02,183 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-26 21:24:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-26 21:24:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-26 21:24:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-26 21:24:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-26 21:24:02,184 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-26 21:24:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-26 21:24:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-26 21:24:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-26 21:24:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-26 21:24:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-26 21:24:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-26 21:24:02,185 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-26 21:24:02,186 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-26 21:24:02,186 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-26 21:24:02,186 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-26 21:24:02,186 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-26 21:24:02,187 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-26 21:24:02,187 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-26 21:24:02,187 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-26 21:24:02,187 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-26 21:24:02,188 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-26 21:24:02,189 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-26 21:24:02,193 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-26 21:24:02,193 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-26 21:24:02,193 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-26 21:24:02,193 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-26 21:24:02,193 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-26 21:24:02,193 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-26 21:24:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-26 21:24:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-26 21:24:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-26 21:24:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-26 21:24:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-26 21:24:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-26 21:24:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-26 21:24:02,194 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-26 21:24:02,195 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-26 21:24:02,195 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-26 21:24:02,195 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-26 21:24:02,195 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-26 21:24:02,195 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-26 21:24:02,195 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-26 21:24:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-26 21:24:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-26 21:24:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-26 21:24:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-26 21:24:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-26 21:24:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-26 21:24:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-26 21:24:02,196 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-26 21:24:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-26 21:24:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-26 21:24:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-26 21:24:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-26 21:24:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-26 21:24:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-26 21:24:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-26 21:24:02,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-26 21:24:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 21:24:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-26 21:24:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-26 21:24:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-26 21:24:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 21:24:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-26 21:24:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-26 21:24:02,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-26 21:24:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 21:24:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-26 21:24:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-26 21:24:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-26 21:24:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-26 21:24:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-26 21:24:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-26 21:24:02,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 21:24:02,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-26 21:24:02,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-26 21:24:02,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-26 21:24:02,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-26 21:24:02,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-26 21:24:02,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 21:24:02,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 21:24:02,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-26 21:24:02,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-26 21:24:02,201 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-26 21:24:02,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-26 21:24:02,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-26 21:24:02,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-26 21:24:02,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-26 21:24:02,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-26 21:24:02,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-26 21:24:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-26 21:24:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-26 21:24:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-26 21:24:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-26 21:24:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-26 21:24:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-26 21:24:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-26 21:24:02,202 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-26 21:24:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_get [2019-11-26 21:24:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_put [2019-11-26 21:24:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-26 21:24:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-26 21:24:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-26 21:24:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 21:24:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 21:24:02,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 21:24:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 21:24:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-26 21:24:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-26 21:24:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-26 21:24:02,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-26 21:24:02,895 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 21:24:03,303 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 21:24:03,697 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 21:24:03,697 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-26 21:24:03,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:24:03 BoogieIcfgContainer [2019-11-26 21:24:03,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 21:24:03,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 21:24:03,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 21:24:03,704 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 21:24:03,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 09:24:01" (1/3) ... [2019-11-26 21:24:03,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a2dc56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:24:03, skipping insertion in model container [2019-11-26 21:24:03,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:24:01" (2/3) ... [2019-11-26 21:24:03,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a2dc56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:24:03, skipping insertion in model container [2019-11-26 21:24:03,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:24:03" (3/3) ... [2019-11-26 21:24:03,709 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_5.i [2019-11-26 21:24:03,719 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 21:24:03,731 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-26 21:24:03,745 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-26 21:24:03,772 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 21:24:03,772 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 21:24:03,772 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 21:24:03,772 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 21:24:03,773 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 21:24:03,773 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 21:24:03,773 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 21:24:03,773 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 21:24:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2019-11-26 21:24:03,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 21:24:03,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:03,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:03,818 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:03,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:03,824 INFO L82 PathProgramCache]: Analyzing trace with hash -604206848, now seen corresponding path program 1 times [2019-11-26 21:24:03,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:03,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5969741] [2019-11-26 21:24:03,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:04,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 21:24:04,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:04,206 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:24:04,208 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:04,220 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:04,221 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:04,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:24:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:04,253 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:04,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:04,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5969741] [2019-11-26 21:24:04,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:04,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 21:24:04,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517993131] [2019-11-26 21:24:04,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:24:04,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:04,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:24:04,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:24:04,360 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 5 states. [2019-11-26 21:24:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:04,739 INFO L93 Difference]: Finished difference Result 137 states and 148 transitions. [2019-11-26 21:24:04,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:24:04,741 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-26 21:24:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:04,769 INFO L225 Difference]: With dead ends: 137 [2019-11-26 21:24:04,770 INFO L226 Difference]: Without dead ends: 134 [2019-11-26 21:24:04,771 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:24:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-26 21:24:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 128. [2019-11-26 21:24:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-26 21:24:04,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2019-11-26 21:24:04,866 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 17 [2019-11-26 21:24:04,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:04,866 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2019-11-26 21:24:04,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:24:04,867 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2019-11-26 21:24:04,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 21:24:04,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:04,868 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:05,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-26 21:24:05,081 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:05,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:05,081 INFO L82 PathProgramCache]: Analyzing trace with hash -604206847, now seen corresponding path program 1 times [2019-11-26 21:24:05,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:05,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580927495] [2019-11-26 21:24:05,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:05,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 21:24:05,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:05,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:24:05,268 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:05,276 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:05,276 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:05,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:24:05,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:05,334 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:05,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580927495] [2019-11-26 21:24:05,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:05,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-26 21:24:05,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519159235] [2019-11-26 21:24:05,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 21:24:05,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:05,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 21:24:05,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-26 21:24:05,696 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand 10 states. [2019-11-26 21:24:06,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:06,397 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-11-26 21:24:06,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 21:24:06,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-26 21:24:06,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:06,400 INFO L225 Difference]: With dead ends: 133 [2019-11-26 21:24:06,400 INFO L226 Difference]: Without dead ends: 133 [2019-11-26 21:24:06,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:24:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-26 21:24:06,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2019-11-26 21:24:06,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-26 21:24:06,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2019-11-26 21:24:06,412 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 17 [2019-11-26 21:24:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:06,412 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2019-11-26 21:24:06,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 21:24:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2019-11-26 21:24:06,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 21:24:06,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:06,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:06,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-26 21:24:06,616 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:06,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:06,617 INFO L82 PathProgramCache]: Analyzing trace with hash -575577697, now seen corresponding path program 1 times [2019-11-26 21:24:06,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:06,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758580149] [2019-11-26 21:24:06,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:06,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 21:24:06,762 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:06,809 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:06,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758580149] [2019-11-26 21:24:06,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:06,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-26 21:24:06,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918408412] [2019-11-26 21:24:06,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:24:06,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:06,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:24:06,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:24:06,862 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 5 states. [2019-11-26 21:24:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:06,899 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2019-11-26 21:24:06,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:24:06,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-26 21:24:06,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:06,906 INFO L225 Difference]: With dead ends: 127 [2019-11-26 21:24:06,906 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 21:24:06,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:24:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 21:24:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-11-26 21:24:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-26 21:24:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2019-11-26 21:24:06,926 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 17 [2019-11-26 21:24:06,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:06,926 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2019-11-26 21:24:06,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:24:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2019-11-26 21:24:06,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-26 21:24:06,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:06,928 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] [2019-11-26 21:24:07,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-26 21:24:07,141 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:07,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:07,142 INFO L82 PathProgramCache]: Analyzing trace with hash -811306797, now seen corresponding path program 1 times [2019-11-26 21:24:07,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:07,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390183301] [2019-11-26 21:24:07,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:07,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:07,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 21:24:07,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:07,323 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:07,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:07,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390183301] [2019-11-26 21:24:07,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:07,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-26 21:24:07,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995332431] [2019-11-26 21:24:07,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:24:07,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:07,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:24:07,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:24:07,413 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 5 states. [2019-11-26 21:24:07,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:07,436 INFO L93 Difference]: Finished difference Result 127 states and 134 transitions. [2019-11-26 21:24:07,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:24:07,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-26 21:24:07,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:07,438 INFO L225 Difference]: With dead ends: 127 [2019-11-26 21:24:07,438 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 21:24:07,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:24:07,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 21:24:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2019-11-26 21:24:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-26 21:24:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2019-11-26 21:24:07,447 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 31 [2019-11-26 21:24:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:07,447 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2019-11-26 21:24:07,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:24:07,447 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2019-11-26 21:24:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-26 21:24:07,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:07,449 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] [2019-11-26 21:24:07,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-26 21:24:07,663 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:07,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:07,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1220131022, now seen corresponding path program 1 times [2019-11-26 21:24:07,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:07,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107990541] [2019-11-26 21:24:07,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:07,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-26 21:24:07,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:07,939 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:07,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107990541] [2019-11-26 21:24:07,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:07,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2019-11-26 21:24:07,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345036545] [2019-11-26 21:24:07,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 21:24:07,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:07,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 21:24:07,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:24:07,994 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 9 states. [2019-11-26 21:24:08,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:08,114 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2019-11-26 21:24:08,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 21:24:08,116 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-11-26 21:24:08,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:08,118 INFO L225 Difference]: With dead ends: 142 [2019-11-26 21:24:08,118 INFO L226 Difference]: Without dead ends: 142 [2019-11-26 21:24:08,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:24:08,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-26 21:24:08,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2019-11-26 21:24:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-26 21:24:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2019-11-26 21:24:08,134 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 31 [2019-11-26 21:24:08,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:08,137 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2019-11-26 21:24:08,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 21:24:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2019-11-26 21:24:08,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 21:24:08,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:08,139 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:08,352 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-26 21:24:08,353 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:08,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:08,354 INFO L82 PathProgramCache]: Analyzing trace with hash 536113147, now seen corresponding path program 1 times [2019-11-26 21:24:08,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:08,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29576369] [2019-11-26 21:24:08,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:08,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 21:24:08,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:08,509 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:08,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29576369] [2019-11-26 21:24:08,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:08,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-26 21:24:08,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340790436] [2019-11-26 21:24:08,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 21:24:08,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:08,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 21:24:08,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 21:24:08,564 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand 6 states. [2019-11-26 21:24:08,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:08,607 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2019-11-26 21:24:08,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 21:24:08,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-26 21:24:08,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:08,609 INFO L225 Difference]: With dead ends: 144 [2019-11-26 21:24:08,609 INFO L226 Difference]: Without dead ends: 140 [2019-11-26 21:24:08,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:24:08,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-26 21:24:08,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-11-26 21:24:08,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-26 21:24:08,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2019-11-26 21:24:08,624 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 32 [2019-11-26 21:24:08,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:08,627 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2019-11-26 21:24:08,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 21:24:08,627 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2019-11-26 21:24:08,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-26 21:24:08,630 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:08,630 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:08,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-26 21:24:08,847 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:08,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:08,848 INFO L82 PathProgramCache]: Analyzing trace with hash 690495131, now seen corresponding path program 1 times [2019-11-26 21:24:08,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:08,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830651898] [2019-11-26 21:24:08,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:08,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 21:24:08,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:09,044 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:09,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830651898] [2019-11-26 21:24:09,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:24:09,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-26 21:24:09,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360643708] [2019-11-26 21:24:09,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 21:24:09,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:09,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 21:24:09,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-26 21:24:09,210 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand 10 states. [2019-11-26 21:24:09,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:09,445 INFO L93 Difference]: Finished difference Result 148 states and 158 transitions. [2019-11-26 21:24:09,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 21:24:09,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-26 21:24:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:09,447 INFO L225 Difference]: With dead ends: 148 [2019-11-26 21:24:09,447 INFO L226 Difference]: Without dead ends: 144 [2019-11-26 21:24:09,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-26 21:24:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-26 21:24:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-11-26 21:24:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-26 21:24:09,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2019-11-26 21:24:09,455 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 34 [2019-11-26 21:24:09,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:09,455 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2019-11-26 21:24:09,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 21:24:09,455 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2019-11-26 21:24:09,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-26 21:24:09,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:09,457 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:09,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-26 21:24:09,669 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:09,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:09,670 INFO L82 PathProgramCache]: Analyzing trace with hash 780110635, now seen corresponding path program 1 times [2019-11-26 21:24:09,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:09,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938735826] [2019-11-26 21:24:09,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:09,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-26 21:24:09,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 21:24:09,858 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:10,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 21:24:10,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938735826] [2019-11-26 21:24:10,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:10,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 21:24:10,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083494281] [2019-11-26 21:24:10,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 21:24:10,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:10,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 21:24:10,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 21:24:10,061 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 3 states. [2019-11-26 21:24:10,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:10,240 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2019-11-26 21:24:10,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 21:24:10,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-26 21:24:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:10,242 INFO L225 Difference]: With dead ends: 157 [2019-11-26 21:24:10,243 INFO L226 Difference]: Without dead ends: 137 [2019-11-26 21:24:10,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 21:24:10,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-26 21:24:10,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2019-11-26 21:24:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-26 21:24:10,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2019-11-26 21:24:10,249 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 36 [2019-11-26 21:24:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:10,249 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2019-11-26 21:24:10,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 21:24:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2019-11-26 21:24:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 21:24:10,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:10,250 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:10,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-26 21:24:10,455 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:10,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:10,456 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385957, now seen corresponding path program 2 times [2019-11-26 21:24:10,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:10,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332156013] [2019-11-26 21:24:10,458 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 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:10,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-26 21:24:10,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:24:10,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 21:24:10,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:10,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:24:10,614 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:10,616 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:10,616 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:10,617 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:24:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-26 21:24:10,752 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-26 21:24:10,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332156013] [2019-11-26 21:24:10,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:10,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-26 21:24:10,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331173764] [2019-11-26 21:24:10,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 21:24:10,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:10,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 21:24:10,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:24:10,839 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 12 states. [2019-11-26 21:24:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:11,847 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2019-11-26 21:24:11,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 21:24:11,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-26 21:24:11,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:11,849 INFO L225 Difference]: With dead ends: 152 [2019-11-26 21:24:11,849 INFO L226 Difference]: Without dead ends: 152 [2019-11-26 21:24:11,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-26 21:24:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-26 21:24:11,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2019-11-26 21:24:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-26 21:24:11,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2019-11-26 21:24:11,855 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 38 [2019-11-26 21:24:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:11,856 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2019-11-26 21:24:11,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 21:24:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2019-11-26 21:24:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 21:24:11,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:11,857 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:12,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-26 21:24:12,068 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:12,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:12,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385956, now seen corresponding path program 1 times [2019-11-26 21:24:12,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:12,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419099516] [2019-11-26 21:24:12,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:12,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 21:24:12,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:12,314 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:12,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419099516] [2019-11-26 21:24:12,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:24:12,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-26 21:24:12,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532414464] [2019-11-26 21:24:12,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-26 21:24:12,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:12,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-26 21:24:12,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-26 21:24:12,681 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 18 states. [2019-11-26 21:24:13,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:13,630 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2019-11-26 21:24:13,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 21:24:13,631 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-26 21:24:13,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:13,632 INFO L225 Difference]: With dead ends: 138 [2019-11-26 21:24:13,632 INFO L226 Difference]: Without dead ends: 134 [2019-11-26 21:24:13,633 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-26 21:24:13,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-26 21:24:13,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-11-26 21:24:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-26 21:24:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 140 transitions. [2019-11-26 21:24:13,638 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 140 transitions. Word has length 38 [2019-11-26 21:24:13,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:13,638 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 140 transitions. [2019-11-26 21:24:13,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-26 21:24:13,638 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 140 transitions. [2019-11-26 21:24:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-26 21:24:13,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:13,640 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:13,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-26 21:24:13,846 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:13,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:13,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1528032860, now seen corresponding path program 2 times [2019-11-26 21:24:13,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:13,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780315627] [2019-11-26 21:24:13,849 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 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:13,993 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-26 21:24:13,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:24:13,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 21:24:13,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:14,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:24:14,012 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:14,021 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:14,022 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:14,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:24:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-26 21:24:14,280 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-26 21:24:15,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780315627] [2019-11-26 21:24:15,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:15,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-26 21:24:15,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836435287] [2019-11-26 21:24:15,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 21:24:15,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:15,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 21:24:15,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-26 21:24:15,208 INFO L87 Difference]: Start difference. First operand 134 states and 140 transitions. Second operand 23 states. [2019-11-26 21:24:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:17,751 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2019-11-26 21:24:17,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 21:24:17,752 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-26 21:24:17,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:17,753 INFO L225 Difference]: With dead ends: 133 [2019-11-26 21:24:17,753 INFO L226 Difference]: Without dead ends: 133 [2019-11-26 21:24:17,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-26 21:24:17,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-26 21:24:17,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-11-26 21:24:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-26 21:24:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2019-11-26 21:24:17,760 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 46 [2019-11-26 21:24:17,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:17,760 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2019-11-26 21:24:17,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 21:24:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2019-11-26 21:24:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 21:24:17,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:17,762 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:17,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-26 21:24:17,967 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:17,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:17,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1472640772, now seen corresponding path program 1 times [2019-11-26 21:24:17,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:17,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691825635] [2019-11-26 21:24:17,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:18,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 21:24:18,166 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:18,354 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:18,467 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-26 21:24:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:19,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691825635] [2019-11-26 21:24:19,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:24:19,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-26 21:24:19,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461904328] [2019-11-26 21:24:19,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-26 21:24:19,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:19,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-26 21:24:19,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-26 21:24:19,336 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand 34 states. [2019-11-26 21:24:20,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:20,308 INFO L93 Difference]: Finished difference Result 139 states and 145 transitions. [2019-11-26 21:24:20,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-26 21:24:20,311 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-26 21:24:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:20,313 INFO L225 Difference]: With dead ends: 139 [2019-11-26 21:24:20,313 INFO L226 Difference]: Without dead ends: 135 [2019-11-26 21:24:20,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-11-26 21:24:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-26 21:24:20,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-11-26 21:24:20,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-26 21:24:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 141 transitions. [2019-11-26 21:24:20,324 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 141 transitions. Word has length 51 [2019-11-26 21:24:20,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:20,327 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 141 transitions. [2019-11-26 21:24:20,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-26 21:24:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 141 transitions. [2019-11-26 21:24:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 21:24:20,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:20,331 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:20,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-26 21:24:20,544 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:20,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:20,545 INFO L82 PathProgramCache]: Analyzing trace with hash 680412260, now seen corresponding path program 2 times [2019-11-26 21:24:20,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:20,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933576917] [2019-11-26 21:24:20,546 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 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:20,691 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-26 21:24:20,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:24:20,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 21:24:20,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:20,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:24:20,713 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:20,717 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:20,717 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:20,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:24:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:20,878 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:20,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933576917] [2019-11-26 21:24:20,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:20,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-26 21:24:20,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415353261] [2019-11-26 21:24:20,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 21:24:20,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:20,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 21:24:20,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:24:20,946 INFO L87 Difference]: Start difference. First operand 135 states and 141 transitions. Second operand 12 states. [2019-11-26 21:24:21,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:21,826 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2019-11-26 21:24:21,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 21:24:21,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-26 21:24:21,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:21,828 INFO L225 Difference]: With dead ends: 159 [2019-11-26 21:24:21,828 INFO L226 Difference]: Without dead ends: 159 [2019-11-26 21:24:21,830 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-26 21:24:21,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-26 21:24:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2019-11-26 21:24:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-26 21:24:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 139 transitions. [2019-11-26 21:24:21,842 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 139 transitions. Word has length 53 [2019-11-26 21:24:21,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:21,843 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 139 transitions. [2019-11-26 21:24:21,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 21:24:21,843 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 139 transitions. [2019-11-26 21:24:21,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 21:24:21,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:21,844 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:22,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-26 21:24:22,046 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:22,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:22,047 INFO L82 PathProgramCache]: Analyzing trace with hash 680412261, now seen corresponding path program 1 times [2019-11-26 21:24:22,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:22,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856331019] [2019-11-26 21:24:22,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:22,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 21:24:22,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:22,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:24:22,251 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:22,258 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:22,258 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:22,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:24:22,500 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:22,500 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:23,330 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:23,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856331019] [2019-11-26 21:24:23,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:23,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-26 21:24:23,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978853168] [2019-11-26 21:24:23,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 21:24:23,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:23,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 21:24:23,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-26 21:24:23,333 INFO L87 Difference]: Start difference. First operand 133 states and 139 transitions. Second operand 23 states. [2019-11-26 21:24:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:25,502 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2019-11-26 21:24:25,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 21:24:25,503 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-26 21:24:25,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:25,504 INFO L225 Difference]: With dead ends: 131 [2019-11-26 21:24:25,504 INFO L226 Difference]: Without dead ends: 131 [2019-11-26 21:24:25,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-26 21:24:25,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-26 21:24:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-26 21:24:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-26 21:24:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2019-11-26 21:24:25,509 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 53 [2019-11-26 21:24:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:25,510 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2019-11-26 21:24:25,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 21:24:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2019-11-26 21:24:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-26 21:24:25,511 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:25,511 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] [2019-11-26 21:24:25,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-26 21:24:25,716 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:25,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:25,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1848313328, now seen corresponding path program 1 times [2019-11-26 21:24:25,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:25,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660554981] [2019-11-26 21:24:25,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:25,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 21:24:25,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:25,934 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:26,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660554981] [2019-11-26 21:24:26,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:26,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-26 21:24:26,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718355518] [2019-11-26 21:24:26,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 21:24:26,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:26,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 21:24:26,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-26 21:24:26,066 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand 8 states. [2019-11-26 21:24:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:26,110 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-11-26 21:24:26,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 21:24:26,111 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-11-26 21:24:26,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:26,112 INFO L225 Difference]: With dead ends: 133 [2019-11-26 21:24:26,112 INFO L226 Difference]: Without dead ends: 131 [2019-11-26 21:24:26,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-26 21:24:26,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-26 21:24:26,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-26 21:24:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-26 21:24:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2019-11-26 21:24:26,117 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 60 [2019-11-26 21:24:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:26,117 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2019-11-26 21:24:26,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 21:24:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2019-11-26 21:24:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-26 21:24:26,118 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:26,119 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:26,330 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-26 21:24:26,330 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:26,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:26,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1123996245, now seen corresponding path program 1 times [2019-11-26 21:24:26,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:26,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803491191] [2019-11-26 21:24:26,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:26,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 21:24:26,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:26,588 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:26,588 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:26,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:26,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803491191] [2019-11-26 21:24:26,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:26,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-26 21:24:26,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972635123] [2019-11-26 21:24:26,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 21:24:26,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:26,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 21:24:26,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:24:26,859 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand 11 states. [2019-11-26 21:24:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:26,961 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-11-26 21:24:26,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:24:26,962 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-11-26 21:24:26,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:26,963 INFO L225 Difference]: With dead ends: 135 [2019-11-26 21:24:26,963 INFO L226 Difference]: Without dead ends: 131 [2019-11-26 21:24:26,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-26 21:24:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-26 21:24:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-26 21:24:26,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-26 21:24:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2019-11-26 21:24:26,979 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 65 [2019-11-26 21:24:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:26,980 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2019-11-26 21:24:26,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 21:24:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2019-11-26 21:24:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-26 21:24:26,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:26,983 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:27,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-26 21:24:27,184 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:27,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:27,185 INFO L82 PathProgramCache]: Analyzing trace with hash -638447166, now seen corresponding path program 1 times [2019-11-26 21:24:27,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:27,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624554700] [2019-11-26 21:24:27,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:27,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-26 21:24:27,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:27,437 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:24:27,437 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:27,439 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:27,440 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:27,440 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:24:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:27,747 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:27,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624554700] [2019-11-26 21:24:27,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:27,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18, 17] imperfect sequences [] total 18 [2019-11-26 21:24:27,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564412799] [2019-11-26 21:24:27,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-26 21:24:27,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:27,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-26 21:24:27,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-11-26 21:24:27,971 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 19 states. [2019-11-26 21:24:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:29,504 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2019-11-26 21:24:29,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 21:24:29,510 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2019-11-26 21:24:29,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:29,512 INFO L225 Difference]: With dead ends: 183 [2019-11-26 21:24:29,512 INFO L226 Difference]: Without dead ends: 183 [2019-11-26 21:24:29,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2019-11-26 21:24:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-26 21:24:29,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 157. [2019-11-26 21:24:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-26 21:24:29,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2019-11-26 21:24:29,523 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 76 [2019-11-26 21:24:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:29,524 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2019-11-26 21:24:29,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-26 21:24:29,525 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2019-11-26 21:24:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-26 21:24:29,531 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:29,531 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:29,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-26 21:24:29,751 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:29,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:29,752 INFO L82 PathProgramCache]: Analyzing trace with hash -638447165, now seen corresponding path program 1 times [2019-11-26 21:24:29,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:29,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1601335101] [2019-11-26 21:24:29,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:29,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-26 21:24:29,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:30,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:24:30,009 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:30,016 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:30,016 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:30,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:24:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:30,577 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:32,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1601335101] [2019-11-26 21:24:32,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:32,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19, 18] imperfect sequences [] total 36 [2019-11-26 21:24:32,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386565583] [2019-11-26 21:24:32,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-26 21:24:32,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:32,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-26 21:24:32,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1229, Unknown=0, NotChecked=0, Total=1332 [2019-11-26 21:24:32,866 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 37 states. [2019-11-26 21:24:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:37,279 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2019-11-26 21:24:37,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-26 21:24:37,280 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 76 [2019-11-26 21:24:37,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:37,282 INFO L225 Difference]: With dead ends: 155 [2019-11-26 21:24:37,282 INFO L226 Difference]: Without dead ends: 155 [2019-11-26 21:24:37,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=151, Invalid=1741, Unknown=0, NotChecked=0, Total=1892 [2019-11-26 21:24:37,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-26 21:24:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-11-26 21:24:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-26 21:24:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2019-11-26 21:24:37,288 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 76 [2019-11-26 21:24:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:37,289 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2019-11-26 21:24:37,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-26 21:24:37,289 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2019-11-26 21:24:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-26 21:24:37,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:37,290 INFO L410 BasicCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:37,498 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-26 21:24:37,498 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:37,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1131008798, now seen corresponding path program 1 times [2019-11-26 21:24:37,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:37,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1441606508] [2019-11-26 21:24:37,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:37,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 21:24:37,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:37,807 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:37,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:38,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1441606508] [2019-11-26 21:24:38,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:38,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 14 [2019-11-26 21:24:38,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919256532] [2019-11-26 21:24:38,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 21:24:38,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:38,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 21:24:38,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-26 21:24:38,034 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand 14 states. [2019-11-26 21:24:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:38,192 INFO L93 Difference]: Finished difference Result 159 states and 165 transitions. [2019-11-26 21:24:38,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 21:24:38,197 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2019-11-26 21:24:38,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:38,198 INFO L225 Difference]: With dead ends: 159 [2019-11-26 21:24:38,198 INFO L226 Difference]: Without dead ends: 153 [2019-11-26 21:24:38,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-11-26 21:24:38,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-26 21:24:38,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-26 21:24:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 21:24:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 159 transitions. [2019-11-26 21:24:38,205 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 159 transitions. Word has length 83 [2019-11-26 21:24:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:38,205 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 159 transitions. [2019-11-26 21:24:38,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 21:24:38,206 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 159 transitions. [2019-11-26 21:24:38,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-26 21:24:38,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:38,207 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:38,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-26 21:24:38,414 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:38,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:38,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1628283129, now seen corresponding path program 1 times [2019-11-26 21:24:38,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:38,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1859139829] [2019-11-26 21:24:38,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:38,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-26 21:24:38,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:38,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:24:38,701 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:38,703 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:38,703 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:38,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:24:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:39,154 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:39,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1859139829] [2019-11-26 21:24:39,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:39,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22, 21] imperfect sequences [] total 22 [2019-11-26 21:24:39,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116684247] [2019-11-26 21:24:39,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 21:24:39,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:39,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 21:24:39,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-11-26 21:24:39,430 INFO L87 Difference]: Start difference. First operand 153 states and 159 transitions. Second operand 23 states. [2019-11-26 21:24:41,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:41,397 INFO L93 Difference]: Finished difference Result 186 states and 202 transitions. [2019-11-26 21:24:41,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-26 21:24:41,398 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 89 [2019-11-26 21:24:41,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:41,400 INFO L225 Difference]: With dead ends: 186 [2019-11-26 21:24:41,400 INFO L226 Difference]: Without dead ends: 186 [2019-11-26 21:24:41,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 144 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2019-11-26 21:24:41,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-26 21:24:41,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 159. [2019-11-26 21:24:41,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-26 21:24:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2019-11-26 21:24:41,408 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 89 [2019-11-26 21:24:41,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:41,408 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2019-11-26 21:24:41,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 21:24:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2019-11-26 21:24:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-26 21:24:41,409 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:41,409 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:41,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-26 21:24:41,624 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:41,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:41,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1628283130, now seen corresponding path program 1 times [2019-11-26 21:24:41,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:41,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466973806] [2019-11-26 21:24:41,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:41,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-26 21:24:41,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:41,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:24:41,912 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:41,922 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:41,923 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:41,923 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:24:42,569 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:42,569 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:45,512 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:45,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466973806] [2019-11-26 21:24:45,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:45,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23, 22] imperfect sequences [] total 44 [2019-11-26 21:24:45,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359827969] [2019-11-26 21:24:45,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-26 21:24:45,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:45,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-26 21:24:45,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1853, Unknown=0, NotChecked=0, Total=1980 [2019-11-26 21:24:45,515 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 45 states. [2019-11-26 21:24:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:50,835 INFO L93 Difference]: Finished difference Result 157 states and 166 transitions. [2019-11-26 21:24:50,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-26 21:24:50,837 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 89 [2019-11-26 21:24:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:50,839 INFO L225 Difference]: With dead ends: 157 [2019-11-26 21:24:50,839 INFO L226 Difference]: Without dead ends: 157 [2019-11-26 21:24:50,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=189, Invalid=2673, Unknown=0, NotChecked=0, Total=2862 [2019-11-26 21:24:50,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-26 21:24:50,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-11-26 21:24:50,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-26 21:24:50,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2019-11-26 21:24:50,849 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 89 [2019-11-26 21:24:50,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:50,849 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2019-11-26 21:24:50,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-26 21:24:50,850 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2019-11-26 21:24:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-26 21:24:50,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:50,851 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:51,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-26 21:24:51,064 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:51,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:51,064 INFO L82 PathProgramCache]: Analyzing trace with hash 822322196, now seen corresponding path program 1 times [2019-11-26 21:24:51,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:51,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [469295198] [2019-11-26 21:24:51,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:51,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-26 21:24:51,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:52,223 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:52,223 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:53,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [469295198] [2019-11-26 21:24:53,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:53,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23, 21] imperfect sequences [] total 43 [2019-11-26 21:24:53,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157656950] [2019-11-26 21:24:53,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-11-26 21:24:53,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:53,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-11-26 21:24:53,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1726, Unknown=0, NotChecked=0, Total=1892 [2019-11-26 21:24:53,170 INFO L87 Difference]: Start difference. First operand 157 states and 166 transitions. Second operand 44 states. [2019-11-26 21:24:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:56,141 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2019-11-26 21:24:56,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-26 21:24:56,144 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2019-11-26 21:24:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:56,146 INFO L225 Difference]: With dead ends: 156 [2019-11-26 21:24:56,146 INFO L226 Difference]: Without dead ends: 156 [2019-11-26 21:24:56,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=230, Invalid=2422, Unknown=0, NotChecked=0, Total=2652 [2019-11-26 21:24:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-26 21:24:56,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-11-26 21:24:56,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-26 21:24:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 165 transitions. [2019-11-26 21:24:56,152 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 165 transitions. Word has length 92 [2019-11-26 21:24:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:56,153 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 165 transitions. [2019-11-26 21:24:56,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-11-26 21:24:56,153 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 165 transitions. [2019-11-26 21:24:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-26 21:24:56,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:56,154 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:24:56,366 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-26 21:24:56,367 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:56,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:56,367 INFO L82 PathProgramCache]: Analyzing trace with hash -692582595, now seen corresponding path program 1 times [2019-11-26 21:24:56,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:56,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598081797] [2019-11-26 21:24:56,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:56,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-26 21:24:56,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:56,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-26 21:24:56,882 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:56,893 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:56,893 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:56,893 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-26 21:24:56,956 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:56,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 54 [2019-11-26 21:24:56,958 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:57,001 INFO L588 ElimStorePlain]: treesize reduction 29, result has 46.3 percent of original size [2019-11-26 21:24:57,001 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:57,001 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-26 21:24:57,113 INFO L343 Elim1Store]: treesize reduction 66, result has 22.4 percent of original size [2019-11-26 21:24:57,114 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2019-11-26 21:24:57,114 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:57,131 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:57,132 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:57,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-26 21:24:57,278 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-26 21:24:57,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 50 [2019-11-26 21:24:57,281 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:57,303 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:57,303 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:57,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-26 21:24:58,034 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:58,034 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:58,431 WARN L192 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-26 21:24:59,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:00,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:02,488 WARN L192 SmtUtils]: Spent 383.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-26 21:25:02,553 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 21:25:02,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:25:02,724 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-26 21:25:02,725 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-26 21:25:02,726 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 85 [2019-11-26 21:25:02,733 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-26 21:25:02,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 21 [2019-11-26 21:25:02,734 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:25:02,735 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:25:02,735 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:25:02,736 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:25:02,737 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:25:02,737 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-26 21:25:04,478 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 21:25:04,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:25:05,062 WARN L192 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-26 21:25:05,063 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-26 21:25:05,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 197 [2019-11-26 21:25:05,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,317 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-26 21:25:05,318 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 193 treesize of output 229 [2019-11-26 21:25:05,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:25:05,327 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:25:05,543 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2019-11-26 21:25:05,544 INFO L588 ElimStorePlain]: treesize reduction 247, result has 28.4 percent of original size [2019-11-26 21:25:05,544 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:25:05,585 INFO L588 ElimStorePlain]: treesize reduction 69, result has 32.4 percent of original size [2019-11-26 21:25:05,585 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:25:05,586 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:33 [2019-11-26 21:25:07,038 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:25:07,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598081797] [2019-11-26 21:25:07,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:25:07,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2019-11-26 21:25:07,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50787895] [2019-11-26 21:25:07,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-26 21:25:07,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:25:07,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-26 21:25:07,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2019-11-26 21:25:07,041 INFO L87 Difference]: Start difference. First operand 156 states and 165 transitions. Second operand 55 states. [2019-11-26 21:25:15,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:25:15,240 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-26 21:25:15,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-26 21:25:15,242 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 95 [2019-11-26 21:25:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:25:15,242 INFO L225 Difference]: With dead ends: 60 [2019-11-26 21:25:15,242 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 21:25:15,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 136 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-26 21:25:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 21:25:15,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 21:25:15,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 21:25:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 21:25:15,244 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 95 [2019-11-26 21:25:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:25:15,244 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 21:25:15,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-26 21:25:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 21:25:15,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 21:25:15,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-26 21:25:15,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 09:25:15 BoogieIcfgContainer [2019-11-26 21:25:15,453 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 21:25:15,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 21:25:15,454 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 21:25:15,454 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 21:25:15,454 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:24:03" (3/4) ... [2019-11-26 21:25:15,458 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 21:25:15,466 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-26 21:25:15,466 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 21:25:15,466 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-26 21:25:15,466 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-26 21:25:15,467 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-26 21:25:15,467 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-26 21:25:15,467 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-26 21:25:15,467 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-26 21:25:15,467 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-26 21:25:15,467 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-26 21:25:15,468 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-26 21:25:15,468 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-26 21:25:15,468 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-26 21:25:15,468 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-26 21:25:15,468 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-26 21:25:15,468 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-26 21:25:15,468 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-26 21:25:15,469 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-26 21:25:15,469 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-26 21:25:15,469 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-26 21:25:15,469 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-26 21:25:15,469 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-26 21:25:15,469 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f_22_get [2019-11-26 21:25:15,470 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-26 21:25:15,470 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-26 21:25:15,470 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-26 21:25:15,470 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-26 21:25:15,470 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-26 21:25:15,470 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-26 21:25:15,471 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-26 21:25:15,471 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-26 21:25:15,471 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-26 21:25:15,471 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-26 21:25:15,471 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-26 21:25:15,471 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-26 21:25:15,472 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-26 21:25:15,472 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-26 21:25:15,472 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-26 21:25:15,472 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-26 21:25:15,472 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-26 21:25:15,472 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-26 21:25:15,472 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-26 21:25:15,473 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f_22_put [2019-11-26 21:25:15,473 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-26 21:25:15,473 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-26 21:25:15,473 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-26 21:25:15,473 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-26 21:25:15,474 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-26 21:25:15,481 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2019-11-26 21:25:15,482 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-26 21:25:15,482 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 21:25:15,483 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 21:25:15,483 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 21:25:15,537 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-26 21:25:15,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 21:25:15,539 INFO L168 Benchmark]: Toolchain (without parser) took 74397.09 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 508.6 MB). Free memory was 957.7 MB in the beginning and 1.4 GB in the end (delta: -447.8 MB). Peak memory consumption was 60.8 MB. Max. memory is 11.5 GB. [2019-11-26 21:25:15,539 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:25:15,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 825.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -144.0 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2019-11-26 21:25:15,540 INFO L168 Benchmark]: Boogie Preprocessor took 125.38 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-26 21:25:15,541 INFO L168 Benchmark]: RCFGBuilder took 1603.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.4 MB in the end (delta: 111.3 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. [2019-11-26 21:25:15,541 INFO L168 Benchmark]: TraceAbstraction took 71752.51 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 361.8 MB). Free memory was 990.4 MB in the beginning and 1.4 GB in the end (delta: -415.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:25:15,542 INFO L168 Benchmark]: Witness Printer took 84.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:25:15,543 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 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 825.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -144.0 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 125.38 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 1603.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.4 MB in the end (delta: 111.3 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 71752.51 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 361.8 MB). Free memory was 990.4 MB in the beginning and 1.4 GB in the end (delta: -415.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 84.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 769]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 49 procedures, 341 locations, 71 error locations. Result: SAFE, OverallTime: 71.6s, OverallIterations: 23, TraceHistogramMax: 16, AutomataDifference: 35.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2441 SDtfs, 1348 SDslu, 19465 SDs, 0 SdLazy, 12495 SolverSat, 417 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 27.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2494 GetRequests, 1978 SyntacticMatches, 52 SemanticMatches, 464 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2725 ImplicationChecksByTransitivity, 23.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 134 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 26.9s InterpolantComputationTime, 1219 NumberOfCodeBlocks, 1183 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2392 ConstructedInterpolants, 306 QuantifiedInterpolants, 727040 SizeOfPredicates, 152 NumberOfNonLiveVariables, 5416 ConjunctsInSsa, 418 ConjunctsInUnsatCore, 46 InterpolantComputations, 38 PerfectInterpolantSequences, 2984/3514 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...