./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test16.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c1f4b5c4 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_test16.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 fa0c2a1ec4e9d87c009cc3e8aa4349638d4af33a ............................................................................................................................. 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_test16.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 fa0c2a1ec4e9d87c009cc3e8aa4349638d4af33a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-c1f4b5c [2019-12-08 16:08:40,148 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-08 16:08:40,150 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-08 16:08:40,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-08 16:08:40,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-08 16:08:40,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-08 16:08:40,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-08 16:08:40,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-08 16:08:40,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-08 16:08:40,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-08 16:08:40,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-08 16:08:40,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-08 16:08:40,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-08 16:08:40,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-08 16:08:40,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-08 16:08:40,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-08 16:08:40,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-08 16:08:40,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-08 16:08:40,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-08 16:08:40,190 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-08 16:08:40,192 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-08 16:08:40,193 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-08 16:08:40,194 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-08 16:08:40,195 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-08 16:08:40,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-08 16:08:40,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-08 16:08:40,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-08 16:08:40,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-08 16:08:40,200 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-08 16:08:40,203 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-08 16:08:40,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-08 16:08:40,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-08 16:08:40,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-08 16:08:40,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-08 16:08:40,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-08 16:08:40,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-08 16:08:40,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-08 16:08:40,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-08 16:08:40,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-08 16:08:40,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-08 16:08:40,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-08 16:08:40,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-08 16:08:40,241 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-08 16:08:40,242 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-08 16:08:40,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-08 16:08:40,244 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-08 16:08:40,244 INFO L138 SettingsManager]: * Use SBE=true [2019-12-08 16:08:40,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-08 16:08:40,245 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-08 16:08:40,245 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-08 16:08:40,245 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-08 16:08:40,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-08 16:08:40,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-08 16:08:40,247 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-08 16:08:40,247 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-08 16:08:40,248 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-08 16:08:40,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-08 16:08:40,248 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-08 16:08:40,248 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-08 16:08:40,248 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-08 16:08:40,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-08 16:08:40,249 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-08 16:08:40,249 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-08 16:08:40,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-08 16:08:40,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-08 16:08:40,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-08 16:08:40,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-08 16:08:40,250 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-08 16:08:40,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-08 16:08:40,251 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-08 16:08:40,251 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 -> fa0c2a1ec4e9d87c009cc3e8aa4349638d4af33a [2019-12-08 16:08:40,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-08 16:08:40,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-08 16:08:40,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-08 16:08:40,658 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-08 16:08:40,658 INFO L275 PluginConnector]: CDTParser initialized [2019-12-08 16:08:40,659 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test16.i [2019-12-08 16:08:40,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d99c2610/701cc1c5ebde45c3aa2a6a368c1820b9/FLAG67fce33b4 [2019-12-08 16:08:41,204 INFO L306 CDTParser]: Found 1 translation units. [2019-12-08 16:08:41,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test16.i [2019-12-08 16:08:41,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d99c2610/701cc1c5ebde45c3aa2a6a368c1820b9/FLAG67fce33b4 [2019-12-08 16:08:41,538 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d99c2610/701cc1c5ebde45c3aa2a6a368c1820b9 [2019-12-08 16:08:41,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-08 16:08:41,542 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-08 16:08:41,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-08 16:08:41,543 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-08 16:08:41,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-08 16:08:41,548 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:08:41" (1/1) ... [2019-12-08 16:08:41,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46e9c483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:08:41, skipping insertion in model container [2019-12-08 16:08:41,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:08:41" (1/1) ... [2019-12-08 16:08:41,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-08 16:08:41,616 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-08 16:08:42,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 16:08:42,217 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-12-08 16:08:42,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2f192d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:08:42, skipping insertion in model container [2019-12-08 16:08:42,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-08 16:08:42,218 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-12-08 16:08:42,221 INFO L168 Benchmark]: Toolchain (without parser) took 677.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -227.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-12-08 16:08:42,222 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-08 16:08:42,223 INFO L168 Benchmark]: CACSL2BoogieTranslator took 675.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -227.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-12-08 16:08:42,225 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 675.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 200.8 MB). Free memory was 952.3 MB in the beginning and 1.2 GB in the end (delta: -227.3 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 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.25-c1f4b5c [2019-12-08 16:08:43,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-08 16:08:43,983 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-08 16:08:44,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-08 16:08:44,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-08 16:08:44,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-08 16:08:44,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-08 16:08:44,005 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-08 16:08:44,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-08 16:08:44,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-08 16:08:44,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-08 16:08:44,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-08 16:08:44,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-08 16:08:44,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-08 16:08:44,013 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-08 16:08:44,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-08 16:08:44,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-08 16:08:44,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-08 16:08:44,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-08 16:08:44,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-08 16:08:44,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-08 16:08:44,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-08 16:08:44,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-08 16:08:44,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-08 16:08:44,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-08 16:08:44,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-08 16:08:44,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-08 16:08:44,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-08 16:08:44,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-08 16:08:44,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-08 16:08:44,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-08 16:08:44,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-08 16:08:44,043 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-08 16:08:44,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-08 16:08:44,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-08 16:08:44,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-08 16:08:44,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-08 16:08:44,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-08 16:08:44,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-08 16:08:44,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-08 16:08:44,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-08 16:08:44,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-08 16:08:44,083 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-08 16:08:44,084 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-08 16:08:44,085 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-08 16:08:44,085 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-08 16:08:44,085 INFO L138 SettingsManager]: * Use SBE=true [2019-12-08 16:08:44,086 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-08 16:08:44,086 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-08 16:08:44,086 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-08 16:08:44,086 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-08 16:08:44,087 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-08 16:08:44,087 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-08 16:08:44,087 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-08 16:08:44,087 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-08 16:08:44,087 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-08 16:08:44,088 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-08 16:08:44,088 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-08 16:08:44,088 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-08 16:08:44,088 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-08 16:08:44,088 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-08 16:08:44,089 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-08 16:08:44,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-08 16:08:44,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-08 16:08:44,089 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-08 16:08:44,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-08 16:08:44,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-08 16:08:44,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-08 16:08:44,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-08 16:08:44,090 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-08 16:08:44,091 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-08 16:08:44,091 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-08 16:08:44,091 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-08 16:08:44,091 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 -> fa0c2a1ec4e9d87c009cc3e8aa4349638d4af33a [2019-12-08 16:08:44,399 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-08 16:08:44,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-08 16:08:44,415 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-08 16:08:44,416 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-08 16:08:44,417 INFO L275 PluginConnector]: CDTParser initialized [2019-12-08 16:08:44,418 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test16.i [2019-12-08 16:08:44,492 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87c816ddc/ff482a55404b44bb9cf2d09d0d325f60/FLAGac6736156 [2019-12-08 16:08:45,017 INFO L306 CDTParser]: Found 1 translation units. [2019-12-08 16:08:45,018 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test16.i [2019-12-08 16:08:45,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87c816ddc/ff482a55404b44bb9cf2d09d0d325f60/FLAGac6736156 [2019-12-08 16:08:45,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87c816ddc/ff482a55404b44bb9cf2d09d0d325f60 [2019-12-08 16:08:45,309 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-08 16:08:45,311 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-08 16:08:45,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-08 16:08:45,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-08 16:08:45,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-08 16:08:45,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:08:45" (1/1) ... [2019-12-08 16:08:45,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a71de5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:08:45, skipping insertion in model container [2019-12-08 16:08:45,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 04:08:45" (1/1) ... [2019-12-08 16:08:45,327 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-08 16:08:45,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-08 16:08:45,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 16:08:45,921 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-08 16:08:45,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-08 16:08:45,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 16:08:46,005 INFO L203 MainTranslator]: Completed pre-run [2019-12-08 16:08:46,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-08 16:08:46,151 INFO L208 MainTranslator]: Completed translation [2019-12-08 16:08:46,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:08:46 WrapperNode [2019-12-08 16:08:46,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-08 16:08:46,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-08 16:08:46,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-08 16:08:46,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-08 16:08:46,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:08:46" (1/1) ... [2019-12-08 16:08:46,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:08:46" (1/1) ... [2019-12-08 16:08:46,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:08:46" (1/1) ... [2019-12-08 16:08:46,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:08:46" (1/1) ... [2019-12-08 16:08:46,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:08:46" (1/1) ... [2019-12-08 16:08:46,273 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:08:46" (1/1) ... [2019-12-08 16:08:46,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:08:46" (1/1) ... [2019-12-08 16:08:46,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-08 16:08:46,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-08 16:08:46,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-08 16:08:46,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-08 16:08:46,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:08:46" (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-12-08 16:08:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-08 16:08:46,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-08 16:08:46,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-12-08 16:08:46,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-08 16:08:46,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-08 16:08:46,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-08 16:08:46,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-08 16:08:46,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-08 16:08:46,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-08 16:08:46,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-12-08 16:08:46,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-12-08 16:08:46,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-12-08 16:08:46,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-12-08 16:08:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-12-08 16:08:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-12-08 16:08:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-12-08 16:08:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-12-08 16:08:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-12-08 16:08:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-12-08 16:08:46,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-12-08 16:08:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-12-08 16:08:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-12-08 16:08:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-12-08 16:08:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-12-08 16:08:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-12-08 16:08:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-12-08 16:08:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-12-08 16:08:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-12-08 16:08:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-12-08 16:08:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-12-08 16:08:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-12-08 16:08:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-12-08 16:08:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-12-08 16:08:46,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-12-08 16:08:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-12-08 16:08:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-12-08 16:08:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-12-08 16:08:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-12-08 16:08:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-12-08 16:08:46,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-12-08 16:08:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-12-08 16:08:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-12-08 16:08:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_16 [2019-12-08 16:08:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure free_16 [2019-12-08 16:08:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-12-08 16:08:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-08 16:08:46,355 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-12-08 16:08:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-08 16:08:46,356 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-12-08 16:08:46,356 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-08 16:08:46,356 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-08 16:08:46,356 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-08 16:08:46,356 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-08 16:08:46,356 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-08 16:08:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-08 16:08:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-08 16:08:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-08 16:08:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-08 16:08:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-08 16:08:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-08 16:08:46,357 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-08 16:08:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-08 16:08:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-08 16:08:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-08 16:08:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-08 16:08:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-08 16:08:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-08 16:08:46,358 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-08 16:08:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-08 16:08:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-08 16:08:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-08 16:08:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-08 16:08:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-08 16:08:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-08 16:08:46,359 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-08 16:08:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-08 16:08:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-08 16:08:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-08 16:08:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-08 16:08:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-08 16:08:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-08 16:08:46,360 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-08 16:08:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-08 16:08:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-08 16:08:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-08 16:08:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-08 16:08:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-08 16:08:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-08 16:08:46,361 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-08 16:08:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-08 16:08:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-08 16:08:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-08 16:08:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-08 16:08:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-08 16:08:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-08 16:08:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-08 16:08:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-08 16:08:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-08 16:08:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-08 16:08:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-08 16:08:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-08 16:08:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-08 16:08:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-08 16:08:46,363 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-08 16:08:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-08 16:08:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-08 16:08:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-08 16:08:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-08 16:08:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-08 16:08:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-08 16:08:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-08 16:08:46,364 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-08 16:08:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-08 16:08:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-08 16:08:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-08 16:08:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-08 16:08:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-08 16:08:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-08 16:08:46,365 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-08 16:08:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-08 16:08:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-08 16:08:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-08 16:08:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-08 16:08:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-08 16:08:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-08 16:08:46,366 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-08 16:08:46,367 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-08 16:08:46,367 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-08 16:08:46,367 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-08 16:08:46,367 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-08 16:08:46,367 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-08 16:08:46,367 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-08 16:08:46,367 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-08 16:08:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-08 16:08:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-08 16:08:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-08 16:08:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-08 16:08:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-08 16:08:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-08 16:08:46,368 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-08 16:08:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-08 16:08:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-08 16:08:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-08 16:08:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-08 16:08:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-08 16:08:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-08 16:08:46,369 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-08 16:08:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-08 16:08:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-08 16:08:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-08 16:08:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-08 16:08:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-08 16:08:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-08 16:08:46,370 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-08 16:08:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-08 16:08:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-08 16:08:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-08 16:08:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-08 16:08:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-12-08 16:08:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-12-08 16:08:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-12-08 16:08:46,371 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-12-08 16:08:46,372 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-08 16:08:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-08 16:08:46,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-12-08 16:08:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-08 16:08:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-12-08 16:08:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-08 16:08:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-12-08 16:08:46,374 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-12-08 16:08:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-12-08 16:08:46,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-08 16:08:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-12-08 16:08:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-12-08 16:08:46,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-12-08 16:08:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-12-08 16:08:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-12-08 16:08:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-12-08 16:08:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-08 16:08:46,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-12-08 16:08:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-12-08 16:08:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-12-08 16:08:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-12-08 16:08:46,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-12-08 16:08:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-08 16:08:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-08 16:08:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-12-08 16:08:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-12-08 16:08:46,379 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-12-08 16:08:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-12-08 16:08:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-12-08 16:08:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-12-08 16:08:46,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-12-08 16:08:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-12-08 16:08:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-12-08 16:08:46,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-12-08 16:08:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-12-08 16:08:46,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-12-08 16:08:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-12-08 16:08:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-12-08 16:08:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-12-08 16:08:46,383 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-12-08 16:08:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-12-08 16:08:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_16 [2019-12-08 16:08:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure free_16 [2019-12-08 16:08:46,384 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-12-08 16:08:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-08 16:08:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-08 16:08:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-08 16:08:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-08 16:08:46,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-08 16:08:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-08 16:08:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-12-08 16:08:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-12-08 16:08:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-08 16:08:46,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-08 16:08:47,066 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-08 16:08:47,477 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-08 16:08:47,862 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-08 16:08:47,862 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-12-08 16:08:47,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:08:47 BoogieIcfgContainer [2019-12-08 16:08:47,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-08 16:08:47,865 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-08 16:08:47,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-08 16:08:47,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-08 16:08:47,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 04:08:45" (1/3) ... [2019-12-08 16:08:47,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab1d9ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:08:47, skipping insertion in model container [2019-12-08 16:08:47,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 04:08:46" (2/3) ... [2019-12-08 16:08:47,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ab1d9ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 04:08:47, skipping insertion in model container [2019-12-08 16:08:47,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:08:47" (3/3) ... [2019-12-08 16:08:47,874 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test16.i [2019-12-08 16:08:47,887 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-08 16:08:47,897 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 74 error locations. [2019-12-08 16:08:47,913 INFO L249 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2019-12-08 16:08:47,937 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-08 16:08:47,938 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-08 16:08:47,938 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-08 16:08:47,938 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-08 16:08:47,938 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-08 16:08:47,938 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-08 16:08:47,939 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-08 16:08:47,939 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-08 16:08:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-12-08 16:08:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-08 16:08:47,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:08:47,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:08:47,971 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-08 16:08:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:08:47,978 INFO L82 PathProgramCache]: Analyzing trace with hash 997159282, now seen corresponding path program 1 times [2019-12-08 16:08:47,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:08:47,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478937032] [2019-12-08 16:08:47,992 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-12-08 16:08:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:08:48,207 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-08 16:08:48,216 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:08:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:08:48,308 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:08:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:08:48,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478937032] [2019-12-08 16:08:48,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:08:48,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-12-08 16:08:48,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885081405] [2019-12-08 16:08:48,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-08 16:08:48,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:08:48,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-08 16:08:48,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-08 16:08:48,447 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 8 states. [2019-12-08 16:08:48,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:08:48,588 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2019-12-08 16:08:48,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-08 16:08:48,590 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-12-08 16:08:48,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:08:48,605 INFO L225 Difference]: With dead ends: 49 [2019-12-08 16:08:48,605 INFO L226 Difference]: Without dead ends: 46 [2019-12-08 16:08:48,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-08 16:08:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-08 16:08:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-12-08 16:08:48,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-08 16:08:48,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-12-08 16:08:48,657 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 17 [2019-12-08 16:08:48,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:08:48,658 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-12-08 16:08:48,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-08 16:08:48,658 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-12-08 16:08:48,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-08 16:08:48,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:08:48,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-08 16:08:48,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-08 16:08:48,875 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-08 16:08:48,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:08:48,875 INFO L82 PathProgramCache]: Analyzing trace with hash 965683329, now seen corresponding path program 1 times [2019-12-08 16:08:48,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:08:48,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355411998] [2019-12-08 16:08:48,877 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-12-08 16:08:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:08:49,018 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-08 16:08:49,020 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:08:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:08:49,031 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:08:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:08:49,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355411998] [2019-12-08 16:08:49,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:08:49,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-08 16:08:49,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044267503] [2019-12-08 16:08:49,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-08 16:08:49,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:08:49,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-08 16:08:49,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-08 16:08:49,136 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 3 states. [2019-12-08 16:08:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:08:49,209 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-12-08 16:08:49,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-08 16:08:49,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-08 16:08:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:08:49,214 INFO L225 Difference]: With dead ends: 54 [2019-12-08 16:08:49,214 INFO L226 Difference]: Without dead ends: 43 [2019-12-08 16:08:49,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-12-08 16:08:49,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-08 16:08:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-12-08 16:08:49,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-08 16:08:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2019-12-08 16:08:49,232 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 21 [2019-12-08 16:08:49,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:08:49,232 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2019-12-08 16:08:49,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-08 16:08:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2019-12-08 16:08:49,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-08 16:08:49,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:08:49,233 INFO L411 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] [2019-12-08 16:08:49,436 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-08 16:08:49,437 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-08 16:08:49,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:08:49,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1103285257, now seen corresponding path program 1 times [2019-12-08 16:08:49,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:08:49,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014223291] [2019-12-08 16:08:49,441 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-12-08 16:08:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:08:49,621 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-08 16:08:49,623 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:08:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:08:49,690 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:08:49,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:08:49,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014223291] [2019-12-08 16:08:49,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:08:49,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-12-08 16:08:49,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480934539] [2019-12-08 16:08:49,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-08 16:08:49,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:08:49,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-08 16:08:49,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-08 16:08:49,853 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 9 states. [2019-12-08 16:08:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:08:49,960 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-12-08 16:08:49,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 16:08:49,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-08 16:08:49,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:08:49,964 INFO L225 Difference]: With dead ends: 42 [2019-12-08 16:08:49,964 INFO L226 Difference]: Without dead ends: 42 [2019-12-08 16:08:49,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-08 16:08:49,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-08 16:08:49,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-08 16:08:49,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-08 16:08:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-12-08 16:08:49,977 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 23 [2019-12-08 16:08:49,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:08:49,977 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-12-08 16:08:49,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-08 16:08:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-12-08 16:08:49,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-08 16:08:49,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:08:49,981 INFO L411 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] [2019-12-08 16:08:50,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-08 16:08:50,193 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-08 16:08:50,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:08:50,194 INFO L82 PathProgramCache]: Analyzing trace with hash 157895800, now seen corresponding path program 1 times [2019-12-08 16:08:50,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:08:50,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102292972] [2019-12-08 16:08:50,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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-12-08 16:08:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:08:50,329 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-08 16:08:50,331 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:08:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:08:50,522 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:08:50,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:08:50,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102292972] [2019-12-08 16:08:50,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:08:50,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2019-12-08 16:08:50,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261866576] [2019-12-08 16:08:50,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-08 16:08:50,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:08:50,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-08 16:08:50,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2019-12-08 16:08:50,858 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 17 states. [2019-12-08 16:08:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:08:51,281 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2019-12-08 16:08:51,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-08 16:08:51,285 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-12-08 16:08:51,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:08:51,286 INFO L225 Difference]: With dead ends: 53 [2019-12-08 16:08:51,286 INFO L226 Difference]: Without dead ends: 51 [2019-12-08 16:08:51,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-08 16:08:51,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-08 16:08:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2019-12-08 16:08:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-08 16:08:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-12-08 16:08:51,294 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 24 [2019-12-08 16:08:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:08:51,294 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-12-08 16:08:51,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-08 16:08:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-12-08 16:08:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-08 16:08:51,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:08:51,296 INFO L411 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] [2019-12-08 16:08:51,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-08 16:08:51,506 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-08 16:08:51,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:08:51,506 INFO L82 PathProgramCache]: Analyzing trace with hash 599802905, now seen corresponding path program 1 times [2019-12-08 16:08:51,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:08:51,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301105531] [2019-12-08 16:08:51,508 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-12-08 16:08:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:08:51,628 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-08 16:08:51,630 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:08:51,668 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-12-08 16:08:51,669 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:08:51,675 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:08:51,675 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:08:51,675 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-08 16:08:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:08:51,743 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:08:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:08:51,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301105531] [2019-12-08 16:08:51,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:08:51,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-12-08 16:08:51,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827132744] [2019-12-08 16:08:51,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-08 16:08:51,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:08:51,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-08 16:08:51,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-08 16:08:51,848 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 9 states. [2019-12-08 16:08:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:08:52,021 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2019-12-08 16:08:52,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 16:08:52,024 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-08 16:08:52,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:08:52,025 INFO L225 Difference]: With dead ends: 50 [2019-12-08 16:08:52,025 INFO L226 Difference]: Without dead ends: 50 [2019-12-08 16:08:52,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-08 16:08:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-08 16:08:52,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2019-12-08 16:08:52,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-08 16:08:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2019-12-08 16:08:52,034 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 25 [2019-12-08 16:08:52,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:08:52,034 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2019-12-08 16:08:52,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-08 16:08:52,034 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2019-12-08 16:08:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-08 16:08:52,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:08:52,035 INFO L411 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] [2019-12-08 16:08:52,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-08 16:08:52,240 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-08 16:08:52,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:08:52,240 INFO L82 PathProgramCache]: Analyzing trace with hash 306399898, now seen corresponding path program 1 times [2019-12-08 16:08:52,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:08:52,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608138447] [2019-12-08 16:08:52,241 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-12-08 16:08:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:08:52,375 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-08 16:08:52,377 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:08:52,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:08:52,455 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:08:52,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:08:52,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608138447] [2019-12-08 16:08:52,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:08:52,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-12-08 16:08:52,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984208232] [2019-12-08 16:08:52,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-08 16:08:52,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:08:52,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-08 16:08:52,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-08 16:08:52,517 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 9 states. [2019-12-08 16:08:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:08:52,588 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-12-08 16:08:52,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-08 16:08:52,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-08 16:08:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:08:52,590 INFO L225 Difference]: With dead ends: 47 [2019-12-08 16:08:52,590 INFO L226 Difference]: Without dead ends: 47 [2019-12-08 16:08:52,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-08 16:08:52,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-08 16:08:52,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-12-08 16:08:52,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-08 16:08:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-12-08 16:08:52,601 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 25 [2019-12-08 16:08:52,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:08:52,601 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-12-08 16:08:52,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-08 16:08:52,601 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-12-08 16:08:52,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-08 16:08:52,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:08:52,604 INFO L411 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] [2019-12-08 16:08:52,804 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-08 16:08:52,805 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-08 16:08:52,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:08:52,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1123950726, now seen corresponding path program 1 times [2019-12-08 16:08:52,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:08:52,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423745177] [2019-12-08 16:08:52,807 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-12-08 16:08:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:08:52,949 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-08 16:08:52,951 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:08:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:08:52,994 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:08:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:08:53,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423745177] [2019-12-08 16:08:53,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:08:53,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-12-08 16:08:53,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501368103] [2019-12-08 16:08:53,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-08 16:08:53,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:08:53,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-08 16:08:53,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-08 16:08:53,169 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 9 states. [2019-12-08 16:08:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:08:53,251 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-12-08 16:08:53,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-08 16:08:53,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2019-12-08 16:08:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:08:53,254 INFO L225 Difference]: With dead ends: 47 [2019-12-08 16:08:53,254 INFO L226 Difference]: Without dead ends: 45 [2019-12-08 16:08:53,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-08 16:08:53,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-08 16:08:53,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-12-08 16:08:53,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-08 16:08:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-12-08 16:08:53,259 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-12-08 16:08:53,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:08:53,259 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-12-08 16:08:53,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-08 16:08:53,260 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-12-08 16:08:53,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-08 16:08:53,261 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:08:53,261 INFO L411 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] [2019-12-08 16:08:53,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-08 16:08:53,474 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-08 16:08:53,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:08:53,475 INFO L82 PathProgramCache]: Analyzing trace with hash 2141245867, now seen corresponding path program 1 times [2019-12-08 16:08:53,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:08:53,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414260761] [2019-12-08 16:08:53,476 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-12-08 16:08:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:08:53,625 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-08 16:08:53,627 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:08:53,656 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:08:53,657 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-12-08 16:08:53,657 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:08:53,674 INFO L614 ElimStorePlain]: treesize reduction 10, result has 60.0 percent of original size [2019-12-08 16:08:53,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:08:53,677 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-08 16:08:53,677 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:15 [2019-12-08 16:08:53,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:08:53,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:08:53,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:08:53,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-08 16:09:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:09:01,987 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:09:17,479 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-12-08 16:09:19,769 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 5=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-08 16:09:19,773 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))))) is different from false [2019-12-08 16:09:19,776 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))))) is different from true [2019-12-08 16:09:19,788 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 5=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-08 16:09:19,799 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 5=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-08 16:09:19,809 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |c_#valid| c_free_16_~p.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|))) is different from false [2019-12-08 16:09:19,817 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |c_#valid| c_free_16_~p.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|))) is different from true [2019-12-08 16:09:19,835 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 5=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-08 16:09:19,856 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 5=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-08 16:09:19,867 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 5=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-08 16:09:19,876 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_11|], 5=[|v_old(#valid)_BEFORE_CALL_12|]} [2019-12-08 16:09:19,886 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (= (store |c_#valid| |c_free_16_#in~p.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))))) is different from false [2019-12-08 16:09:19,891 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (= (store |c_#valid| |c_free_16_#in~p.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))))) is different from true [2019-12-08 16:09:23,452 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))) (= v_prenex_3 (store |c_#valid| |c_alloc_16_#res.base| (_ bv0 1))))))) is different from false [2019-12-08 16:09:23,456 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))) (= v_prenex_3 (store |c_#valid| |c_alloc_16_#res.base| (_ bv0 1))))))) is different from true [2019-12-08 16:09:23,485 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_3 (store |c_#valid| |c_alloc_16_#t~ret38.base| (_ bv0 1))) (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))))))) is different from false [2019-12-08 16:09:23,495 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_3 (store |c_#valid| |c_alloc_16_#t~ret38.base| (_ bv0 1))) (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))))))) is different from true [2019-12-08 16:09:23,576 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_53|) (_ bv0 1))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_ldv_malloc_#res.base_53| (_ bv0 1)) v_prenex_3) (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))))))) is different from false [2019-12-08 16:09:23,585 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_53|) (_ bv0 1))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| |v_ldv_malloc_#res.base_53| (_ bv0 1)) v_prenex_3) (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))))))) is different from true [2019-12-08 16:09:23,595 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-12-08 16:09:23,639 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-08 16:09:23,641 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_5, |v_old(#valid)_BEFORE_CALL_11|], 5=[v_prenex_6]} [2019-12-08 16:09:23,644 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3], 5=[|v_old(#valid)_BEFORE_CALL_13|]} [2019-12-08 16:09:23,654 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_8 (_ BitVec 32))) (and (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_9 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_8)) (not (= v_prenex_9 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_8 (_ bv0 1)))))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_53| (_ bv0 1)))) (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31))))))))) is different from false [2019-12-08 16:09:23,668 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_8 (_ BitVec 32))) (and (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_9 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_8)) (not (= v_prenex_9 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_8 (_ bv0 1)))))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_53| (_ bv0 1)))) (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31))))))))) is different from true [2019-12-08 16:09:23,672 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-08 16:09:23,682 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2019-12-08 16:09:23,690 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_9], 5=[|v_old(#valid)_BEFORE_CALL_13|]} [2019-12-08 16:09:23,693 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_5], 5=[v_prenex_6, |v_old(#valid)_BEFORE_CALL_14|]} [2019-12-08 16:09:23,703 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_53| (_ bv0 1)))) (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31))))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_8 (_ BitVec 32))) (and (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_9 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_8)) (not (= v_prenex_9 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_8 (_ bv0 1)))))))) is different from false [2019-12-08 16:09:23,714 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_53| (_ bv0 1)))) (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31))))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_8 (_ BitVec 32))) (and (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_9 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_8)) (not (= v_prenex_9 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_8 (_ bv0 1)))))))) is different from true [2019-12-08 16:09:23,719 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-12-08 16:09:23,729 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-08 16:09:23,738 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_9], 5=[|v_old(#valid)_BEFORE_CALL_13|]} [2019-12-08 16:09:23,742 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_5], 5=[v_prenex_6, |v_old(#valid)_BEFORE_CALL_14|]} [2019-12-08 16:09:23,758 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_54| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_53| (_ bv0 1)))) (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31))))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_54|) (_ bv0 1))) (exists ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_8 (_ BitVec 32))) (and (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_9 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_8)) (not (= v_prenex_9 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_8 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |v_ldv_malloc_#res.base_54| (_ bv0 1))))) is different from false [2019-12-08 16:09:23,766 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_54| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_53| (_ bv0 1)))) (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31))))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_54|) (_ bv0 1))) (exists ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_8 (_ BitVec 32))) (and (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_9 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_8)) (not (= v_prenex_9 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_8 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |v_ldv_malloc_#res.base_54| (_ bv0 1))))) is different from true [2019-12-08 16:09:23,771 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-12-08 16:09:23,782 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-08 16:09:23,789 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_9], 5=[|v_old(#valid)_BEFORE_CALL_13|]} [2019-12-08 16:09:23,794 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_5], 5=[v_prenex_6, |v_old(#valid)_BEFORE_CALL_14|]} [2019-12-08 16:09:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:09:23,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414260761] [2019-12-08 16:09:23,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:09:23,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 16] imperfect sequences [] total 27 [2019-12-08 16:09:23,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668926351] [2019-12-08 16:09:23,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-08 16:09:23,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:09:23,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-08 16:09:23,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=238, Unknown=59, NotChecked=378, Total=756 [2019-12-08 16:09:23,842 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 28 states. [2019-12-08 16:09:49,026 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_53| (_ bv0 1)))) (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31))))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_8 (_ BitVec 32))) (and (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_9 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_8)) (not (= v_prenex_9 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_8 (_ bv0 1))))))))) is different from false [2019-12-08 16:09:49,107 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_14| (Array (_ BitVec 32) (_ BitVec 1)))) (or (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_9 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_8 (_ BitVec 32))) (and (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_9 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_8)) (not (= v_prenex_9 (store |v_old(#valid)_BEFORE_CALL_14| v_prenex_8 (_ bv0 1)))))))) (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_53| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| |v_ldv_malloc_#res.base_53|) (_ bv0 1)) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1))))) (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_53| (_ bv0 1)))) (forall ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_14| v_alloc_16_~p~0.base_31))))))))) (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1)))) is different from false [2019-12-08 16:09:53,119 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_3 (store |c_#valid| |c_alloc_16_#t~ret38.base| (_ bv0 1))) (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))))))) (= |c_#valid| (store |c_old(#valid)| |c_alloc_16_#t~ret38.base| (_ bv1 1))) (= (select |c_old(#valid)| |c_alloc_16_#t~ret38.base|) (_ bv0 1))) is different from false [2019-12-08 16:09:53,179 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 1) (select |c_old(#valid)| |c_alloc_16_#res.base|)) (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_alloc_16_~p~0.base_31 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1)))) (and (= (select |c_old(#valid)| v_alloc_16_~p~0.base_31) (_ bv0 1)) (forall ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (or (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_13| v_entry_point_~p~1.base_20) (_ bv0 1))))) (not (= (store |c_old(#valid)| v_alloc_16_~p~0.base_31 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_13| v_prenex_4 (_ bv0 1)))) (= (select |v_old(#valid)_BEFORE_CALL_13| v_prenex_4) (_ bv0 1)))) (= v_prenex_3 (store |c_#valid| |c_alloc_16_#res.base| (_ bv0 1))))))) (= |c_#valid| (store |c_old(#valid)| |c_alloc_16_#res.base| (_ bv1 1)))) is different from false [2019-12-08 16:10:13,655 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (= (store |c_#valid| |c_free_16_#in~p.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (bvadd (select |c_old(#valid)| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))) (= |c_#valid| |c_old(#valid)|)) is different from false [2019-12-08 16:10:17,752 WARN L838 $PredicateComparison]: unable to prove that (and (= c_free_16_~p.base |c_free_16_#in~p.base|) (= |c_#valid| |c_old(#valid)|) (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))) (= (store |c_#valid| c_free_16_~p.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_11|)))) is different from false [2019-12-08 16:10:40,017 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))))) (= |c_#valid| (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))) is different from false [2019-12-08 16:10:40,020 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_11| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_12| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_12| v_prenex_2) (_ bv0 1))) (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_12| v_prenex_2 (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_11|) (exists ((v_entry_point_~p~1.base_20 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_11| (store |v_old(#valid)_BEFORE_CALL_12| v_entry_point_~p~1.base_20 (_ bv0 1)))))))) (= |c_#valid| (store |c_old(#valid)| |c_free_16_#in~p.base| (_ bv0 1)))) is different from true [2019-12-08 16:10:42,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:10:42,977 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2019-12-08 16:10:42,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-08 16:10:42,979 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 30 [2019-12-08 16:10:42,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:10:42,980 INFO L225 Difference]: With dead ends: 48 [2019-12-08 16:10:42,980 INFO L226 Difference]: Without dead ends: 31 [2019-12-08 16:10:42,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=117, Invalid=305, Unknown=104, NotChecked=880, Total=1406 [2019-12-08 16:10:42,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-08 16:10:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-08 16:10:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-08 16:10:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 30 transitions. [2019-12-08 16:10:42,985 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 30 transitions. Word has length 30 [2019-12-08 16:10:42,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:10:42,986 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 30 transitions. [2019-12-08 16:10:42,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-08 16:10:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2019-12-08 16:10:42,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-08 16:10:42,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-08 16:10:42,987 INFO L411 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] [2019-12-08 16:10:43,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-08 16:10:43,189 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, free_16Err0ASSERT_VIOLATIONMEMORY_FREE, free_16Err1ASSERT_VIOLATIONMEMORY_FREE, free_16Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-08 16:10:43,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-08 16:10:43,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1144173514, now seen corresponding path program 1 times [2019-12-08 16:10:43,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-08 16:10:43,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1053875645] [2019-12-08 16:10:43,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-08 16:10:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-08 16:10:43,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-08 16:10:43,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-08 16:10:43,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-08 16:10:43,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-08 16:10:43,342 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:10:43,353 INFO L614 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-12-08 16:10:43,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-08 16:10:43,354 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-12-08 16:10:43,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:10:43,522 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-08 16:10:43,752 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:10:43,752 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 1 case distinctions, treesize of input 17 treesize of output 16 [2019-12-08 16:10:43,752 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:10:43,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:10:43,762 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:10:43,763 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-12-08 16:10:43,950 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 20 treesize of output 9 [2019-12-08 16:10:43,950 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:10:43,953 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:10:43,953 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:10:43,953 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:9 [2019-12-08 16:10:44,031 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 20 treesize of output 9 [2019-12-08 16:10:44,032 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-08 16:10:44,034 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-08 16:10:44,034 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-08 16:10:44,034 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:9 [2019-12-08 16:10:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-08 16:10:44,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1053875645] [2019-12-08 16:10:44,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-08 16:10:44,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 14] imperfect sequences [] total 23 [2019-12-08 16:10:44,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53122514] [2019-12-08 16:10:44,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-08 16:10:44,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-08 16:10:44,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-08 16:10:44,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-12-08 16:10:44,112 INFO L87 Difference]: Start difference. First operand 31 states and 30 transitions. Second operand 24 states. [2019-12-08 16:10:44,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-08 16:10:44,630 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2019-12-08 16:10:44,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-08 16:10:44,631 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-12-08 16:10:44,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-08 16:10:44,631 INFO L225 Difference]: With dead ends: 30 [2019-12-08 16:10:44,632 INFO L226 Difference]: Without dead ends: 0 [2019-12-08 16:10:44,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2019-12-08 16:10:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-08 16:10:44,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-08 16:10:44,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-08 16:10:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-08 16:10:44,633 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-12-08 16:10:44,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-08 16:10:44,634 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-08 16:10:44,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-08 16:10:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-08 16:10:44,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-08 16:10:44,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-08 16:10:44,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 04:10:44 BoogieIcfgContainer [2019-12-08 16:10:44,842 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-08 16:10:44,842 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-08 16:10:44,842 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-08 16:10:44,843 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-08 16:10:44,843 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 04:08:47" (3/4) ... [2019-12-08 16:10:44,849 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-08 16:10:44,858 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-12-08 16:10:44,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-12-08 16:10:44,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-12-08 16:10:44,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-12-08 16:10:44,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-12-08 16:10:44,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-08 16:10:44,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-12-08 16:10:44,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-12-08 16:10:44,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-12-08 16:10:44,859 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-12-08 16:10:44,860 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-12-08 16:10:44,860 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-12-08 16:10:44,860 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-12-08 16:10:44,860 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-12-08 16:10:44,860 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-12-08 16:10:44,860 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-08 16:10:44,860 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-12-08 16:10:44,860 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-12-08 16:10:44,860 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-12-08 16:10:44,861 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-12-08 16:10:44,861 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-12-08 16:10:44,861 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-12-08 16:10:44,861 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-12-08 16:10:44,861 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-12-08 16:10:44,861 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-12-08 16:10:44,861 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-08 16:10:44,861 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-12-08 16:10:44,861 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-12-08 16:10:44,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-12-08 16:10:44,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-12-08 16:10:44,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-12-08 16:10:44,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-12-08 16:10:44,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-12-08 16:10:44,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-12-08 16:10:44,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_16 [2019-12-08 16:10:44,862 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-12-08 16:10:44,863 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-12-08 16:10:44,863 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-12-08 16:10:44,863 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-12-08 16:10:44,863 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-12-08 16:10:44,863 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-12-08 16:10:44,863 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-12-08 16:10:44,863 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_16 [2019-12-08 16:10:44,863 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-08 16:10:44,863 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-12-08 16:10:44,863 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-12-08 16:10:44,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-12-08 16:10:44,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-12-08 16:10:44,872 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2019-12-08 16:10:44,872 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-12-08 16:10:44,872 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-08 16:10:44,873 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-08 16:10:44,873 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-08 16:10:44,928 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-12-08 16:10:44,928 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-08 16:10:44,930 INFO L168 Benchmark]: Toolchain (without parser) took 119619.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 328.7 MB). Free memory was 949.6 MB in the beginning and 879.7 MB in the end (delta: 69.9 MB). Peak memory consumption was 398.6 MB. Max. memory is 11.5 GB. [2019-12-08 16:10:44,930 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-08 16:10:44,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 841.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-12-08 16:10:44,931 INFO L168 Benchmark]: Boogie Preprocessor took 137.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-08 16:10:44,932 INFO L168 Benchmark]: RCFGBuilder took 1573.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.7 MB in the end (delta: 111.4 MB). Peak memory consumption was 111.4 MB. Max. memory is 11.5 GB. [2019-12-08 16:10:44,932 INFO L168 Benchmark]: TraceAbstraction took 116976.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 976.7 MB in the beginning and 888.9 MB in the end (delta: 87.8 MB). Peak memory consumption was 283.3 MB. Max. memory is 11.5 GB. [2019-12-08 16:10:44,933 INFO L168 Benchmark]: Witness Printer took 85.86 ms. Allocated memory is still 1.4 GB. Free memory was 888.9 MB in the beginning and 879.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-12-08 16:10:44,935 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 841.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 137.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1573.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.7 MB in the end (delta: 111.4 MB). Peak memory consumption was 111.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 116976.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 195.6 MB). Free memory was 976.7 MB in the beginning and 888.9 MB in the end (delta: 87.8 MB). Peak memory consumption was 283.3 MB. Max. memory is 11.5 GB. * Witness Printer took 85.86 ms. Allocated memory is still 1.4 GB. Free memory was 888.9 MB in the beginning and 879.7 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 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: 777]: 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: 769]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 769]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 769]: free always succeeds For all program executions holds that free 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 74 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 49 procedures, 347 locations, 74 error locations. Result: SAFE, OverallTime: 116.9s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 80.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 260 SDtfs, 205 SDslu, 1252 SDs, 0 SdLazy, 811 SolverSat, 94 SolverUnsat, 85 SolverUnknown, 0 SolverNotchecked, 73.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 333 SyntacticMatches, 4 SemanticMatches, 125 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 37.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 29 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 32.6s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 426 ConstructedInterpolants, 36 QuantifiedInterpolants, 75540 SizeOfPredicates, 29 NumberOfNonLiveVariables, 771 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 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...