./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7c71bc25 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 2a86b9fab61553f9a54467f5b62ac500f38719cf ......................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 2a86b9fab61553f9a54467f5b62ac500f38719cf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-7c71bc2 [2019-11-25 13:21:33,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:21:33,508 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:21:33,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:21:33,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:21:33,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:21:33,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:21:33,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:21:33,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:21:33,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:21:33,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:21:33,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:21:33,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:21:33,557 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:21:33,559 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:21:33,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:21:33,562 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:21:33,563 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:21:33,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:21:33,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:21:33,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:21:33,579 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:21:33,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:21:33,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:21:33,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:21:33,585 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:21:33,585 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:21:33,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:21:33,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:21:33,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:21:33,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:21:33,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:21:33,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:21:33,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:21:33,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:21:33,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:21:33,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:21:33,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:21:33,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:21:33,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:21:33,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:21:33,598 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-25 13:21:33,625 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:21:33,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:21:33,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:21:33,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:21:33,627 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:21:33,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:21:33,628 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:21:33,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:21:33,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:21:33,628 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:21:33,629 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:21:33,629 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:21:33,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:21:33,629 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:21:33,630 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:21:33,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:21:33,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:21:33,631 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:21:33,631 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:21:33,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:21:33,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:21:33,632 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:21:33,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 13:21:33,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 13:21:33,632 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a86b9fab61553f9a54467f5b62ac500f38719cf [2019-11-25 13:21:33,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:21:33,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:21:33,997 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:21:33,998 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:21:33,999 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:21:34,000 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-25 13:21:34,069 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/684a0bad1/aff8c310368e47a581be230bf8b5430a/FLAGb0a5ffed6 [2019-11-25 13:21:34,636 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:21:34,637 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-25 13:21:34,661 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/684a0bad1/aff8c310368e47a581be230bf8b5430a/FLAGb0a5ffed6 [2019-11-25 13:21:34,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/684a0bad1/aff8c310368e47a581be230bf8b5430a [2019-11-25 13:21:34,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:21:34,860 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:21:34,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:21:34,863 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:21:34,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:21:34,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:21:34" (1/1) ... [2019-11-25 13:21:34,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e67317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:34, skipping insertion in model container [2019-11-25 13:21:34,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:21:34" (1/1) ... [2019-11-25 13:21:34,878 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:21:34,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:21:35,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:21:35,484 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-11-25 13:21:35,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@23b2fa83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:35, skipping insertion in model container [2019-11-25 13:21:35,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:21:35,485 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-25 13:21:35,487 INFO L168 Benchmark]: Toolchain (without parser) took 626.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -207.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 13:21:35,488 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:21:35,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 623.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -207.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-25 13:21:35,491 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 623.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 955.0 MB in the beginning and 1.2 GB in the end (delta: -207.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 577]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-7c71bc2 [2019-11-25 13:21:37,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:21:37,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:21:37,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:21:37,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:21:37,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:21:37,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:21:37,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:21:37,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:21:37,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:21:37,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:21:37,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:21:37,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:21:37,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:21:37,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:21:37,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:21:37,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:21:37,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:21:37,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:21:37,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:21:37,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:21:37,224 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:21:37,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:21:37,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:21:37,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:21:37,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:21:37,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:21:37,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:21:37,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:21:37,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:21:37,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:21:37,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:21:37,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:21:37,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:21:37,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:21:37,237 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:21:37,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:21:37,238 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:21:37,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:21:37,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:21:37,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:21:37,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-25 13:21:37,256 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:21:37,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:21:37,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:21:37,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:21:37,258 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:21:37,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:21:37,259 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:21:37,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:21:37,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:21:37,259 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:21:37,260 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:21:37,260 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:21:37,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:21:37,260 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:21:37,261 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 13:21:37,261 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 13:21:37,261 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:21:37,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:21:37,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:21:37,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:21:37,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:21:37,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:21:37,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:21:37,263 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:21:37,264 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 13:21:37,264 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 13:21:37,264 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 13:21:37,264 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a86b9fab61553f9a54467f5b62ac500f38719cf [2019-11-25 13:21:37,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:21:37,569 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:21:37,573 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:21:37,574 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:21:37,575 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:21:37,575 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-25 13:21:37,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8eea0744/5c58bd9b27e44331826a133cec210ad4/FLAG179277ab4 [2019-11-25 13:21:38,221 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:21:38,222 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-25 13:21:38,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8eea0744/5c58bd9b27e44331826a133cec210ad4/FLAG179277ab4 [2019-11-25 13:21:38,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8eea0744/5c58bd9b27e44331826a133cec210ad4 [2019-11-25 13:21:38,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:21:38,536 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:21:38,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:21:38,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:21:38,541 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:21:38,542 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:21:38" (1/1) ... [2019-11-25 13:21:38,545 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155b5aed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:38, skipping insertion in model container [2019-11-25 13:21:38,546 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:21:38" (1/1) ... [2019-11-25 13:21:38,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:21:38,628 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:21:39,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:21:39,168 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-25 13:21:39,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:21:39,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:21:39,239 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 13:21:39,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:21:39,379 INFO L208 MainTranslator]: Completed translation [2019-11-25 13:21:39,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:39 WrapperNode [2019-11-25 13:21:39,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:21:39,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 13:21:39,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 13:21:39,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 13:21:39,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:39" (1/1) ... [2019-11-25 13:21:39,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:39" (1/1) ... [2019-11-25 13:21:39,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:39" (1/1) ... [2019-11-25 13:21:39,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:39" (1/1) ... [2019-11-25 13:21:39,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:39" (1/1) ... [2019-11-25 13:21:39,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:39" (1/1) ... [2019-11-25 13:21:39,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:39" (1/1) ... [2019-11-25 13:21:39,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 13:21:39,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 13:21:39,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 13:21:39,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 13:21:39,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:21:39,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 13:21:39,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 13:21:39,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:21:39,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:21:39,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 13:21:39,616 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 13:21:39,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-25 13:21:39,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-25 13:21:39,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-25 13:21:39,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-25 13:21:39,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-25 13:21:39,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-25 13:21:39,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-25 13:21:39,618 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-25 13:21:39,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-25 13:21:39,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-25 13:21:39,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-25 13:21:39,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-25 13:21:39,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-25 13:21:39,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-25 13:21:39,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-25 13:21:39,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-25 13:21:39,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-25 13:21:39,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-25 13:21:39,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-25 13:21:39,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-25 13:21:39,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-25 13:21:39,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-25 13:21:39,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-25 13:21:39,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-25 13:21:39,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-25 13:21:39,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-25 13:21:39,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-25 13:21:39,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-25 13:21:39,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-25 13:21:39,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-25 13:21:39,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-25 13:21:39,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-25 13:21:39,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-25 13:21:39,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-25 13:21:39,624 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-25 13:21:39,624 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-25 13:21:39,625 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-25 13:21:39,625 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 13:21:39,625 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-25 13:21:39,625 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 13:21:39,626 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-25 13:21:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 13:21:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 13:21:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 13:21:39,626 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 13:21:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 13:21:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 13:21:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 13:21:39,627 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 13:21:39,628 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 13:21:39,628 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 13:21:39,628 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 13:21:39,628 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 13:21:39,628 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 13:21:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 13:21:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 13:21:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 13:21:39,629 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 13:21:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 13:21:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-25 13:21:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-25 13:21:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-25 13:21:39,630 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 13:21:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 13:21:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 13:21:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 13:21:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 13:21:39,631 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 13:21:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 13:21:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 13:21:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 13:21:39,632 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 13:21:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 13:21:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 13:21:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 13:21:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 13:21:39,633 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 13:21:39,634 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 13:21:39,634 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 13:21:39,634 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 13:21:39,634 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 13:21:39,634 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 13:21:39,635 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 13:21:39,635 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 13:21:39,635 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 13:21:39,635 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 13:21:39,635 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 13:21:39,636 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 13:21:39,636 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 13:21:39,636 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 13:21:39,636 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 13:21:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 13:21:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 13:21:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 13:21:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 13:21:39,637 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 13:21:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 13:21:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 13:21:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 13:21:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 13:21:39,638 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 13:21:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 13:21:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 13:21:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 13:21:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 13:21:39,639 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 13:21:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 13:21:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 13:21:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 13:21:39,640 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 13:21:39,641 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 13:21:39,641 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 13:21:39,641 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 13:21:39,641 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 13:21:39,641 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 13:21:39,642 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 13:21:39,642 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 13:21:39,642 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 13:21:39,642 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 13:21:39,643 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 13:21:39,643 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 13:21:39,643 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 13:21:39,643 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 13:21:39,643 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 13:21:39,644 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 13:21:39,644 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 13:21:39,644 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 13:21:39,644 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 13:21:39,644 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 13:21:39,645 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 13:21:39,645 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 13:21:39,645 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 13:21:39,645 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 13:21:39,646 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 13:21:39,646 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 13:21:39,646 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 13:21:39,646 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 13:21:39,646 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 13:21:39,647 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 13:21:39,647 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 13:21:39,647 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 13:21:39,647 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 13:21:39,648 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 13:21:39,648 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 13:21:39,648 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 13:21:39,648 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 13:21:39,648 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 13:21:39,648 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 13:21:39,649 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-25 13:21:39,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 13:21:39,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-25 13:21:39,649 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-25 13:21:39,649 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-25 13:21:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-25 13:21:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-25 13:21:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-25 13:21:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 13:21:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-25 13:21:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 13:21:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-25 13:21:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 13:21:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-25 13:21:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-25 13:21:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-25 13:21:39,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 13:21:39,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-25 13:21:39,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-25 13:21:39,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-25 13:21:39,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-25 13:21:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-25 13:21:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-25 13:21:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 13:21:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-25 13:21:39,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-25 13:21:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-25 13:21:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-25 13:21:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-25 13:21:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 13:21:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 13:21:39,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-25 13:21:39,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-25 13:21:39,655 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:21:39,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-25 13:21:39,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-25 13:21:39,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-25 13:21:39,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-25 13:21:39,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-25 13:21:39,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-25 13:21:39,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-25 13:21:39,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-25 13:21:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-25 13:21:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-25 13:21:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-25 13:21:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-25 13:21:39,657 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-25 13:21:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-25 13:21:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-25 13:21:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 13:21:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 13:21:39,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 13:21:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 13:21:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 13:21:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:21:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-25 13:21:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-25 13:21:39,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-25 13:21:39,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-25 13:21:40,395 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 13:21:40,830 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 13:21:41,168 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 13:21:41,168 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-25 13:21:41,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:21:41 BoogieIcfgContainer [2019-11-25 13:21:41,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 13:21:41,172 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 13:21:41,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 13:21:41,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 13:21:41,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 01:21:38" (1/3) ... [2019-11-25 13:21:41,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb6cec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:21:41, skipping insertion in model container [2019-11-25 13:21:41,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:21:39" (2/3) ... [2019-11-25 13:21:41,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb6cec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:21:41, skipping insertion in model container [2019-11-25 13:21:41,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:21:41" (3/3) ... [2019-11-25 13:21:41,179 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-1.i [2019-11-25 13:21:41,190 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 13:21:41,198 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-25 13:21:41,210 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-25 13:21:41,230 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 13:21:41,230 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 13:21:41,230 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 13:21:41,230 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 13:21:41,231 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 13:21:41,231 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 13:21:41,231 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 13:21:41,231 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 13:21:41,249 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2019-11-25 13:21:41,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:21:41,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:41,260 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:41,261 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:41,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:41,267 INFO L82 PathProgramCache]: Analyzing trace with hash -896940051, now seen corresponding path program 1 times [2019-11-25 13:21:41,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:41,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518275737] [2019-11-25 13:21:41,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:41,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:21:41,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:41,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:21:41,552 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:21:41,560 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:21:41,561 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:21:41,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:21:41,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:41,597 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:41,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:41,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518275737] [2019-11-25 13:21:41,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:41,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 13:21:41,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144085183] [2019-11-25 13:21:41,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:21:41,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:41,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:21:41,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:21:41,684 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 5 states. [2019-11-25 13:21:41,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:41,896 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2019-11-25 13:21:41,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:21:41,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-25 13:21:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:41,919 INFO L225 Difference]: With dead ends: 74 [2019-11-25 13:21:41,919 INFO L226 Difference]: Without dead ends: 71 [2019-11-25 13:21:41,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:21:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-25 13:21:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2019-11-25 13:21:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-25 13:21:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2019-11-25 13:21:41,971 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 17 [2019-11-25 13:21:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:41,971 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2019-11-25 13:21:41,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:21:41,972 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2019-11-25 13:21:41,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:21:41,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:41,973 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:42,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 13:21:42,195 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:42,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:42,195 INFO L82 PathProgramCache]: Analyzing trace with hash -896940050, now seen corresponding path program 1 times [2019-11-25 13:21:42,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:42,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913636583] [2019-11-25 13:21:42,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:42,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 13:21:42,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:42,377 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:21:42,377 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:21:42,387 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:21:42,388 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:21:42,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:21:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:42,448 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:42,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:42,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913636583] [2019-11-25 13:21:42,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:42,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-25 13:21:42,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887887196] [2019-11-25 13:21:42,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:21:42,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:42,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:21:42,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:21:42,841 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 10 states. [2019-11-25 13:21:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:43,337 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2019-11-25 13:21:43,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 13:21:43,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-25 13:21:43,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:43,340 INFO L225 Difference]: With dead ends: 70 [2019-11-25 13:21:43,340 INFO L226 Difference]: Without dead ends: 70 [2019-11-25 13:21:43,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:21:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-25 13:21:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-11-25 13:21:43,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-25 13:21:43,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2019-11-25 13:21:43,379 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 17 [2019-11-25 13:21:43,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:43,379 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2019-11-25 13:21:43,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:21:43,379 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2019-11-25 13:21:43,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:21:43,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:43,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:43,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 13:21:43,591 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:43,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:43,594 INFO L82 PathProgramCache]: Analyzing trace with hash -868310900, now seen corresponding path program 1 times [2019-11-25 13:21:43,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:43,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986567076] [2019-11-25 13:21:43,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:43,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 13:21:43,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:43,746 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:43,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986567076] [2019-11-25 13:21:43,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:43,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 13:21:43,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413137819] [2019-11-25 13:21:43,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:21:43,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:43,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:21:43,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:21:43,801 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 5 states. [2019-11-25 13:21:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:43,834 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-11-25 13:21:43,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:21:43,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-25 13:21:43,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:43,837 INFO L225 Difference]: With dead ends: 64 [2019-11-25 13:21:43,837 INFO L226 Difference]: Without dead ends: 64 [2019-11-25 13:21:43,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:21:43,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-25 13:21:43,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-25 13:21:43,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-25 13:21:43,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-25 13:21:43,858 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 17 [2019-11-25 13:21:43,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:43,859 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-25 13:21:43,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:21:43,859 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-25 13:21:43,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 13:21:43,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:43,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:44,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 13:21:44,078 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:44,079 INFO L82 PathProgramCache]: Analyzing trace with hash 2008128002, now seen corresponding path program 1 times [2019-11-25 13:21:44,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:44,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076999867] [2019-11-25 13:21:44,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:44,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:44,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:21:44,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:44,217 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:44,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:44,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076999867] [2019-11-25 13:21:44,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:44,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 13:21:44,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596626196] [2019-11-25 13:21:44,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:21:44,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:44,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:21:44,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:21:44,339 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2019-11-25 13:21:44,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:44,367 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-25 13:21:44,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:21:44,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-25 13:21:44,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:44,370 INFO L225 Difference]: With dead ends: 64 [2019-11-25 13:21:44,370 INFO L226 Difference]: Without dead ends: 64 [2019-11-25 13:21:44,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:21:44,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-25 13:21:44,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-25 13:21:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-25 13:21:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-11-25 13:21:44,386 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 22 [2019-11-25 13:21:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:44,386 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-11-25 13:21:44,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:21:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-11-25 13:21:44,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 13:21:44,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:44,392 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:44,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 13:21:44,594 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:44,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:44,595 INFO L82 PathProgramCache]: Analyzing trace with hash 211176643, now seen corresponding path program 1 times [2019-11-25 13:21:44,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:44,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642297645] [2019-11-25 13:21:44,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:44,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 13:21:44,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:44,732 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:44,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642297645] [2019-11-25 13:21:44,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:44,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 13:21:44,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787747258] [2019-11-25 13:21:44,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 13:21:44,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:44,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 13:21:44,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 13:21:44,832 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 3 states. [2019-11-25 13:21:44,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:44,940 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-11-25 13:21:44,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 13:21:44,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-25 13:21:44,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:44,942 INFO L225 Difference]: With dead ends: 68 [2019-11-25 13:21:44,942 INFO L226 Difference]: Without dead ends: 58 [2019-11-25 13:21:44,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 13:21:44,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-25 13:21:44,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-25 13:21:44,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-25 13:21:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-25 13:21:44,948 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 22 [2019-11-25 13:21:44,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:44,948 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-25 13:21:44,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 13:21:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-25 13:21:44,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 13:21:44,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:44,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:45,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 13:21:45,161 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:45,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:45,162 INFO L82 PathProgramCache]: Analyzing trace with hash -45428445, now seen corresponding path program 1 times [2019-11-25 13:21:45,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:45,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492041624] [2019-11-25 13:21:45,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:45,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 13:21:45,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:45,330 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:45,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492041624] [2019-11-25 13:21:45,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:45,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 13:21:45,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870520566] [2019-11-25 13:21:45,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 13:21:45,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:45,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 13:21:45,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 13:21:45,399 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 6 states. [2019-11-25 13:21:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:45,444 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-11-25 13:21:45,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 13:21:45,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-25 13:21:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:45,447 INFO L225 Difference]: With dead ends: 64 [2019-11-25 13:21:45,447 INFO L226 Difference]: Without dead ends: 60 [2019-11-25 13:21:45,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-25 13:21:45,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-25 13:21:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-25 13:21:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-25 13:21:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-25 13:21:45,453 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 32 [2019-11-25 13:21:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:45,456 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-25 13:21:45,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 13:21:45,456 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-25 13:21:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 13:21:45,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:45,458 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:45,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 13:21:45,671 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:45,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:45,671 INFO L82 PathProgramCache]: Analyzing trace with hash -792080061, now seen corresponding path program 1 times [2019-11-25 13:21:45,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:45,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1913898374] [2019-11-25 13:21:45,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:45,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:21:45,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:45,855 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:45,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1913898374] [2019-11-25 13:21:45,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:21:45,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-25 13:21:45,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353522388] [2019-11-25 13:21:45,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:21:45,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:45,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:21:45,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:21:45,983 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2019-11-25 13:21:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:46,183 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-25 13:21:46,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 13:21:46,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-25 13:21:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:46,186 INFO L225 Difference]: With dead ends: 68 [2019-11-25 13:21:46,187 INFO L226 Difference]: Without dead ends: 64 [2019-11-25 13:21:46,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-25 13:21:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-25 13:21:46,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-25 13:21:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-25 13:21:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-11-25 13:21:46,193 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 34 [2019-11-25 13:21:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:46,194 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-11-25 13:21:46,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:21:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-11-25 13:21:46,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 13:21:46,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:46,195 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:46,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 13:21:46,401 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:46,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:46,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1102366333, now seen corresponding path program 2 times [2019-11-25 13:21:46,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:46,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073440187] [2019-11-25 13:21:46,403 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 13:21:46,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 13:21:46,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:21:46,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 13:21:46,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:46,582 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:21:46,583 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:21:46,584 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:21:46,585 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:21:46,585 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:21:46,756 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-25 13:21:46,756 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:46,875 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-25 13:21:46,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073440187] [2019-11-25 13:21:46,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:46,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-25 13:21:46,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310893776] [2019-11-25 13:21:46,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 13:21:46,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:46,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 13:21:46,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 13:21:46,878 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 12 states. [2019-11-25 13:21:47,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:47,408 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-25 13:21:47,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 13:21:47,409 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-25 13:21:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:47,410 INFO L225 Difference]: With dead ends: 63 [2019-11-25 13:21:47,410 INFO L226 Difference]: Without dead ends: 63 [2019-11-25 13:21:47,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-25 13:21:47,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-25 13:21:47,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-25 13:21:47,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-25 13:21:47,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-25 13:21:47,415 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 38 [2019-11-25 13:21:47,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:47,416 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-25 13:21:47,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 13:21:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-25 13:21:47,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 13:21:47,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:47,417 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:47,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 13:21:47,621 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:47,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:47,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1102366332, now seen corresponding path program 1 times [2019-11-25 13:21:47,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:47,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317936856] [2019-11-25 13:21:47,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:47,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 13:21:47,773 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:47,881 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:48,281 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:48,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317936856] [2019-11-25 13:21:48,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:21:48,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-25 13:21:48,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966287273] [2019-11-25 13:21:48,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 13:21:48,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:48,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 13:21:48,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-25 13:21:48,284 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 18 states. [2019-11-25 13:21:49,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:49,194 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-11-25 13:21:49,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 13:21:49,195 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-25 13:21:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:49,196 INFO L225 Difference]: With dead ends: 75 [2019-11-25 13:21:49,197 INFO L226 Difference]: Without dead ends: 71 [2019-11-25 13:21:49,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-25 13:21:49,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-25 13:21:49,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-25 13:21:49,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-25 13:21:49,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-11-25 13:21:49,203 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 38 [2019-11-25 13:21:49,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:49,203 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-11-25 13:21:49,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 13:21:49,204 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-11-25 13:21:49,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-25 13:21:49,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:49,205 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:49,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-25 13:21:49,424 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:49,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:49,425 INFO L82 PathProgramCache]: Analyzing trace with hash 2064886276, now seen corresponding path program 2 times [2019-11-25 13:21:49,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:49,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730971520] [2019-11-25 13:21:49,427 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:49,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 13:21:49,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:21:49,575 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 13:21:49,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:49,595 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-25 13:21:49,595 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:21:49,601 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:21:49,602 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:21:49,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:21:49,817 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-25 13:21:49,817 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-25 13:21:50,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730971520] [2019-11-25 13:21:50,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:50,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-25 13:21:50,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717722603] [2019-11-25 13:21:50,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 13:21:50,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:50,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 13:21:50,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-25 13:21:50,994 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 23 states. [2019-11-25 13:21:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:52,486 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-11-25 13:21:52,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 13:21:52,486 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-25 13:21:52,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:52,488 INFO L225 Difference]: With dead ends: 70 [2019-11-25 13:21:52,488 INFO L226 Difference]: Without dead ends: 70 [2019-11-25 13:21:52,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-25 13:21:52,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-25 13:21:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-25 13:21:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-25 13:21:52,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-11-25 13:21:52,493 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 46 [2019-11-25 13:21:52,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:52,494 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-11-25 13:21:52,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 13:21:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-11-25 13:21:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 13:21:52,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:52,495 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:52,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-25 13:21:52,709 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:52,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:52,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1743926468, now seen corresponding path program 1 times [2019-11-25 13:21:52,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:52,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470170080] [2019-11-25 13:21:52,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:21:52,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 13:21:52,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:53,166 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:53,303 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-25 13:21:54,410 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:21:54,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470170080] [2019-11-25 13:21:54,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:21:54,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-25 13:21:54,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232614080] [2019-11-25 13:21:54,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-25 13:21:54,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:54,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-25 13:21:54,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2019-11-25 13:21:54,414 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 34 states. [2019-11-25 13:21:58,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:58,513 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2019-11-25 13:21:58,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-25 13:21:58,514 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-25 13:21:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:58,516 INFO L225 Difference]: With dead ends: 88 [2019-11-25 13:21:58,516 INFO L226 Difference]: Without dead ends: 84 [2019-11-25 13:21:58,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=736, Invalid=1426, Unknown=0, NotChecked=0, Total=2162 [2019-11-25 13:21:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-25 13:21:58,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-11-25 13:21:58,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-25 13:21:58,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-11-25 13:21:58,532 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 51 [2019-11-25 13:21:58,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:58,532 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-11-25 13:21:58,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-25 13:21:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-11-25 13:21:58,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-25 13:21:58,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:58,535 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:58,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-25 13:21:58,737 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:58,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:58,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1346271652, now seen corresponding path program 2 times [2019-11-25 13:21:58,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:58,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714303858] [2019-11-25 13:21:58,739 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-25 13:21:58,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 13:21:58,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:21:58,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 13:21:58,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:21:58,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 13:21:58,884 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:21:58,885 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:21:58,885 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:21:58,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:21:59,051 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:21:59,051 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:21:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:21:59,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1714303858] [2019-11-25 13:21:59,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:21:59,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-25 13:21:59,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840252235] [2019-11-25 13:21:59,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 13:21:59,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:21:59,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 13:21:59,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 13:21:59,114 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 12 states. [2019-11-25 13:21:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:21:59,628 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2019-11-25 13:21:59,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 13:21:59,629 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2019-11-25 13:21:59,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:21:59,630 INFO L225 Difference]: With dead ends: 82 [2019-11-25 13:21:59,630 INFO L226 Difference]: Without dead ends: 82 [2019-11-25 13:21:59,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 114 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-25 13:21:59,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-25 13:21:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-11-25 13:21:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-25 13:21:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-11-25 13:21:59,635 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 65 [2019-11-25 13:21:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:21:59,635 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-11-25 13:21:59,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 13:21:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-11-25 13:21:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-25 13:21:59,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:21:59,636 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:21:59,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-25 13:21:59,845 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:21:59,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:21:59,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1346271651, now seen corresponding path program 1 times [2019-11-25 13:21:59,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:21:59,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162719035] [2019-11-25 13:21:59,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-25 13:22:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:00,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 13:22:00,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:00,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 13:22:00,148 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:00,159 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:00,159 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:00,159 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:22:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:00,444 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:01,245 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:01,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162719035] [2019-11-25 13:22:01,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:22:01,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-25 13:22:01,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709702649] [2019-11-25 13:22:01,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 13:22:01,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:01,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 13:22:01,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-25 13:22:01,247 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 23 states. [2019-11-25 13:22:02,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:02,818 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2019-11-25 13:22:02,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 13:22:02,819 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 65 [2019-11-25 13:22:02,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:02,820 INFO L225 Difference]: With dead ends: 80 [2019-11-25 13:22:02,820 INFO L226 Difference]: Without dead ends: 80 [2019-11-25 13:22:02,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 104 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-25 13:22:02,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-25 13:22:02,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-25 13:22:02,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-25 13:22:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-11-25 13:22:02,825 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 65 [2019-11-25 13:22:02,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:02,825 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-11-25 13:22:02,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 13:22:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-11-25 13:22:02,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-25 13:22:02,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:02,827 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:03,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-25 13:22:03,038 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:22:03,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:03,038 INFO L82 PathProgramCache]: Analyzing trace with hash 983694261, now seen corresponding path program 1 times [2019-11-25 13:22:03,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:03,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017823349] [2019-11-25 13:22:03,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-25 13:22:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:03,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 13:22:03,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:03,285 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:03,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017823349] [2019-11-25 13:22:03,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:22:03,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-25 13:22:03,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929840201] [2019-11-25 13:22:03,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 13:22:03,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:03,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 13:22:03,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 13:22:03,485 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 8 states. [2019-11-25 13:22:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:03,538 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2019-11-25 13:22:03,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 13:22:03,539 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-11-25 13:22:03,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:03,541 INFO L225 Difference]: With dead ends: 82 [2019-11-25 13:22:03,541 INFO L226 Difference]: Without dead ends: 80 [2019-11-25 13:22:03,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-25 13:22:03,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-25 13:22:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-25 13:22:03,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-25 13:22:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-11-25 13:22:03,546 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 63 [2019-11-25 13:22:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:03,546 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-11-25 13:22:03,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 13:22:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-11-25 13:22:03,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-25 13:22:03,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:03,547 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:03,759 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-25 13:22:03,760 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:22:03,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:03,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1784683644, now seen corresponding path program 1 times [2019-11-25 13:22:03,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:03,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491012988] [2019-11-25 13:22:03,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-25 13:22:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:03,965 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 13:22:03,967 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:04,016 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:04,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:04,395 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-25 13:22:04,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491012988] [2019-11-25 13:22:04,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:22:04,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-25 13:22:04,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446483929] [2019-11-25 13:22:04,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 13:22:04,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:04,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 13:22:04,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:22:04,398 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 11 states. [2019-11-25 13:22:04,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:04,526 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-11-25 13:22:04,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 13:22:04,526 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-11-25 13:22:04,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:04,527 INFO L225 Difference]: With dead ends: 84 [2019-11-25 13:22:04,527 INFO L226 Difference]: Without dead ends: 80 [2019-11-25 13:22:04,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-25 13:22:04,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-25 13:22:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-25 13:22:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-25 13:22:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-11-25 13:22:04,537 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 68 [2019-11-25 13:22:04,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:04,538 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-11-25 13:22:04,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 13:22:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-11-25 13:22:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-25 13:22:04,540 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:22:04,540 INFO L410 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:22:04,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-25 13:22:04,741 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:22:04,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:22:04,741 INFO L82 PathProgramCache]: Analyzing trace with hash 887798645, now seen corresponding path program 1 times [2019-11-25 13:22:04,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:22:04,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814779742] [2019-11-25 13:22:04,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-25 13:22:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:22:05,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-25 13:22:05,021 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:22:05,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-25 13:22:05,479 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:05,488 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:05,488 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:05,488 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-25 13:22:05,587 INFO L343 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2019-11-25 13:22:05,588 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2019-11-25 13:22:05,588 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:05,602 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:05,602 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:05,602 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2019-11-25 13:22:05,750 INFO L343 Elim1Store]: treesize reduction 66, result has 22.4 percent of original size [2019-11-25 13:22:05,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2019-11-25 13:22:05,751 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:05,771 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:05,771 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:05,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-25 13:22:05,937 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-25 13:22:05,937 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 50 [2019-11-25 13:22:05,938 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:05,957 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:05,957 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:05,958 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-25 13:22:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:22:07,002 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:22:08,052 WARN L192 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 115 [2019-11-25 13:22:09,336 WARN L192 SmtUtils]: Spent 776.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-25 13:22:10,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:11,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:14,545 WARN L192 SmtUtils]: Spent 853.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-25 13:22:14,616 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 13:22:14,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:22:14,790 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-25 13:22:14,792 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-25 13:22:14,792 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 85 [2019-11-25 13:22:14,800 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-25 13:22:14,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 21 [2019-11-25 13:22:14,802 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:14,804 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:14,804 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:14,804 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:22:14,805 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:14,805 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-25 13:22:16,849 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 13:22:16,850 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:22:17,289 WARN L192 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-25 13:22:17,291 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-25 13:22:17,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 197 [2019-11-25 13:22:17,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,605 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-25 13:22:17,606 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-25 13:22:17,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 193 treesize of output 229 [2019-11-25 13:22:17,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:22:17,618 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:22:17,820 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 50 [2019-11-25 13:22:17,821 INFO L588 ElimStorePlain]: treesize reduction 206, result has 35.0 percent of original size [2019-11-25 13:22:17,821 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:17,865 INFO L588 ElimStorePlain]: treesize reduction 83, result has 27.8 percent of original size [2019-11-25 13:22:17,866 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:22:17,866 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:32 [2019-11-25 13:22:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:22:21,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814779742] [2019-11-25 13:22:21,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:22:21,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41] total 79 [2019-11-25 13:22:21,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741509829] [2019-11-25 13:22:21,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-11-25 13:22:21,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:22:21,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-11-25 13:22:21,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=5859, Unknown=0, NotChecked=0, Total=6162 [2019-11-25 13:22:21,074 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-11-25 13:22:30,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:22:30,016 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-11-25 13:22:30,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-11-25 13:22:30,017 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-11-25 13:22:30,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:22:30,018 INFO L225 Difference]: With dead ends: 72 [2019-11-25 13:22:30,018 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 13:22:30,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=354, Invalid=6786, Unknown=0, NotChecked=0, Total=7140 [2019-11-25 13:22:30,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 13:22:30,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 13:22:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 13:22:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 13:22:30,021 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2019-11-25 13:22:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:22:30,021 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 13:22:30,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-11-25 13:22:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 13:22:30,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 13:22:30,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-25 13:22:30,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 01:22:30 BoogieIcfgContainer [2019-11-25 13:22:30,230 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 13:22:30,231 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 13:22:30,231 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 13:22:30,231 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 13:22:30,232 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:21:41" (3/4) ... [2019-11-25 13:22:30,235 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 13:22:30,243 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-25 13:22:30,244 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:22:30,244 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-25 13:22:30,244 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-25 13:22:30,244 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-25 13:22:30,244 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-25 13:22:30,245 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-25 13:22:30,245 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-25 13:22:30,245 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-25 13:22:30,245 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 13:22:30,245 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-25 13:22:30,245 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-25 13:22:30,245 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-25 13:22:30,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-25 13:22:30,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-25 13:22:30,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:22:30,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-25 13:22:30,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-25 13:22:30,246 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-25 13:22:30,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-25 13:22:30,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 13:22:30,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-25 13:22:30,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-25 13:22:30,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-25 13:22:30,247 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-25 13:22:30,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-25 13:22:30,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-25 13:22:30,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-25 13:22:30,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-25 13:22:30,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-25 13:22:30,248 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-25 13:22:30,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-25 13:22:30,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-25 13:22:30,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-25 13:22:30,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-25 13:22:30,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-25 13:22:30,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-25 13:22:30,249 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-25 13:22:30,250 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-25 13:22:30,250 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 13:22:30,250 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-25 13:22:30,250 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-25 13:22:30,250 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-25 13:22:30,250 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-25 13:22:30,251 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-25 13:22:30,251 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-25 13:22:30,263 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2019-11-25 13:22:30,263 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-25 13:22:30,264 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 13:22:30,264 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 13:22:30,264 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 13:22:30,314 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 13:22:30,314 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 13:22:30,316 INFO L168 Benchmark]: Toolchain (without parser) took 51780.53 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 465.0 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -353.1 MB). Peak memory consumption was 111.9 MB. Max. memory is 11.5 GB. [2019-11-25 13:22:30,316 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:22:30,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -151.2 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-11-25 13:22:30,317 INFO L168 Benchmark]: Boogie Preprocessor took 157.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:22:30,317 INFO L168 Benchmark]: RCFGBuilder took 1631.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 109.4 MB). Peak memory consumption was 109.4 MB. Max. memory is 11.5 GB. [2019-11-25 13:22:30,317 INFO L168 Benchmark]: TraceAbstraction took 49058.48 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 318.2 MB). Free memory was 992.7 MB in the beginning and 1.3 GB in the end (delta: -329.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:22:30,318 INFO L168 Benchmark]: Witness Printer took 84.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. [2019-11-25 13:22:30,320 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 843.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -151.2 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 157.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1631.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 109.4 MB). Peak memory consumption was 109.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49058.48 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 318.2 MB). Free memory was 992.7 MB in the beginning and 1.3 GB in the end (delta: -329.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 84.03 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 683]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 683]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 745]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 745]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 659]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 659]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 762]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 667]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 667]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 669]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 669]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 330 locations, 71 error locations. Result: SAFE, OverallTime: 49.0s, OverallIterations: 16, TraceHistogramMax: 28, AutomataDifference: 19.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 792 SDtfs, 471 SDslu, 5493 SDs, 0 SdLazy, 5025 SolverSat, 289 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1380 GetRequests, 1081 SyntacticMatches, 19 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1331 ImplicationChecksByTransitivity, 20.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 23.2s InterpolantComputationTime, 674 NumberOfCodeBlocks, 626 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1316 ConstructedInterpolants, 104 QuantifiedInterpolants, 344025 SizeOfPredicates, 60 NumberOfNonLiveVariables, 2837 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 3500/4570 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...