./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer --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 b6943849e6f46346ed71c5d8e09de50318fefe6a ............................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer --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 b6943849e6f46346ed71c5d8e09de50318fefe6a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:01:52,378 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:01:52,380 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:01:52,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:01:52,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:01:52,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:01:52,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:01:52,392 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:01:52,394 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:01:52,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:01:52,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:01:52,397 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:01:52,397 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:01:52,398 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:01:52,399 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:01:52,400 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:01:52,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:01:52,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:01:52,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:01:52,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:01:52,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:01:52,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:01:52,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:01:52,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:01:52,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:01:52,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:01:52,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:01:52,412 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:01:52,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:01:52,413 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:01:52,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:01:52,414 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:01:52,414 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:01:52,415 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:01:52,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:01:52,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:01:52,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:01:52,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:01:52,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:01:52,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:01:52,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:01:52,419 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 19:01:52,430 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:01:52,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:01:52,430 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:01:52,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:01:52,431 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 19:01:52,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:01:52,431 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:01:52,431 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 19:01:52,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:01:52,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:01:52,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:01:52,432 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 19:01:52,432 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 19:01:52,432 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 19:01:52,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:01:52,432 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:01:52,432 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:01:52,432 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:01:52,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:01:52,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 19:01:52,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:01:52,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:01:52,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:01:52,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:01:52,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:01:52,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 19:01:52,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:01:52,434 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:01:52,434 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer 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 -> b6943849e6f46346ed71c5d8e09de50318fefe6a [2019-12-07 19:01:52,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:01:52,556 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:01:52,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:01:52,560 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:01:52,560 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:01:52,561 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i [2019-12-07 19:01:52,608 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/data/87c27d098/2afd35857c3b468e97d73af13264a5bd/FLAGeb61574e5 [2019-12-07 19:01:53,052 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:01:53,053 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i [2019-12-07 19:01:53,063 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/data/87c27d098/2afd35857c3b468e97d73af13264a5bd/FLAGeb61574e5 [2019-12-07 19:01:53,388 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/data/87c27d098/2afd35857c3b468e97d73af13264a5bd [2019-12-07 19:01:53,393 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:01:53,395 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 19:01:53,396 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:01:53,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:01:53,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:01:53,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:01:53" (1/1) ... [2019-12-07 19:01:53,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@518af2d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:53, skipping insertion in model container [2019-12-07 19:01:53,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:01:53" (1/1) ... [2019-12-07 19:01:53,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:01:53,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:01:53,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:01:53,707 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-07 19:01:53,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@178ac7a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:53, skipping insertion in model container [2019-12-07 19:01:53,708 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:01:53,708 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-12-07 19:01:53,710 INFO L168 Benchmark]: Toolchain (without parser) took 315.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -120.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:53,710 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:01:53,711 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -120.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:01:53,712 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -120.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 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-f470102 [2019-12-07 19:01:54,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:01:54,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:01:54,881 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:01:54,881 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:01:54,882 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:01:54,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:01:54,884 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:01:54,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:01:54,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:01:54,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:01:54,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:01:54,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:01:54,888 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:01:54,889 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:01:54,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:01:54,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:01:54,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:01:54,892 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:01:54,894 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:01:54,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:01:54,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:01:54,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:01:54,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:01:54,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:01:54,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:01:54,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:01:54,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:01:54,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:01:54,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:01:54,901 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:01:54,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:01:54,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:01:54,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:01:54,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:01:54,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:01:54,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:01:54,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:01:54,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:01:54,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:01:54,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:01:54,906 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-07 19:01:54,916 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:01:54,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:01:54,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:01:54,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:01:54,917 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 19:01:54,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:01:54,917 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:01:54,917 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 19:01:54,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:01:54,918 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:01:54,918 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:01:54,918 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 19:01:54,918 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 19:01:54,918 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 19:01:54,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:01:54,918 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:01:54,918 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 19:01:54,919 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 19:01:54,919 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:01:54,919 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:01:54,919 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:01:54,919 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 19:01:54,919 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:01:54,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:01:54,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:01:54,920 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:01:54,920 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:01:54,920 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 19:01:54,920 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 19:01:54,920 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:01:54,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:01:54,920 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer 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 -> b6943849e6f46346ed71c5d8e09de50318fefe6a [2019-12-07 19:01:55,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:01:55,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:01:55,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:01:55,095 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:01:55,096 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:01:55,096 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i [2019-12-07 19:01:55,134 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/data/9f5b823cd/be8d24d2472d4c9d8b61314154ff29b7/FLAG686b1616a [2019-12-07 19:01:55,631 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:01:55,631 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/sv-benchmarks/c/ldv-memsafety/memleaks_test20-2.i [2019-12-07 19:01:55,642 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/data/9f5b823cd/be8d24d2472d4c9d8b61314154ff29b7/FLAG686b1616a [2019-12-07 19:01:55,653 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/data/9f5b823cd/be8d24d2472d4c9d8b61314154ff29b7 [2019-12-07 19:01:55,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:01:55,655 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 19:01:55,656 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:01:55,656 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:01:55,658 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:01:55,658 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:01:55" (1/1) ... [2019-12-07 19:01:55,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5dd555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:55, skipping insertion in model container [2019-12-07 19:01:55,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:01:55" (1/1) ... [2019-12-07 19:01:55,666 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:01:55,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:01:55,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:01:55,978 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 19:01:55,986 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:01:56,019 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:01:56,024 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:01:56,058 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:01:56,113 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:01:56,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:56 WrapperNode [2019-12-07 19:01:56,113 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:01:56,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:01:56,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:01:56,114 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:01:56,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:56" (1/1) ... [2019-12-07 19:01:56,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:56" (1/1) ... [2019-12-07 19:01:56,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:56" (1/1) ... [2019-12-07 19:01:56,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:56" (1/1) ... [2019-12-07 19:01:56,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:56" (1/1) ... [2019-12-07 19:01:56,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:56" (1/1) ... [2019-12-07 19:01:56,173 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:56" (1/1) ... [2019-12-07 19:01:56,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:01:56,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:01:56,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:01:56,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:01:56,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/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-07 19:01:56,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 19:01:56,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:01:56,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 19:01:56,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 19:01:56,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 19:01:56,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 19:01:56,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 19:01:56,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 19:01:56,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 19:01:56,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-12-07 19:01:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-12-07 19:01:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-12-07 19:01:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-12-07 19:01:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-12-07 19:01:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-12-07 19:01:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-12-07 19:01:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-12-07 19:01:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-12-07 19:01:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-12-07 19:01:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-12-07 19:01:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-12-07 19:01:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-12-07 19:01:56,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-12-07 19:01:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-12-07 19:01:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-12-07 19:01:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-12-07 19:01:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-12-07 19:01:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-12-07 19:01:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-12-07 19:01:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-12-07 19:01:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-12-07 19:01:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-12-07 19:01:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-12-07 19:01:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-12-07 19:01:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-12-07 19:01:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-12-07 19:01:56,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-12-07 19:01:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-12-07 19:01:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-12-07 19:01:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-12-07 19:01:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-12-07 19:01:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-12-07 19:01:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_device [2019-12-07 19:01:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_device [2019-12-07 19:01:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_deregister_device [2019-12-07 19:01:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_20 [2019-12-07 19:01:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure free_20 [2019-12-07 19:01:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-12-07 19:01:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 19:01:56,224 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-12-07 19:01:56,225 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-07 19:01:56,225 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-12-07 19:01:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 19:01:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 19:01:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 19:01:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 19:01:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 19:01:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 19:01:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 19:01:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 19:01:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 19:01:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 19:01:56,225 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 19:01:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 19:01:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 19:01:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 19:01:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 19:01:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 19:01:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 19:01:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 19:01:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 19:01:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 19:01:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 19:01:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 19:01:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 19:01:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 19:01:56,226 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 19:01:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 19:01:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 19:01:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 19:01:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 19:01:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 19:01:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 19:01:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 19:01:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 19:01:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 19:01:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 19:01:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 19:01:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 19:01:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 19:01:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 19:01:56,227 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 19:01:56,228 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 19:01:56,228 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 19:01:56,228 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 19:01:56,228 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 19:01:56,228 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 19:01:56,228 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 19:01:56,228 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 19:01:56,228 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 19:01:56,228 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 19:01:56,228 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 19:01:56,228 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 19:01:56,228 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 19:01:56,229 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 19:01:56,229 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 19:01:56,229 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 19:01:56,229 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 19:01:56,229 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 19:01:56,229 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 19:01:56,229 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 19:01:56,229 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 19:01:56,229 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 19:01:56,229 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 19:01:56,229 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 19:01:56,230 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 19:01:56,230 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 19:01:56,230 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 19:01:56,230 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 19:01:56,230 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 19:01:56,230 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 19:01:56,230 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 19:01:56,230 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 19:01:56,230 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 19:01:56,230 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 19:01:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 19:01:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 19:01:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 19:01:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 19:01:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 19:01:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 19:01:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 19:01:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 19:01:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 19:01:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 19:01:56,231 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 19:01:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 19:01:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 19:01:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 19:01:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 19:01:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 19:01:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 19:01:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 19:01:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 19:01:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 19:01:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 19:01:56,232 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 19:01:56,233 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 19:01:56,233 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 19:01:56,233 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 19:01:56,233 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 19:01:56,233 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 19:01:56,233 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 19:01:56,233 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 19:01:56,233 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 19:01:56,233 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 19:01:56,233 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 19:01:56,233 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 19:01:56,234 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 19:01:56,234 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-07 19:01:56,234 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 19:01:56,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-12-07 19:01:56,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-12-07 19:01:56,234 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-12-07 19:01:56,234 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-12-07 19:01:56,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-07 19:01:56,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 19:01:56,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-12-07 19:01:56,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-07 19:01:56,235 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-12-07 19:01:56,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 19:01:56,235 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-12-07 19:01:56,235 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-12-07 19:01:56,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-12-07 19:01:56,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 19:01:56,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-12-07 19:01:56,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-12-07 19:01:56,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-12-07 19:01:56,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-12-07 19:01:56,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-12-07 19:01:56,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-12-07 19:01:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:01:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-12-07 19:01:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-12-07 19:01:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-12-07 19:01:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-12-07 19:01:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-12-07 19:01:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 19:01:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 19:01:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-12-07 19:01:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-12-07 19:01:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 19:01:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-12-07 19:01:56,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_device [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_device [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_deregister_device [2019-12-07 19:01:56,237 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_20 [2019-12-07 19:01:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure free_20 [2019-12-07 19:01:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-12-07 19:01:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 19:01:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 19:01:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:01:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 19:01:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:01:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 19:01:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-12-07 19:01:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-12-07 19:01:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-07 19:01:56,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-07 19:01:56,586 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:01:56,830 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 19:01:57,054 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:01:57,054 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-12-07 19:01:57,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:01:57 BoogieIcfgContainer [2019-12-07 19:01:57,055 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:01:57,056 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:01:57,056 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:01:57,058 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:01:57,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:01:55" (1/3) ... [2019-12-07 19:01:57,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1349b836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:01:57, skipping insertion in model container [2019-12-07 19:01:57,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:01:56" (2/3) ... [2019-12-07 19:01:57,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1349b836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:01:57, skipping insertion in model container [2019-12-07 19:01:57,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:01:57" (3/3) ... [2019-12-07 19:01:57,060 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test20-2.i [2019-12-07 19:01:57,067 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:01:57,072 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 74 error locations. [2019-12-07 19:01:57,079 INFO L249 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2019-12-07 19:01:57,092 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:01:57,092 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 19:01:57,092 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:01:57,092 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:01:57,092 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:01:57,093 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:01:57,093 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:01:57,093 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:01:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-12-07 19:01:57,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 19:01:57,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:57,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:57,112 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, free_20Err0ASSERT_VIOLATIONMEMORY_FREE, free_20Err1ASSERT_VIOLATIONMEMORY_FREE, free_20Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 19:01:57,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:57,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2108151956, now seen corresponding path program 1 times [2019-12-07 19:01:57,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 19:01:57,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638494146] [2019-12-07 19:01:57,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/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-07 19:01:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:57,254 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:01:57,258 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:01:57,295 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-07 19:01:57,295 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:01:57,368 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-07 19:01:57,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638494146] [2019-12-07 19:01:57,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:57,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 19:01:57,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490498717] [2019-12-07 19:01:57,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:01:57,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 19:01:57,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:01:57,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:01:57,390 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 5 states. [2019-12-07 19:01:57,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:57,423 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-12-07 19:01:57,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:01:57,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 19:01:57,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:57,434 INFO L225 Difference]: With dead ends: 50 [2019-12-07 19:01:57,434 INFO L226 Difference]: Without dead ends: 47 [2019-12-07 19:01:57,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:01:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-07 19:01:57,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-12-07 19:01:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-07 19:01:57,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2019-12-07 19:01:57,467 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 24 [2019-12-07 19:01:57,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:57,468 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2019-12-07 19:01:57,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:01:57,468 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2019-12-07 19:01:57,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 19:01:57,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:57,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:57,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 19:01:57,670 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, free_20Err0ASSERT_VIOLATIONMEMORY_FREE, free_20Err1ASSERT_VIOLATIONMEMORY_FREE, free_20Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 19:01:57,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:57,670 INFO L82 PathProgramCache]: Analyzing trace with hash -600600147, now seen corresponding path program 1 times [2019-12-07 19:01:57,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 19:01:57,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259961347] [2019-12-07 19:01:57,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/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-07 19:01:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:57,778 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 19:01:57,780 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:01:57,840 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-07 19:01:57,840 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:01:57,967 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-07 19:01:57,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259961347] [2019-12-07 19:01:57,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:57,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-12-07 19:01:57,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771512991] [2019-12-07 19:01:57,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:01:57,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 19:01:57,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:01:57,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:01:57,970 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 9 states. [2019-12-07 19:01:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:58,251 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-12-07 19:01:58,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:01:58,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2019-12-07 19:01:58,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:58,253 INFO L225 Difference]: With dead ends: 60 [2019-12-07 19:01:58,253 INFO L226 Difference]: Without dead ends: 60 [2019-12-07 19:01:58,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:01:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-07 19:01:58,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 55. [2019-12-07 19:01:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-07 19:01:58,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2019-12-07 19:01:58,260 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 24 [2019-12-07 19:01:58,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:58,260 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2019-12-07 19:01:58,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:01:58,260 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2019-12-07 19:01:58,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 19:01:58,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:58,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:58,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 19:01:58,463 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, free_20Err0ASSERT_VIOLATIONMEMORY_FREE, free_20Err1ASSERT_VIOLATIONMEMORY_FREE, free_20Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 19:01:58,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:58,463 INFO L82 PathProgramCache]: Analyzing trace with hash 976042921, now seen corresponding path program 1 times [2019-12-07 19:01:58,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 19:01:58,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572707748] [2019-12-07 19:01:58,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/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-07 19:01:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:58,588 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 19:01:58,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:01:58,649 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-07 19:01:58,649 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:01:58,795 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-07 19:01:58,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572707748] [2019-12-07 19:01:58,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:58,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-12-07 19:01:58,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476803405] [2019-12-07 19:01:58,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 19:01:58,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 19:01:58,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 19:01:58,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:01:58,797 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 13 states. [2019-12-07 19:01:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:01:58,909 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-12-07 19:01:58,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:01:58,909 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-12-07 19:01:58,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:01:58,910 INFO L225 Difference]: With dead ends: 55 [2019-12-07 19:01:58,910 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 19:01:58,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-12-07 19:01:58,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 19:01:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-12-07 19:01:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-07 19:01:58,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2019-12-07 19:01:58,915 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 28 [2019-12-07 19:01:58,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:01:58,916 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2019-12-07 19:01:58,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 19:01:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2019-12-07 19:01:58,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 19:01:58,917 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:01:58,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:01:59,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 19:01:59,119 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, free_20Err0ASSERT_VIOLATIONMEMORY_FREE, free_20Err1ASSERT_VIOLATIONMEMORY_FREE, free_20Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 19:01:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:01:59,120 INFO L82 PathProgramCache]: Analyzing trace with hash 192559894, now seen corresponding path program 1 times [2019-12-07 19:01:59,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 19:01:59,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987611635] [2019-12-07 19:01:59,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/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-07 19:01:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:01:59,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 19:01:59,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:01:59,484 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-07 19:01:59,484 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:01:59,911 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-07 19:01:59,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987611635] [2019-12-07 19:01:59,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:01:59,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 10] imperfect sequences [] total 21 [2019-12-07 19:01:59,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218272988] [2019-12-07 19:01:59,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 19:01:59,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 19:01:59,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 19:01:59,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-12-07 19:01:59,913 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 22 states. [2019-12-07 19:02:01,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:01,341 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-12-07 19:02:01,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 19:02:01,342 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2019-12-07 19:02:01,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:01,344 INFO L225 Difference]: With dead ends: 77 [2019-12-07 19:02:01,344 INFO L226 Difference]: Without dead ends: 77 [2019-12-07 19:02:01,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=1232, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 19:02:01,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-07 19:02:01,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 53. [2019-12-07 19:02:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-07 19:02:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-12-07 19:02:01,353 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 29 [2019-12-07 19:02:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:01,353 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-12-07 19:02:01,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 19:02:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-12-07 19:02:01,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 19:02:01,355 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:01,355 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:01,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 19:02:01,558 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, free_20Err0ASSERT_VIOLATIONMEMORY_FREE, free_20Err1ASSERT_VIOLATIONMEMORY_FREE, free_20Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 19:02:01,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:01,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1674389835, now seen corresponding path program 1 times [2019-12-07 19:02:01,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 19:02:01,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414885976] [2019-12-07 19:02:01,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/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-07 19:02:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:01,729 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 19:02:01,730 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:02:01,749 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-07 19:02:01,749 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:02:01,752 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:02:01,752 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:02:01,752 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:02:01,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-07 19:02:01,846 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:02:02,016 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-07 19:02:02,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414885976] [2019-12-07 19:02:02,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:02,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 13 [2019-12-07 19:02:02,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3433424] [2019-12-07 19:02:02,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 19:02:02,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 19:02:02,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 19:02:02,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:02:02,017 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 14 states. [2019-12-07 19:02:02,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:02,396 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2019-12-07 19:02:02,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 19:02:02,396 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-12-07 19:02:02,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:02,398 INFO L225 Difference]: With dead ends: 71 [2019-12-07 19:02:02,399 INFO L226 Difference]: Without dead ends: 71 [2019-12-07 19:02:02,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-07 19:02:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-07 19:02:02,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2019-12-07 19:02:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 19:02:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2019-12-07 19:02:02,409 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 30 [2019-12-07 19:02:02,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:02,410 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2019-12-07 19:02:02,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 19:02:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2019-12-07 19:02:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 19:02:02,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:02,413 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:02,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 19:02:02,615 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, free_20Err0ASSERT_VIOLATIONMEMORY_FREE, free_20Err1ASSERT_VIOLATIONMEMORY_FREE, free_20Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 19:02:02,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:02,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1885740748, now seen corresponding path program 1 times [2019-12-07 19:02:02,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 19:02:02,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271200923] [2019-12-07 19:02:02,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/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-07 19:02:02,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:02,749 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 19:02:02,750 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:02:02,771 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-07 19:02:02,771 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:02:02,814 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-07 19:02:02,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271200923] [2019-12-07 19:02:02,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:02,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 19:02:02,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096451531] [2019-12-07 19:02:02,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:02:02,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 19:02:02,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:02:02,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:02:02,815 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 5 states. [2019-12-07 19:02:02,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:02,824 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-12-07 19:02:02,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:02:02,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 19:02:02,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:02,825 INFO L225 Difference]: With dead ends: 52 [2019-12-07 19:02:02,825 INFO L226 Difference]: Without dead ends: 52 [2019-12-07 19:02:02,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:02:02,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-07 19:02:02,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-07 19:02:02,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 19:02:02,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-12-07 19:02:02,828 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 30 [2019-12-07 19:02:02,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:02,828 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-12-07 19:02:02,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:02:02,828 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-12-07 19:02:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 19:02:02,829 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:02,829 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:03,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 19:02:03,031 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, free_20Err0ASSERT_VIOLATIONMEMORY_FREE, free_20Err1ASSERT_VIOLATIONMEMORY_FREE, free_20Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 19:02:03,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:03,032 INFO L82 PathProgramCache]: Analyzing trace with hash 844909557, now seen corresponding path program 1 times [2019-12-07 19:02:03,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 19:02:03,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013236262] [2019-12-07 19:02:03,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/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-07 19:02:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:03,160 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 19:02:03,161 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:02:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:02:03,167 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:02:03,237 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-07 19:02:03,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013236262] [2019-12-07 19:02:03,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:03,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 19:02:03,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655751223] [2019-12-07 19:02:03,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:02:03,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 19:02:03,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:02:03,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:02:03,238 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 3 states. [2019-12-07 19:02:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:03,262 INFO L93 Difference]: Finished difference Result 56 states and 55 transitions. [2019-12-07 19:02:03,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:02:03,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 19:02:03,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:03,263 INFO L225 Difference]: With dead ends: 56 [2019-12-07 19:02:03,263 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 19:02:03,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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-07 19:02:03,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 19:02:03,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-12-07 19:02:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 19:02:03,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 36 transitions. [2019-12-07 19:02:03,266 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 36 transitions. Word has length 29 [2019-12-07 19:02:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:03,266 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 36 transitions. [2019-12-07 19:02:03,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:02:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 36 transitions. [2019-12-07 19:02:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 19:02:03,267 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:02:03,267 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:02:03,467 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 19:02:03,468 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, free_20Err0ASSERT_VIOLATIONMEMORY_FREE, free_20Err1ASSERT_VIOLATIONMEMORY_FREE, free_20Err2ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 19:02:03,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:02:03,469 INFO L82 PathProgramCache]: Analyzing trace with hash -548127480, now seen corresponding path program 1 times [2019-12-07 19:02:03,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 19:02:03,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183133594] [2019-12-07 19:02:03,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/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-07 19:02:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:02:03,635 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 19:02:03,637 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:02:03,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2019-12-07 19:02:03,667 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:02:03,670 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:02:03,671 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-07 19:02:03,671 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-12-07 19:02:03,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 19:02:03,719 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:02:03,721 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:02:03,721 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:02:03,721 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-12-07 19:02:11,824 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-07 19:02:11,824 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:02:30,845 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_18|]} [2019-12-07 19:02:30,849 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2))))) (not (= v_prenex_1 (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_17|))) is different from false [2019-12-07 19:02:30,852 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2))))) (not (= v_prenex_1 (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_17|))) is different from true [2019-12-07 19:02:30,856 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_18|]} [2019-12-07 19:02:30,861 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_18|]} [2019-12-07 19:02:30,866 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2))))) (not (= v_prenex_1 (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (= (store |c_#valid| c_free_20_~p~1.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|))) is different from false [2019-12-07 19:02:30,870 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2))))) (not (= v_prenex_1 (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (= (store |c_#valid| c_free_20_~p~1.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|))) is different from true [2019-12-07 19:02:30,875 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_18|]} [2019-12-07 19:02:30,879 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_18|]} [2019-12-07 19:02:30,886 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_18|]} [2019-12-07 19:02:30,890 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2))))) (not (= v_prenex_1 (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (= (store |c_#valid| c_free_20_~dev~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|))) is different from false [2019-12-07 19:02:30,895 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2))))) (not (= v_prenex_1 (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (= (store |c_#valid| c_free_20_~dev~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|))) is different from true [2019-12-07 19:02:30,901 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_18|]} [2019-12-07 19:02:30,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2))))) (not (= v_prenex_1 (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| |c_free_20_#t~ret39.base| (_ bv0 1))))) is different from false [2019-12-07 19:02:30,908 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2))))) (not (= v_prenex_1 (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| |c_free_20_#t~ret39.base| (_ bv0 1))))) is different from true [2019-12-07 19:02:30,921 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_18|]} [2019-12-07 19:02:30,925 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2))))) (not (= v_prenex_1 (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))))) is different from false [2019-12-07 19:02:30,928 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2))))) (not (= v_prenex_1 (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))))) is different from true [2019-12-07 19:02:30,932 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-12-07 19:02:30,941 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_1], 5=[v_prenex_4]} [2019-12-07 19:02:30,943 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_18|]} [2019-12-07 19:02:30,951 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_19| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1))))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_19| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2)))))) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1)))))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_3 (store |c_#valid| |c_ldv_get_device_#res.base| (_ bv0 1))) (exists ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_5 (store |v_old(#valid)_BEFORE_CALL_19| c_~saved_device_20~0.base (_ bv0 1)))) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_4 v_prenex_7))) (= v_prenex_5 (store v_prenex_4 v_prenex_7 (_ bv0 1))))))) (exists ((v_prenex_6 (_ BitVec 32))) (and (not (= v_prenex_3 (store v_prenex_4 v_prenex_6 (_ bv0 1)))) (= (_ bv0 1) (select v_prenex_4 v_prenex_6)))))))) is different from false [2019-12-07 19:02:30,958 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_19| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1))))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_19| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2)))))) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1)))))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_3 (store |c_#valid| |c_ldv_get_device_#res.base| (_ bv0 1))) (exists ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_5 (store |v_old(#valid)_BEFORE_CALL_19| c_~saved_device_20~0.base (_ bv0 1)))) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_4 v_prenex_7))) (= v_prenex_5 (store v_prenex_4 v_prenex_7 (_ bv0 1))))))) (exists ((v_prenex_6 (_ BitVec 32))) (and (not (= v_prenex_3 (store v_prenex_4 v_prenex_6 (_ bv0 1)))) (= (_ bv0 1) (select v_prenex_4 v_prenex_6)))))))) is different from true [2019-12-07 19:02:30,961 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-12-07 19:02:30,968 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_1], 5=[v_prenex_4]} [2019-12-07 19:02:30,970 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_18|]} [2019-12-07 19:02:30,975 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-12-07 19:02:30,980 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3, v_prenex_1], 5=[v_prenex_4]} [2019-12-07 19:02:30,981 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_18|]} [2019-12-07 19:02:30,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_19| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1))))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_19| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2)))))) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1)))))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_5 (store |v_old(#valid)_BEFORE_CALL_19| c_~saved_device_20~0.base (_ bv0 1)))) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_4 v_prenex_7))) (= v_prenex_5 (store v_prenex_4 v_prenex_7 (_ bv0 1))))))) (= v_prenex_3 (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_6 (_ BitVec 32))) (and (not (= v_prenex_3 (store v_prenex_4 v_prenex_6 (_ bv0 1)))) (= (_ bv0 1) (select v_prenex_4 v_prenex_6)))))))) is different from false [2019-12-07 19:02:30,996 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_19| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1))))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_19| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2)))))) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1)))))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_5 (store |v_old(#valid)_BEFORE_CALL_19| c_~saved_device_20~0.base (_ bv0 1)))) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_4 v_prenex_7))) (= v_prenex_5 (store v_prenex_4 v_prenex_7 (_ bv0 1))))))) (= v_prenex_3 (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_6 (_ BitVec 32))) (and (not (= v_prenex_3 (store v_prenex_4 v_prenex_6 (_ bv0 1)))) (= (_ bv0 1) (select v_prenex_4 v_prenex_6)))))))) is different from true [2019-12-07 19:02:31,151 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 19:02:31,153 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_20|]} [2019-12-07 19:02:31,156 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (= (select |c_old(#valid)| v_alloc_20_~p~0.base_49) (_ bv0 1)) (not (= v_prenex_8 (store |c_old(#valid)| v_alloc_20_~p~0.base_49 (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))))) is different from false [2019-12-07 19:02:31,159 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (= (select |c_old(#valid)| v_alloc_20_~p~0.base_49) (_ bv0 1)) (not (= v_prenex_8 (store |c_old(#valid)| v_alloc_20_~p~0.base_49 (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))))) is different from true [2019-12-07 19:02:31,160 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 19:02:31,163 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_20|]} [2019-12-07 19:02:31,180 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 19:02:31,182 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_20|]} [2019-12-07 19:02:31,185 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| c_alloc_20_~p~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (= (select |c_old(#valid)| v_alloc_20_~p~0.base_49) (_ bv0 1)) (not (= v_prenex_8 (store |c_old(#valid)| v_alloc_20_~p~0.base_49 (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))))) is different from false [2019-12-07 19:02:31,189 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| c_alloc_20_~p~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (= (select |c_old(#valid)| v_alloc_20_~p~0.base_49) (_ bv0 1)) (not (= v_prenex_8 (store |c_old(#valid)| v_alloc_20_~p~0.base_49 (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))))) is different from true [2019-12-07 19:02:31,191 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 19:02:31,196 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 18 [2019-12-07 19:02:31,199 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_8, v_prenex_10], 5=[v_prenex_11]} [2019-12-07 19:02:31,202 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_20|, |v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 19:02:31,208 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_21| v_alloc_20_~p~0.base_49 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_alloc_20_~p~0.base_49)))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (exists ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_14 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_14))) (exists ((v_prenex_15 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_11 v_prenex_15)) (not (= (store v_prenex_11 v_prenex_15 (_ bv0 1)) v_prenex_13)))) (= v_prenex_13 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_14 (_ bv0 1))))) (not (= v_prenex_10 (store |c_#valid| |c_ldv_register_device_#in~dev.base| (_ bv0 1)))) (forall ((v_prenex_12 (_ BitVec 32))) (or (= (store v_prenex_11 v_prenex_12 (_ bv0 1)) v_prenex_10) (not (= (_ bv0 1) (select v_prenex_11 v_prenex_12))))))))) is different from false [2019-12-07 19:02:31,214 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_21| v_alloc_20_~p~0.base_49 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_alloc_20_~p~0.base_49)))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (exists ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_14 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_14))) (exists ((v_prenex_15 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_11 v_prenex_15)) (not (= (store v_prenex_11 v_prenex_15 (_ bv0 1)) v_prenex_13)))) (= v_prenex_13 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_14 (_ bv0 1))))) (not (= v_prenex_10 (store |c_#valid| |c_ldv_register_device_#in~dev.base| (_ bv0 1)))) (forall ((v_prenex_12 (_ BitVec 32))) (or (= (store v_prenex_11 v_prenex_12 (_ bv0 1)) v_prenex_10) (not (= (_ bv0 1) (select v_prenex_11 v_prenex_12))))))))) is different from true [2019-12-07 19:02:31,218 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-12-07 19:02:31,222 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 19:02:31,224 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_8, v_prenex_10], 5=[v_prenex_11]} [2019-12-07 19:02:31,226 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_20|, |v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 19:02:31,230 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-12-07 19:02:31,233 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 19:02:31,235 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_8, v_prenex_10], 5=[v_prenex_11]} [2019-12-07 19:02:31,237 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_20|, |v_old(#valid)_BEFORE_CALL_21|]} [2019-12-07 19:02:31,244 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| |c_ldv_register_device_#in~dev.base| (_ bv0 1))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_21| v_alloc_20_~p~0.base_49 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_alloc_20_~p~0.base_49)))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (exists ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_14 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_14))) (exists ((v_prenex_15 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_11 v_prenex_15)) (not (= (store v_prenex_11 v_prenex_15 (_ bv0 1)) v_prenex_13)))) (= v_prenex_13 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_14 (_ bv0 1))))) (not (= v_prenex_10 (store |c_#valid| |c_ldv_register_device_#in~dev.base| (_ bv0 1)))) (forall ((v_prenex_12 (_ BitVec 32))) (or (= (store v_prenex_11 v_prenex_12 (_ bv0 1)) v_prenex_10) (not (= (_ bv0 1) (select v_prenex_11 v_prenex_12))))))))) is different from false [2019-12-07 19:02:31,252 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| |c_ldv_register_device_#in~dev.base| (_ bv0 1))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_21| v_alloc_20_~p~0.base_49 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_alloc_20_~p~0.base_49)))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (exists ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_14 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_14))) (exists ((v_prenex_15 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_11 v_prenex_15)) (not (= (store v_prenex_11 v_prenex_15 (_ bv0 1)) v_prenex_13)))) (= v_prenex_13 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_14 (_ bv0 1))))) (not (= v_prenex_10 (store |c_#valid| |c_ldv_register_device_#in~dev.base| (_ bv0 1)))) (forall ((v_prenex_12 (_ BitVec 32))) (or (= (store v_prenex_11 v_prenex_12 (_ bv0 1)) v_prenex_10) (not (= (_ bv0 1) (select v_prenex_11 v_prenex_12))))))))) is different from true [2019-12-07 19:02:31,254 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 19:02:31,257 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_20|]} [2019-12-07 19:02:31,259 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 19:02:31,262 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_20|]} [2019-12-07 19:02:31,266 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (= (select |c_old(#valid)| v_alloc_20_~p~0.base_49) (_ bv0 1)) (not (= v_prenex_8 (store |c_old(#valid)| v_alloc_20_~p~0.base_49 (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (= (store |c_#valid| |c_alloc_20_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|))) is different from false [2019-12-07 19:02:31,271 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (= (select |c_old(#valid)| v_alloc_20_~p~0.base_49) (_ bv0 1)) (not (= v_prenex_8 (store |c_old(#valid)| v_alloc_20_~p~0.base_49 (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (= (store |c_#valid| |c_alloc_20_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|))) is different from true [2019-12-07 19:02:31,301 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 19:02:31,303 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_20|]} [2019-12-07 19:02:31,309 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (= (select |c_old(#valid)| v_alloc_20_~p~0.base_49) (_ bv0 1)) (not (= v_prenex_8 (store |c_old(#valid)| v_alloc_20_~p~0.base_49 (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_68|))) (= (store |c_#valid| |v_ldv_malloc_#res.base_68| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|))) is different from true [2019-12-07 19:02:31,315 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-12-07 19:02:31,345 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 19:02:31,346 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_16, v_prenex_8], 5=[v_prenex_17]} [2019-12-07 19:02:31,348 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|], 5=[|v_old(#valid)_BEFORE_CALL_20|]} [2019-12-07 19:02:31,357 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_22| (Array (_ BitVec 32) (_ BitVec 1)))) (or (forall ((v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_18 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_17 v_prenex_18)) (not (= v_prenex_16 (store v_prenex_17 v_prenex_18 (_ bv0 1)))))) (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_prenex_20)) (not (= v_prenex_19 (store |v_old(#valid)_BEFORE_CALL_22| v_prenex_20 (_ bv0 1)))) (forall ((v_prenex_21 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_17 v_prenex_21))) (= v_prenex_19 (store v_prenex_17 v_prenex_21 (_ bv0 1))))))) (= v_prenex_16 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))) (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49 (_ bv0 1)) v_prenex_8) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49))) (exists ((v_prenex_9 (_ BitVec 32))) (and (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9)))))) (not (= (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|)) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)) (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1))))))))) is different from false [2019-12-07 19:02:31,364 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_22| (Array (_ BitVec 32) (_ BitVec 1)))) (or (forall ((v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_18 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_17 v_prenex_18)) (not (= v_prenex_16 (store v_prenex_17 v_prenex_18 (_ bv0 1)))))) (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_prenex_20)) (not (= v_prenex_19 (store |v_old(#valid)_BEFORE_CALL_22| v_prenex_20 (_ bv0 1)))) (forall ((v_prenex_21 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_17 v_prenex_21))) (= v_prenex_19 (store v_prenex_17 v_prenex_21 (_ bv0 1))))))) (= v_prenex_16 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))) (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49 (_ bv0 1)) v_prenex_8) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49))) (exists ((v_prenex_9 (_ BitVec 32))) (and (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9)))))) (not (= (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|)) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)) (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1))))))))) is different from true [2019-12-07 19:02:31,367 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 19:02:31,373 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 24 [2019-12-07 19:02:31,377 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|, v_prenex_19], 5=[|v_old(#valid)_BEFORE_CALL_20|]} [2019-12-07 19:02:31,378 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_16], 5=[v_prenex_17, |v_old(#valid)_BEFORE_CALL_22|]} [2019-12-07 19:02:31,386 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_22| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_18 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_17 v_prenex_18)) (not (= v_prenex_16 (store v_prenex_17 v_prenex_18 (_ bv0 1)))))) (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49 (_ bv0 1)) v_prenex_8) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49))) (exists ((v_prenex_9 (_ BitVec 32))) (and (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9)))))) (not (= (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|)) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)) (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1))))))) (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_prenex_20)) (not (= v_prenex_19 (store |v_old(#valid)_BEFORE_CALL_22| v_prenex_20 (_ bv0 1)))) (forall ((v_prenex_21 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_17 v_prenex_21))) (= v_prenex_19 (store v_prenex_17 v_prenex_21 (_ bv0 1))))))) (= v_prenex_16 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))) is different from false [2019-12-07 19:02:31,395 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_22| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_18 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_17 v_prenex_18)) (not (= v_prenex_16 (store v_prenex_17 v_prenex_18 (_ bv0 1)))))) (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49 (_ bv0 1)) v_prenex_8) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49))) (exists ((v_prenex_9 (_ BitVec 32))) (and (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9)))))) (not (= (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|)) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)) (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1))))))) (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_prenex_20)) (not (= v_prenex_19 (store |v_old(#valid)_BEFORE_CALL_22| v_prenex_20 (_ bv0 1)))) (forall ((v_prenex_21 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_17 v_prenex_21))) (= v_prenex_19 (store v_prenex_17 v_prenex_21 (_ bv0 1))))))) (= v_prenex_16 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))) is different from true [2019-12-07 19:02:31,399 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-12-07 19:02:31,403 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 19:02:31,405 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|, v_prenex_19], 5=[|v_old(#valid)_BEFORE_CALL_20|]} [2019-12-07 19:02:31,407 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_16], 5=[v_prenex_17, |v_old(#valid)_BEFORE_CALL_22|]} [2019-12-07 19:02:31,422 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_22| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_69| (_ BitVec 32))) (or (= v_prenex_16 (store |c_#valid| |v_ldv_malloc_#res.base_69| (_ bv0 1))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_69|) (_ bv0 1))) (exists ((v_prenex_18 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_17 v_prenex_18)) (not (= v_prenex_16 (store v_prenex_17 v_prenex_18 (_ bv0 1)))))) (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49 (_ bv0 1)) v_prenex_8) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49))) (exists ((v_prenex_9 (_ BitVec 32))) (and (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9)))))) (not (= (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|)) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)) (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1))))))) (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_prenex_20)) (not (= v_prenex_19 (store |v_old(#valid)_BEFORE_CALL_22| v_prenex_20 (_ bv0 1)))) (forall ((v_prenex_21 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_17 v_prenex_21))) (= v_prenex_19 (store v_prenex_17 v_prenex_21 (_ bv0 1))))))))) is different from false [2019-12-07 19:02:31,433 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_22| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_69| (_ BitVec 32))) (or (= v_prenex_16 (store |c_#valid| |v_ldv_malloc_#res.base_69| (_ bv0 1))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_69|) (_ bv0 1))) (exists ((v_prenex_18 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_17 v_prenex_18)) (not (= v_prenex_16 (store v_prenex_17 v_prenex_18 (_ bv0 1)))))) (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49 (_ bv0 1)) v_prenex_8) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49))) (exists ((v_prenex_9 (_ BitVec 32))) (and (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9)))))) (not (= (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|)) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)) (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1))))))) (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_prenex_20)) (not (= v_prenex_19 (store |v_old(#valid)_BEFORE_CALL_22| v_prenex_20 (_ bv0 1)))) (forall ((v_prenex_21 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_17 v_prenex_21))) (= v_prenex_19 (store v_prenex_17 v_prenex_21 (_ bv0 1))))))))) is different from true [2019-12-07 19:02:31,436 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-12-07 19:02:31,440 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2019-12-07 19:02:31,442 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_17|, v_prenex_19], 5=[|v_old(#valid)_BEFORE_CALL_20|]} [2019-12-07 19:02:31,443 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_16], 5=[v_prenex_17, |v_old(#valid)_BEFORE_CALL_22|]} [2019-12-07 19:02:31,466 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-07 19:02:31,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183133594] [2019-12-07 19:02:31,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:02:31,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14, 22] imperfect sequences [] total 34 [2019-12-07 19:02:31,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32575517] [2019-12-07 19:02:31,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-07 19:02:31,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 19:02:31,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-07 19:02:31,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=245, Unknown=72, NotChecked=784, Total=1190 [2019-12-07 19:02:31,468 INFO L87 Difference]: Start difference. First operand 37 states and 36 transitions. Second operand 35 states. [2019-12-07 19:02:44,101 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_22| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_69| (_ BitVec 32))) (or (= v_prenex_16 (store |c_#valid| |v_ldv_malloc_#res.base_69| (_ bv0 1))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_69|) (_ bv0 1))) (exists ((v_prenex_18 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_17 v_prenex_18)) (not (= v_prenex_16 (store v_prenex_17 v_prenex_18 (_ bv0 1)))))) (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49 (_ bv0 1)) v_prenex_8) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49))) (exists ((v_prenex_9 (_ BitVec 32))) (and (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9)))))) (not (= (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|)) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)) (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1))))))) (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_prenex_20)) (not (= v_prenex_19 (store |v_old(#valid)_BEFORE_CALL_22| v_prenex_20 (_ bv0 1)))) (forall ((v_prenex_21 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_17 v_prenex_21))) (= v_prenex_19 (store v_prenex_17 v_prenex_21 (_ bv0 1))))))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2019-12-07 19:02:44,111 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_22| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_18 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_17 v_prenex_18)) (not (= v_prenex_16 (store v_prenex_17 v_prenex_18 (_ bv0 1)))))) (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49 (_ bv0 1)) v_prenex_8) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49))) (exists ((v_prenex_9 (_ BitVec 32))) (and (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9)))))) (not (= (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|)) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)) (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1))))))) (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_prenex_20)) (not (= v_prenex_19 (store |v_old(#valid)_BEFORE_CALL_22| v_prenex_20 (_ bv0 1)))) (forall ((v_prenex_21 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_17 v_prenex_21))) (= v_prenex_19 (store v_prenex_17 v_prenex_21 (_ bv0 1))))))) (= v_prenex_16 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))) (= (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-07 19:02:44,119 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_22| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_18 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_17 v_prenex_18)) (not (= v_prenex_16 (store v_prenex_17 v_prenex_18 (_ bv0 1)))))) (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49 (_ bv0 1)) v_prenex_8) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49))) (exists ((v_prenex_9 (_ BitVec 32))) (and (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9)))))) (not (= (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|)) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)) (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1))))))) (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_prenex_20)) (not (= v_prenex_19 (store |v_old(#valid)_BEFORE_CALL_22| v_prenex_20 (_ bv0 1)))) (forall ((v_prenex_21 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_17 v_prenex_21))) (= v_prenex_19 (store v_prenex_17 v_prenex_21 (_ bv0 1))))))) (= v_prenex_16 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))) (= (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 true [2019-12-07 19:02:44,126 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_22| (Array (_ BitVec 32) (_ BitVec 1)))) (or (forall ((v_prenex_16 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_17 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_18 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_17 v_prenex_18)) (not (= v_prenex_16 (store v_prenex_17 v_prenex_18 (_ bv0 1)))))) (exists ((v_prenex_19 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_20 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_prenex_20)) (not (= v_prenex_19 (store |v_old(#valid)_BEFORE_CALL_22| v_prenex_20 (_ bv0 1)))) (forall ((v_prenex_21 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_17 v_prenex_21))) (= v_prenex_19 (store v_prenex_17 v_prenex_21 (_ bv0 1))))))) (= v_prenex_16 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))) (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (or (= (store |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49 (_ bv0 1)) v_prenex_8) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_22| v_alloc_20_~p~0.base_49))) (exists ((v_prenex_9 (_ BitVec 32))) (and (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9)))))) (not (= (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|)) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)) (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1))))))))) (= (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-07 19:02:44,134 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_alloc_20_#t~ret38.base| (_ bv1 1))) (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (= (select |c_old(#valid)| v_alloc_20_~p~0.base_49) (_ bv0 1)) (not (= v_prenex_8 (store |c_old(#valid)| v_alloc_20_~p~0.base_49 (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (= (store |c_#valid| |c_alloc_20_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|))) (= (select |c_old(#valid)| |c_alloc_20_#t~ret38.base|) (_ bv0 1))) is different from false [2019-12-07 19:02:44,142 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| c_alloc_20_~p~0.base) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| c_alloc_20_~p~0.base (_ bv1 1))) (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (store |c_#valid| c_alloc_20_~p~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (= (select |c_old(#valid)| v_alloc_20_~p~0.base_49) (_ bv0 1)) (not (= v_prenex_8 (store |c_old(#valid)| v_alloc_20_~p~0.base_49 (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1))))))))) is different from false [2019-12-07 19:02:44,154 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| |c_ldv_register_device_#in~dev.base| (_ bv0 1))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_21| v_alloc_20_~p~0.base_49 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_alloc_20_~p~0.base_49)))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (exists ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_14 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_14))) (exists ((v_prenex_15 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_11 v_prenex_15)) (not (= (store v_prenex_11 v_prenex_15 (_ bv0 1)) v_prenex_13)))) (= v_prenex_13 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_14 (_ bv0 1))))) (not (= v_prenex_10 (store |c_#valid| |c_ldv_register_device_#in~dev.base| (_ bv0 1)))) (forall ((v_prenex_12 (_ BitVec 32))) (or (= (store v_prenex_11 v_prenex_12 (_ bv0 1)) v_prenex_10) (not (= (_ bv0 1) (select v_prenex_11 v_prenex_12))))))))) (exists ((v_alloc_20_~p~0.base_BEFORE_CALL_5 (_ BitVec 32))) (= (_ bv1 1) (select |c_#valid| v_alloc_20_~p~0.base_BEFORE_CALL_5)))) is different from false [2019-12-07 19:02:44,166 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_21| v_alloc_20_~p~0.base_49 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_alloc_20_~p~0.base_49)))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (exists ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_14 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_14))) (exists ((v_prenex_15 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_11 v_prenex_15)) (not (= (store v_prenex_11 v_prenex_15 (_ bv0 1)) v_prenex_13)))) (= v_prenex_13 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_14 (_ bv0 1))))) (not (= v_prenex_10 (store |c_#valid| |c_ldv_register_device_#in~dev.base| (_ bv0 1)))) (forall ((v_prenex_12 (_ BitVec 32))) (or (= (store v_prenex_11 v_prenex_12 (_ bv0 1)) v_prenex_10) (not (= (_ bv0 1) (select v_prenex_11 v_prenex_12))))))))) (= c_~saved_device_20~0.base |c_ldv_register_device_#in~dev.base|) (exists ((v_alloc_20_~p~0.base_BEFORE_CALL_5 (_ BitVec 32))) (= (_ bv1 1) (select |c_#valid| v_alloc_20_~p~0.base_BEFORE_CALL_5)))) is different from false [2019-12-07 19:02:44,176 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_21| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_21| v_alloc_20_~p~0.base_49 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_alloc_20_~p~0.base_49)))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (exists ((v_prenex_11 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_10 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_13 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_14 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_21| v_prenex_14))) (exists ((v_prenex_15 (_ BitVec 32))) (and (= (_ bv0 1) (select v_prenex_11 v_prenex_15)) (not (= (store v_prenex_11 v_prenex_15 (_ bv0 1)) v_prenex_13)))) (= v_prenex_13 (store |v_old(#valid)_BEFORE_CALL_21| v_prenex_14 (_ bv0 1))))) (not (= v_prenex_10 (store |c_#valid| |c_ldv_register_device_#in~dev.base| (_ bv0 1)))) (forall ((v_prenex_12 (_ BitVec 32))) (or (= (store v_prenex_11 v_prenex_12 (_ bv0 1)) v_prenex_10) (not (= (_ bv0 1) (select v_prenex_11 v_prenex_12))))))))) (= c_~saved_device_20~0.base |c_ldv_register_device_#in~dev.base|) (exists ((v_alloc_20_~p~0.base_BEFORE_CALL_5 (_ BitVec 32))) (= (_ bv1 1) (select |c_#valid| v_alloc_20_~p~0.base_BEFORE_CALL_5)))) is different from true [2019-12-07 19:02:44,182 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv1 1))) (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_20| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_alloc_20_~p~0.base_49 (_ BitVec 32))) (and (forall ((v_prenex_9 (_ BitVec 32))) (or (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_20| v_prenex_9 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_prenex_9))))) (= (select |c_old(#valid)| v_alloc_20_~p~0.base_49) (_ bv0 1)) (not (= v_prenex_8 (store |c_old(#valid)| v_alloc_20_~p~0.base_49 (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_20| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))))) (= (select |c_old(#valid)| c_~saved_device_20~0.base) (_ bv0 1))) is different from false [2019-12-07 19:02:46,228 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2))))) (not (= v_prenex_1 (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))))) (= |c_#valid| |c_old(#valid)|) (exists ((v_alloc_20_~p~0.base_BEFORE_CALL_5 (_ BitVec 32))) (= (_ bv1 1) (select |c_#valid| v_alloc_20_~p~0.base_BEFORE_CALL_5)))) is different from false [2019-12-07 19:02:46,237 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_19| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1))))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_19| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2)))))) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1)))))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_3 (store |c_#valid| |c_ldv_get_device_#res.base| (_ bv0 1))) (exists ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_5 (store |v_old(#valid)_BEFORE_CALL_19| c_~saved_device_20~0.base (_ bv0 1)))) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_4 v_prenex_7))) (= v_prenex_5 (store v_prenex_4 v_prenex_7 (_ bv0 1))))))) (exists ((v_prenex_6 (_ BitVec 32))) (and (not (= v_prenex_3 (store v_prenex_4 v_prenex_6 (_ bv0 1)))) (= (_ bv0 1) (select v_prenex_4 v_prenex_6)))))))) (= |c_ldv_get_device_#res.base| c_~saved_device_20~0.base)) is different from false [2019-12-07 19:02:46,244 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_19| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13))) (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1))))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_19| c_~saved_device_20~0.base (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1)))) (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2)))))) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| c_~saved_device_20~0.base (_ bv0 1)))))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_4 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_3 (store |c_#valid| |c_ldv_get_device_#res.base| (_ bv0 1))) (exists ((v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_5 (store |v_old(#valid)_BEFORE_CALL_19| c_~saved_device_20~0.base (_ bv0 1)))) (forall ((v_prenex_7 (_ BitVec 32))) (or (not (= (_ bv0 1) (select v_prenex_4 v_prenex_7))) (= v_prenex_5 (store v_prenex_4 v_prenex_7 (_ bv0 1))))))) (exists ((v_prenex_6 (_ BitVec 32))) (and (not (= v_prenex_3 (store v_prenex_4 v_prenex_6 (_ bv0 1)))) (= (_ bv0 1) (select v_prenex_4 v_prenex_6)))))))) (= |c_ldv_get_device_#res.base| c_~saved_device_20~0.base)) is different from true [2019-12-07 19:02:46,248 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= c_~saved_device_20~0.base |c_free_20_#t~ret39.base|) (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2))))) (not (= v_prenex_1 (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (= |v_old(#valid)_BEFORE_CALL_17| (store |c_#valid| |c_free_20_#t~ret39.base| (_ bv0 1)))))) is different from false [2019-12-07 19:02:46,254 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2))))) (not (= v_prenex_1 (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (= (store |c_#valid| c_free_20_~dev~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|))) (= |c_#valid| |c_old(#valid)|) (= c_~saved_device_20~0.base c_free_20_~dev~0.base)) is different from false [2019-12-07 19:02:46,260 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2))))) (not (= v_prenex_1 (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (= (store |c_#valid| c_free_20_~p~1.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_17|))) (= c_~saved_device_20~0.base c_free_20_~p~1.base) (= |c_#valid| |c_old(#valid)|)) is different from false [2019-12-07 19:02:46,266 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_17| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_18| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_prenex_2 (_ BitVec 32))) (or (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_18| v_prenex_2 (_ bv0 1))) (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_prenex_2))))) (not (= v_prenex_1 (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))))) (exists ((v_free_20_~__mptr~4.base_13 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13)) (not (= |v_old(#valid)_BEFORE_CALL_17| (store |v_old(#valid)_BEFORE_CALL_18| v_free_20_~__mptr~4.base_13 (_ bv0 1)))))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_17|))) (= |c_#valid| (store |c_old(#valid)| c_~saved_device_20~0.base (_ bv0 1)))) is different from false [2019-12-07 19:02:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:02:48,357 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2019-12-07 19:02:48,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 19:02:48,358 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2019-12-07 19:02:48,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:02:48,358 INFO L225 Difference]: With dead ends: 36 [2019-12-07 19:02:48,358 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 19:02:48,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 30 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 33.5s TimeCoverageRelationStatistics Valid=139, Invalid=335, Unknown=108, NotChecked=2070, Total=2652 [2019-12-07 19:02:48,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 19:02:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 19:02:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 19:02:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 19:02:48,360 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-12-07 19:02:48,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:02:48,360 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 19:02:48,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-07 19:02:48,360 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 19:02:48,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 19:02:48,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 19:02:48,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:02:48 BoogieIcfgContainer [2019-12-07 19:02:48,571 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:02:48,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:02:48,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:02:48,572 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:02:48,572 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:01:57" (3/4) ... [2019-12-07 19:02:48,577 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 19:02:48,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-12-07 19:02:48,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_20 [2019-12-07 19:02:48,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 19:02:48,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-12-07 19:02:48,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_register_device [2019-12-07 19:02:48,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-12-07 19:02:48,589 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-12-07 19:02:48,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 19:02:48,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_deregister_device [2019-12-07 19:02:48,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-12-07 19:02:48,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-12-07 19:02:48,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-12-07 19:02:48,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-12-07 19:02:48,590 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-12-07 19:02:48,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-12-07 19:02:48,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-12-07 19:02:48,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-12-07 19:02:48,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-12-07 19:02:48,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 19:02:48,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-12-07 19:02:48,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-12-07 19:02:48,591 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-12-07 19:02:48,592 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-12-07 19:02:48,592 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_get_device [2019-12-07 19:02:48,592 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-12-07 19:02:48,592 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-12-07 19:02:48,592 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-12-07 19:02:48,592 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-12-07 19:02:48,592 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-12-07 19:02:48,592 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 19:02:48,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-12-07 19:02:48,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-12-07 19:02:48,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-12-07 19:02:48,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-12-07 19:02:48,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-12-07 19:02:48,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-12-07 19:02:48,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-12-07 19:02:48,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-12-07 19:02:48,593 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-12-07 19:02:48,594 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-12-07 19:02:48,594 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-12-07 19:02:48,594 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-12-07 19:02:48,594 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-12-07 19:02:48,594 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-12-07 19:02:48,594 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-12-07 19:02:48,594 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 19:02:48,595 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_20 [2019-12-07 19:02:48,595 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-12-07 19:02:48,595 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-12-07 19:02:48,595 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-12-07 19:02:48,595 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-12-07 19:02:48,604 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 40 nodes and edges [2019-12-07 19:02:48,604 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 19:02:48,605 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 19:02:48,605 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 19:02:48,605 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 19:02:48,648 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f242342e-3a46-4f4e-8681-553d7b01e466/bin/uautomizer/witness.graphml [2019-12-07 19:02:48,648 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:02:48,649 INFO L168 Benchmark]: Toolchain (without parser) took 52993.64 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.3 MB). Free memory was 948.4 MB in the beginning and 1.3 GB in the end (delta: -328.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:02:48,649 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:02:48,650 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -121.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:48,650 INFO L168 Benchmark]: Boogie Preprocessor took 66.44 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-07 19:02:48,650 INFO L168 Benchmark]: RCFGBuilder took 874.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.2 MB in the end (delta: 113.8 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:48,650 INFO L168 Benchmark]: TraceAbstraction took 51514.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 956.2 MB in the beginning and 1.3 GB in the end (delta: -331.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:02:48,651 INFO L168 Benchmark]: Witness Printer took 76.65 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:02:48,652 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 457.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -121.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.44 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 874.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.2 MB in the end (delta: 113.8 MB). Peak memory consumption was 113.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 51514.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.6 MB). Free memory was 956.2 MB in the beginning and 1.3 GB in the end (delta: -331.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 76.65 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 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: 789]: 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: 781]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 781]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 781]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 74 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 52 procedures, 356 locations, 74 error locations. Result: SAFE, OverallTime: 51.4s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 19.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 289 SDtfs, 271 SDslu, 1076 SDs, 0 SdLazy, 1112 SolverSat, 133 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 362 SyntacticMatches, 4 SemanticMatches, 139 ConstructedPredicates, 30 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 35.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred 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, 8 MinimizatonAttempts, 38 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 29.4s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 444 ConstructedInterpolants, 43 QuantifiedInterpolants, 108941 SizeOfPredicates, 38 NumberOfNonLiveVariables, 929 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...