./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5758efa3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.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 e977fbeb632c2e5a16902a6c2250cf608217c650 ............................................................................................................................ 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_3-2.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 e977fbeb632c2e5a16902a6c2250cf608217c650 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-5758efa [2019-11-26 21:23:14,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 21:23:14,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 21:23:14,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 21:23:14,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 21:23:14,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 21:23:14,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 21:23:14,156 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 21:23:14,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 21:23:14,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 21:23:14,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 21:23:14,162 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 21:23:14,162 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 21:23:14,163 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 21:23:14,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 21:23:14,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 21:23:14,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 21:23:14,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 21:23:14,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 21:23:14,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 21:23:14,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 21:23:14,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 21:23:14,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 21:23:14,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 21:23:14,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 21:23:14,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 21:23:14,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 21:23:14,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 21:23:14,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 21:23:14,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 21:23:14,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 21:23:14,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 21:23:14,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 21:23:14,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 21:23:14,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 21:23:14,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 21:23:14,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 21:23:14,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 21:23:14,191 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 21:23:14,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 21:23:14,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 21:23:14,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-26 21:23:14,221 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 21:23:14,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 21:23:14,223 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 21:23:14,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 21:23:14,224 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 21:23:14,224 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 21:23:14,224 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 21:23:14,225 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 21:23:14,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 21:23:14,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 21:23:14,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 21:23:14,227 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 21:23:14,227 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 21:23:14,227 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 21:23:14,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 21:23:14,228 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 21:23:14,228 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 21:23:14,228 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 21:23:14,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 21:23:14,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 21:23:14,230 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 21:23:14,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 21:23:14,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 21:23:14,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 21:23:14,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 21:23:14,231 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-26 21:23:14,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 21:23:14,231 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 -> e977fbeb632c2e5a16902a6c2250cf608217c650 [2019-11-26 21:23:14,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 21:23:14,564 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 21:23:14,569 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 21:23:14,571 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 21:23:14,571 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 21:23:14,572 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-26 21:23:14,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41eb44a02/61fb93dad1ce41a6b444482aafc9cee9/FLAGb42d464d6 [2019-11-26 21:23:15,158 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 21:23:15,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-26 21:23:15,187 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41eb44a02/61fb93dad1ce41a6b444482aafc9cee9/FLAGb42d464d6 [2019-11-26 21:23:15,468 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41eb44a02/61fb93dad1ce41a6b444482aafc9cee9 [2019-11-26 21:23:15,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 21:23:15,473 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 21:23:15,474 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 21:23:15,474 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 21:23:15,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 21:23:15,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:23:15" (1/1) ... [2019-11-26 21:23:15,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@319094c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:15, skipping insertion in model container [2019-11-26 21:23:15,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:23:15" (1/1) ... [2019-11-26 21:23:15,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 21:23:15,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:23:16,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:23:16,104 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-11-26 21:23:16,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4410c736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:16, skipping insertion in model container [2019-11-26 21:23:16,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 21:23:16,106 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-26 21:23:16,110 INFO L168 Benchmark]: Toolchain (without parser) took 635.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-26 21:23:16,111 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:23:16,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-26 21:23:16,117 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.25 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 631.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -158.4 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-5758efa [2019-11-26 21:23:17,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 21:23:17,900 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 21:23:17,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 21:23:17,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 21:23:17,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 21:23:17,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 21:23:17,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 21:23:17,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 21:23:17,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 21:23:17,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 21:23:17,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 21:23:17,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 21:23:17,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 21:23:17,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 21:23:17,947 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 21:23:17,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 21:23:17,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 21:23:17,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 21:23:17,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 21:23:17,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 21:23:17,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 21:23:17,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 21:23:17,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 21:23:17,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 21:23:17,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 21:23:17,961 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 21:23:17,962 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 21:23:17,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 21:23:17,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 21:23:17,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 21:23:17,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 21:23:17,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 21:23:17,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 21:23:17,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 21:23:17,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 21:23:17,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 21:23:17,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 21:23:17,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 21:23:17,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 21:23:17,973 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 21:23:17,974 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-26 21:23:17,989 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 21:23:17,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 21:23:17,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-26 21:23:17,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-26 21:23:17,992 INFO L138 SettingsManager]: * Use SBE=true [2019-11-26 21:23:17,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 21:23:17,993 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 21:23:17,993 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-26 21:23:17,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 21:23:17,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 21:23:17,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 21:23:17,994 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-26 21:23:17,995 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-26 21:23:17,995 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-26 21:23:17,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 21:23:17,995 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 21:23:17,996 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 21:23:17,996 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 21:23:17,996 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 21:23:17,997 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 21:23:17,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 21:23:17,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 21:23:17,998 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 21:23:17,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 21:23:17,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 21:23:17,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 21:23:17,999 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 21:23:17,999 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-26 21:23:17,999 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 21:23:18,000 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 21:23:18,000 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 -> e977fbeb632c2e5a16902a6c2250cf608217c650 [2019-11-26 21:23:18,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 21:23:18,318 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 21:23:18,321 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 21:23:18,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 21:23:18,324 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 21:23:18,325 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-26 21:23:18,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2478d63ab/0ce08f8adf73444ebb33c6978307b837/FLAG4d85da23f [2019-11-26 21:23:18,943 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 21:23:18,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-26 21:23:18,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2478d63ab/0ce08f8adf73444ebb33c6978307b837/FLAG4d85da23f [2019-11-26 21:23:19,192 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2478d63ab/0ce08f8adf73444ebb33c6978307b837 [2019-11-26 21:23:19,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 21:23:19,199 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-26 21:23:19,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 21:23:19,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 21:23:19,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 21:23:19,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:23:19" (1/1) ... [2019-11-26 21:23:19,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39472393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:19, skipping insertion in model container [2019-11-26 21:23:19,210 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 09:23:19" (1/1) ... [2019-11-26 21:23:19,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 21:23:19,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:23:19,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:23:19,844 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-26 21:23:19,859 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-26 21:23:19,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:23:19,917 INFO L203 MainTranslator]: Completed pre-run [2019-11-26 21:23:20,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 21:23:20,125 INFO L208 MainTranslator]: Completed translation [2019-11-26 21:23:20,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:20 WrapperNode [2019-11-26 21:23:20,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 21:23:20,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 21:23:20,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 21:23:20,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 21:23:20,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:20" (1/1) ... [2019-11-26 21:23:20,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:20" (1/1) ... [2019-11-26 21:23:20,173 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:20" (1/1) ... [2019-11-26 21:23:20,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:20" (1/1) ... [2019-11-26 21:23:20,206 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:20" (1/1) ... [2019-11-26 21:23:20,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:20" (1/1) ... [2019-11-26 21:23:20,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:20" (1/1) ... [2019-11-26 21:23:20,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 21:23:20,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 21:23:20,232 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 21:23:20,232 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 21:23:20,233 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23: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-26 21:23:20,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-26 21:23:20,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 21:23:20,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-26 21:23:20,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 21:23:20,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-26 21:23:20,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-26 21:23:20,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-26 21:23:20,297 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-26 21:23:20,298 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-26 21:23:20,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-26 21:23:20,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-26 21:23:20,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-26 21:23:20,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-26 21:23:20,299 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-26 21:23:20,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-26 21:23:20,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-26 21:23:20,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-26 21:23:20,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-26 21:23:20,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-26 21:23:20,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-26 21:23:20,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-26 21:23:20,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-26 21:23:20,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-26 21:23:20,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-26 21:23:20,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-26 21:23:20,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-26 21:23:20,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-26 21:23:20,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-26 21:23:20,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-26 21:23:20,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-26 21:23:20,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-26 21:23:20,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-26 21:23:20,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-26 21:23:20,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-26 21:23:20,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-26 21:23:20,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-26 21:23:20,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-26 21:23:20,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-26 21:23:20,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-26 21:23:20,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-26 21:23:20,306 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-26 21:23:20,306 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-26 21:23:20,306 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-26 21:23:20,307 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-26 21:23:20,307 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-26 21:23:20,307 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-26 21:23:20,307 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-26 21:23:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-26 21:23:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-26 21:23:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-26 21:23:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-26 21:23:20,308 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-26 21:23:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-26 21:23:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-26 21:23:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-26 21:23:20,309 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-26 21:23:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-26 21:23:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-26 21:23:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-26 21:23:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-26 21:23:20,310 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-26 21:23:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-26 21:23:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-26 21:23:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-26 21:23:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-26 21:23:20,311 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-26 21:23:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-26 21:23:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-26 21:23:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-26 21:23:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-26 21:23:20,312 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-26 21:23:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-26 21:23:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-26 21:23:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-26 21:23:20,313 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-26 21:23:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-26 21:23:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-26 21:23:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-26 21:23:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-26 21:23:20,314 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-26 21:23:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-26 21:23:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-26 21:23:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-26 21:23:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-26 21:23:20,315 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-26 21:23:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-26 21:23:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-26 21:23:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-26 21:23:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-26 21:23:20,316 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-26 21:23:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-26 21:23:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-26 21:23:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-26 21:23:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-26 21:23:20,317 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-26 21:23:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-26 21:23:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-26 21:23:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-26 21:23:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-26 21:23:20,318 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-26 21:23:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-26 21:23:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-26 21:23:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-26 21:23:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-26 21:23:20,319 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-26 21:23:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-26 21:23:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-26 21:23:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-26 21:23:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-26 21:23:20,320 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-26 21:23:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-26 21:23:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-26 21:23:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-26 21:23:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-26 21:23:20,321 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-26 21:23:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-26 21:23:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-26 21:23:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-26 21:23:20,322 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-26 21:23:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-26 21:23:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-26 21:23:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-26 21:23:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-26 21:23:20,323 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-26 21:23:20,324 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-26 21:23:20,324 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-26 21:23:20,324 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-26 21:23:20,324 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-26 21:23:20,324 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-26 21:23:20,325 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-26 21:23:20,325 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-26 21:23:20,325 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-26 21:23:20,325 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-26 21:23:20,325 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-26 21:23:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-26 21:23:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-26 21:23:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-26 21:23:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-26 21:23:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-26 21:23:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-26 21:23:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-26 21:23:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-26 21:23:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-26 21:23:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-26 21:23:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-26 21:23:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-26 21:23:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-26 21:23:20,328 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-26 21:23:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-26 21:23:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-26 21:23:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-26 21:23:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-26 21:23:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-26 21:23:20,329 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-26 21:23:20,330 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-26 21:23:20,330 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-26 21:23:20,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-26 21:23:20,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-26 21:23:20,330 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-26 21:23:20,331 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-26 21:23:20,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-26 21:23:20,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 21:23:20,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-26 21:23:20,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-26 21:23:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-26 21:23:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 21:23:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-26 21:23:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-26 21:23:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-26 21:23:20,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 21:23:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-26 21:23:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-26 21:23:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-26 21:23:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-26 21:23:20,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-26 21:23:20,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-26 21:23:20,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 21:23:20,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-26 21:23:20,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-26 21:23:20,334 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-26 21:23:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-26 21:23:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-26 21:23:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 21:23:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-26 21:23:20,335 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-26 21:23:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-26 21:23:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-26 21:23:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-26 21:23:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-26 21:23:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-26 21:23:20,336 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-26 21:23:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-26 21:23:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-26 21:23:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-26 21:23:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-26 21:23:20,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-26 21:23:20,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-26 21:23:20,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-26 21:23:20,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-26 21:23:20,338 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-26 21:23:20,338 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-26 21:23:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-26 21:23:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-26 21:23:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-26 21:23:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 21:23:20,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 21:23:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 21:23:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 21:23:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-26 21:23:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-26 21:23:20,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-26 21:23:20,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-26 21:23:20,977 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 21:23:21,454 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 21:23:21,756 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 21:23:21,757 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-26 21:23:21,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:23:21 BoogieIcfgContainer [2019-11-26 21:23:21,758 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 21:23:21,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 21:23:21,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 21:23:21,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 21:23:21,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 09:23:19" (1/3) ... [2019-11-26 21:23:21,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee372a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:23:21, skipping insertion in model container [2019-11-26 21:23:21,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 09:23:20" (2/3) ... [2019-11-26 21:23:21,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee372a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 09:23:21, skipping insertion in model container [2019-11-26 21:23:21,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:23:21" (3/3) ... [2019-11-26 21:23:21,768 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-2.i [2019-11-26 21:23:21,778 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 21:23:21,787 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-26 21:23:21,800 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-26 21:23:21,822 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 21:23:21,823 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-26 21:23:21,823 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 21:23:21,823 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 21:23:21,823 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 21:23:21,823 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 21:23:21,824 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 21:23:21,824 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 21:23:21,844 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-26 21:23:21,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 21:23:21,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:21,856 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:21,857 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:21,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:21,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1484999723, now seen corresponding path program 1 times [2019-11-26 21:23:21,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:21,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [93975909] [2019-11-26 21:23:21,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:22,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 21:23:22,077 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:22,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:23:22,149 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:22,160 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:22,160 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:22,161 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:23:22,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:22,193 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:22,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [93975909] [2019-11-26 21:23:22,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:22,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 21:23:22,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649939721] [2019-11-26 21:23:22,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:23:22,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:22,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:23:22,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:23:22,293 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2019-11-26 21:23:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:22,581 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-11-26 21:23:22,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:23:22,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-26 21:23:22,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:22,597 INFO L225 Difference]: With dead ends: 133 [2019-11-26 21:23:22,597 INFO L226 Difference]: Without dead ends: 130 [2019-11-26 21:23:22,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:23:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-26 21:23:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2019-11-26 21:23:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-26 21:23:22,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2019-11-26 21:23:22,652 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 17 [2019-11-26 21:23:22,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:22,652 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2019-11-26 21:23:22,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:23:22,653 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2019-11-26 21:23:22,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 21:23:22,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:22,654 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:22,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-26 21:23:22,865 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:22,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:22,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1484999724, now seen corresponding path program 1 times [2019-11-26 21:23:22,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:22,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160729925] [2019-11-26 21:23:22,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:23,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:23,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 21:23:23,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:23,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:23:23,049 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:23,058 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:23,059 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:23,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:23:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:23,112 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:23,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:23,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160729925] [2019-11-26 21:23:23,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:23,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-26 21:23:23,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800893298] [2019-11-26 21:23:23,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 21:23:23,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:23,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 21:23:23,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-26 21:23:23,471 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 10 states. [2019-11-26 21:23:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:24,117 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2019-11-26 21:23:24,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 21:23:24,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-26 21:23:24,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:24,121 INFO L225 Difference]: With dead ends: 129 [2019-11-26 21:23:24,121 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 21:23:24,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:23:24,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 21:23:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2019-11-26 21:23:24,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-26 21:23:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-11-26 21:23:24,164 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 17 [2019-11-26 21:23:24,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:24,164 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-11-26 21:23:24,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 21:23:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-11-26 21:23:24,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 21:23:24,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:24,165 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:24,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-26 21:23:24,377 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:24,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:24,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1513628874, now seen corresponding path program 1 times [2019-11-26 21:23:24,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:24,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819920107] [2019-11-26 21:23:24,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:24,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:24,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 21:23:24,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:24,537 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:24,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819920107] [2019-11-26 21:23:24,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:24,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-26 21:23:24,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489010190] [2019-11-26 21:23:24,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:23:24,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:24,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:23:24,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:23:24,585 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 5 states. [2019-11-26 21:23:24,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:24,624 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2019-11-26 21:23:24,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:23:24,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-26 21:23:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:24,629 INFO L225 Difference]: With dead ends: 123 [2019-11-26 21:23:24,629 INFO L226 Difference]: Without dead ends: 123 [2019-11-26 21:23:24,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:23:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-26 21:23:24,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-11-26 21:23:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-26 21:23:24,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2019-11-26 21:23:24,654 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 17 [2019-11-26 21:23:24,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:24,655 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2019-11-26 21:23:24,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:23:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2019-11-26 21:23:24,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-26 21:23:24,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:24,659 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-26 21:23:24,859 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-26 21:23:24,860 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:24,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:24,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1578542280, now seen corresponding path program 1 times [2019-11-26 21:23:24,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:24,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [477323918] [2019-11-26 21:23:24,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:25,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 21:23:25,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:25,041 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:25,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:25,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [477323918] [2019-11-26 21:23:25,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:25,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-26 21:23:25,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146651318] [2019-11-26 21:23:25,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 21:23:25,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:25,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 21:23:25,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 21:23:25,128 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 5 states. [2019-11-26 21:23:25,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:25,161 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2019-11-26 21:23:25,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 21:23:25,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-26 21:23:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:25,165 INFO L225 Difference]: With dead ends: 123 [2019-11-26 21:23:25,167 INFO L226 Difference]: Without dead ends: 123 [2019-11-26 21:23:25,167 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-26 21:23:25,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-26 21:23:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-11-26 21:23:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-26 21:23:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-11-26 21:23:25,189 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 29 [2019-11-26 21:23:25,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:25,190 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-11-26 21:23:25,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 21:23:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2019-11-26 21:23:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-26 21:23:25,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:25,191 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-26 21:23:25,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-26 21:23:25,412 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:25,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:25,412 INFO L82 PathProgramCache]: Analyzing trace with hash 581469927, now seen corresponding path program 1 times [2019-11-26 21:23:25,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:25,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57218289] [2019-11-26 21:23:25,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:25,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 21:23:25,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:25,622 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:25,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57218289] [2019-11-26 21:23:25,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:25,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-26 21:23:25,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629754244] [2019-11-26 21:23:25,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-26 21:23:25,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:25,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-26 21:23:25,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:23:25,668 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 7 states. [2019-11-26 21:23:25,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:25,740 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2019-11-26 21:23:25,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 21:23:25,741 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-11-26 21:23:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:25,743 INFO L225 Difference]: With dead ends: 134 [2019-11-26 21:23:25,743 INFO L226 Difference]: Without dead ends: 134 [2019-11-26 21:23:25,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 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-26 21:23:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-26 21:23:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2019-11-26 21:23:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-26 21:23:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2019-11-26 21:23:25,754 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 29 [2019-11-26 21:23:25,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:25,754 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2019-11-26 21:23:25,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-26 21:23:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2019-11-26 21:23:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 21:23:25,756 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:25,756 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:25,967 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-26 21:23:25,968 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1899216601, now seen corresponding path program 1 times [2019-11-26 21:23:25,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:25,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537436570] [2019-11-26 21:23:25,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:26,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 21:23:26,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:26,119 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:26,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537436570] [2019-11-26 21:23:26,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:26,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-26 21:23:26,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073440187] [2019-11-26 21:23:26,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 21:23:26,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:26,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 21:23:26,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 21:23:26,169 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 6 states. [2019-11-26 21:23:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:26,211 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2019-11-26 21:23:26,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 21:23:26,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-26 21:23:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:26,214 INFO L225 Difference]: With dead ends: 136 [2019-11-26 21:23:26,214 INFO L226 Difference]: Without dead ends: 132 [2019-11-26 21:23:26,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-26 21:23:26,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-26 21:23:26,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-11-26 21:23:26,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-26 21:23:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2019-11-26 21:23:26,223 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 32 [2019-11-26 21:23:26,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:26,224 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2019-11-26 21:23:26,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 21:23:26,224 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2019-11-26 21:23:26,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-26 21:23:26,225 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:26,226 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:26,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-26 21:23:26,447 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:26,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:26,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2034413241, now seen corresponding path program 1 times [2019-11-26 21:23:26,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:26,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792064092] [2019-11-26 21:23:26,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:26,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 21:23:26,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:26,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:26,629 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:26,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792064092] [2019-11-26 21:23:26,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:23:26,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-26 21:23:26,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541474774] [2019-11-26 21:23:26,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 21:23:26,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:26,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 21:23:26,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-26 21:23:26,746 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 10 states. [2019-11-26 21:23:27,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:27,006 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-11-26 21:23:27,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 21:23:27,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-26 21:23:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:27,012 INFO L225 Difference]: With dead ends: 140 [2019-11-26 21:23:27,012 INFO L226 Difference]: Without dead ends: 136 [2019-11-26 21:23:27,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-26 21:23:27,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-26 21:23:27,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-11-26 21:23:27,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-26 21:23:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2019-11-26 21:23:27,021 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 34 [2019-11-26 21:23:27,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:27,021 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2019-11-26 21:23:27,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 21:23:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2019-11-26 21:23:27,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 21:23:27,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:27,023 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:27,234 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-26 21:23:27,235 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:27,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:27,235 INFO L82 PathProgramCache]: Analyzing trace with hash 76391075, now seen corresponding path program 1 times [2019-11-26 21:23:27,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:27,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006648353] [2019-11-26 21:23:27,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:27,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 21:23:27,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:27,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 21:23:27,418 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:27,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-26 21:23:27,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006648353] [2019-11-26 21:23:27,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:27,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 21:23:27,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266822006] [2019-11-26 21:23:27,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 21:23:27,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:27,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 21:23:27,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 21:23:27,598 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 3 states. [2019-11-26 21:23:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:27,785 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2019-11-26 21:23:27,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 21:23:27,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-26 21:23:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:27,787 INFO L225 Difference]: With dead ends: 147 [2019-11-26 21:23:27,787 INFO L226 Difference]: Without dead ends: 131 [2019-11-26 21:23:27,788 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 21:23:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-26 21:23:27,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2019-11-26 21:23:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-26 21:23:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2019-11-26 21:23:27,795 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 32 [2019-11-26 21:23:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:27,795 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2019-11-26 21:23:27,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 21:23:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2019-11-26 21:23:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 21:23:27,797 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:27,797 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:28,011 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-26 21:23:28,011 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:28,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:28,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1051272825, now seen corresponding path program 2 times [2019-11-26 21:23:28,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:28,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1984663737] [2019-11-26 21:23:28,012 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:28,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-26 21:23:28,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:23:28,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 21:23:28,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:28,169 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:23:28,169 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:28,171 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:28,172 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:28,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:23:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-26 21:23:28,315 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-26 21:23:28,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1984663737] [2019-11-26 21:23:28,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:28,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-26 21:23:28,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608594317] [2019-11-26 21:23:28,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 21:23:28,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:28,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 21:23:28,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:23:28,392 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 12 states. [2019-11-26 21:23:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:29,336 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2019-11-26 21:23:29,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 21:23:29,337 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-26 21:23:29,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:29,339 INFO L225 Difference]: With dead ends: 146 [2019-11-26 21:23:29,339 INFO L226 Difference]: Without dead ends: 146 [2019-11-26 21:23:29,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-26 21:23:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-26 21:23:29,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2019-11-26 21:23:29,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-26 21:23:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2019-11-26 21:23:29,346 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 38 [2019-11-26 21:23:29,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:29,347 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2019-11-26 21:23:29,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 21:23:29,347 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2019-11-26 21:23:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-26 21:23:29,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:29,349 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:29,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-26 21:23:29,558 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:29,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:29,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1051272824, now seen corresponding path program 1 times [2019-11-26 21:23:29,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:29,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131514112] [2019-11-26 21:23:29,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:29,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 21:23:29,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:29,801 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:30,175 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:30,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131514112] [2019-11-26 21:23:30,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:23:30,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-26 21:23:30,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378077705] [2019-11-26 21:23:30,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-26 21:23:30,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:30,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-26 21:23:30,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-26 21:23:30,177 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 18 states. [2019-11-26 21:23:31,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:31,116 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2019-11-26 21:23:31,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 21:23:31,117 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-26 21:23:31,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:31,118 INFO L225 Difference]: With dead ends: 134 [2019-11-26 21:23:31,118 INFO L226 Difference]: Without dead ends: 130 [2019-11-26 21:23:31,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-26 21:23:31,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-26 21:23:31,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-26 21:23:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-26 21:23:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2019-11-26 21:23:31,125 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 38 [2019-11-26 21:23:31,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:31,126 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2019-11-26 21:23:31,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-26 21:23:31,126 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2019-11-26 21:23:31,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-26 21:23:31,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:31,127 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:31,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-26 21:23:31,333 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:31,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:31,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2061530616, now seen corresponding path program 2 times [2019-11-26 21:23:31,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:31,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836817900] [2019-11-26 21:23:31,335 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:31,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-26 21:23:31,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:23:31,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 21:23:31,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:31,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:23:31,485 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:31,491 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:31,491 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:31,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:23:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-26 21:23:31,726 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-26 21:23:32,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836817900] [2019-11-26 21:23:32,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:32,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-26 21:23:32,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938125628] [2019-11-26 21:23:32,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 21:23:32,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:32,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 21:23:32,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-26 21:23:32,585 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 23 states. [2019-11-26 21:23:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:35,008 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-11-26 21:23:35,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 21:23:35,009 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-26 21:23:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:35,010 INFO L225 Difference]: With dead ends: 129 [2019-11-26 21:23:35,010 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 21:23:35,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-26 21:23:35,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 21:23:35,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-11-26 21:23:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-26 21:23:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2019-11-26 21:23:35,021 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 46 [2019-11-26 21:23:35,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:35,021 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2019-11-26 21:23:35,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 21:23:35,022 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2019-11-26 21:23:35,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 21:23:35,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:35,026 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:35,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-26 21:23:35,233 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:35,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:35,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731192, now seen corresponding path program 1 times [2019-11-26 21:23:35,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:35,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [857782242] [2019-11-26 21:23:35,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:35,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-26 21:23:35,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:35,662 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:35,663 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:35,806 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-26 21:23:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:23:36,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [857782242] [2019-11-26 21:23:36,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:23:36,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-26 21:23:36,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822489405] [2019-11-26 21:23:36,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-26 21:23:36,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:36,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-26 21:23:36,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-26 21:23:36,593 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 34 states. [2019-11-26 21:23:37,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:37,356 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2019-11-26 21:23:37,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-26 21:23:37,357 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-26 21:23:37,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:37,360 INFO L225 Difference]: With dead ends: 135 [2019-11-26 21:23:37,360 INFO L226 Difference]: Without dead ends: 131 [2019-11-26 21:23:37,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-11-26 21:23:37,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-26 21:23:37,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-26 21:23:37,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-26 21:23:37,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2019-11-26 21:23:37,367 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 51 [2019-11-26 21:23:37,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:37,367 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2019-11-26 21:23:37,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-26 21:23:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2019-11-26 21:23:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 21:23:37,369 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:37,370 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:37,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-26 21:23:37,582 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:37,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:37,582 INFO L82 PathProgramCache]: Analyzing trace with hash -346949160, now seen corresponding path program 2 times [2019-11-26 21:23:37,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:37,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344711332] [2019-11-26 21:23:37,584 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:37,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-26 21:23:37,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 21:23:37,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 21:23:37,734 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:37,740 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:23:37,740 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:37,744 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:37,744 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:37,744 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:23:37,901 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:37,902 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:37,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344711332] [2019-11-26 21:23:37,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:37,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-26 21:23:37,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112943938] [2019-11-26 21:23:37,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 21:23:37,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:37,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 21:23:37,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 21:23:37,971 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand 12 states. [2019-11-26 21:23:38,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:38,809 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2019-11-26 21:23:38,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 21:23:38,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-26 21:23:38,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:38,811 INFO L225 Difference]: With dead ends: 153 [2019-11-26 21:23:38,811 INFO L226 Difference]: Without dead ends: 153 [2019-11-26 21:23:38,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-26 21:23:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-26 21:23:38,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 129. [2019-11-26 21:23:38,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-26 21:23:38,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2019-11-26 21:23:38,820 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 53 [2019-11-26 21:23:38,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:38,821 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2019-11-26 21:23:38,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 21:23:38,821 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2019-11-26 21:23:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 21:23:38,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:38,822 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:39,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-26 21:23:39,034 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:39,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:39,035 INFO L82 PathProgramCache]: Analyzing trace with hash -346949159, now seen corresponding path program 1 times [2019-11-26 21:23:39,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:39,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881469478] [2019-11-26 21:23:39,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:39,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 21:23:39,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:39,239 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:23:39,239 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:39,244 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:39,245 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:39,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:23:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:39,568 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:40,364 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:40,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881469478] [2019-11-26 21:23:40,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:40,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-26 21:23:40,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699043821] [2019-11-26 21:23:40,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 21:23:40,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:40,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 21:23:40,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-26 21:23:40,366 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 23 states. [2019-11-26 21:23:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:42,421 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2019-11-26 21:23:42,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-26 21:23:42,422 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-26 21:23:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:42,423 INFO L225 Difference]: With dead ends: 127 [2019-11-26 21:23:42,423 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 21:23:42,424 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-26 21:23:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 21:23:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-26 21:23:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-26 21:23:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2019-11-26 21:23:42,429 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 53 [2019-11-26 21:23:42,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:42,430 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2019-11-26 21:23:42,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 21:23:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2019-11-26 21:23:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-26 21:23:42,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:42,431 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-26 21:23:42,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-26 21:23:42,642 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:42,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:42,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1487182461, now seen corresponding path program 1 times [2019-11-26 21:23:42,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:42,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293848633] [2019-11-26 21:23:42,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 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:42,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-26 21:23:42,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:42,858 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:43,001 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:43,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293848633] [2019-11-26 21:23:43,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:43,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-26 21:23:43,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907558385] [2019-11-26 21:23:43,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 21:23:43,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:43,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 21:23:43,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-26 21:23:43,003 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 8 states. [2019-11-26 21:23:43,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:43,054 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2019-11-26 21:23:43,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 21:23:43,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-26 21:23:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:43,056 INFO L225 Difference]: With dead ends: 129 [2019-11-26 21:23:43,056 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 21:23:43,057 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-26 21:23:43,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 21:23:43,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-26 21:23:43,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-26 21:23:43,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2019-11-26 21:23:43,062 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 58 [2019-11-26 21:23:43,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:43,062 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2019-11-26 21:23:43,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 21:23:43,062 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2019-11-26 21:23:43,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-26 21:23:43,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:43,064 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-26 21:23:43,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-26 21:23:43,268 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:43,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:43,269 INFO L82 PathProgramCache]: Analyzing trace with hash -537222574, now seen corresponding path program 1 times [2019-11-26 21:23:43,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:43,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [122891450] [2019-11-26 21:23:43,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:43,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 21:23:43,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:43,517 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:43,518 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:43,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:23:43,742 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:43,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [122891450] [2019-11-26 21:23:43,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:43,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-26 21:23:43,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840248639] [2019-11-26 21:23:43,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 21:23:43,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:43,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 21:23:43,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:23:43,745 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 11 states. [2019-11-26 21:23:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:43,845 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-11-26 21:23:43,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 21:23:43,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-11-26 21:23:43,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:43,846 INFO L225 Difference]: With dead ends: 131 [2019-11-26 21:23:43,846 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 21:23:43,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-26 21:23:43,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 21:23:43,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-26 21:23:43,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-26 21:23:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-11-26 21:23:43,852 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 63 [2019-11-26 21:23:43,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:43,852 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-11-26 21:23:43,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 21:23:43,852 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-11-26 21:23:43,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-26 21:23:43,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:43,854 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-26 21:23:44,058 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-26 21:23:44,059 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:44,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:44,059 INFO L82 PathProgramCache]: Analyzing trace with hash -964060479, now seen corresponding path program 1 times [2019-11-26 21:23:44,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:44,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092309036] [2019-11-26 21:23:44,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:44,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-26 21:23:44,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:44,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:23:44,286 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:44,287 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:44,287 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:44,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:23:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:44,577 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:44,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092309036] [2019-11-26 21:23:44,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:44,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-26 21:23:44,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296264131] [2019-11-26 21:23:44,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-26 21:23:44,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:44,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-26 21:23:44,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-26 21:23:44,768 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 17 states. [2019-11-26 21:23:46,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:46,130 INFO L93 Difference]: Finished difference Result 178 states and 198 transitions. [2019-11-26 21:23:46,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-26 21:23:46,131 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2019-11-26 21:23:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:46,133 INFO L225 Difference]: With dead ends: 178 [2019-11-26 21:23:46,133 INFO L226 Difference]: Without dead ends: 178 [2019-11-26 21:23:46,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-26 21:23:46,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-26 21:23:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 154. [2019-11-26 21:23:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-26 21:23:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2019-11-26 21:23:46,143 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 74 [2019-11-26 21:23:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:46,144 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2019-11-26 21:23:46,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-26 21:23:46,144 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2019-11-26 21:23:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-26 21:23:46,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:46,145 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-26 21:23:46,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-26 21:23:46,348 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:46,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:46,349 INFO L82 PathProgramCache]: Analyzing trace with hash -964060478, now seen corresponding path program 1 times [2019-11-26 21:23:46,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:46,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727324976] [2019-11-26 21:23:46,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:46,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-26 21:23:46,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:46,599 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:23:46,599 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:46,605 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:46,605 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:46,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:23:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:47,084 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:48,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727324976] [2019-11-26 21:23:48,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:48,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-26 21:23:48,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642801154] [2019-11-26 21:23:48,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-26 21:23:48,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:48,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-26 21:23:48,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-26 21:23:48,710 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 33 states. [2019-11-26 21:23:52,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:52,209 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2019-11-26 21:23:52,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-26 21:23:52,210 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2019-11-26 21:23:52,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:52,211 INFO L225 Difference]: With dead ends: 152 [2019-11-26 21:23:52,211 INFO L226 Difference]: Without dead ends: 152 [2019-11-26 21:23:52,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-26 21:23:52,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-26 21:23:52,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-26 21:23:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 21:23:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2019-11-26 21:23:52,218 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 74 [2019-11-26 21:23:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:52,219 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2019-11-26 21:23:52,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-26 21:23:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2019-11-26 21:23:52,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-26 21:23:52,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:52,220 INFO L410 BasicCegarLoop]: trace histogram [16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 21:23:52,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-26 21:23:52,434 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:52,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:52,435 INFO L82 PathProgramCache]: Analyzing trace with hash -770520951, now seen corresponding path program 1 times [2019-11-26 21:23:52,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:52,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916266437] [2019-11-26 21:23:52,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:52,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 21:23:52,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:52,718 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:53,004 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-26 21:23:53,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916266437] [2019-11-26 21:23:53,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-26 21:23:53,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 11 [2019-11-26 21:23:53,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448284551] [2019-11-26 21:23:53,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 21:23:53,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:53,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 21:23:53,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-26 21:23:53,007 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 10 states. [2019-11-26 21:23:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:53,131 INFO L93 Difference]: Finished difference Result 153 states and 159 transitions. [2019-11-26 21:23:53,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 21:23:53,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2019-11-26 21:23:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:53,133 INFO L225 Difference]: With dead ends: 153 [2019-11-26 21:23:53,134 INFO L226 Difference]: Without dead ends: 149 [2019-11-26 21:23:53,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-26 21:23:53,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-26 21:23:53,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-26 21:23:53,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-26 21:23:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2019-11-26 21:23:53,140 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 77 [2019-11-26 21:23:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:53,141 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2019-11-26 21:23:53,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 21:23:53,141 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2019-11-26 21:23:53,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-26 21:23:53,142 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:53,142 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] [2019-11-26 21:23:53,357 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-26 21:23:53,357 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:53,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:53,358 INFO L82 PathProgramCache]: Analyzing trace with hash 810528448, now seen corresponding path program 1 times [2019-11-26 21:23:53,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:53,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382623468] [2019-11-26 21:23:53,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:53,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-26 21:23:53,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:53,624 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:23:53,624 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:53,626 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:53,626 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:53,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-26 21:23:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:53,969 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:54,190 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:54,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382623468] [2019-11-26 21:23:54,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:54,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 20 [2019-11-26 21:23:54,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613124488] [2019-11-26 21:23:54,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-26 21:23:54,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:54,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-26 21:23:54,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-26 21:23:54,192 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 21 states. [2019-11-26 21:23:55,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:23:55,985 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2019-11-26 21:23:55,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-26 21:23:55,985 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2019-11-26 21:23:55,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:23:55,987 INFO L225 Difference]: With dead ends: 180 [2019-11-26 21:23:55,987 INFO L226 Difference]: Without dead ends: 180 [2019-11-26 21:23:55,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 145 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-11-26 21:23:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-26 21:23:55,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 155. [2019-11-26 21:23:55,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-26 21:23:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2019-11-26 21:23:55,995 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 87 [2019-11-26 21:23:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:23:55,996 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2019-11-26 21:23:55,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-26 21:23:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2019-11-26 21:23:55,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-26 21:23:55,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:23:55,997 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] [2019-11-26 21:23:56,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-26 21:23:56,211 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:23:56,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:23:56,211 INFO L82 PathProgramCache]: Analyzing trace with hash 810528449, now seen corresponding path program 1 times [2019-11-26 21:23:56,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:23:56,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062591820] [2019-11-26 21:23:56,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-26 21:23:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:23:56,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-26 21:23:56,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:23:56,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-26 21:23:56,511 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:23:56,517 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:23:56,517 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:23:56,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-26 21:23:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:57,115 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:23:59,576 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:23:59,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062591820] [2019-11-26 21:23:59,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:23:59,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 20] imperfect sequences [] total 40 [2019-11-26 21:23:59,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855081294] [2019-11-26 21:23:59,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-26 21:23:59,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:23:59,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-26 21:23:59,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-11-26 21:23:59,578 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 41 states. [2019-11-26 21:24:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:04,522 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2019-11-26 21:24:04,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 21:24:04,523 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 87 [2019-11-26 21:24:04,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:04,524 INFO L225 Difference]: With dead ends: 153 [2019-11-26 21:24:04,524 INFO L226 Difference]: Without dead ends: 153 [2019-11-26 21:24:04,525 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-11-26 21:24:04,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-26 21:24:04,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-26 21:24:04,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 21:24:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2019-11-26 21:24:04,537 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 87 [2019-11-26 21:24:04,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:04,538 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2019-11-26 21:24:04,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-26 21:24:04,538 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2019-11-26 21:24:04,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-26 21:24:04,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:04,539 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] [2019-11-26 21:24:04,740 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-26 21:24:04,740 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:04,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:04,741 INFO L82 PathProgramCache]: Analyzing trace with hash 147123437, now seen corresponding path program 1 times [2019-11-26 21:24:04,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:04,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917106020] [2019-11-26 21:24:04,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:05,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 21:24:05,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:05,839 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:05,839 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-26 21:24:06,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917106020] [2019-11-26 21:24:06,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 21:24:06,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 19] imperfect sequences [] total 39 [2019-11-26 21:24:06,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816832748] [2019-11-26 21:24:06,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-26 21:24:06,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:06,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-26 21:24:06,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2019-11-26 21:24:06,653 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 40 states. [2019-11-26 21:24:08,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:08,734 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2019-11-26 21:24:08,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-26 21:24:08,736 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-11-26 21:24:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:08,737 INFO L225 Difference]: With dead ends: 152 [2019-11-26 21:24:08,737 INFO L226 Difference]: Without dead ends: 152 [2019-11-26 21:24:08,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2019-11-26 21:24:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-26 21:24:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-26 21:24:08,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 21:24:08,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2019-11-26 21:24:08,743 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 90 [2019-11-26 21:24:08,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:08,744 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2019-11-26 21:24:08,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-26 21:24:08,744 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2019-11-26 21:24:08,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-26 21:24:08,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 21:24:08,745 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] [2019-11-26 21:24:08,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-26 21:24:08,958 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-26 21:24:08,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 21:24:08,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2088002500, now seen corresponding path program 1 times [2019-11-26 21:24:08,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-26 21:24:08,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815777882] [2019-11-26 21:24:08,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-11-26 21:24:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 21:24:09,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-26 21:24:09,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 21:24:09,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2019-11-26 21:24:09,505 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:09,514 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:09,514 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:09,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-11-26 21:24:09,582 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:09,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 54 [2019-11-26 21:24:09,583 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:09,617 INFO L588 ElimStorePlain]: treesize reduction 29, result has 48.2 percent of original size [2019-11-26 21:24:09,618 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:09,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-11-26 21:24:22,024 WARN L192 SmtUtils]: Spent 12.35 s on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2019-11-26 21:24:22,024 INFO L343 Elim1Store]: treesize reduction 32, result has 66.0 percent of original size [2019-11-26 21:24:22,025 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-26 21:24:22,025 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:22,080 INFO L588 ElimStorePlain]: treesize reduction 50, result has 41.9 percent of original size [2019-11-26 21:24:22,080 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:22,080 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2019-11-26 21:24:22,300 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-26 21:24:22,300 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 50 [2019-11-26 21:24:22,301 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:22,323 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:22,323 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:22,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-26 21:24:23,028 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:23,029 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 21:24:23,406 WARN L192 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-26 21:24:24,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:25,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:27,229 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-26 21:24:27,295 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 21:24:27,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:24:27,452 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2019-11-26 21:24:27,453 INFO L343 Elim1Store]: treesize reduction 390, result has 17.2 percent of original size [2019-11-26 21:24:27,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 61 treesize of output 85 [2019-11-26 21:24:27,460 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-26 21:24:27,460 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 21 [2019-11-26 21:24:27,461 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:27,461 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:27,462 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:27,462 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 21:24:27,463 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:27,463 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:1 [2019-11-26 21:24:29,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 21:24:29,505 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-26 21:24:29,947 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 77 [2019-11-26 21:24:29,948 INFO L343 Elim1Store]: treesize reduction 708, result has 21.4 percent of original size [2019-11-26 21:24:29,949 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 197 [2019-11-26 21:24:29,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:29,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,239 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2019-11-26 21:24:30,240 INFO L343 Elim1Store]: treesize reduction 93, result has 52.6 percent of original size [2019-11-26 21:24:30,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 193 treesize of output 229 [2019-11-26 21:24:30,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 21:24:30,249 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 21:24:30,452 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 40 [2019-11-26 21:24:30,452 INFO L588 ElimStorePlain]: treesize reduction 193, result has 34.8 percent of original size [2019-11-26 21:24:30,453 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:30,515 INFO L588 ElimStorePlain]: treesize reduction 70, result has 34.6 percent of original size [2019-11-26 21:24:30,516 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 21:24:30,516 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:37 [2019-11-26 21:24:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 21:24:32,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815777882] [2019-11-26 21:24:32,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-26 21:24:32,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2019-11-26 21:24:32,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438755456] [2019-11-26 21:24:32,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-26 21:24:32,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-26 21:24:32,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-26 21:24:32,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2019-11-26 21:24:32,021 INFO L87 Difference]: Start difference. First operand 152 states and 161 transitions. Second operand 55 states. [2019-11-26 21:24:37,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 21:24:37,194 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-26 21:24:37,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-26 21:24:37,194 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 93 [2019-11-26 21:24:37,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 21:24:37,195 INFO L225 Difference]: With dead ends: 60 [2019-11-26 21:24:37,195 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 21:24:37,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2019-11-26 21:24:37,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 21:24:37,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 21:24:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 21:24:37,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 21:24:37,197 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 93 [2019-11-26 21:24:37,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 21:24:37,197 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 21:24:37,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-26 21:24:37,197 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 21:24:37,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 21:24:37,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-26 21:24:37,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 09:24:37 BoogieIcfgContainer [2019-11-26 21:24:37,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 21:24:37,405 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 21:24:37,405 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 21:24:37,405 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 21:24:37,406 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 09:23:21" (3/4) ... [2019-11-26 21:24:37,408 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 21:24:37,415 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-26 21:24:37,415 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-11-26 21:24:37,415 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-26 21:24:37,416 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-26 21:24:37,416 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-26 21:24:37,416 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-26 21:24:37,416 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-26 21:24:37,416 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-26 21:24:37,416 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-26 21:24:37,416 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-26 21:24:37,416 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-26 21:24:37,416 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-26 21:24:37,416 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-26 21:24:37,416 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-26 21:24:37,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-26 21:24:37,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-26 21:24:37,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-26 21:24:37,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-26 21:24:37,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-26 21:24:37,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-26 21:24:37,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-26 21:24:37,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-26 21:24:37,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-26 21:24:37,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-26 21:24:37,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-26 21:24:37,417 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-26 21:24:37,418 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-26 21:24:37,418 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-26 21:24:37,418 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-26 21:24:37,418 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-26 21:24:37,418 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-26 21:24:37,418 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-26 21:24:37,418 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-26 21:24:37,418 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-26 21:24:37,418 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-26 21:24:37,418 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-26 21:24:37,418 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-26 21:24:37,418 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-26 21:24:37,419 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-26 21:24:37,419 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-26 21:24:37,419 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-26 21:24:37,419 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-26 21:24:37,419 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-26 21:24:37,419 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-26 21:24:37,419 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-26 21:24:37,419 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-26 21:24:37,427 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2019-11-26 21:24:37,427 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-26 21:24:37,428 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 21:24:37,428 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 21:24:37,429 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 21:24:37,486 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-26 21:24:37,486 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 21:24:37,487 INFO L168 Benchmark]: Toolchain (without parser) took 78288.73 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 505.4 MB). Free memory was 952.3 MB in the beginning and 1.3 GB in the end (delta: -391.1 MB). Peak memory consumption was 114.4 MB. Max. memory is 11.5 GB. [2019-11-26 21:24:37,488 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:24:37,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 925.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -126.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-26 21:24:37,488 INFO L168 Benchmark]: Boogie Preprocessor took 104.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:24:37,489 INFO L168 Benchmark]: RCFGBuilder took 1526.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.7 MB in the end (delta: 112.6 MB). Peak memory consumption was 112.6 MB. Max. memory is 11.5 GB. [2019-11-26 21:24:37,489 INFO L168 Benchmark]: TraceAbstraction took 75644.74 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 386.9 MB). Free memory was 959.7 MB in the beginning and 1.4 GB in the end (delta: -397.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 21:24:37,490 INFO L168 Benchmark]: Witness Printer took 81.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2019-11-26 21:24:37,491 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 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 925.59 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -126.7 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 104.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1526.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 959.7 MB in the end (delta: 112.6 MB). Peak memory consumption was 112.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 75644.74 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 386.9 MB). Free memory was 959.7 MB in the beginning and 1.4 GB in the end (delta: -397.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 81.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 763]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 332 locations, 71 error locations. Result: SAFE, OverallTime: 75.5s, OverallIterations: 23, TraceHistogramMax: 16, AutomataDifference: 28.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2367 SDtfs, 1231 SDslu, 17957 SDs, 0 SdLazy, 10850 SolverSat, 372 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2427 GetRequests, 1943 SyntacticMatches, 48 SemanticMatches, 436 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2353 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 124 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 37.3s InterpolantComputationTime, 1189 NumberOfCodeBlocks, 1153 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2332 ConstructedInterpolants, 306 QuantifiedInterpolants, 692552 SizeOfPredicates, 140 NumberOfNonLiveVariables, 5227 ConjunctsInSsa, 392 ConjunctsInUnsatCore, 46 InterpolantComputations, 37 PerfectInterpolantSequences, 2985/3518 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...