./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test21-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_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test21-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/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 702f633b7e7ff05b6cbb070b8858a8adcd841273 ............................................................................................................................ 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_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test21-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/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 702f633b7e7ff05b6cbb070b8858a8adcd841273 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:10:04,194 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:10:04,196 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:10:04,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:10:04,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:10:04,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:10:04,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:10:04,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:10:04,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:10:04,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:10:04,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:10:04,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:10:04,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:10:04,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:10:04,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:10:04,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:10:04,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:10:04,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:10:04,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:10:04,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:10:04,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:10:04,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:10:04,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:10:04,223 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:10:04,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:10:04,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:10:04,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:10:04,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:10:04,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:10:04,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:10:04,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:10:04,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:10:04,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:10:04,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:10:04,228 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:10:04,228 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:10:04,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:10:04,229 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:10:04,229 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:10:04,229 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:10:04,230 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:10:04,230 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 17:10:04,240 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:10:04,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:10:04,241 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:10:04,241 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:10:04,241 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:10:04,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:10:04,241 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:10:04,242 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:10:04,242 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:10:04,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:10:04,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:10:04,242 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 17:10:04,242 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 17:10:04,242 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 17:10:04,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:10:04,243 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 17:10:04,243 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:10:04,243 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:10:04,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:10:04,243 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:10:04,243 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:10:04,243 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:10:04,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:10:04,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:10:04,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:10:04,244 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:10:04,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:10:04,244 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:10:04,244 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_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/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 -> 702f633b7e7ff05b6cbb070b8858a8adcd841273 [2019-12-07 17:10:04,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:10:04,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:10:04,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:10:04,351 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:10:04,351 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:10:04,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test21-2.i [2019-12-07 17:10:04,388 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/data/e2151376a/bf27bd658ca84d0f8c647c679d835140/FLAG227aba3e4 [2019-12-07 17:10:04,825 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:10:04,826 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/sv-benchmarks/c/ldv-memsafety/memleaks_test21-2.i [2019-12-07 17:10:04,836 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/data/e2151376a/bf27bd658ca84d0f8c647c679d835140/FLAG227aba3e4 [2019-12-07 17:10:04,844 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/data/e2151376a/bf27bd658ca84d0f8c647c679d835140 [2019-12-07 17:10:04,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:10:04,847 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 17:10:04,848 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:10:04,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:10:04,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:10:04,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:10:04" (1/1) ... [2019-12-07 17:10:04,853 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32fb40e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:04, skipping insertion in model container [2019-12-07 17:10:04,853 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:10:04" (1/1) ... [2019-12-07 17:10:04,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:10:04,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:10:05,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:10:05,151 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 17:10:05,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@568a56a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:05, skipping insertion in model container [2019-12-07 17:10:05,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:10:05,152 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-12-07 17:10:05,154 INFO L168 Benchmark]: Toolchain (without parser) took 306.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:05,154 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:10:05,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 304.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:05,156 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 304.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -155.5 MB). Peak memory consumption was 18.5 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 17:10:06,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:10:06,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:10:06,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:10:06,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:10:06,300 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:10:06,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:10:06,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:10:06,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:10:06,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:10:06,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:10:06,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:10:06,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:10:06,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:10:06,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:10:06,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:10:06,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:10:06,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:10:06,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:10:06,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:10:06,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:10:06,313 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:10:06,314 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:10:06,315 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:10:06,317 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:10:06,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:10:06,317 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:10:06,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:10:06,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:10:06,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:10:06,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:10:06,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:10:06,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:10:06,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:10:06,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:10:06,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:10:06,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:10:06,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:10:06,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:10:06,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:10:06,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:10:06,324 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-07 17:10:06,336 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:10:06,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:10:06,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:10:06,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:10:06,338 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:10:06,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:10:06,338 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:10:06,338 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:10:06,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:10:06,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:10:06,339 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:10:06,339 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 17:10:06,339 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 17:10:06,339 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 17:10:06,339 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:10:06,339 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 17:10:06,340 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 17:10:06,340 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 17:10:06,340 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:10:06,340 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:10:06,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:10:06,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:10:06,340 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:10:06,341 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:10:06,341 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:10:06,341 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:10:06,341 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:10:06,341 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 17:10:06,341 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 17:10:06,341 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:10:06,342 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 17:10:06,342 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_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/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 -> 702f633b7e7ff05b6cbb070b8858a8adcd841273 [2019-12-07 17:10:06,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:10:06,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:10:06,514 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:10:06,515 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:10:06,515 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:10:06,516 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test21-2.i [2019-12-07 17:10:06,554 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/data/89970a07a/b7c388bfd9354c89abcad562ea5999af/FLAG90ca70582 [2019-12-07 17:10:06,974 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:10:06,975 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/sv-benchmarks/c/ldv-memsafety/memleaks_test21-2.i [2019-12-07 17:10:06,985 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/data/89970a07a/b7c388bfd9354c89abcad562ea5999af/FLAG90ca70582 [2019-12-07 17:10:07,327 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/data/89970a07a/b7c388bfd9354c89abcad562ea5999af [2019-12-07 17:10:07,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:10:07,330 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 17:10:07,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:10:07,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:10:07,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:10:07,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:10:07" (1/1) ... [2019-12-07 17:10:07,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ea342d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:07, skipping insertion in model container [2019-12-07 17:10:07,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:10:07" (1/1) ... [2019-12-07 17:10:07,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:10:07,367 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:10:07,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:10:07,619 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 17:10:07,629 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:10:07,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:10:07,665 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:10:07,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:10:07,762 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:10:07,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:07 WrapperNode [2019-12-07 17:10:07,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:10:07,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:10:07,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:10:07,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:10:07,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:07" (1/1) ... [2019-12-07 17:10:07,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:07" (1/1) ... [2019-12-07 17:10:07,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:07" (1/1) ... [2019-12-07 17:10:07,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:07" (1/1) ... [2019-12-07 17:10:07,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:07" (1/1) ... [2019-12-07 17:10:07,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:07" (1/1) ... [2019-12-07 17:10:07,818 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:07" (1/1) ... [2019-12-07 17:10:07,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:10:07,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:10:07,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:10:07,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:10:07,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/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 17:10:07,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 17:10:07,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:10:07,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 17:10:07,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 17:10:07,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 17:10:07,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 17:10:07,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 17:10:07,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 17:10:07,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 17:10:07,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-12-07 17:10:07,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-12-07 17:10:07,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-12-07 17:10:07,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-12-07 17:10:07,866 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-12-07 17:10:07,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-12-07 17:10:07,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-12-07 17:10:07,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-12-07 17:10:07,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-12-07 17:10:07,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-12-07 17:10:07,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-12-07 17:10:07,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-12-07 17:10:07,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-12-07 17:10:07,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-12-07 17:10:07,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-12-07 17:10:07,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-12-07 17:10:07,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-12-07 17:10:07,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-12-07 17:10:07,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-12-07 17:10:07,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-12-07 17:10:07,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-12-07 17:10:07,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-12-07 17:10:07,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-12-07 17:10:07,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-12-07 17:10:07,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-12-07 17:10:07,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-12-07 17:10:07,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-12-07 17:10:07,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-12-07 17:10:07,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-12-07 17:10:07,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-12-07 17:10:07,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-12-07 17:10:07,868 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-12-07 17:10:07,868 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-12-07 17:10:07,868 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_21 [2019-12-07 17:10:07,868 INFO L138 BoogieDeclarations]: Found implementation of procedure free_21 [2019-12-07 17:10:07,868 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-12-07 17:10:07,868 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 17:10:07,868 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-12-07 17:10:07,868 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-07 17:10:07,868 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-12-07 17:10:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 17:10:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 17:10:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 17:10:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 17:10:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 17:10:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 17:10:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 17:10:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 17:10:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 17:10:07,869 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 17:10:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 17:10:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 17:10:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 17:10:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 17:10:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 17:10:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 17:10:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 17:10:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 17:10:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 17:10:07,870 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 17:10:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 17:10:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 17:10:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 17:10:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 17:10:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 17:10:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 17:10:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 17:10:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 17:10:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 17:10:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 17:10:07,871 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 17:10:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 17:10:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 17:10:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 17:10:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 17:10:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 17:10:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 17:10:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 17:10:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 17:10:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 17:10:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 17:10:07,872 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 17:10:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 17:10:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 17:10:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 17:10:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 17:10:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 17:10:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 17:10:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 17:10:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 17:10:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 17:10:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 17:10:07,873 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 17:10:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 17:10:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 17:10:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 17:10:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 17:10:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 17:10:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 17:10:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 17:10:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 17:10:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 17:10:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 17:10:07,874 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 17:10:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 17:10:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 17:10:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 17:10:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 17:10:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 17:10:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 17:10:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 17:10:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 17:10:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 17:10:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 17:10:07,875 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 17:10:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 17:10:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 17:10:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 17:10:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 17:10:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 17:10:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 17:10:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 17:10:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 17:10:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 17:10:07,876 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 17:10:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 17:10:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 17:10:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 17:10:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 17:10:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 17:10:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 17:10:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 17:10:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 17:10:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 17:10:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 17:10:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 17:10:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 17:10:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 17:10:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 17:10:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 17:10:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 17:10:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 17:10:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 17:10:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 17:10:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 17:10:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 17:10:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 17:10:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-07 17:10:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 17:10:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-12-07 17:10:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-12-07 17:10:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-12-07 17:10:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-12-07 17:10:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-07 17:10:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:10:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-12-07 17:10:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-07 17:10:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-12-07 17:10:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:10:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-12-07 17:10:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-12-07 17:10:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-12-07 17:10:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:10:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-12-07 17:10:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-12-07 17:10:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-12-07 17:10:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-12-07 17:10:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-12-07 17:10:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-12-07 17:10:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:10:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-12-07 17:10:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-12-07 17:10:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-12-07 17:10:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-12-07 17:10:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-12-07 17:10:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 17:10:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 17:10:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-12-07 17:10:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-12-07 17:10:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 17:10:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-12-07 17:10:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-12-07 17:10:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-12-07 17:10:07,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-12-07 17:10:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-12-07 17:10:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-12-07 17:10:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-12-07 17:10:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-12-07 17:10:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-12-07 17:10:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-12-07 17:10:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-12-07 17:10:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-12-07 17:10:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-12-07 17:10:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-12-07 17:10:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_21 [2019-12-07 17:10:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure free_21 [2019-12-07 17:10:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-12-07 17:10:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 17:10:07,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 17:10:07,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:10:07,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 17:10:07,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:10:07,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 17:10:07,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-07 17:10:07,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-07 17:10:07,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-12-07 17:10:07,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-12-07 17:10:08,243 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 17:10:08,484 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 17:10:08,693 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:10:08,693 INFO L287 CfgBuilder]: Removed 1 assume(true) statements. [2019-12-07 17:10:08,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:10:08 BoogieIcfgContainer [2019-12-07 17:10:08,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:10:08,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:10:08,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:10:08,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:10:08,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:10:07" (1/3) ... [2019-12-07 17:10:08,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45054694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:10:08, skipping insertion in model container [2019-12-07 17:10:08,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:10:07" (2/3) ... [2019-12-07 17:10:08,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45054694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:10:08, skipping insertion in model container [2019-12-07 17:10:08,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:10:08" (3/3) ... [2019-12-07 17:10:08,699 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test21-2.i [2019-12-07 17:10:08,706 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:10:08,711 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 74 error locations. [2019-12-07 17:10:08,719 INFO L249 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2019-12-07 17:10:08,732 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:10:08,732 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 17:10:08,732 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:10:08,732 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:10:08,732 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:10:08,733 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:10:08,733 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:10:08,733 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:10:08,744 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2019-12-07 17:10:08,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:10:08,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:08,751 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] [2019-12-07 17:10:08,752 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_21Err0ASSERT_VIOLATIONMEMORY_FREE, free_21Err1ASSERT_VIOLATIONMEMORY_FREE, free_21Err2ASSERT_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 17:10:08,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:08,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1560719066, now seen corresponding path program 1 times [2019-12-07 17:10:08,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:10:08,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669039541] [2019-12-07 17:10:08,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/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 17:10:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:08,901 INFO L264 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:10:08,905 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:10:08,992 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 17:10:08,992 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:10:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:10:09,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669039541] [2019-12-07 17:10:09,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:09,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 10 [2019-12-07 17:10:09,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654226712] [2019-12-07 17:10:09,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:10:09,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:10:09,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:10:09,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:10:09,133 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 11 states. [2019-12-07 17:10:09,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:09,256 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-12-07 17:10:09,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:10:09,257 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-12-07 17:10:09,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:09,264 INFO L225 Difference]: With dead ends: 52 [2019-12-07 17:10:09,264 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 17:10:09,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:10:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 17:10:09,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-12-07 17:10:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 17:10:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-12-07 17:10:09,292 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 21 [2019-12-07 17:10:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:09,292 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-12-07 17:10:09,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:10:09,292 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-12-07 17:10:09,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:10:09,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:09,293 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] [2019-12-07 17:10:09,493 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 17:10:09,494 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_21Err0ASSERT_VIOLATIONMEMORY_FREE, free_21Err1ASSERT_VIOLATIONMEMORY_FREE, free_21Err2ASSERT_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 17:10:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:09,494 INFO L82 PathProgramCache]: Analyzing trace with hash 182091269, now seen corresponding path program 1 times [2019-12-07 17:10:09,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:10:09,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780456624] [2019-12-07 17:10:09,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/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 17:10:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:09,599 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:10:09,601 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:10:09,617 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 17:10:09,617 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:10:09,691 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 17:10:09,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780456624] [2019-12-07 17:10:09,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:09,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 17:10:09,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182847852] [2019-12-07 17:10:09,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:10:09,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:10:09,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:10:09,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:10:09,694 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2019-12-07 17:10:09,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:09,708 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2019-12-07 17:10:09,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:10:09,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 17:10:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:09,710 INFO L225 Difference]: With dead ends: 49 [2019-12-07 17:10:09,710 INFO L226 Difference]: Without dead ends: 49 [2019-12-07 17:10:09,710 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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 17:10:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-07 17:10:09,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-12-07 17:10:09,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 17:10:09,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-12-07 17:10:09,717 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 21 [2019-12-07 17:10:09,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:09,717 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-12-07 17:10:09,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:10:09,717 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-12-07 17:10:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:10:09,718 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:09,719 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] [2019-12-07 17:10:09,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 17:10:09,920 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_21Err0ASSERT_VIOLATIONMEMORY_FREE, free_21Err1ASSERT_VIOLATIONMEMORY_FREE, free_21Err2ASSERT_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 17:10:09,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:09,920 INFO L82 PathProgramCache]: Analyzing trace with hash 311173988, now seen corresponding path program 1 times [2019-12-07 17:10:09,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:10:09,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827685315] [2019-12-07 17:10:09,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/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 17:10:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:10,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 17:10:10,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:10:10,090 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 17:10:10,090 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:10:10,120 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 17:10:10,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827685315] [2019-12-07 17:10:10,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:10,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-12-07 17:10:10,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011249192] [2019-12-07 17:10:10,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:10:10,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:10:10,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:10:10,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:10:10,122 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 7 states. [2019-12-07 17:10:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:10,156 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-12-07 17:10:10,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:10:10,157 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-12-07 17:10:10,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:10,157 INFO L225 Difference]: With dead ends: 45 [2019-12-07 17:10:10,158 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 17:10:10,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:10:10,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 17:10:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-12-07 17:10:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 17:10:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-12-07 17:10:10,162 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 21 [2019-12-07 17:10:10,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:10,162 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-12-07 17:10:10,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:10:10,162 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-12-07 17:10:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:10:10,163 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:10,163 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:10,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 17:10:10,365 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_21Err0ASSERT_VIOLATIONMEMORY_FREE, free_21Err1ASSERT_VIOLATIONMEMORY_FREE, free_21Err2ASSERT_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 17:10:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:10,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1137650385, now seen corresponding path program 1 times [2019-12-07 17:10:10,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:10:10,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456608043] [2019-12-07 17:10:10,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/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 17:10:10,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:10,495 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 17:10:10,497 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:10:10,653 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 17:10:10,653 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:10:11,060 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 17:10:11,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456608043] [2019-12-07 17:10:11,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:11,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 20 [2019-12-07 17:10:11,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069858438] [2019-12-07 17:10:11,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 17:10:11,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:10:11,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 17:10:11,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:10:11,062 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 21 states. [2019-12-07 17:10:11,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:11,898 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2019-12-07 17:10:11,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 17:10:11,898 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-12-07 17:10:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:11,899 INFO L225 Difference]: With dead ends: 56 [2019-12-07 17:10:11,899 INFO L226 Difference]: Without dead ends: 56 [2019-12-07 17:10:11,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:10:11,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-07 17:10:11,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2019-12-07 17:10:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 17:10:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2019-12-07 17:10:11,904 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 22 [2019-12-07 17:10:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:11,904 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2019-12-07 17:10:11,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 17:10:11,904 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2019-12-07 17:10:11,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:10:11,905 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:11,905 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] [2019-12-07 17:10:12,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 17:10:12,107 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_21Err0ASSERT_VIOLATIONMEMORY_FREE, free_21Err1ASSERT_VIOLATIONMEMORY_FREE, free_21Err2ASSERT_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 17:10:12,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:12,107 INFO L82 PathProgramCache]: Analyzing trace with hash -907423160, now seen corresponding path program 1 times [2019-12-07 17:10:12,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:10:12,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519275508] [2019-12-07 17:10:12,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/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 17:10:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:12,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 17:10:12,232 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:10:12,256 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 17:10:12,256 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:10:12,259 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:10:12,259 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:10:12,259 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:10:12,322 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 17:10:12,323 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:10:12,393 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 17:10:12,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519275508] [2019-12-07 17:10:12,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:12,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 10 [2019-12-07 17:10:12,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307843269] [2019-12-07 17:10:12,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:10:12,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:10:12,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:10:12,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:10:12,395 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 11 states. [2019-12-07 17:10:12,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:12,536 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2019-12-07 17:10:12,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:10:12,536 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2019-12-07 17:10:12,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:12,537 INFO L225 Difference]: With dead ends: 51 [2019-12-07 17:10:12,537 INFO L226 Difference]: Without dead ends: 51 [2019-12-07 17:10:12,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:10:12,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-07 17:10:12,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-12-07 17:10:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 17:10:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-12-07 17:10:12,545 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23 [2019-12-07 17:10:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:12,546 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-12-07 17:10:12,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:10:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-12-07 17:10:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:10:12,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:12,546 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] [2019-12-07 17:10:12,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 17:10:12,749 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_21Err0ASSERT_VIOLATIONMEMORY_FREE, free_21Err1ASSERT_VIOLATIONMEMORY_FREE, free_21Err2ASSERT_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 17:10:12,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:12,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1412981785, now seen corresponding path program 1 times [2019-12-07 17:10:12,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:10:12,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376180998] [2019-12-07 17:10:12,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/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 17:10:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:12,870 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:10:12,871 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:10:12,892 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 17:10:12,892 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:10:12,939 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 17:10:12,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376180998] [2019-12-07 17:10:12,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:12,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 17:10:12,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288259322] [2019-12-07 17:10:12,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:10:12,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:10:12,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:10:12,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:10:12,941 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 5 states. [2019-12-07 17:10:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:12,952 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-12-07 17:10:12,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:10:12,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 17:10:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:12,953 INFO L225 Difference]: With dead ends: 41 [2019-12-07 17:10:12,954 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 17:10:12,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 17:10:12,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 17:10:12,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 17:10:12,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 17:10:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-12-07 17:10:12,957 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 23 [2019-12-07 17:10:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:12,957 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-12-07 17:10:12,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:10:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-12-07 17:10:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:10:12,958 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:12,958 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] [2019-12-07 17:10:13,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 17:10:13,160 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_21Err0ASSERT_VIOLATIONMEMORY_FREE, free_21Err1ASSERT_VIOLATIONMEMORY_FREE, free_21Err2ASSERT_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 17:10:13,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:13,160 INFO L82 PathProgramCache]: Analyzing trace with hash -298029978, now seen corresponding path program 1 times [2019-12-07 17:10:13,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:10:13,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895987881] [2019-12-07 17:10:13,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/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 17:10:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:13,289 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:10:13,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:10:13,296 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 17:10:13,297 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:10:13,379 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 17:10:13,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895987881] [2019-12-07 17:10:13,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:13,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 17:10:13,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040725954] [2019-12-07 17:10:13,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:10:13,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:10:13,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:10:13,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:10:13,380 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 3 states. [2019-12-07 17:10:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:13,397 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2019-12-07 17:10:13,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:10:13,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 17:10:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:13,398 INFO L225 Difference]: With dead ends: 44 [2019-12-07 17:10:13,398 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 17:10:13,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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 17:10:13,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 17:10:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 17:10:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 17:10:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 28 transitions. [2019-12-07 17:10:13,400 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 28 transitions. Word has length 25 [2019-12-07 17:10:13,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:13,400 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 28 transitions. [2019-12-07 17:10:13,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:10:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2019-12-07 17:10:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:10:13,401 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:13,401 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 17:10:13,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 17:10:13,603 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_21Err0ASSERT_VIOLATIONMEMORY_FREE, free_21Err1ASSERT_VIOLATIONMEMORY_FREE, free_21Err2ASSERT_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 17:10:13,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:13,603 INFO L82 PathProgramCache]: Analyzing trace with hash -339267371, now seen corresponding path program 1 times [2019-12-07 17:10:13,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:10:13,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276515902] [2019-12-07 17:10:13,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/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 17:10:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:13,726 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-07 17:10:13,727 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:10:19,875 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 17:10:19,875 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:10:38,051 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2019-12-07 17:10:38,056 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (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_14| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_21_#in~dev.base| (_ bv0 1)))))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17) (_ bv0 1)))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_13|))) is different from false [2019-12-07 17:10:38,060 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (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_14| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_21_#in~dev.base| (_ bv0 1)))))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17) (_ bv0 1)))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_13|))) is different from true [2019-12-07 17:10:38,066 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2019-12-07 17:10:38,072 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2019-12-07 17:10:38,075 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (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_14| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_21_#in~dev.base| (_ bv0 1)))))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17) (_ bv0 1)))) (= (store |c_#valid| c_free_21_~p~1.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) is different from false [2019-12-07 17:10:38,078 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (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_14| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_21_#in~dev.base| (_ bv0 1)))))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17) (_ bv0 1)))) (= (store |c_#valid| c_free_21_~p~1.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) is different from true [2019-12-07 17:10:38,082 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2019-12-07 17:10:38,089 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2019-12-07 17:10:38,095 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2019-12-07 17:10:38,099 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (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_14| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_21_#in~dev.base| (_ bv0 1)))))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17) (_ bv0 1)))) (= (store |c_#valid| c_free_21_~dev.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) is different from false [2019-12-07 17:10:38,104 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (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_14| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_21_#in~dev.base| (_ bv0 1)))))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17) (_ bv0 1)))) (= (store |c_#valid| c_free_21_~dev.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) is different from true [2019-12-07 17:10:38,109 INFO L430 ElimStorePlain]: Different costs {0=[|v_old(#valid)_BEFORE_CALL_13|], 5=[|v_old(#valid)_BEFORE_CALL_14|]} [2019-12-07 17:10:38,113 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (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_14| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_21_#in~dev.base| (_ bv0 1)))))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |c_free_21_#in~dev.base| (_ bv0 1))))) is different from false [2019-12-07 17:10:38,115 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (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_14| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_21_#in~dev.base| (_ bv0 1)))))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |c_free_21_#in~dev.base| (_ bv0 1))))) is different from true [2019-12-07 17:10:40,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_alloc_21_#res.base_40|) (_ bv0 1))) (= (store |c_#valid| |v_alloc_21_#res.base_40| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_entry_point_~dev~0.base_17) (_ bv0 1)) (not (= (store |c_old(#valid)| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))))) is different from false [2019-12-07 17:10:40,655 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (and (not (= (store |c_old(#valid)| |v_alloc_21_#res.base_40| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (forall ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) (= (select |c_old(#valid)| |v_alloc_21_#res.base_40|) (_ bv0 1)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1)))))) (= v_prenex_3 (store |c_#valid| |c_alloc_21_#res.base| (_ bv0 1))))))) is different from false [2019-12-07 17:10:40,658 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (and (not (= (store |c_old(#valid)| |v_alloc_21_#res.base_40| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (forall ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) (= (select |c_old(#valid)| |v_alloc_21_#res.base_40|) (_ bv0 1)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1)))))) (= v_prenex_3 (store |c_#valid| |c_alloc_21_#res.base| (_ bv0 1))))))) is different from true [2019-12-07 17:10:40,674 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (and (not (= (store |c_old(#valid)| |v_alloc_21_#res.base_40| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (forall ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) (= (select |c_old(#valid)| |v_alloc_21_#res.base_40|) (_ bv0 1)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1)))))) (= v_prenex_3 (store |c_#valid| c_alloc_21_~p~0.base (_ bv0 1))))))) is different from false [2019-12-07 17:10:40,677 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (and (not (= (store |c_old(#valid)| |v_alloc_21_#res.base_40| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (forall ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) (= (select |c_old(#valid)| |v_alloc_21_#res.base_40|) (_ bv0 1)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1)))))) (= v_prenex_3 (store |c_#valid| c_alloc_21_~p~0.base (_ bv0 1))))))) is different from true [2019-12-07 17:10:40,688 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (and (not (= (store |c_old(#valid)| |v_alloc_21_#res.base_40| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (forall ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) (= (select |c_old(#valid)| |v_alloc_21_#res.base_40|) (_ bv0 1)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1)))))) (= v_prenex_3 (store |c_#valid| |c_alloc_21_#t~ret38.base| (_ bv0 1))))))) is different from false [2019-12-07 17:10:40,691 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (and (not (= (store |c_old(#valid)| |v_alloc_21_#res.base_40| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (forall ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) (= (select |c_old(#valid)| |v_alloc_21_#res.base_40|) (_ bv0 1)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1)))))) (= v_prenex_3 (store |c_#valid| |c_alloc_21_#t~ret38.base| (_ bv0 1))))))) is different from true [2019-12-07 17:10:40,720 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 17:10:40,723 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3], 5=[|v_old(#valid)_BEFORE_CALL_15|]} [2019-12-07 17:10:40,727 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_3 (store |c_#valid| |v_ldv_malloc_#res.base_68| (_ bv0 1))) (exists ((v_prenex_4 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1)))))) (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (and (not (= (store |c_old(#valid)| |v_alloc_21_#res.base_40| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (forall ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) (= (select |c_old(#valid)| |v_alloc_21_#res.base_40|) (_ bv0 1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_68|))))) is different from false [2019-12-07 17:10:40,733 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_3 (store |c_#valid| |v_ldv_malloc_#res.base_68| (_ bv0 1))) (exists ((v_prenex_4 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1)))))) (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (and (not (= (store |c_old(#valid)| |v_alloc_21_#res.base_40| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (forall ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) (= (select |c_old(#valid)| |v_alloc_21_#res.base_40|) (_ bv0 1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_68|))))) is different from true [2019-12-07 17:10:40,741 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-12-07 17:10:40,782 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 17:10:40,784 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_5, |v_old(#valid)_BEFORE_CALL_13|], 5=[v_prenex_6]} [2019-12-07 17:10:40,786 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3], 5=[|v_old(#valid)_BEFORE_CALL_15|]} [2019-12-07 17:10:40,795 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)))) (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_alloc_21_#res.base_40|))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1)) (not (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_16| |v_alloc_21_#res.base_40| (_ bv0 1))))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9)) (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_8 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1)))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))))) is different from false [2019-12-07 17:10:40,801 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)))) (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_alloc_21_#res.base_40|))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1)) (not (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_16| |v_alloc_21_#res.base_40| (_ bv0 1))))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9)) (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_8 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1)))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))))) is different from true [2019-12-07 17:10:40,805 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-12-07 17:10:40,824 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 17:10:40,826 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_5, |v_old(#valid)_BEFORE_CALL_13|], 5=[v_prenex_6]} [2019-12-07 17:10:40,828 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3], 5=[|v_old(#valid)_BEFORE_CALL_15|]} [2019-12-07 17:10:40,834 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-12-07 17:10:40,859 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 17:10:40,861 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_5, |v_old(#valid)_BEFORE_CALL_13|], 5=[v_prenex_6]} [2019-12-07 17:10:40,862 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3], 5=[|v_old(#valid)_BEFORE_CALL_15|]} [2019-12-07 17:10:40,875 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_69| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)))) (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_alloc_21_#res.base_40|))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1)) (not (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_16| |v_alloc_21_#res.base_40| (_ bv0 1))))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_69|) (_ bv0 1))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9)) (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_8 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1)))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |v_ldv_malloc_#res.base_69| (_ bv0 1))))))) is different from false [2019-12-07 17:10:40,881 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_69| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)))) (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_alloc_21_#res.base_40|))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1)) (not (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_16| |v_alloc_21_#res.base_40| (_ bv0 1))))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_69|) (_ bv0 1))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9)) (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_8 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1)))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |v_ldv_malloc_#res.base_69| (_ bv0 1))))))) is different from true [2019-12-07 17:10:40,887 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 30 [2019-12-07 17:10:40,914 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-12-07 17:10:40,916 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_5, |v_old(#valid)_BEFORE_CALL_13|], 5=[v_prenex_6]} [2019-12-07 17:10:40,917 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_3], 5=[|v_old(#valid)_BEFORE_CALL_15|]} [2019-12-07 17:10:40,930 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 17:10:40,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276515902] [2019-12-07 17:10:40,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:40,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 17] imperfect sequences [] total 27 [2019-12-07 17:10:40,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891440043] [2019-12-07 17:10:40,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 17:10:40,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:10:40,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 17:10:40,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=197, Unknown=56, NotChecked=440, Total=756 [2019-12-07 17:10:40,931 INFO L87 Difference]: Start difference. First operand 29 states and 28 transitions. Second operand 28 states. [2019-12-07 17:10:55,733 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#res.base_69| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)))) (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_alloc_21_#res.base_40|))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1)) (not (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_16| |v_alloc_21_#res.base_40| (_ bv0 1))))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)))) (not (= (select |c_#valid| |v_ldv_malloc_#res.base_69|) (_ bv0 1))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9)) (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_8 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1)))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |v_ldv_malloc_#res.base_69| (_ bv0 1))))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2019-12-07 17:10:55,745 WARN L838 $PredicateComparison]: unable to prove that (and (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (forall ((|v_old(#valid)_BEFORE_CALL_16| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1))) (|v_ldv_malloc_#res.base_68| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (and (not (= v_prenex_3 (store |c_old(#valid)| |v_ldv_malloc_#res.base_68| (_ bv0 1)))) (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| |v_alloc_21_#res.base_40|))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1)) (not (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |v_old(#valid)_BEFORE_CALL_16| |v_alloc_21_#res.base_40| (_ bv0 1))))) (forall ((v_prenex_4 (_ BitVec 32))) (or (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1))))) (= (_ bv0 1) (select |c_old(#valid)| |v_ldv_malloc_#res.base_68|)))) (forall ((v_prenex_6 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_5 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_8 (Array (_ BitVec 32) (_ BitVec 1))) (v_prenex_9 (_ BitVec 32))) (and (= (_ bv0 1) (select |v_old(#valid)_BEFORE_CALL_16| v_prenex_9)) (forall ((v_prenex_10 (_ BitVec 32))) (or (not (= (select v_prenex_6 v_prenex_10) (_ bv0 1))) (= v_prenex_8 (store v_prenex_6 v_prenex_10 (_ bv0 1))))) (not (= v_prenex_8 (store |v_old(#valid)_BEFORE_CALL_16| v_prenex_9 (_ bv0 1)))))) (exists ((v_prenex_7 (_ BitVec 32))) (and (= (select v_prenex_6 v_prenex_7) (_ bv0 1)) (not (= v_prenex_5 (store v_prenex_6 v_prenex_7 (_ bv0 1)))))) (= v_prenex_5 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))))))) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1)))) is different from false [2019-12-07 17:10:55,752 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_alloc_21_#t~ret38.base| (_ bv1 1))) (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (and (not (= (store |c_old(#valid)| |v_alloc_21_#res.base_40| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (forall ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) (= (select |c_old(#valid)| |v_alloc_21_#res.base_40|) (_ bv0 1)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1)))))) (= v_prenex_3 (store |c_#valid| |c_alloc_21_#t~ret38.base| (_ bv0 1))))))) (= (select |c_old(#valid)| |c_alloc_21_#t~ret38.base|) (_ bv0 1))) is different from false [2019-12-07 17:10:55,757 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (and (not (= (store |c_old(#valid)| |v_alloc_21_#res.base_40| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (forall ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) (= (select |c_old(#valid)| |v_alloc_21_#res.base_40|) (_ bv0 1)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1)))))) (= v_prenex_3 (store |c_#valid| c_alloc_21_~p~0.base (_ bv0 1))))))) (= (select |c_old(#valid)| c_alloc_21_~p~0.base) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| c_alloc_21_~p~0.base (_ bv1 1)))) is different from false [2019-12-07 17:10:55,764 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_alloc_21_#res.base| (_ bv1 1))) (forall ((|v_old(#valid)_BEFORE_CALL_15| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_alloc_21_#res.base_40| (_ BitVec 32))) (and (not (= (store |c_old(#valid)| |v_alloc_21_#res.base_40| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (forall ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_15| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) (= (select |c_old(#valid)| |v_alloc_21_#res.base_40|) (_ bv0 1)))) (forall ((v_prenex_3 (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_prenex_4 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_15| v_prenex_4) (_ bv0 1)) (not (= v_prenex_3 (store |v_old(#valid)_BEFORE_CALL_15| v_prenex_4 (_ bv0 1)))))) (= v_prenex_3 (store |c_#valid| |c_alloc_21_#res.base| (_ bv0 1))))))) (= (_ bv0 1) (select |c_old(#valid)| |c_alloc_21_#res.base|))) is different from false [2019-12-07 17:10:57,799 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (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_14| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_21_#in~dev.base| (_ bv0 1)))))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17) (_ bv0 1)))) (= |v_old(#valid)_BEFORE_CALL_13| (store |c_#valid| |c_free_21_#in~dev.base| (_ bv0 1)))))) is different from false [2019-12-07 17:10:57,805 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (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_14| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_21_#in~dev.base| (_ bv0 1)))))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17) (_ bv0 1)))) (= (store |c_#valid| c_free_21_~dev.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|))) (= |c_free_21_#in~dev.base| c_free_21_~dev.base) (= |c_#valid| |c_old(#valid)|)) is different from false [2019-12-07 17:10:57,810 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= c_free_21_~p~1.base |c_free_21_#in~dev.base|) (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (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_14| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_21_#in~dev.base| (_ bv0 1)))))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17) (_ bv0 1)))) (= (store |c_#valid| c_free_21_~p~1.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) is different from false [2019-12-07 17:10:57,814 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (= c_free_21_~p~1.base |c_free_21_#in~dev.base|) (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (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_14| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_21_#in~dev.base| (_ bv0 1)))))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17) (_ bv0 1)))) (= (store |c_#valid| c_free_21_~p~1.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)))) is different from true [2019-12-07 17:10:57,818 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_free_21_#in~dev.base| (_ bv0 1))) (forall ((|v_old(#valid)_BEFORE_CALL_13| (Array (_ BitVec 32) (_ BitVec 1))) (|v_old(#valid)_BEFORE_CALL_14| (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_14| v_prenex_2 (_ bv0 1))) (not (= (select |v_old(#valid)_BEFORE_CALL_14| v_prenex_2) (_ bv0 1))))) (not (= v_prenex_1 (store |c_old(#valid)| |c_free_21_#in~dev.base| (_ bv0 1)))))) (exists ((v_entry_point_~dev~0.base_17 (_ BitVec 32))) (and (not (= (store |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_13|)) (= (select |v_old(#valid)_BEFORE_CALL_14| v_entry_point_~dev~0.base_17) (_ bv0 1)))) (= |c_#valid| |v_old(#valid)_BEFORE_CALL_13|)))) is different from false [2019-12-07 17:10:57,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:57,835 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2019-12-07 17:10:57,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:10:57,836 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-12-07 17:10:57,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:57,836 INFO L225 Difference]: With dead ends: 28 [2019-12-07 17:10:57,836 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 17:10:57,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=85, Invalid=216, Unknown=85, NotChecked=1020, Total=1406 [2019-12-07 17:10:57,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 17:10:57,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 17:10:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 17:10:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 17:10:57,837 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-12-07 17:10:57,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:57,837 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 17:10:57,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 17:10:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 17:10:57,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 17:10:58,038 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 17:10:58,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:10:58 BoogieIcfgContainer [2019-12-07 17:10:58,046 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:10:58,046 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:10:58,046 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:10:58,047 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:10:58,047 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:10:08" (3/4) ... [2019-12-07 17:10:58,053 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 17:10:58,062 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-12-07 17:10:58,062 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 17:10:58,062 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_21 [2019-12-07 17:10:58,062 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-12-07 17:10:58,062 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-12-07 17:10:58,062 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-12-07 17:10:58,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-12-07 17:10:58,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-12-07 17:10:58,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-12-07 17:10:58,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-12-07 17:10:58,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-12-07 17:10:58,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-12-07 17:10:58,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-12-07 17:10:58,063 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-12-07 17:10:58,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-12-07 17:10:58,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-12-07 17:10:58,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-12-07 17:10:58,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-12-07 17:10:58,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-12-07 17:10:58,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-12-07 17:10:58,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-12-07 17:10:58,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-12-07 17:10:58,064 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-12-07 17:10:58,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-12-07 17:10:58,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-12-07 17:10:58,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-12-07 17:10:58,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-12-07 17:10:58,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-12-07 17:10:58,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-12-07 17:10:58,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-12-07 17:10:58,065 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-12-07 17:10:58,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-12-07 17:10:58,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-12-07 17:10:58,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-12-07 17:10:58,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-12-07 17:10:58,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-12-07 17:10:58,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-12-07 17:10:58,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-12-07 17:10:58,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-12-07 17:10:58,066 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-12-07 17:10:58,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-12-07 17:10:58,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-12-07 17:10:58,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_21 [2019-12-07 17:10:58,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-12-07 17:10:58,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-12-07 17:10:58,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-12-07 17:10:58,067 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-12-07 17:10:58,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-12-07 17:10:58,076 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-12-07 17:10:58,077 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 17:10:58,077 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:10:58,077 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 17:10:58,078 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 17:10:58,119 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f9482283-7fd8-4503-9d0f-5838dc5f9f8d/bin/uautomizer/witness.graphml [2019-12-07 17:10:58,119 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:10:58,120 INFO L168 Benchmark]: Toolchain (without parser) took 50790.59 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.8 MB). Free memory was 947.0 MB in the beginning and 990.0 MB in the end (delta: -43.0 MB). Peak memory consumption was 254.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:58,121 INFO L168 Benchmark]: CDTParser took 0.14 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 17:10:58,121 INFO L168 Benchmark]: CACSL2BoogieTranslator took 432.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -111.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:58,121 INFO L168 Benchmark]: Boogie Preprocessor took 62.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:58,122 INFO L168 Benchmark]: RCFGBuilder took 869.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 931.9 MB in the end (delta: 120.1 MB). Peak memory consumption was 120.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:58,122 INFO L168 Benchmark]: TraceAbstraction took 49350.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 931.9 MB in the beginning and 999.1 MB in the end (delta: -67.2 MB). Peak memory consumption was 120.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:58,122 INFO L168 Benchmark]: Witness Printer took 73.05 ms. Allocated memory is still 1.3 GB. Free memory was 999.1 MB in the beginning and 990.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:10:58,124 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.14 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 432.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -111.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 869.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 931.9 MB in the end (delta: 120.1 MB). Peak memory consumption was 120.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49350.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 931.9 MB in the beginning and 999.1 MB in the end (delta: -67.2 MB). Peak memory consumption was 120.0 MB. Max. memory is 11.5 GB. * Witness Printer took 73.05 ms. Allocated memory is still 1.3 GB. Free memory was 999.1 MB in the beginning and 990.0 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 779]: 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: 772]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 772]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 772]: 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 49 procedures, 345 locations, 74 error locations. Result: SAFE, OverallTime: 49.3s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 225 SDtfs, 118 SDslu, 1004 SDs, 0 SdLazy, 658 SolverSat, 18 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 17.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 386 GetRequests, 282 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 27.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred 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, 24 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 28.4s InterpolantComputationTime, 184 NumberOfCodeBlocks, 184 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 352 ConstructedInterpolants, 25 QuantifiedInterpolants, 54633 SizeOfPredicates, 30 NumberOfNonLiveVariables, 705 ConjunctsInSsa, 97 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...