./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6692e4fc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85051d52521692aaf1a0de9e5f8f895724c83314 ............................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 85051d52521692aaf1a0de9e5f8f895724c83314 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- This is Ultimate 0.1.24-6692e4f [2019-11-25 17:45:08,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:45:08,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:45:08,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:45:08,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:45:08,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:45:08,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:45:08,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:45:08,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:45:08,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:45:08,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:45:08,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:45:08,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:45:08,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:45:08,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:45:08,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:45:08,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:45:08,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:45:08,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:45:08,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:45:08,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:45:08,259 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:45:08,262 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:45:08,263 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:45:08,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:45:08,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:45:08,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:45:08,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:45:08,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:45:08,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:45:08,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:45:08,276 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:45:08,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:45:08,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:45:08,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:45:08,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:45:08,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:45:08,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:45:08,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:45:08,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:45:08,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:45:08,289 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-25 17:45:08,313 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:45:08,313 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:45:08,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:45:08,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:45:08,316 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:45:08,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:45:08,316 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 17:45:08,317 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:45:08,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:45:08,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 17:45:08,318 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:45:08,319 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:45:08,319 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:45:08,320 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:45:08,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:45:08,320 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:45:08,320 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 17:45:08,321 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:45:08,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:45:08,321 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:45:08,322 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:45:08,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:45:08,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:45:08,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:45:08,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:45:08,323 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 17:45:08,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 17:45:08,324 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 -> 85051d52521692aaf1a0de9e5f8f895724c83314 [2019-11-25 17:45:08,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:45:08,631 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:45:08,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:45:08,636 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:45:08,637 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:45:08,638 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i [2019-11-25 17:45:08,714 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b19d670/875a30f58d074dcdb2f67af280472d1b/FLAG2f9bcce59 [2019-11-25 17:45:09,326 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:45:09,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i [2019-11-25 17:45:09,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b19d670/875a30f58d074dcdb2f67af280472d1b/FLAG2f9bcce59 [2019-11-25 17:45:09,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13b19d670/875a30f58d074dcdb2f67af280472d1b [2019-11-25 17:45:09,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:45:09,574 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:45:09,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:45:09,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:45:09,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:45:09,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:45:09" (1/1) ... [2019-11-25 17:45:09,584 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f61f9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:45:09, skipping insertion in model container [2019-11-25 17:45:09,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:45:09" (1/1) ... [2019-11-25 17:45:09,592 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:45:09,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:45:10,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:45:10,167 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-11-25 17:45:10,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@293a8a3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:45:10, skipping insertion in model container [2019-11-25 17:45:10,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:45:10,169 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-25 17:45:10,172 INFO L168 Benchmark]: Toolchain (without parser) took 597.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -192.3 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-11-25 17:45:10,173 INFO L168 Benchmark]: CDTParser took 0.62 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:45:10,174 INFO L168 Benchmark]: CACSL2BoogieTranslator took 593.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -197.7 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-11-25 17:45:10,177 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.62 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 593.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -197.7 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 577]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6692e4f [2019-11-25 17:45:11,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 17:45:11,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 17:45:11,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 17:45:11,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 17:45:11,972 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 17:45:11,974 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 17:45:11,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 17:45:11,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 17:45:11,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 17:45:11,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 17:45:11,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 17:45:11,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 17:45:11,998 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 17:45:12,000 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 17:45:12,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 17:45:12,004 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 17:45:12,007 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 17:45:12,009 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 17:45:12,012 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 17:45:12,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 17:45:12,019 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 17:45:12,022 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 17:45:12,023 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 17:45:12,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 17:45:12,027 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 17:45:12,027 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 17:45:12,029 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 17:45:12,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 17:45:12,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 17:45:12,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 17:45:12,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 17:45:12,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 17:45:12,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 17:45:12,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 17:45:12,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 17:45:12,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 17:45:12,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 17:45:12,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 17:45:12,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 17:45:12,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 17:45:12,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-25 17:45:12,066 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 17:45:12,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 17:45:12,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 17:45:12,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 17:45:12,068 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 17:45:12,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 17:45:12,069 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 17:45:12,069 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 17:45:12,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 17:45:12,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 17:45:12,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 17:45:12,071 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 17:45:12,071 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 17:45:12,072 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 17:45:12,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 17:45:12,072 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 17:45:12,073 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 17:45:12,073 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 17:45:12,073 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 17:45:12,073 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 17:45:12,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 17:45:12,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 17:45:12,074 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 17:45:12,075 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 17:45:12,075 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:45:12,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 17:45:12,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 17:45:12,076 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 17:45:12,076 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 17:45:12,076 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 17:45:12,076 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 -> 85051d52521692aaf1a0de9e5f8f895724c83314 [2019-11-25 17:45:12,397 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 17:45:12,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 17:45:12,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 17:45:12,421 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 17:45:12,422 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 17:45:12,423 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i [2019-11-25 17:45:12,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e458c5a5c/83d3a6cc4a2e406291cdcdd4dfc83594/FLAG870a05981 [2019-11-25 17:45:13,129 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 17:45:13,130 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i [2019-11-25 17:45:13,145 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e458c5a5c/83d3a6cc4a2e406291cdcdd4dfc83594/FLAG870a05981 [2019-11-25 17:45:13,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e458c5a5c/83d3a6cc4a2e406291cdcdd4dfc83594 [2019-11-25 17:45:13,339 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 17:45:13,341 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 17:45:13,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 17:45:13,342 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 17:45:13,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 17:45:13,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:45:13" (1/1) ... [2019-11-25 17:45:13,349 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f61f9f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:45:13, skipping insertion in model container [2019-11-25 17:45:13,349 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:45:13" (1/1) ... [2019-11-25 17:45:13,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 17:45:13,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:45:14,012 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:45:14,043 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-25 17:45:14,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 17:45:14,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:45:14,121 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 17:45:14,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 17:45:14,265 INFO L208 MainTranslator]: Completed translation [2019-11-25 17:45:14,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:45:14 WrapperNode [2019-11-25 17:45:14,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 17:45:14,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 17:45:14,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 17:45:14,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 17:45:14,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:45:14" (1/1) ... [2019-11-25 17:45:14,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:45:14" (1/1) ... [2019-11-25 17:45:14,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:45:14" (1/1) ... [2019-11-25 17:45:14,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:45:14" (1/1) ... [2019-11-25 17:45:14,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:45:14" (1/1) ... [2019-11-25 17:45:14,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:45:14" (1/1) ... [2019-11-25 17:45:14,371 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:45:14" (1/1) ... [2019-11-25 17:45:14,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 17:45:14,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 17:45:14,384 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 17:45:14,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 17:45:14,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:45:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 17:45:14,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 17:45:14,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 17:45:14,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 17:45:14,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 17:45:14,442 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 17:45:14,442 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 17:45:14,442 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-25 17:45:14,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-25 17:45:14,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-25 17:45:14,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-25 17:45:14,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-25 17:45:14,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-25 17:45:14,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-25 17:45:14,444 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-25 17:45:14,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-25 17:45:14,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-25 17:45:14,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-25 17:45:14,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-25 17:45:14,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-25 17:45:14,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-25 17:45:14,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-25 17:45:14,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-25 17:45:14,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-25 17:45:14,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-25 17:45:14,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-25 17:45:14,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-25 17:45:14,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-25 17:45:14,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-25 17:45:14,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-25 17:45:14,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-25 17:45:14,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-25 17:45:14,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-25 17:45:14,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-25 17:45:14,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-25 17:45:14,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-25 17:45:14,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-25 17:45:14,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-25 17:45:14,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-25 17:45:14,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-25 17:45:14,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-25 17:45:14,448 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-25 17:45:14,448 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-25 17:45:14,448 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_17 [2019-11-25 17:45:14,449 INFO L138 BoogieDeclarations]: Found implementation of procedure free_17 [2019-11-25 17:45:14,449 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-25 17:45:14,449 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 17:45:14,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-25 17:45:14,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 17:45:14,449 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-25 17:45:14,450 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 17:45:14,450 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 17:45:14,450 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 17:45:14,450 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 17:45:14,450 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 17:45:14,450 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 17:45:14,451 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 17:45:14,451 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 17:45:14,451 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 17:45:14,451 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 17:45:14,452 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 17:45:14,452 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 17:45:14,452 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 17:45:14,452 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 17:45:14,452 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 17:45:14,453 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 17:45:14,453 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 17:45:14,453 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 17:45:14,453 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-25 17:45:14,453 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-25 17:45:14,454 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-25 17:45:14,454 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 17:45:14,454 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 17:45:14,454 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 17:45:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 17:45:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 17:45:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 17:45:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 17:45:14,455 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 17:45:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 17:45:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 17:45:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 17:45:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 17:45:14,456 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 17:45:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 17:45:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 17:45:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 17:45:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 17:45:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 17:45:14,457 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 17:45:14,458 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 17:45:14,458 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 17:45:14,458 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 17:45:14,458 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 17:45:14,458 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 17:45:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 17:45:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 17:45:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 17:45:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 17:45:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 17:45:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 17:45:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 17:45:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 17:45:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 17:45:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 17:45:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 17:45:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 17:45:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 17:45:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 17:45:14,461 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 17:45:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 17:45:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 17:45:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 17:45:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 17:45:14,462 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 17:45:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 17:45:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 17:45:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 17:45:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 17:45:14,463 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 17:45:14,464 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 17:45:14,464 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 17:45:14,464 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 17:45:14,464 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 17:45:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 17:45:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 17:45:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 17:45:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 17:45:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 17:45:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 17:45:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 17:45:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 17:45:14,466 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 17:45:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 17:45:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 17:45:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 17:45:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 17:45:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 17:45:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 17:45:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 17:45:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 17:45:14,468 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 17:45:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 17:45:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 17:45:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 17:45:14,469 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 17:45:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 17:45:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 17:45:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 17:45:14,470 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 17:45:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 17:45:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 17:45:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 17:45:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 17:45:14,471 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 17:45:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 17:45:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 17:45:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-25 17:45:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 17:45:14,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-25 17:45:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-25 17:45:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-25 17:45:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-25 17:45:14,473 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-25 17:45:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-25 17:45:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 17:45:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-25 17:45:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 17:45:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-25 17:45:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 17:45:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-25 17:45:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-25 17:45:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-25 17:45:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 17:45:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-25 17:45:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-25 17:45:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-25 17:45:14,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-25 17:45:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-25 17:45:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-25 17:45:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 17:45:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-25 17:45:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-25 17:45:14,478 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-25 17:45:14,478 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-25 17:45:14,478 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-25 17:45:14,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 17:45:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 17:45:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-25 17:45:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-25 17:45:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 17:45:14,479 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-25 17:45:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-25 17:45:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-25 17:45:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-25 17:45:14,480 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-25 17:45:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-25 17:45:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-25 17:45:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-25 17:45:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-25 17:45:14,481 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-25 17:45:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-25 17:45:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-25 17:45:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-25 17:45:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-25 17:45:14,482 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_17 [2019-11-25 17:45:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure free_17 [2019-11-25 17:45:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-25 17:45:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 17:45:14,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 17:45:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 17:45:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 17:45:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 17:45:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 17:45:14,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-25 17:45:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-25 17:45:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-25 17:45:14,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-25 17:45:15,171 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 17:45:15,569 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 17:45:16,141 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 17:45:16,141 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-25 17:45:16,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:45:16 BoogieIcfgContainer [2019-11-25 17:45:16,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 17:45:16,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 17:45:16,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 17:45:16,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 17:45:16,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:45:13" (1/3) ... [2019-11-25 17:45:16,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d5bb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:45:16, skipping insertion in model container [2019-11-25 17:45:16,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:45:14" (2/3) ... [2019-11-25 17:45:16,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d5bb0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:45:16, skipping insertion in model container [2019-11-25 17:45:16,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:45:16" (3/3) ... [2019-11-25 17:45:16,152 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1-1.i [2019-11-25 17:45:16,161 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 17:45:16,169 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 87 error locations. [2019-11-25 17:45:16,178 INFO L249 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2019-11-25 17:45:16,199 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 17:45:16,199 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 17:45:16,199 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 17:45:16,199 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 17:45:16,199 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 17:45:16,199 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 17:45:16,199 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 17:45:16,200 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 17:45:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-11-25 17:45:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 17:45:16,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:45:16,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:45:16,231 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:45:16,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:45:16,237 INFO L82 PathProgramCache]: Analyzing trace with hash -200276895, now seen corresponding path program 1 times [2019-11-25 17:45:16,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:45:16,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002812539] [2019-11-25 17:45:16,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-25 17:45:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:45:16,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-25 17:45:16,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:45:16,562 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:45:16,562 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:45:16,577 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:45:16,578 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:45:16,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:45:16,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:16,673 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:45:17,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:17,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002812539] [2019-11-25 17:45:17,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:45:17,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-11-25 17:45:17,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837756051] [2019-11-25 17:45:17,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-25 17:45:17,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:45:17,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-25 17:45:17,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-25 17:45:17,558 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 14 states. [2019-11-25 17:45:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:45:18,661 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2019-11-25 17:45:18,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 17:45:18,664 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2019-11-25 17:45:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:45:18,677 INFO L225 Difference]: With dead ends: 91 [2019-11-25 17:45:18,677 INFO L226 Difference]: Without dead ends: 88 [2019-11-25 17:45:18,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-11-25 17:45:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-25 17:45:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2019-11-25 17:45:18,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-25 17:45:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-11-25 17:45:18,755 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 16 [2019-11-25 17:45:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:45:18,756 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-11-25 17:45:18,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-25 17:45:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-11-25 17:45:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 17:45:18,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:45:18,760 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:45:19,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 17:45:19,008 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:45:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:45:19,010 INFO L82 PathProgramCache]: Analyzing trace with hash -200276896, now seen corresponding path program 1 times [2019-11-25 17:45:19,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:45:19,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850488273] [2019-11-25 17:45:19,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-25 17:45:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:45:19,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 17:45:19,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:45:19,148 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:45:19,148 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:45:19,153 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:45:19,154 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:45:19,154 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 17:45:19,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:19,179 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:45:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:19,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850488273] [2019-11-25 17:45:19,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:45:19,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 17:45:19,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472600713] [2019-11-25 17:45:19,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:45:19,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:45:19,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:45:19,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:45:19,229 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 5 states. [2019-11-25 17:45:19,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:45:19,409 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2019-11-25 17:45:19,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:45:19,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-25 17:45:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:45:19,412 INFO L225 Difference]: With dead ends: 83 [2019-11-25 17:45:19,412 INFO L226 Difference]: Without dead ends: 83 [2019-11-25 17:45:19,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:45:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-25 17:45:19,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-11-25 17:45:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-25 17:45:19,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2019-11-25 17:45:19,422 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 16 [2019-11-25 17:45:19,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:45:19,423 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2019-11-25 17:45:19,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:45:19,423 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2019-11-25 17:45:19,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-25 17:45:19,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:45:19,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:45:19,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 17:45:19,632 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:45:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:45:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash 687226786, now seen corresponding path program 1 times [2019-11-25 17:45:19,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:45:19,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1976559045] [2019-11-25 17:45:19,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-25 17:45:19,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:45:19,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 17:45:19,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:45:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:19,834 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:45:19,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:19,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1976559045] [2019-11-25 17:45:19,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:45:19,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 17:45:19,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469297129] [2019-11-25 17:45:19,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:45:19,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:45:19,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:45:19,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:45:19,884 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand 5 states. [2019-11-25 17:45:19,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:45:19,928 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2019-11-25 17:45:19,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:45:19,929 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-25 17:45:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:45:19,930 INFO L225 Difference]: With dead ends: 78 [2019-11-25 17:45:19,930 INFO L226 Difference]: Without dead ends: 78 [2019-11-25 17:45:19,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:45:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-25 17:45:19,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-25 17:45:19,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-25 17:45:19,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-11-25 17:45:19,939 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 16 [2019-11-25 17:45:19,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:45:19,939 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-11-25 17:45:19,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:45:19,939 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-11-25 17:45:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 17:45:19,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:45:19,940 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:45:20,151 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 17:45:20,152 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:45:20,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:45:20,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1913632700, now seen corresponding path program 1 times [2019-11-25 17:45:20,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:45:20,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760413096] [2019-11-25 17:45:20,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-25 17:45:20,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:45:20,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 17:45:20,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:45:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:20,281 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:45:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:20,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760413096] [2019-11-25 17:45:20,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:45:20,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 17:45:20,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198013816] [2019-11-25 17:45:20,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:45:20,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:45:20,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:45:20,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:45:20,353 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 5 states. [2019-11-25 17:45:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:45:20,394 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-11-25 17:45:20,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:45:20,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-25 17:45:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:45:20,396 INFO L225 Difference]: With dead ends: 78 [2019-11-25 17:45:20,397 INFO L226 Difference]: Without dead ends: 78 [2019-11-25 17:45:20,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:45:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-25 17:45:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-25 17:45:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-25 17:45:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2019-11-25 17:45:20,405 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 17 [2019-11-25 17:45:20,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:45:20,405 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2019-11-25 17:45:20,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:45:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2019-11-25 17:45:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 17:45:20,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:45:20,406 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:45:20,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 17:45:20,628 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:45:20,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:45:20,629 INFO L82 PathProgramCache]: Analyzing trace with hash -170822365, now seen corresponding path program 1 times [2019-11-25 17:45:20,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:45:20,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329533118] [2019-11-25 17:45:20,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-25 17:45:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:45:20,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 17:45:20,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:45:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:20,762 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:45:20,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:20,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329533118] [2019-11-25 17:45:20,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:45:20,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 17:45:20,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654799156] [2019-11-25 17:45:20,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 17:45:20,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:45:20,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 17:45:20,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:45:20,812 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 3 states. [2019-11-25 17:45:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:45:20,940 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2019-11-25 17:45:20,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 17:45:20,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-25 17:45:20,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:45:20,942 INFO L225 Difference]: With dead ends: 114 [2019-11-25 17:45:20,942 INFO L226 Difference]: Without dead ends: 109 [2019-11-25 17:45:20,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 17:45:20,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-25 17:45:20,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 74. [2019-11-25 17:45:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-25 17:45:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-11-25 17:45:20,949 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 17 [2019-11-25 17:45:20,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:45:20,950 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-11-25 17:45:20,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 17:45:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-11-25 17:45:20,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 17:45:20,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:45:20,951 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:45:21,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 17:45:21,157 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:45:21,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:45:21,158 INFO L82 PathProgramCache]: Analyzing trace with hash -73256383, now seen corresponding path program 1 times [2019-11-25 17:45:21,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:45:21,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955012770] [2019-11-25 17:45:21,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-25 17:45:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:45:21,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-25 17:45:21,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:45:21,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:45:21,331 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:45:21,338 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:45:21,338 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:45:21,338 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:45:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:21,469 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:45:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:22,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955012770] [2019-11-25 17:45:22,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:45:22,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-11-25 17:45:22,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769506686] [2019-11-25 17:45:22,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 17:45:22,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:45:22,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 17:45:22,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-11-25 17:45:22,482 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 18 states. [2019-11-25 17:45:24,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:45:24,470 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2019-11-25 17:45:24,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 17:45:24,471 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-11-25 17:45:24,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:45:24,472 INFO L225 Difference]: With dead ends: 91 [2019-11-25 17:45:24,472 INFO L226 Difference]: Without dead ends: 91 [2019-11-25 17:45:24,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2019-11-25 17:45:24,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-25 17:45:24,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2019-11-25 17:45:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-25 17:45:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-11-25 17:45:24,485 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 22 [2019-11-25 17:45:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:45:24,486 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-11-25 17:45:24,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 17:45:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-11-25 17:45:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 17:45:24,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:45:24,489 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:45:24,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 17:45:24,696 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:45:24,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:45:24,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1067902475, now seen corresponding path program 1 times [2019-11-25 17:45:24,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:45:24,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448744243] [2019-11-25 17:45:24,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-25 17:45:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:45:24,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 17:45:24,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:45:24,891 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:24,892 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:45:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:25,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448744243] [2019-11-25 17:45:25,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:45:25,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-25 17:45:25,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461711150] [2019-11-25 17:45:25,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 17:45:25,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:45:25,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 17:45:25,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-25 17:45:25,025 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 12 states. [2019-11-25 17:45:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:45:25,398 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2019-11-25 17:45:25,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 17:45:25,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-25 17:45:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:45:25,399 INFO L225 Difference]: With dead ends: 92 [2019-11-25 17:45:25,399 INFO L226 Difference]: Without dead ends: 92 [2019-11-25 17:45:25,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2019-11-25 17:45:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-25 17:45:25,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-11-25 17:45:25,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-25 17:45:25,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2019-11-25 17:45:25,407 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 35 [2019-11-25 17:45:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:45:25,407 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2019-11-25 17:45:25,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 17:45:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2019-11-25 17:45:25,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 17:45:25,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:45:25,408 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:45:25,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 17:45:25,614 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:45:25,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:45:25,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1190057473, now seen corresponding path program 2 times [2019-11-25 17:45:25,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:45:25,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296623453] [2019-11-25 17:45:25,617 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-25 17:45:25,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 17:45:25,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 17:45:25,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-25 17:45:25,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:45:25,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:45:25,789 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:45:25,796 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:45:25,796 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:45:25,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:45:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:26,110 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:45:27,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:45:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:28,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296623453] [2019-11-25 17:45:28,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:45:28,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2019-11-25 17:45:28,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179121900] [2019-11-25 17:45:28,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-25 17:45:28,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:45:28,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-25 17:45:28,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2019-11-25 17:45:28,319 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 28 states. [2019-11-25 17:45:29,462 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 28 [2019-11-25 17:45:29,895 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2019-11-25 17:45:30,374 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2019-11-25 17:45:30,650 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 28 [2019-11-25 17:45:31,136 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-11-25 17:45:31,451 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 27 [2019-11-25 17:45:32,399 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-11-25 17:45:32,875 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 28 [2019-11-25 17:45:33,281 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-11-25 17:45:33,582 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 28 [2019-11-25 17:45:34,013 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-25 17:45:35,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:45:35,350 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2019-11-25 17:45:35,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-25 17:45:35,351 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-11-25 17:45:35,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:45:35,353 INFO L225 Difference]: With dead ends: 112 [2019-11-25 17:45:35,353 INFO L226 Difference]: Without dead ends: 112 [2019-11-25 17:45:35,355 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=487, Invalid=1493, Unknown=0, NotChecked=0, Total=1980 [2019-11-25 17:45:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-25 17:45:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-25 17:45:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-25 17:45:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2019-11-25 17:45:35,370 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 34 [2019-11-25 17:45:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:45:35,370 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2019-11-25 17:45:35,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-25 17:45:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2019-11-25 17:45:35,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 17:45:35,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:45:35,376 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:45:35,588 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 17:45:35,588 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:45:35,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:45:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash -321692208, now seen corresponding path program 2 times [2019-11-25 17:45:35,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:45:35,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620624755] [2019-11-25 17:45:35,590 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-25 17:45:35,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 17:45:35,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 17:45:35,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 17:45:35,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:45:35,756 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-25 17:45:35,757 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:45:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-25 17:45:35,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620624755] [2019-11-25 17:45:35,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:45:35,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-11-25 17:45:35,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002855803] [2019-11-25 17:45:35,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 17:45:35,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:45:35,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 17:45:35,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:45:35,829 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand 7 states. [2019-11-25 17:45:35,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:45:35,937 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2019-11-25 17:45:35,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:45:35,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-11-25 17:45:35,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:45:35,941 INFO L225 Difference]: With dead ends: 141 [2019-11-25 17:45:35,941 INFO L226 Difference]: Without dead ends: 138 [2019-11-25 17:45:35,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-25 17:45:35,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-25 17:45:35,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 111. [2019-11-25 17:45:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-25 17:45:35,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2019-11-25 17:45:35,953 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 50 [2019-11-25 17:45:35,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:45:35,953 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2019-11-25 17:45:35,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 17:45:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2019-11-25 17:45:35,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 17:45:35,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:45:35,957 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:45:36,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-25 17:45:36,178 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:45:36,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:45:36,179 INFO L82 PathProgramCache]: Analyzing trace with hash 115614506, now seen corresponding path program 1 times [2019-11-25 17:45:36,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:45:36,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287477227] [2019-11-25 17:45:36,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-25 17:45:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:45:36,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 17:45:36,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:45:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:45:36,539 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:45:36,911 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 17:45:36,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1287477227] [2019-11-25 17:45:36,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:45:36,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-25 17:45:36,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116871360] [2019-11-25 17:45:36,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-25 17:45:36,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:45:36,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-25 17:45:36,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-11-25 17:45:36,913 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 22 states. [2019-11-25 17:45:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:45:37,509 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2019-11-25 17:45:37,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 17:45:37,510 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2019-11-25 17:45:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:45:37,512 INFO L225 Difference]: With dead ends: 111 [2019-11-25 17:45:37,512 INFO L226 Difference]: Without dead ends: 111 [2019-11-25 17:45:37,513 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-11-25 17:45:37,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-25 17:45:37,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-25 17:45:37,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-25 17:45:37,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2019-11-25 17:45:37,518 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 50 [2019-11-25 17:45:37,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:45:37,518 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2019-11-25 17:45:37,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-25 17:45:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2019-11-25 17:45:37,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 17:45:37,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:45:37,520 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:45:37,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-25 17:45:37,733 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:45:37,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:45:37,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1051535094, now seen corresponding path program 2 times [2019-11-25 17:45:37,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:45:37,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652109257] [2019-11-25 17:45:37,734 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-25 17:45:37,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 17:45:37,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 17:45:37,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-25 17:45:37,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:45:37,937 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:45:37,938 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:45:37,939 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:45:37,939 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:45:37,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 17:45:38,064 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:45:38,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-25 17:45:38,066 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:45:38,089 INFO L588 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-25 17:45:38,090 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:45:38,090 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-25 17:45:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-25 17:45:38,119 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:45:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-25 17:45:38,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652109257] [2019-11-25 17:45:38,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:45:38,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-25 17:45:38,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559214238] [2019-11-25 17:45:38,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-25 17:45:38,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:45:38,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 17:45:38,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-11-25 17:45:38,526 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 17 states. [2019-11-25 17:46:00,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:46:00,434 INFO L93 Difference]: Finished difference Result 208 states and 237 transitions. [2019-11-25 17:46:00,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-25 17:46:00,434 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-11-25 17:46:00,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:46:00,436 INFO L225 Difference]: With dead ends: 208 [2019-11-25 17:46:00,437 INFO L226 Difference]: Without dead ends: 208 [2019-11-25 17:46:00,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2019-11-25 17:46:00,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-25 17:46:00,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 109. [2019-11-25 17:46:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-25 17:46:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2019-11-25 17:46:00,449 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 56 [2019-11-25 17:46:00,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:46:00,451 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2019-11-25 17:46:00,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-25 17:46:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2019-11-25 17:46:00,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-25 17:46:00,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:46:00,455 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:46:00,656 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-25 17:46:00,656 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:46:00,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:46:00,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1051535093, now seen corresponding path program 1 times [2019-11-25 17:46:00,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:46:00,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132292799] [2019-11-25 17:46:00,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-25 17:46:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:46:00,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-25 17:46:00,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:46:00,883 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:46:00,883 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:46:00,893 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:46:00,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:46:00,898 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:46:00,907 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:46:00,907 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:46:00,908 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-25 17:46:03,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 17:46:03,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-25 17:46:03,191 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:46:03,218 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:46:03,241 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:46:03,242 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-25 17:46:03,242 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:46:03,260 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:46:03,261 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:46:03,261 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-11-25 17:46:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-25 17:46:03,316 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:46:03,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:46:05,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:46:05,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:46:05,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:46:13,550 WARN L192 SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-11-25 17:46:13,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:46:17,267 INFO L404 ElimStorePlain]: Different costs {1=[|v_#valid_259|], 2=[|v_#length_220|]} [2019-11-25 17:46:17,277 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-25 17:46:17,277 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:46:17,286 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:46:17,288 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:46:17,288 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:46:17,297 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:46:17,298 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:46:17,298 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:23, output treesize:5 [2019-11-25 17:46:17,944 INFO L404 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-25 17:46:17,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-25 17:46:17,958 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:46:17,977 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:46:17,981 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 17:46:17,982 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 17:46:18,001 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:46:18,002 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-25 17:46:18,002 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:33, output treesize:16 [2019-11-25 17:46:18,171 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-25 17:46:18,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132292799] [2019-11-25 17:46:18,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:46:18,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-11-25 17:46:18,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320028526] [2019-11-25 17:46:18,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-25 17:46:18,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:46:18,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-25 17:46:18,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=406, Unknown=4, NotChecked=0, Total=462 [2019-11-25 17:46:18,173 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 22 states. [2019-11-25 17:46:41,238 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= (_ bv0 32) |c_ldv_malloc_#res.offset|) (= (bvadd (select |c_#valid| |c_ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1)) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (forall ((v_alloc_17_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse1 (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvule .cse0 (select |c_#length| v_alloc_17_~array.base_BEFORE_CALL_4)) (not (bvule (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2) .cse0)) (exists ((v_ldv_malloc_~size_55 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_48| (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_48| v_ldv_malloc_~size_55) v_alloc_17_~array.base_BEFORE_CALL_4))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_48|) (_ bv0 1)))))))) (forall ((v_alloc_17_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_4 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_49| (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32))) (let ((.cse2 (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse3 (bvadd .cse2 v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_49|))) (not (bvule (bvadd .cse2 v_alloc_17_~array.offset_BEFORE_CALL_2) .cse3)) (bvule .cse3 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_49| ldv_malloc_~size) v_alloc_17_~array.base_BEFORE_CALL_4)) (exists ((v_ldv_malloc_~size_55 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_48| (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_48| v_ldv_malloc_~size_55) v_alloc_17_~array.base_BEFORE_CALL_4))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_48|) (_ bv0 1)))))))) (exists ((v_prenex_4 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4)))) is different from false [2019-11-25 17:47:09,776 WARN L192 SmtUtils]: Spent 10.26 s on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-25 17:47:34,477 WARN L192 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 55 DAG size of output: 28 [2019-11-25 17:47:44,871 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd (select |c_#length| c_entry_point_~array~0.base) (_ bv4294967256 32)) (_ bv0 32)) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (bvadd (select |c_#valid| c_entry_point_~array~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd c_entry_point_~len~0 (_ bv4294967286 32)) (_ bv0 32)) (forall ((v_alloc_17_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse1 (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvule .cse0 (select |c_#length| v_alloc_17_~array.base_BEFORE_CALL_4)) (not (bvule (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2) .cse0)) (exists ((v_ldv_malloc_~size_55 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_48| (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_48| v_ldv_malloc_~size_55) v_alloc_17_~array.base_BEFORE_CALL_4))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_48|) (_ bv0 1)))))))) (= (_ bv0 32) c_entry_point_~array~0.offset) (exists ((v_prenex_4 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4)))) is different from false [2019-11-25 17:47:52,628 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-11-25 17:48:36,956 WARN L192 SmtUtils]: Spent 18.22 s on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-25 17:49:12,728 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-11-25 17:49:48,100 WARN L192 SmtUtils]: Spent 22.73 s on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-11-25 17:50:32,576 WARN L192 SmtUtils]: Spent 8.46 s on a formula simplification. DAG size of input: 49 DAG size of output: 23 [2019-11-25 17:50:49,466 WARN L192 SmtUtils]: Spent 6.18 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-11-25 17:50:57,871 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (bvmul c_alloc_17_~i~0 (_ bv4 32)))) (let ((.cse0 (bvadd .cse4 c_alloc_17_~array.offset (_ bv4 32)))) (let ((.cse1 (bvule (bvadd .cse4 c_alloc_17_~array.offset) .cse0))) (and (bvule .cse0 (select |c_#length| c_alloc_17_~array.base)) .cse1 (forall ((v_ldv_malloc_~size_55 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_48| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_48|) (_ bv0 1))) (bvule (bvadd (bvmul c_alloc_17_~i~0 (_ bv4 32)) c_alloc_17_~array.offset (_ bv4 32)) (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_48| v_ldv_malloc_~size_55) c_alloc_17_~array.base)))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (forall ((v_alloc_17_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse3 (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse2 (bvadd .cse3 v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvule .cse2 (select |c_#length| v_alloc_17_~array.base_BEFORE_CALL_4)) (not (bvule (bvadd .cse3 v_alloc_17_~array.offset_BEFORE_CALL_2) .cse2)) (exists ((v_ldv_malloc_~size_55 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_48| (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_48| v_ldv_malloc_~size_55) v_alloc_17_~array.base_BEFORE_CALL_4))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_48|) (_ bv0 1)))))))) (or .cse1 (forall ((|v_ldv_malloc_#t~malloc12.base_48| (_ BitVec 32))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_48|) (_ bv0 1))))) (exists ((v_prenex_4 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4))))))) is different from false [2019-11-25 17:51:30,966 WARN L192 SmtUtils]: Spent 8.20 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-11-25 17:52:37,037 WARN L192 SmtUtils]: Spent 52.44 s on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-25 17:53:00,181 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (_ bv40 32) (select |c_#length| |c_alloc_17_#in~array.base|)) (= |c_#valid| |c_old(#valid)|) (forall ((v_alloc_17_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse1 (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvule .cse0 (select |c_#length| v_alloc_17_~array.base_BEFORE_CALL_4)) (not (bvule (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2) .cse0)) (exists ((v_ldv_malloc_~size_55 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_48| (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_48| v_ldv_malloc_~size_55) v_alloc_17_~array.base_BEFORE_CALL_4))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_48|) (_ bv0 1)))))))) (= |c_old(#length)| |c_#length|) (= (_ bv1 1) (select |c_#valid| |c_alloc_17_#in~array.base|)) (exists ((v_prenex_4 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4))) (= |c_alloc_17_#in~array.offset| (_ bv0 32))) is different from false [2019-11-25 17:53:00,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:53:00,200 INFO L93 Difference]: Finished difference Result 279 states and 324 transitions. [2019-11-25 17:53:00,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-25 17:53:00,201 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-25 17:53:00,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:53:00,204 INFO L225 Difference]: With dead ends: 279 [2019-11-25 17:53:00,204 INFO L226 Difference]: Without dead ends: 279 [2019-11-25 17:53:00,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 249.9s TimeCoverageRelationStatistics Valid=201, Invalid=1178, Unknown=43, NotChecked=300, Total=1722 [2019-11-25 17:53:00,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-11-25 17:53:00,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 119. [2019-11-25 17:53:00,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-25 17:53:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2019-11-25 17:53:00,213 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 56 [2019-11-25 17:53:00,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:53:00,213 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2019-11-25 17:53:00,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-25 17:53:00,214 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2019-11-25 17:53:00,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-25 17:53:00,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:53:00,215 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2019-11-25 17:53:00,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-25 17:53:00,422 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:53:00,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:53:00,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1207954601, now seen corresponding path program 1 times [2019-11-25 17:53:00,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:53:00,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857679213] [2019-11-25 17:53:00,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-25 17:53:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:53:00,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 17:53:00,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:53:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-11-25 17:53:00,617 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:53:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-11-25 17:53:00,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857679213] [2019-11-25 17:53:00,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:53:00,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 17:53:00,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682530658] [2019-11-25 17:53:00,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 17:53:00,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:53:00,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 17:53:00,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 17:53:00,652 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand 5 states. [2019-11-25 17:53:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:53:00,699 INFO L93 Difference]: Finished difference Result 142 states and 165 transitions. [2019-11-25 17:53:00,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 17:53:00,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-25 17:53:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:53:00,702 INFO L225 Difference]: With dead ends: 142 [2019-11-25 17:53:00,703 INFO L226 Difference]: Without dead ends: 142 [2019-11-25 17:53:00,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:53:00,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-25 17:53:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2019-11-25 17:53:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-25 17:53:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2019-11-25 17:53:00,708 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 58 [2019-11-25 17:53:00,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:53:00,708 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2019-11-25 17:53:00,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 17:53:00,708 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2019-11-25 17:53:00,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-25 17:53:00,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:53:00,709 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2019-11-25 17:53:00,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-25 17:53:00,918 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:53:00,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:53:00,918 INFO L82 PathProgramCache]: Analyzing trace with hash 534855734, now seen corresponding path program 1 times [2019-11-25 17:53:00,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:53:00,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1983062367] [2019-11-25 17:53:00,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-25 17:53:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:53:01,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 17:53:01,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:53:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-11-25 17:53:01,116 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:53:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-11-25 17:53:01,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1983062367] [2019-11-25 17:53:01,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 17:53:01,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 17:53:01,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122837834] [2019-11-25 17:53:01,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 17:53:01,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:53:01,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 17:53:01,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-25 17:53:01,157 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand 6 states. [2019-11-25 17:53:01,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:53:01,266 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2019-11-25 17:53:01,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 17:53:01,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-11-25 17:53:01,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:53:01,269 INFO L225 Difference]: With dead ends: 132 [2019-11-25 17:53:01,269 INFO L226 Difference]: Without dead ends: 132 [2019-11-25 17:53:01,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 17:53:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-25 17:53:01,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2019-11-25 17:53:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-25 17:53:01,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2019-11-25 17:53:01,279 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 58 [2019-11-25 17:53:01,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:53:01,279 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2019-11-25 17:53:01,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 17:53:01,279 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2019-11-25 17:53:01,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-25 17:53:01,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:53:01,280 INFO L410 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:53:01,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-25 17:53:01,492 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:53:01,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:53:01,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1546730881, now seen corresponding path program 3 times [2019-11-25 17:53:01,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:53:01,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584530260] [2019-11-25 17:53:01,493 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-25 17:53:01,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-11-25 17:53:01,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 17:53:01,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-25 17:53:01,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:53:01,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:53:01,955 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:53:01,960 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:53:01,961 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:53:01,961 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 17:53:02,412 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 41 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:53:02,412 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:53:09,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 17:53:10,035 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-11-25 17:53:10,933 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 17:53:10,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584530260] [2019-11-25 17:53:10,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 17:53:10,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2019-11-25 17:53:10,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675959106] [2019-11-25 17:53:10,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-25 17:53:10,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 17:53:10,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-25 17:53:10,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1402, Unknown=0, NotChecked=0, Total=1722 [2019-11-25 17:53:10,936 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 42 states. [2019-11-25 17:53:16,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 17:53:16,315 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2019-11-25 17:53:16,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 17:53:16,317 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 58 [2019-11-25 17:53:16,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 17:53:16,318 INFO L225 Difference]: With dead ends: 113 [2019-11-25 17:53:16,318 INFO L226 Difference]: Without dead ends: 113 [2019-11-25 17:53:16,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=589, Invalid=2491, Unknown=0, NotChecked=0, Total=3080 [2019-11-25 17:53:16,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-25 17:53:16,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-11-25 17:53:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-25 17:53:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2019-11-25 17:53:16,324 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 58 [2019-11-25 17:53:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 17:53:16,324 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2019-11-25 17:53:16,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-25 17:53:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2019-11-25 17:53:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-25 17:53:16,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 17:53:16,326 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 17:53:16,527 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-25 17:53:16,528 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 17:53:16,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 17:53:16,529 INFO L82 PathProgramCache]: Analyzing trace with hash 926469409, now seen corresponding path program 1 times [2019-11-25 17:53:16,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 17:53:16,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674661087] [2019-11-25 17:53:16,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-25 17:53:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 17:53:16,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-25 17:53:16,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 17:53:16,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 17:53:16,718 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 17:53:16,720 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 17:53:16,720 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 17:53:16,720 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 17:53:16,767 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-25 17:53:16,767 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 17:53:17,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-25 17:53:17,066 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:283) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:351) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-25 17:53:17,071 INFO L168 Benchmark]: Toolchain (without parser) took 483730.85 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 326.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -117.1 MB). Peak memory consumption was 209.0 MB. Max. memory is 11.5 GB. [2019-11-25 17:53:17,072 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 17:53:17,073 INFO L168 Benchmark]: CACSL2BoogieTranslator took 924.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-25 17:53:17,073 INFO L168 Benchmark]: Boogie Preprocessor took 116.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-25 17:53:17,074 INFO L168 Benchmark]: RCFGBuilder took 1758.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 971.0 MB in the end (delta: 122.5 MB). Peak memory consumption was 122.5 MB. Max. memory is 11.5 GB. [2019-11-25 17:53:17,074 INFO L168 Benchmark]: TraceAbstraction took 480925.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.2 MB). Free memory was 971.0 MB in the beginning and 1.1 GB in the end (delta: -95.7 MB). Peak memory consumption was 81.6 MB. Max. memory is 11.5 GB. [2019-11-25 17:53:17,085 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.36 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 924.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 116.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1758.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 971.0 MB in the end (delta: 122.5 MB). Peak memory consumption was 122.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 480925.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 177.2 MB). Free memory was 971.0 MB in the beginning and 1.1 GB in the end (delta: -95.7 MB). Peak memory consumption was 81.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:283) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...