./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7c71bc25 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e9fad8e4cf3911fa9881577a543d060495d5513 ............................................................................................................................ 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_4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e9fad8e4cf3911fa9881577a543d060495d5513 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:54:15,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:54:15,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:54:15,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:54:15,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:54:15,089 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:54:15,091 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:54:15,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:54:15,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:54:15,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:54:15,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:54:15,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:54:15,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:54:15,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:54:15,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:54:15,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:54:15,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:54:15,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:54:15,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:54:15,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:54:15,133 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:54:15,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:54:15,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:54:15,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:54:15,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:54:15,145 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:54:15,145 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:54:15,147 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:54:15,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:54:15,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:54:15,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:54:15,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:54:15,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:54:15,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:54:15,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:54:15,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:54:15,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:54:15,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:54:15,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:54:15,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:54:15,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:54:15,158 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-25 13:54:15,186 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:54:15,186 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:54:15,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:54:15,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:54:15,188 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:54:15,189 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:54:15,189 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 13:54:15,189 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:54:15,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:54:15,190 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 13:54:15,190 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:54:15,190 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:54:15,190 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:54:15,191 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:54:15,191 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:54:15,191 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:54:15,191 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 13:54:15,192 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:54:15,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:54:15,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:54:15,193 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:54:15,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:54:15,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:54:15,194 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:54:15,194 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:54:15,194 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 13:54:15,194 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 13:54:15,195 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e9fad8e4cf3911fa9881577a543d060495d5513 [2019-11-25 13:54:15,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:54:15,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:54:15,510 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:54:15,512 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:54:15,513 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:54:15,513 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-25 13:54:15,587 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b898407e/aa6b2d1f29964a4d91f8b94908865c4e/FLAGf57d35290 [2019-11-25 13:54:16,139 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:54:16,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-25 13:54:16,159 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b898407e/aa6b2d1f29964a4d91f8b94908865c4e/FLAGf57d35290 [2019-11-25 13:54:16,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b898407e/aa6b2d1f29964a4d91f8b94908865c4e [2019-11-25 13:54:16,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:54:16,429 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:54:16,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:54:16,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:54:16,433 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:54:16,434 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:54:16" (1/1) ... [2019-11-25 13:54:16,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@245d122c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:54:16, skipping insertion in model container [2019-11-25 13:54:16,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:54:16" (1/1) ... [2019-11-25 13:54:16,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:54:16,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:54:17,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:54:17,044 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:54:17,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6ff242f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:54:17, skipping insertion in model container [2019-11-25 13:54:17,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:54:17,045 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-25 13:54:17,048 INFO L168 Benchmark]: Toolchain (without parser) took 618.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -159.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-25 13:54:17,049 INFO L168 Benchmark]: CDTParser took 0.63 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:54:17,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 615.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-25 13:54:17,052 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.63 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 615.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 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:54:18,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 13:54:18,750 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 13:54:18,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 13:54:18,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 13:54:18,763 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 13:54:18,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 13:54:18,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 13:54:18,769 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 13:54:18,770 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 13:54:18,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 13:54:18,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 13:54:18,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 13:54:18,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 13:54:18,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 13:54:18,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 13:54:18,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 13:54:18,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 13:54:18,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 13:54:18,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 13:54:18,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 13:54:18,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 13:54:18,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 13:54:18,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 13:54:18,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 13:54:18,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 13:54:18,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 13:54:18,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 13:54:18,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 13:54:18,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 13:54:18,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 13:54:18,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 13:54:18,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 13:54:18,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 13:54:18,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 13:54:18,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 13:54:18,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 13:54:18,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 13:54:18,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 13:54:18,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 13:54:18,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 13:54:18,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-25 13:54:18,834 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 13:54:18,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 13:54:18,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 13:54:18,837 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 13:54:18,838 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 13:54:18,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 13:54:18,839 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 13:54:18,839 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 13:54:18,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 13:54:18,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 13:54:18,841 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 13:54:18,841 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-25 13:54:18,841 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-25 13:54:18,842 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-25 13:54:18,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 13:54:18,842 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-25 13:54:18,843 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-25 13:54:18,843 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-25 13:54:18,843 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 13:54:18,843 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 13:54:18,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 13:54:18,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 13:54:18,845 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 13:54:18,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 13:54:18,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 13:54:18,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 13:54:18,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 13:54:18,846 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-25 13:54:18,847 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-25 13:54:18,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-25 13:54:18,847 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e9fad8e4cf3911fa9881577a543d060495d5513 [2019-11-25 13:54:19,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 13:54:19,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 13:54:19,160 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 13:54:19,161 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 13:54:19,162 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 13:54:19,163 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-25 13:54:19,231 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7f9a390/ccad932d82944452b61773f39eaf737d/FLAGd3412a4cf [2019-11-25 13:54:19,764 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 13:54:19,765 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_4.i [2019-11-25 13:54:19,784 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7f9a390/ccad932d82944452b61773f39eaf737d/FLAGd3412a4cf [2019-11-25 13:54:20,045 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be7f9a390/ccad932d82944452b61773f39eaf737d [2019-11-25 13:54:20,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 13:54:20,052 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-25 13:54:20,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 13:54:20,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 13:54:20,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 13:54:20,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:54:20" (1/1) ... [2019-11-25 13:54:20,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c2c676 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:54:20, skipping insertion in model container [2019-11-25 13:54:20,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 01:54:20" (1/1) ... [2019-11-25 13:54:20,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 13:54:20,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:54:20,654 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:54:20,676 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-25 13:54:20,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-25 13:54:20,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:54:20,801 INFO L203 MainTranslator]: Completed pre-run [2019-11-25 13:54:20,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 13:54:20,968 INFO L208 MainTranslator]: Completed translation [2019-11-25 13:54:20,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:54:20 WrapperNode [2019-11-25 13:54:20,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 13:54:20,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 13:54:20,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 13:54:20,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 13:54:20,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:54:20" (1/1) ... [2019-11-25 13:54:20,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:54:20" (1/1) ... [2019-11-25 13:54:21,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:54:20" (1/1) ... [2019-11-25 13:54:21,020 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:54:20" (1/1) ... [2019-11-25 13:54:21,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:54:20" (1/1) ... [2019-11-25 13:54:21,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:54:20" (1/1) ... [2019-11-25 13:54:21,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:54:20" (1/1) ... [2019-11-25 13:54:21,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 13:54:21,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 13:54:21,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 13:54:21,080 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 13:54:21,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:54:20" (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:54:21,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-25 13:54:21,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 13:54:21,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:54:21,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:54:21,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-25 13:54:21,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-25 13:54:21,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-25 13:54:21,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-25 13:54:21,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-25 13:54:21,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-25 13:54:21,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-25 13:54:21,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-25 13:54:21,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-25 13:54:21,154 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-25 13:54:21,154 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-25 13:54:21,155 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-25 13:54:21,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-25 13:54:21,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-25 13:54:21,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-25 13:54:21,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-25 13:54:21,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-25 13:54:21,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-25 13:54:21,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-25 13:54:21,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-25 13:54:21,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-25 13:54:21,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-25 13:54:21,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-25 13:54:21,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-25 13:54:21,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-25 13:54:21,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-25 13:54:21,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-25 13:54:21,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-25 13:54:21,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-25 13:54:21,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-25 13:54:21,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-25 13:54:21,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-25 13:54:21,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-25 13:54:21,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-25 13:54:21,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-25 13:54:21,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-25 13:54:21,159 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-25 13:54:21,160 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-25 13:54:21,160 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_get [2019-11-25 13:54:21,160 INFO L138 BoogieDeclarations]: Found implementation of procedure f_22_put [2019-11-25 13:54:21,160 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-25 13:54:21,160 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-25 13:54:21,160 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-25 13:54:21,160 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-25 13:54:21,161 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-25 13:54:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-25 13:54:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-25 13:54:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-25 13:54:21,161 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-25 13:54:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-25 13:54:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-25 13:54:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-25 13:54:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-25 13:54:21,162 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-25 13:54:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-25 13:54:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-25 13:54:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-25 13:54:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-25 13:54:21,163 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-25 13:54:21,164 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-25 13:54:21,165 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-25 13:54:21,165 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-25 13:54:21,165 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-25 13:54:21,166 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-25 13:54:21,166 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-25 13:54:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-25 13:54:21,167 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-25 13:54:21,168 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-25 13:54:21,168 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-25 13:54:21,168 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-25 13:54:21,168 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-25 13:54:21,168 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-25 13:54:21,168 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-25 13:54:21,168 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-25 13:54:21,169 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-25 13:54:21,169 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-25 13:54:21,170 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-25 13:54:21,170 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-25 13:54:21,170 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-25 13:54:21,170 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-25 13:54:21,170 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-25 13:54:21,170 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-25 13:54:21,170 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-25 13:54:21,171 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-25 13:54:21,171 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-25 13:54:21,171 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-25 13:54:21,171 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-25 13:54:21,171 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-25 13:54:21,171 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-25 13:54:21,171 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-25 13:54:21,172 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-25 13:54:21,172 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-25 13:54:21,172 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-25 13:54:21,172 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-25 13:54:21,172 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-25 13:54:21,172 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-25 13:54:21,172 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-25 13:54:21,172 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-25 13:54:21,173 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-25 13:54:21,173 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-25 13:54:21,173 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-25 13:54:21,173 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-25 13:54:21,173 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-25 13:54:21,173 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-25 13:54:21,173 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-25 13:54:21,173 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-25 13:54:21,174 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-25 13:54:21,174 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-25 13:54:21,175 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-25 13:54:21,175 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-25 13:54:21,175 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-25 13:54:21,175 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-25 13:54:21,175 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-25 13:54:21,176 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-25 13:54:21,176 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-25 13:54:21,176 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-25 13:54:21,177 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-25 13:54:21,177 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-25 13:54:21,177 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-25 13:54:21,177 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-25 13:54:21,177 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-25 13:54:21,178 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-25 13:54:21,178 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-25 13:54:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-25 13:54:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-25 13:54:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-25 13:54:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-25 13:54:21,182 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-25 13:54:21,183 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-25 13:54:21,183 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-25 13:54:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-25 13:54:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-25 13:54:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-25 13:54:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-25 13:54:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-25 13:54:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-25 13:54:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-25 13:54:21,191 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-25 13:54:21,192 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-25 13:54:21,192 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-25 13:54:21,192 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-25 13:54:21,192 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-25 13:54:21,192 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-25 13:54:21,192 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-25 13:54:21,192 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-25 13:54:21,192 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-25 13:54:21,193 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-25 13:54:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-25 13:54:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-25 13:54:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-25 13:54:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-25 13:54:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-25 13:54:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-25 13:54:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-25 13:54:21,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-25 13:54:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-25 13:54:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-25 13:54:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-25 13:54:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-25 13:54:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-25 13:54:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-25 13:54:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-25 13:54:21,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-25 13:54:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-25 13:54:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-25 13:54:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-25 13:54:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-25 13:54:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-25 13:54:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-25 13:54:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-25 13:54:21,196 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-25 13:54:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-25 13:54:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-25 13:54:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-25 13:54:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-25 13:54:21,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 13:54:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-25 13:54:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-25 13:54:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-25 13:54:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-25 13:54:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-25 13:54:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-25 13:54:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-25 13:54:21,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-25 13:54:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-25 13:54:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:54:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-25 13:54:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-25 13:54:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-25 13:54:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-25 13:54:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-25 13:54:21,199 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-25 13:54:21,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-25 13:54:21,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-25 13:54:21,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-25 13:54:21,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-25 13:54:21,200 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-25 13:54:21,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-25 13:54:21,200 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-25 13:54:21,200 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-25 13:54:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_get [2019-11-25 13:54:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure f_22_put [2019-11-25 13:54:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-25 13:54:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-25 13:54:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-25 13:54:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 13:54:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-25 13:54:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 13:54:21,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:54:21,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-25 13:54:21,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-25 13:54:21,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-25 13:54:21,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-25 13:54:21,943 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 13:54:22,419 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 13:54:22,776 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 13:54:22,776 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-25 13:54:22,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:54:22 BoogieIcfgContainer [2019-11-25 13:54:22,778 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 13:54:22,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 13:54:22,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 13:54:22,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 13:54:22,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 01:54:20" (1/3) ... [2019-11-25 13:54:22,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ad53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:54:22, skipping insertion in model container [2019-11-25 13:54:22,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 01:54:20" (2/3) ... [2019-11-25 13:54:22,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44ad53b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 01:54:22, skipping insertion in model container [2019-11-25 13:54:22,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:54:22" (3/3) ... [2019-11-25 13:54:22,790 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_4.i [2019-11-25 13:54:22,800 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 13:54:22,810 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-25 13:54:22,822 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-25 13:54:22,845 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 13:54:22,845 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-25 13:54:22,845 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 13:54:22,845 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 13:54:22,846 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 13:54:22,846 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 13:54:22,846 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 13:54:22,846 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 13:54:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states. [2019-11-25 13:54:22,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:54:22,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:22,892 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:54:22,892 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:54:22,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:22,899 INFO L82 PathProgramCache]: Analyzing trace with hash -604206848, now seen corresponding path program 1 times [2019-11-25 13:54:22,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:22,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291128378] [2019-11-25 13:54:22,913 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:54:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:23,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:54:23,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:23,168 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:54:23,170 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:54:23,178 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:54:23,178 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:54:23,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:54:23,212 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:54:23,212 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:23,274 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:54:23,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291128378] [2019-11-25 13:54:23,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:23,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-25 13:54:23,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867359685] [2019-11-25 13:54:23,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:54:23,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:23,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:54:23,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:54:23,302 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 5 states. [2019-11-25 13:54:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:23,611 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2019-11-25 13:54:23,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:54:23,614 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-25 13:54:23,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:23,651 INFO L225 Difference]: With dead ends: 160 [2019-11-25 13:54:23,651 INFO L226 Difference]: Without dead ends: 157 [2019-11-25 13:54:23,655 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:54:23,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-25 13:54:23,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 151. [2019-11-25 13:54:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-25 13:54:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2019-11-25 13:54:23,756 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 17 [2019-11-25 13:54:23,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:23,759 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2019-11-25 13:54:23,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:54:23,759 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2019-11-25 13:54:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:54:23,760 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:23,760 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:54:23,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-25 13:54:23,973 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:54:23,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:23,974 INFO L82 PathProgramCache]: Analyzing trace with hash -604206847, now seen corresponding path program 1 times [2019-11-25 13:54:23,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:23,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498866283] [2019-11-25 13:54:23,975 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:54:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:24,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 13:54:24,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:24,136 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:54:24,136 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:54:24,144 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:54:24,144 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:54:24,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:54:24,196 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:54:24,197 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:24,553 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:54:24,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498866283] [2019-11-25 13:54:24,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:24,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-25 13:54:24,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489010190] [2019-11-25 13:54:24,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:54:24,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:24,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:54:24,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:54:24,559 INFO L87 Difference]: Start difference. First operand 151 states and 162 transitions. Second operand 10 states. [2019-11-25 13:54:25,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:25,319 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2019-11-25 13:54:25,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 13:54:25,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-25 13:54:25,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:25,325 INFO L225 Difference]: With dead ends: 156 [2019-11-25 13:54:25,325 INFO L226 Difference]: Without dead ends: 156 [2019-11-25 13:54:25,326 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:54:25,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-25 13:54:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 151. [2019-11-25 13:54:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-25 13:54:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2019-11-25 13:54:25,338 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 17 [2019-11-25 13:54:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:25,339 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2019-11-25 13:54:25,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:54:25,339 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2019-11-25 13:54:25,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-25 13:54:25,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:25,340 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:54:25,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-25 13:54:25,551 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:54:25,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:25,552 INFO L82 PathProgramCache]: Analyzing trace with hash -575577697, now seen corresponding path program 1 times [2019-11-25 13:54:25,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:25,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830807668] [2019-11-25 13:54:25,554 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:54:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:25,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 13:54:25,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:25,705 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:54:25,706 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:25,744 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:54:25,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830807668] [2019-11-25 13:54:25,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:25,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 13:54:25,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127005631] [2019-11-25 13:54:25,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:54:25,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:25,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:54:25,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:54:25,746 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 5 states. [2019-11-25 13:54:25,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:25,776 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2019-11-25 13:54:25,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:54:25,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-25 13:54:25,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:25,779 INFO L225 Difference]: With dead ends: 150 [2019-11-25 13:54:25,779 INFO L226 Difference]: Without dead ends: 150 [2019-11-25 13:54:25,779 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:54:25,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-25 13:54:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-11-25 13:54:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-25 13:54:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2019-11-25 13:54:25,800 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 17 [2019-11-25 13:54:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:25,802 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2019-11-25 13:54:25,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:54:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2019-11-25 13:54:25,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 13:54:25,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:25,805 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] [2019-11-25 13:54:26,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-25 13:54:26,019 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:54:26,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:26,020 INFO L82 PathProgramCache]: Analyzing trace with hash 300911328, now seen corresponding path program 1 times [2019-11-25 13:54:26,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:26,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995332431] [2019-11-25 13:54:26,020 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:54:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:26,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:54:26,163 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:26,192 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:54:26,193 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:26,277 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:54:26,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995332431] [2019-11-25 13:54:26,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:26,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-25 13:54:26,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897200998] [2019-11-25 13:54:26,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 13:54:26,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:26,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 13:54:26,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 13:54:26,279 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand 5 states. [2019-11-25 13:54:26,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:26,307 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2019-11-25 13:54:26,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 13:54:26,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-25 13:54:26,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:26,310 INFO L225 Difference]: With dead ends: 150 [2019-11-25 13:54:26,313 INFO L226 Difference]: Without dead ends: 150 [2019-11-25 13:54:26,313 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 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:54:26,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-25 13:54:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2019-11-25 13:54:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-25 13:54:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 155 transitions. [2019-11-25 13:54:26,329 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 155 transitions. Word has length 29 [2019-11-25 13:54:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:26,329 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 155 transitions. [2019-11-25 13:54:26,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 13:54:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 155 transitions. [2019-11-25 13:54:26,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 13:54:26,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:26,332 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] [2019-11-25 13:54:26,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-25 13:54:26,534 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:54:26,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:26,535 INFO L82 PathProgramCache]: Analyzing trace with hash -696161025, now seen corresponding path program 1 times [2019-11-25 13:54:26,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:26,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853644324] [2019-11-25 13:54:26,539 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:54:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:26,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-25 13:54:26,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:26,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:54:26,796 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:26,843 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:54:26,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853644324] [2019-11-25 13:54:26,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:26,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2019-11-25 13:54:26,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468602432] [2019-11-25 13:54:26,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-25 13:54:26,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:26,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-25 13:54:26,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-25 13:54:26,847 INFO L87 Difference]: Start difference. First operand 148 states and 155 transitions. Second operand 9 states. [2019-11-25 13:54:26,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:26,952 INFO L93 Difference]: Finished difference Result 168 states and 176 transitions. [2019-11-25 13:54:26,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 13:54:26,953 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-11-25 13:54:26,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:26,958 INFO L225 Difference]: With dead ends: 168 [2019-11-25 13:54:26,958 INFO L226 Difference]: Without dead ends: 168 [2019-11-25 13:54:26,959 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:54:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-25 13:54:26,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 162. [2019-11-25 13:54:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-25 13:54:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 169 transitions. [2019-11-25 13:54:26,980 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 169 transitions. Word has length 29 [2019-11-25 13:54:26,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:26,981 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 169 transitions. [2019-11-25 13:54:26,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-25 13:54:26,981 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 169 transitions. [2019-11-25 13:54:26,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 13:54:26,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:26,982 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:54:27,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-25 13:54:27,195 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:54:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:27,195 INFO L82 PathProgramCache]: Analyzing trace with hash 536113147, now seen corresponding path program 1 times [2019-11-25 13:54:27,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:27,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [613146034] [2019-11-25 13:54:27,197 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:54:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:27,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 13:54:27,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:27,350 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:54:27,351 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:54:27,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [613146034] [2019-11-25 13:54:27,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:27,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-25 13:54:27,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313244584] [2019-11-25 13:54:27,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 13:54:27,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:27,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 13:54:27,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 13:54:27,418 INFO L87 Difference]: Start difference. First operand 162 states and 169 transitions. Second operand 6 states. [2019-11-25 13:54:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:27,467 INFO L93 Difference]: Finished difference Result 168 states and 175 transitions. [2019-11-25 13:54:27,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 13:54:27,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-25 13:54:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:27,469 INFO L225 Difference]: With dead ends: 168 [2019-11-25 13:54:27,469 INFO L226 Difference]: Without dead ends: 164 [2019-11-25 13:54:27,470 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:54:27,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-25 13:54:27,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-11-25 13:54:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-11-25 13:54:27,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 171 transitions. [2019-11-25 13:54:27,486 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 171 transitions. Word has length 32 [2019-11-25 13:54:27,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:27,486 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 171 transitions. [2019-11-25 13:54:27,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 13:54:27,486 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 171 transitions. [2019-11-25 13:54:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-25 13:54:27,490 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:27,490 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:54:27,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-25 13:54:27,708 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:54:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:27,709 INFO L82 PathProgramCache]: Analyzing trace with hash 690495131, now seen corresponding path program 1 times [2019-11-25 13:54:27,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:27,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480584756] [2019-11-25 13:54:27,710 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:54:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:27,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 13:54:27,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:27,889 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:54:27,890 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:28,014 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:54:28,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480584756] [2019-11-25 13:54:28,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:54:28,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-25 13:54:28,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279081109] [2019-11-25 13:54:28,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-25 13:54:28,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:28,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-25 13:54:28,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-25 13:54:28,017 INFO L87 Difference]: Start difference. First operand 164 states and 171 transitions. Second operand 10 states. [2019-11-25 13:54:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:28,255 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2019-11-25 13:54:28,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 13:54:28,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-25 13:54:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:28,258 INFO L225 Difference]: With dead ends: 172 [2019-11-25 13:54:28,258 INFO L226 Difference]: Without dead ends: 168 [2019-11-25 13:54:28,259 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:54:28,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-25 13:54:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-11-25 13:54:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-25 13:54:28,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 175 transitions. [2019-11-25 13:54:28,267 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 175 transitions. Word has length 34 [2019-11-25 13:54:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:28,268 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 175 transitions. [2019-11-25 13:54:28,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-25 13:54:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 175 transitions. [2019-11-25 13:54:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 13:54:28,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:28,270 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:54:28,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-25 13:54:28,490 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:54:28,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:28,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385957, now seen corresponding path program 2 times [2019-11-25 13:54:28,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:28,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281387673] [2019-11-25 13:54:28,492 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:54:28,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 13:54:28,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:54:28,652 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 13:54:28,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:28,660 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:54:28,660 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:54:28,662 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:54:28,662 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:54:28,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:54:28,831 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:54:28,831 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:28,928 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:54:28,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281387673] [2019-11-25 13:54:28,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:28,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-25 13:54:28,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779683628] [2019-11-25 13:54:28,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 13:54:28,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:28,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 13:54:28,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 13:54:28,930 INFO L87 Difference]: Start difference. First operand 168 states and 175 transitions. Second operand 12 states. [2019-11-25 13:54:29,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:29,950 INFO L93 Difference]: Finished difference Result 179 states and 185 transitions. [2019-11-25 13:54:29,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 13:54:29,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-25 13:54:29,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:29,952 INFO L225 Difference]: With dead ends: 179 [2019-11-25 13:54:29,953 INFO L226 Difference]: Without dead ends: 179 [2019-11-25 13:54:29,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-25 13:54:29,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-25 13:54:29,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2019-11-25 13:54:29,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-25 13:54:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 174 transitions. [2019-11-25 13:54:29,960 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 174 transitions. Word has length 38 [2019-11-25 13:54:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:29,960 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 174 transitions. [2019-11-25 13:54:29,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 13:54:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 174 transitions. [2019-11-25 13:54:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 13:54:29,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:29,961 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:54:30,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-25 13:54:30,171 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:54:30,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:30,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2002385956, now seen corresponding path program 1 times [2019-11-25 13:54:30,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:30,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4928185] [2019-11-25 13:54:30,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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:54:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:30,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 13:54:30,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:30,386 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:54:30,387 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:30,697 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:54:30,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4928185] [2019-11-25 13:54:30,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:54:30,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-25 13:54:30,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263806789] [2019-11-25 13:54:30,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 13:54:30,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:30,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 13:54:30,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-25 13:54:30,700 INFO L87 Difference]: Start difference. First operand 167 states and 174 transitions. Second operand 18 states. [2019-11-25 13:54:31,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:31,689 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2019-11-25 13:54:31,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 13:54:31,691 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-25 13:54:31,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:31,695 INFO L225 Difference]: With dead ends: 179 [2019-11-25 13:54:31,695 INFO L226 Difference]: Without dead ends: 175 [2019-11-25 13:54:31,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-25 13:54:31,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-25 13:54:31,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-11-25 13:54:31,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-25 13:54:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 182 transitions. [2019-11-25 13:54:31,703 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 182 transitions. Word has length 38 [2019-11-25 13:54:31,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:31,703 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 182 transitions. [2019-11-25 13:54:31,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 13:54:31,703 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 182 transitions. [2019-11-25 13:54:31,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-25 13:54:31,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:31,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:54:31,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-25 13:54:31,912 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:54:31,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:31,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1347385061, now seen corresponding path program 1 times [2019-11-25 13:54:31,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:31,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491800765] [2019-11-25 13:54:31,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-25 13:54:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:32,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-25 13:54:32,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:32,128 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:54:32,129 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:32,183 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:54:32,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491800765] [2019-11-25 13:54:32,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:32,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-25 13:54:32,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103048021] [2019-11-25 13:54:32,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 13:54:32,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:32,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 13:54:32,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 13:54:32,185 INFO L87 Difference]: Start difference. First operand 175 states and 182 transitions. Second operand 7 states. [2019-11-25 13:54:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:32,234 INFO L93 Difference]: Finished difference Result 184 states and 191 transitions. [2019-11-25 13:54:32,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 13:54:32,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-11-25 13:54:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:32,237 INFO L225 Difference]: With dead ends: 184 [2019-11-25 13:54:32,237 INFO L226 Difference]: Without dead ends: 184 [2019-11-25 13:54:32,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 13:54:32,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-25 13:54:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2019-11-25 13:54:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-25 13:54:32,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 187 transitions. [2019-11-25 13:54:32,245 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 187 transitions. Word has length 40 [2019-11-25 13:54:32,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:32,246 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 187 transitions. [2019-11-25 13:54:32,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 13:54:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 187 transitions. [2019-11-25 13:54:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-25 13:54:32,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:32,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:54:32,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-25 13:54:32,469 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:54:32,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:32,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1156201438, now seen corresponding path program 1 times [2019-11-25 13:54:32,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:32,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938370071] [2019-11-25 13:54:32,471 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:54:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:32,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 13:54:32,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:32,623 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:54:32,623 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:32,813 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:54:32,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938370071] [2019-11-25 13:54:32,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:32,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-25 13:54:32,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920101320] [2019-11-25 13:54:32,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 13:54:32,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:32,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 13:54:32,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 13:54:32,817 INFO L87 Difference]: Start difference. First operand 180 states and 187 transitions. Second operand 3 states. [2019-11-25 13:54:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:33,012 INFO L93 Difference]: Finished difference Result 191 states and 197 transitions. [2019-11-25 13:54:33,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 13:54:33,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-11-25 13:54:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:33,014 INFO L225 Difference]: With dead ends: 191 [2019-11-25 13:54:33,015 INFO L226 Difference]: Without dead ends: 165 [2019-11-25 13:54:33,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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:54:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-25 13:54:33,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2019-11-25 13:54:33,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-25 13:54:33,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 163 transitions. [2019-11-25 13:54:33,020 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 163 transitions. Word has length 38 [2019-11-25 13:54:33,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:33,021 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 163 transitions. [2019-11-25 13:54:33,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 13:54:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 163 transitions. [2019-11-25 13:54:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-25 13:54:33,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:33,022 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:54:33,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-25 13:54:33,228 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:54:33,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:33,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1528032860, now seen corresponding path program 2 times [2019-11-25 13:54:33,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:33,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797278372] [2019-11-25 13:54:33,230 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:54:33,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 13:54:33,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:54:33,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 13:54:33,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:33,412 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:54:33,412 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:54:33,421 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:54:33,421 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:54:33,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:54:33,667 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:54:33,668 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:34,588 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:54:34,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797278372] [2019-11-25 13:54:34,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:34,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-25 13:54:34,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421275369] [2019-11-25 13:54:34,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 13:54:34,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:34,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 13:54:34,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-25 13:54:34,591 INFO L87 Difference]: Start difference. First operand 157 states and 163 transitions. Second operand 23 states. [2019-11-25 13:54:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:37,443 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2019-11-25 13:54:37,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 13:54:37,443 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-25 13:54:37,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:37,444 INFO L225 Difference]: With dead ends: 156 [2019-11-25 13:54:37,445 INFO L226 Difference]: Without dead ends: 156 [2019-11-25 13:54:37,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-25 13:54:37,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-25 13:54:37,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-11-25 13:54:37,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-25 13:54:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2019-11-25 13:54:37,450 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 46 [2019-11-25 13:54:37,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:37,450 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2019-11-25 13:54:37,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 13:54:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2019-11-25 13:54:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 13:54:37,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:37,451 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:54:37,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-25 13:54:37,662 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:54:37,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:37,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1472640772, now seen corresponding path program 1 times [2019-11-25 13:54:37,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:37,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035110587] [2019-11-25 13:54:37,666 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:54:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:37,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 13:54:37,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:38,051 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:54:38,051 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:38,169 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-25 13:54:39,006 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:54:39,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035110587] [2019-11-25 13:54:39,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:54:39,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-25 13:54:39,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935451101] [2019-11-25 13:54:39,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-25 13:54:39,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:39,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-25 13:54:39,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-25 13:54:39,009 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 34 states. [2019-11-25 13:54:39,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:39,831 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2019-11-25 13:54:39,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-25 13:54:39,832 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-25 13:54:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:39,834 INFO L225 Difference]: With dead ends: 162 [2019-11-25 13:54:39,834 INFO L226 Difference]: Without dead ends: 158 [2019-11-25 13:54:39,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-11-25 13:54:39,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-25 13:54:39,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-11-25 13:54:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-25 13:54:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 164 transitions. [2019-11-25 13:54:39,843 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 164 transitions. Word has length 51 [2019-11-25 13:54:39,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:39,843 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 164 transitions. [2019-11-25 13:54:39,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-25 13:54:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 164 transitions. [2019-11-25 13:54:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 13:54:39,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:39,844 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:54:40,052 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-25 13:54:40,053 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:54:40,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:40,053 INFO L82 PathProgramCache]: Analyzing trace with hash 680412260, now seen corresponding path program 2 times [2019-11-25 13:54:40,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:40,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094879406] [2019-11-25 13:54:40,055 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-25 13:54:40,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-25 13:54:40,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 13:54:40,190 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 13:54:40,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:40,196 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:54:40,197 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:54:40,199 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:54:40,199 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:54:40,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:54:40,355 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:40,355 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:40,427 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:40,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094879406] [2019-11-25 13:54:40,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:40,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-25 13:54:40,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220845223] [2019-11-25 13:54:40,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 13:54:40,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:40,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 13:54:40,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-25 13:54:40,429 INFO L87 Difference]: Start difference. First operand 158 states and 164 transitions. Second operand 12 states. [2019-11-25 13:54:41,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:41,350 INFO L93 Difference]: Finished difference Result 168 states and 173 transitions. [2019-11-25 13:54:41,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 13:54:41,350 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-25 13:54:41,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:41,352 INFO L225 Difference]: With dead ends: 168 [2019-11-25 13:54:41,352 INFO L226 Difference]: Without dead ends: 168 [2019-11-25 13:54:41,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-25 13:54:41,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-25 13:54:41,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 156. [2019-11-25 13:54:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-25 13:54:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 162 transitions. [2019-11-25 13:54:41,359 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 162 transitions. Word has length 53 [2019-11-25 13:54:41,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:41,359 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 162 transitions. [2019-11-25 13:54:41,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 13:54:41,360 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 162 transitions. [2019-11-25 13:54:41,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-25 13:54:41,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:41,360 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:54:41,571 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-25 13:54:41,572 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:54:41,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash 680412261, now seen corresponding path program 1 times [2019-11-25 13:54:41,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:41,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850712052] [2019-11-25 13:54:41,574 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:54:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:41,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 13:54:41,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:41,790 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:54:41,790 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:54:41,794 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:54:41,795 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:54:41,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:54:42,022 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:42,022 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:42,841 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:42,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850712052] [2019-11-25 13:54:42,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:42,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-25 13:54:42,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014341645] [2019-11-25 13:54:42,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-25 13:54:42,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:42,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-25 13:54:42,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-25 13:54:42,843 INFO L87 Difference]: Start difference. First operand 156 states and 162 transitions. Second operand 23 states. [2019-11-25 13:54:45,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:45,745 INFO L93 Difference]: Finished difference Result 154 states and 160 transitions. [2019-11-25 13:54:45,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 13:54:45,746 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-25 13:54:45,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:45,747 INFO L225 Difference]: With dead ends: 154 [2019-11-25 13:54:45,747 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 13:54:45,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-25 13:54:45,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 13:54:45,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-25 13:54:45,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-25 13:54:45,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 160 transitions. [2019-11-25 13:54:45,752 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 160 transitions. Word has length 53 [2019-11-25 13:54:45,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:45,753 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 160 transitions. [2019-11-25 13:54:45,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-25 13:54:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 160 transitions. [2019-11-25 13:54:45,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-25 13:54:45,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:45,754 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:54:45,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-25 13:54:45,962 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:54:45,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:45,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2141011139, now seen corresponding path program 1 times [2019-11-25 13:54:45,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:45,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94613474] [2019-11-25 13:54:45,964 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:54:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:46,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 13:54:46,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:46,177 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:46,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94613474] [2019-11-25 13:54:46,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:46,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-25 13:54:46,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364906452] [2019-11-25 13:54:46,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-25 13:54:46,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:46,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-25 13:54:46,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 13:54:46,309 INFO L87 Difference]: Start difference. First operand 154 states and 160 transitions. Second operand 8 states. [2019-11-25 13:54:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:46,358 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2019-11-25 13:54:46,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-25 13:54:46,359 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-25 13:54:46,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:46,360 INFO L225 Difference]: With dead ends: 156 [2019-11-25 13:54:46,360 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 13:54:46,360 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 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:54:46,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 13:54:46,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-25 13:54:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-25 13:54:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 159 transitions. [2019-11-25 13:54:46,366 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 159 transitions. Word has length 58 [2019-11-25 13:54:46,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:46,366 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 159 transitions. [2019-11-25 13:54:46,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-25 13:54:46,366 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 159 transitions. [2019-11-25 13:54:46,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-25 13:54:46,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:46,367 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:54:46,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-25 13:54:46,574 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:54:46,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:46,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1283825080, now seen corresponding path program 1 times [2019-11-25 13:54:46,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:46,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5304749] [2019-11-25 13:54:46,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-25 13:54:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:46,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-25 13:54:46,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:46,828 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:47,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:47,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5304749] [2019-11-25 13:54:47,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:47,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-25 13:54:47,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773448685] [2019-11-25 13:54:47,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 13:54:47,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:47,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 13:54:47,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:54:47,083 INFO L87 Difference]: Start difference. First operand 154 states and 159 transitions. Second operand 11 states. [2019-11-25 13:54:47,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:47,189 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2019-11-25 13:54:47,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 13:54:47,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-11-25 13:54:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:47,192 INFO L225 Difference]: With dead ends: 158 [2019-11-25 13:54:47,192 INFO L226 Difference]: Without dead ends: 154 [2019-11-25 13:54:47,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-25 13:54:47,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-25 13:54:47,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-11-25 13:54:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-25 13:54:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2019-11-25 13:54:47,199 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 63 [2019-11-25 13:54:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:47,199 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2019-11-25 13:54:47,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 13:54:47,200 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2019-11-25 13:54:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-25 13:54:47,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:47,201 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:54:47,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-25 13:54:47,415 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:54:47,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:47,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1405000591, now seen corresponding path program 1 times [2019-11-25 13:54:47,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:47,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025938731] [2019-11-25 13:54:47,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-25 13:54:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:47,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-25 13:54:47,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:47,685 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:54:47,685 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:54:47,686 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:54:47,687 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:54:47,687 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:54:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:47,907 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:48,091 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:48,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025938731] [2019-11-25 13:54:48,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:48,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-25 13:54:48,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826907848] [2019-11-25 13:54:48,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-25 13:54:48,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:48,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 13:54:48,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-25 13:54:48,094 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 17 states. [2019-11-25 13:54:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:49,405 INFO L93 Difference]: Finished difference Result 164 states and 167 transitions. [2019-11-25 13:54:49,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-25 13:54:49,406 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2019-11-25 13:54:49,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:49,408 INFO L225 Difference]: With dead ends: 164 [2019-11-25 13:54:49,408 INFO L226 Difference]: Without dead ends: 164 [2019-11-25 13:54:49,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-25 13:54:49,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-25 13:54:49,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-11-25 13:54:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-25 13:54:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2019-11-25 13:54:49,420 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 74 [2019-11-25 13:54:49,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:49,422 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2019-11-25 13:54:49,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-25 13:54:49,422 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2019-11-25 13:54:49,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-25 13:54:49,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:49,427 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:54:49,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-25 13:54:49,642 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:54:49,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:49,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1405000592, now seen corresponding path program 1 times [2019-11-25 13:54:49,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:49,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903355228] [2019-11-25 13:54:49,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-25 13:54:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:50,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 13:54:50,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:50,032 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:54:50,032 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:54:50,041 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:54:50,041 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:54:50,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:54:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:50,725 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:52,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903355228] [2019-11-25 13:54:52,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:52,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-25 13:54:52,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812178882] [2019-11-25 13:54:52,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-25 13:54:52,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:52,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-25 13:54:52,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-25 13:54:52,842 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 33 states. [2019-11-25 13:54:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:56,996 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-11-25 13:54:56,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 13:54:56,997 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2019-11-25 13:54:56,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:56,998 INFO L225 Difference]: With dead ends: 150 [2019-11-25 13:54:56,998 INFO L226 Difference]: Without dead ends: 150 [2019-11-25 13:54:56,999 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-25 13:54:56,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-25 13:54:57,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-25 13:54:57,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-25 13:54:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2019-11-25 13:54:57,003 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 74 [2019-11-25 13:54:57,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:57,004 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2019-11-25 13:54:57,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-25 13:54:57,004 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2019-11-25 13:54:57,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-25 13:54:57,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:57,006 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:54:57,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-25 13:54:57,216 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:54:57,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:57,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1519816277, now seen corresponding path program 1 times [2019-11-25 13:54:57,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:57,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900680239] [2019-11-25 13:54:57,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-25 13:54:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:57,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 13:54:57,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:57,551 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:57,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:54:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:57,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [900680239] [2019-11-25 13:54:57,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:57,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 14 [2019-11-25 13:54:57,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082892460] [2019-11-25 13:54:57,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-25 13:54:57,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:57,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-25 13:54:57,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-11-25 13:54:57,790 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand 14 states. [2019-11-25 13:54:57,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:54:57,933 INFO L93 Difference]: Finished difference Result 156 states and 159 transitions. [2019-11-25 13:54:57,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-25 13:54:57,933 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2019-11-25 13:54:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:54:57,935 INFO L225 Difference]: With dead ends: 156 [2019-11-25 13:54:57,935 INFO L226 Difference]: Without dead ends: 150 [2019-11-25 13:54:57,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-11-25 13:54:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-25 13:54:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-11-25 13:54:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-11-25 13:54:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 153 transitions. [2019-11-25 13:54:57,941 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 153 transitions. Word has length 85 [2019-11-25 13:54:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:54:57,941 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 153 transitions. [2019-11-25 13:54:57,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-25 13:54:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 153 transitions. [2019-11-25 13:54:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 13:54:57,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:54:57,943 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:54:58,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-25 13:54:58,155 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:54:58,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:54:58,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2050797402, now seen corresponding path program 1 times [2019-11-25 13:54:58,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:54:58,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764364643] [2019-11-25 13:54:58,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-25 13:54:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:54:58,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-25 13:54:58,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:54:58,428 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:54:58,428 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:54:58,430 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:54:58,430 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:54:58,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:54:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:58,734 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:54:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:54:59,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764364643] [2019-11-25 13:54:59,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:54:59,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-25 13:54:59,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872736226] [2019-11-25 13:54:59,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-25 13:54:59,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:54:59,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 13:54:59,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-25 13:54:59,018 INFO L87 Difference]: Start difference. First operand 150 states and 153 transitions. Second operand 17 states. [2019-11-25 13:55:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:55:00,455 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2019-11-25 13:55:00,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 13:55:00,455 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 98 [2019-11-25 13:55:00,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:55:00,457 INFO L225 Difference]: With dead ends: 164 [2019-11-25 13:55:00,457 INFO L226 Difference]: Without dead ends: 164 [2019-11-25 13:55:00,458 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 173 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-25 13:55:00,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-25 13:55:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2019-11-25 13:55:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-25 13:55:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2019-11-25 13:55:00,465 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 98 [2019-11-25 13:55:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:55:00,466 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2019-11-25 13:55:00,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-25 13:55:00,466 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2019-11-25 13:55:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 13:55:00,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:55:00,468 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:55:00,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-25 13:55:00,683 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:55:00,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:55:00,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2050797403, now seen corresponding path program 1 times [2019-11-25 13:55:00,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:55:00,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628498401] [2019-11-25 13:55:00,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-11-25 13:55:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:55:00,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-25 13:55:00,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:55:00,991 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:55:00,991 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:55:00,998 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:00,998 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:00,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:55:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:55:01,436 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:55:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:55:03,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628498401] [2019-11-25 13:55:03,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:55:03,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-25 13:55:03,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546594040] [2019-11-25 13:55:03,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-25 13:55:03,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:55:03,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-25 13:55:03,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-25 13:55:03,239 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand 33 states. [2019-11-25 13:55:07,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:55:07,540 INFO L93 Difference]: Finished difference Result 146 states and 149 transitions. [2019-11-25 13:55:07,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-25 13:55:07,543 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 98 [2019-11-25 13:55:07,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:55:07,544 INFO L225 Difference]: With dead ends: 146 [2019-11-25 13:55:07,544 INFO L226 Difference]: Without dead ends: 146 [2019-11-25 13:55:07,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 158 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-25 13:55:07,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-25 13:55:07,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-11-25 13:55:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 13:55:07,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 149 transitions. [2019-11-25 13:55:07,549 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 149 transitions. Word has length 98 [2019-11-25 13:55:07,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:55:07,550 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 149 transitions. [2019-11-25 13:55:07,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-25 13:55:07,550 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2019-11-25 13:55:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-25 13:55:07,551 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:55:07,551 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:55:07,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-25 13:55:07,761 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:55:07,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:55:07,761 INFO L82 PathProgramCache]: Analyzing trace with hash -797927977, now seen corresponding path program 1 times [2019-11-25 13:55:07,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:55:07,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627959782] [2019-11-25 13:55:07,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-11-25 13:55:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:55:08,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 13:55:08,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:55:08,076 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:55:08,076 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:55:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:55:08,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627959782] [2019-11-25 13:55:08,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:55:08,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2019-11-25 13:55:08,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666297773] [2019-11-25 13:55:08,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-25 13:55:08,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:55:08,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-25 13:55:08,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-25 13:55:08,401 INFO L87 Difference]: Start difference. First operand 146 states and 149 transitions. Second operand 11 states. [2019-11-25 13:55:08,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:55:08,491 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2019-11-25 13:55:08,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 13:55:08,492 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-11-25 13:55:08,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:55:08,493 INFO L225 Difference]: With dead ends: 148 [2019-11-25 13:55:08,493 INFO L226 Difference]: Without dead ends: 146 [2019-11-25 13:55:08,493 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-25 13:55:08,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-25 13:55:08,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-11-25 13:55:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-25 13:55:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2019-11-25 13:55:08,498 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 96 [2019-11-25 13:55:08,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:55:08,499 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2019-11-25 13:55:08,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-25 13:55:08,499 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2019-11-25 13:55:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-25 13:55:08,500 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:55:08,500 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:55:08,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-25 13:55:08,714 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:55:08,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:55:08,714 INFO L82 PathProgramCache]: Analyzing trace with hash 693754465, now seen corresponding path program 1 times [2019-11-25 13:55:08,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:55:08,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143165888] [2019-11-25 13:55:08,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-11-25 13:55:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:55:09,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-25 13:55:09,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:55:09,092 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:55:09,092 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:55:09,094 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:09,095 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:09,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-25 13:55:09,684 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:55:09,684 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:55:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:55:09,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143165888] [2019-11-25 13:55:09,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:55:09,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 20 [2019-11-25 13:55:09,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29292925] [2019-11-25 13:55:09,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-25 13:55:09,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:55:09,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-25 13:55:09,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-25 13:55:09,987 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 21 states. [2019-11-25 13:55:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:55:11,604 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2019-11-25 13:55:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-25 13:55:11,605 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 111 [2019-11-25 13:55:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:55:11,606 INFO L225 Difference]: With dead ends: 156 [2019-11-25 13:55:11,606 INFO L226 Difference]: Without dead ends: 156 [2019-11-25 13:55:11,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 191 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-11-25 13:55:11,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-25 13:55:11,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 144. [2019-11-25 13:55:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-25 13:55:11,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2019-11-25 13:55:11,613 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 111 [2019-11-25 13:55:11,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:55:11,614 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2019-11-25 13:55:11,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-25 13:55:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2019-11-25 13:55:11,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-25 13:55:11,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:55:11,616 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:55:11,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-11-25 13:55:11,826 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:55:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:55:11,827 INFO L82 PathProgramCache]: Analyzing trace with hash 693754466, now seen corresponding path program 1 times [2019-11-25 13:55:11,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:55:11,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399260309] [2019-11-25 13:55:11,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-11-25 13:55:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:55:12,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-25 13:55:12,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:55:12,307 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:55:12,308 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:55:12,313 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:12,314 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:12,314 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-25 13:55:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:55:13,038 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:55:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:55:15,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399260309] [2019-11-25 13:55:15,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:55:15,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 20] imperfect sequences [] total 40 [2019-11-25 13:55:15,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254072939] [2019-11-25 13:55:15,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-25 13:55:15,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:55:15,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-25 13:55:15,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-11-25 13:55:15,576 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 41 states. [2019-11-25 13:55:20,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:55:20,715 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2019-11-25 13:55:20,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-25 13:55:20,716 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 111 [2019-11-25 13:55:20,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:55:20,717 INFO L225 Difference]: With dead ends: 142 [2019-11-25 13:55:20,717 INFO L226 Difference]: Without dead ends: 142 [2019-11-25 13:55:20,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 174 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-11-25 13:55:20,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-25 13:55:20,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-11-25 13:55:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-25 13:55:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 144 transitions. [2019-11-25 13:55:20,722 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 144 transitions. Word has length 111 [2019-11-25 13:55:20,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:55:20,723 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 144 transitions. [2019-11-25 13:55:20,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-25 13:55:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 144 transitions. [2019-11-25 13:55:20,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-25 13:55:20,724 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:55:20,724 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:55:20,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-11-25 13:55:20,935 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:55:20,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:55:20,935 INFO L82 PathProgramCache]: Analyzing trace with hash 256905644, now seen corresponding path program 1 times [2019-11-25 13:55:20,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:55:20,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628734294] [2019-11-25 13:55:20,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-11-25 13:55:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:55:21,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-25 13:55:21,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:55:22,135 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:55:22,136 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:55:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-25 13:55:22,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628734294] [2019-11-25 13:55:22,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-25 13:55:22,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 19] imperfect sequences [] total 39 [2019-11-25 13:55:22,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200448074] [2019-11-25 13:55:22,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-25 13:55:22,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:55:22,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-25 13:55:22,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2019-11-25 13:55:22,988 INFO L87 Difference]: Start difference. First operand 142 states and 144 transitions. Second operand 40 states. [2019-11-25 13:55:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:55:25,523 INFO L93 Difference]: Finished difference Result 141 states and 143 transitions. [2019-11-25 13:55:25,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-25 13:55:25,524 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 114 [2019-11-25 13:55:25,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:55:25,525 INFO L225 Difference]: With dead ends: 141 [2019-11-25 13:55:25,525 INFO L226 Difference]: Without dead ends: 141 [2019-11-25 13:55:25,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 182 SyntacticMatches, 7 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2019-11-25 13:55:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-25 13:55:25,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-11-25 13:55:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-25 13:55:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2019-11-25 13:55:25,531 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 114 [2019-11-25 13:55:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:55:25,532 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2019-11-25 13:55:25,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-25 13:55:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2019-11-25 13:55:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-25 13:55:25,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 13:55:25,533 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 13:55:25,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-11-25 13:55:25,738 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-25 13:55:25,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 13:55:25,739 INFO L82 PathProgramCache]: Analyzing trace with hash -155348315, now seen corresponding path program 1 times [2019-11-25 13:55:25,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-25 13:55:25,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141999581] [2019-11-25 13:55:25,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-11-25 13:55:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 13:55:26,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-25 13:55:26,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 13:55:26,325 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:55:26,326 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:55:26,334 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:26,334 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:26,335 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-25 13:55:26,405 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:26,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 54 [2019-11-25 13:55:26,406 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:55:26,457 INFO L588 ElimStorePlain]: treesize reduction 29, result has 46.3 percent of original size [2019-11-25 13:55:26,458 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:26,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-25 13:55:38,956 WARN L192 SmtUtils]: Spent 12.43 s on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-11-25 13:55:38,957 INFO L343 Elim1Store]: treesize reduction 32, result has 66.0 percent of original size [2019-11-25 13:55:38,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 81 [2019-11-25 13:55:38,958 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:55:39,013 INFO L588 ElimStorePlain]: treesize reduction 50, result has 41.9 percent of original size [2019-11-25 13:55:39,013 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:39,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-25 13:55:39,149 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-25 13:55:39,149 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:55:39,150 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 13:55:39,190 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:39,190 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:39,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-25 13:55:40,077 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:55:40,078 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-25 13:55:40,497 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-25 13:55:41,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:42,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:44,702 WARN L192 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-25 13:55:44,796 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 13:55:44,797 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:55:44,941 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-25 13:55:44,942 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-25 13:55:44,943 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:55:44,950 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-25 13:55:44,951 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:55:44,951 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:55:44,951 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:44,952 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:44,952 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 13:55:44,952 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:55:44,952 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-25 13:55:46,679 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-25 13:55:46,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-25 13:55:47,135 WARN L192 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-25 13:55:47,136 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-25 13:55:47,137 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:55:47,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,402 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-25 13:55:47,403 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-25 13:55:47,403 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:55:47,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-25 13:55:47,413 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-25 13:55:47,607 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 43 [2019-11-25 13:55:47,608 INFO L588 ElimStorePlain]: treesize reduction 247, result has 28.4 percent of original size [2019-11-25 13:55:47,609 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:47,646 INFO L588 ElimStorePlain]: treesize reduction 69, result has 32.4 percent of original size [2019-11-25 13:55:47,647 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-25 13:55:47,647 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:33 [2019-11-25 13:55:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 13:55:49,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141999581] [2019-11-25 13:55:49,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 13:55:49,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2019-11-25 13:55:49,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36422775] [2019-11-25 13:55:49,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-25 13:55:49,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-25 13:55:49,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-25 13:55:49,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2019-11-25 13:55:49,185 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand 55 states. [2019-11-25 13:55:57,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 13:55:57,826 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-25 13:55:57,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-25 13:55:57,827 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 117 [2019-11-25 13:55:57,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 13:55:57,828 INFO L225 Difference]: With dead ends: 60 [2019-11-25 13:55:57,828 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 13:55:57,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2019-11-25 13:55:57,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 13:55:57,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 13:55:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 13:55:57,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 13:55:57,831 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 117 [2019-11-25 13:55:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 13:55:57,831 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 13:55:57,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-25 13:55:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 13:55:57,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 13:55:58,032 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-11-25 13:55:58,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 01:55:58 BoogieIcfgContainer [2019-11-25 13:55:58,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 13:55:58,041 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 13:55:58,041 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 13:55:58,041 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 13:55:58,042 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 01:54:22" (3/4) ... [2019-11-25 13:55:58,046 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 13:55:58,055 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-25 13:55:58,055 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-25 13:55:58,055 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-25 13:55:58,055 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-25 13:55:58,055 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-25 13:55:58,055 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-25 13:55:58,055 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-25 13:55:58,056 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-25 13:55:58,056 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-25 13:55:58,056 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-25 13:55:58,056 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-25 13:55:58,056 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-25 13:55:58,056 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-25 13:55:58,056 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-25 13:55:58,056 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-25 13:55:58,056 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-25 13:55:58,056 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-25 13:55:58,056 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-25 13:55:58,056 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-25 13:55:58,057 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-25 13:55:58,057 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-25 13:55:58,057 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-25 13:55:58,057 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f_22_get [2019-11-25 13:55:58,057 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-25 13:55:58,057 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-25 13:55:58,057 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-25 13:55:58,057 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-25 13:55:58,057 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-25 13:55:58,057 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-25 13:55:58,057 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-25 13:55:58,058 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-25 13:55:58,058 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-25 13:55:58,058 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-25 13:55:58,058 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-25 13:55:58,058 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-25 13:55:58,058 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-25 13:55:58,058 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-25 13:55:58,058 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-25 13:55:58,058 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-25 13:55:58,058 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-25 13:55:58,058 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-25 13:55:58,058 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-25 13:55:58,059 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f_22_put [2019-11-25 13:55:58,059 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-25 13:55:58,059 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-25 13:55:58,059 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-25 13:55:58,059 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-25 13:55:58,059 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-25 13:55:58,067 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 58 nodes and edges [2019-11-25 13:55:58,068 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-25 13:55:58,069 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 13:55:58,069 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 13:55:58,069 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-25 13:55:58,129 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-25 13:55:58,130 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 13:55:58,131 INFO L168 Benchmark]: Toolchain (without parser) took 98080.07 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 542.6 MB). Free memory was 945.6 MB in the beginning and 817.7 MB in the end (delta: 127.9 MB). Peak memory consumption was 670.5 MB. Max. memory is 11.5 GB. [2019-11-25 13:55:58,131 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 976.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:55:58,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 916.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -136.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-25 13:55:58,132 INFO L168 Benchmark]: Boogie Preprocessor took 109.27 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:55:58,133 INFO L168 Benchmark]: RCFGBuilder took 1699.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.7 MB in the end (delta: 113.7 MB). Peak memory consumption was 113.7 MB. Max. memory is 11.5 GB. [2019-11-25 13:55:58,133 INFO L168 Benchmark]: TraceAbstraction took 95258.62 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 413.7 MB). Free memory was 968.7 MB in the beginning and 817.7 MB in the end (delta: 150.9 MB). Peak memory consumption was 564.6 MB. Max. memory is 11.5 GB. [2019-11-25 13:55:58,133 INFO L168 Benchmark]: Witness Printer took 89.04 ms. Allocated memory is still 1.6 GB. Free memory is still 817.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 13:55:58,135 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 976.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 916.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -136.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.27 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 1699.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.7 MB in the end (delta: 113.7 MB). Peak memory consumption was 113.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 95258.62 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 413.7 MB). Free memory was 968.7 MB in the beginning and 817.7 MB in the end (delta: 150.9 MB). Peak memory consumption was 564.6 MB. Max. memory is 11.5 GB. * Witness Printer took 89.04 ms. Allocated memory is still 1.6 GB. Free memory is still 817.7 MB. There was no memory consumed. 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: 770]: 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 49 procedures, 341 locations, 71 error locations. Result: SAFE, OverallTime: 95.1s, OverallIterations: 27, TraceHistogramMax: 16, AutomataDifference: 40.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3350 SDtfs, 1546 SDslu, 28036 SDs, 0 SdLazy, 15114 SolverSat, 429 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 32.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3323 GetRequests, 2739 SyntacticMatches, 67 SemanticMatches, 517 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2731 ImplicationChecksByTransitivity, 25.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred 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.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 97 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 42.4s InterpolantComputationTime, 1631 NumberOfCodeBlocks, 1595 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3208 ConstructedInterpolants, 503 QuantifiedInterpolants, 1103791 SizeOfPredicates, 171 NumberOfNonLiveVariables, 6904 ConjunctsInSsa, 468 ConjunctsInUnsatCore, 54 InterpolantComputations, 46 PerfectInterpolantSequences, 3788/4318 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...