./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.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_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/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 9de0b0c743a2720b24a0366af33371eca52f31f7 ............................................................................................................................ 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_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/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 9de0b0c743a2720b24a0366af33371eca52f31f7 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:07:55,385 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:07:55,386 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:07:55,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:07:55,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:07:55,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:07:55,396 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:07:55,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:07:55,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:07:55,399 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:07:55,400 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:07:55,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:07:55,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:07:55,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:07:55,402 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:07:55,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:07:55,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:07:55,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:07:55,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:07:55,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:07:55,409 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:07:55,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:07:55,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:07:55,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:07:55,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:07:55,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:07:55,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:07:55,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:07:55,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:07:55,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:07:55,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:07:55,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:07:55,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:07:55,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:07:55,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:07:55,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:07:55,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:07:55,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:07:55,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:07:55,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:07:55,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:07:55,420 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-12-07 17:07:55,433 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:07:55,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:07:55,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:07:55,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:07:55,434 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:07:55,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:07:55,435 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:07:55,435 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:07:55,435 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:07:55,435 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:07:55,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:07:55,436 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 17:07:55,436 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 17:07:55,436 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 17:07:55,436 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:07:55,436 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 17:07:55,437 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:07:55,437 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:07:55,437 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:07:55,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:07:55,437 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:07:55,437 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:07:55,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:07:55,438 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:07:55,438 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:07:55,438 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:07:55,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:07:55,439 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:07:55,439 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_189feea9-2950-4e97-bdda-b1ec8eef74b9/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 -> 9de0b0c743a2720b24a0366af33371eca52f31f7 [2019-12-07 17:07:55,539 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:07:55,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:07:55,552 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:07:55,553 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:07:55,554 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:07:55,554 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i [2019-12-07 17:07:55,602 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/data/a08084b41/e5530a1abfbe42bca3e9d71401741662/FLAG3ab492360 [2019-12-07 17:07:55,965 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:07:55,966 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i [2019-12-07 17:07:55,975 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/data/a08084b41/e5530a1abfbe42bca3e9d71401741662/FLAG3ab492360 [2019-12-07 17:07:55,984 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/data/a08084b41/e5530a1abfbe42bca3e9d71401741662 [2019-12-07 17:07:55,986 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:07:55,987 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 17:07:55,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:07:55,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:07:55,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:07:55,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:07:55" (1/1) ... [2019-12-07 17:07:55,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee0b347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:55, skipping insertion in model container [2019-12-07 17:07:55,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:07:55" (1/1) ... [2019-12-07 17:07:55,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:07:56,024 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:07:56,300 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:07:56,313 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:07:56,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@210bda2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:56, skipping insertion in model container [2019-12-07 17:07:56,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:07:56,314 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-12-07 17:07:56,316 INFO L168 Benchmark]: Toolchain (without parser) took 328.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:07:56,316 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:07:56,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -180.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:07:56,318 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 964.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -180.6 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:07:57,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:07:57,426 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:07:57,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:07:57,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:07:57,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:07:57,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:07:57,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:07:57,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:07:57,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:07:57,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:07:57,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:07:57,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:07:57,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:07:57,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:07:57,443 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:07:57,444 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:07:57,445 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:07:57,446 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:07:57,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:07:57,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:07:57,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:07:57,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:07:57,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:07:57,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:07:57,453 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:07:57,453 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:07:57,454 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:07:57,454 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:07:57,455 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:07:57,455 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:07:57,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:07:57,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:07:57,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:07:57,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:07:57,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:07:57,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:07:57,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:07:57,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:07:57,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:07:57,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:07:57,460 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-12-07 17:07:57,469 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:07:57,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:07:57,470 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:07:57,470 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:07:57,471 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:07:57,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:07:57,471 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:07:57,471 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 17:07:57,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:07:57,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:07:57,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:07:57,472 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 17:07:57,472 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 17:07:57,472 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 17:07:57,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:07:57,472 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 17:07:57,472 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 17:07:57,472 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 17:07:57,473 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:07:57,473 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:07:57,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:07:57,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:07:57,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:07:57,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:07:57,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:07:57,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:07:57,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:07:57,474 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 17:07:57,474 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 17:07:57,474 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:07:57,474 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 17:07:57,474 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_189feea9-2950-4e97-bdda-b1ec8eef74b9/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 -> 9de0b0c743a2720b24a0366af33371eca52f31f7 [2019-12-07 17:07:57,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:07:57,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:07:57,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:07:57,648 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:07:57,648 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:07:57,649 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i [2019-12-07 17:07:57,694 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/data/c6dd02b5d/59ad8d67391849f2aa6bc8846397e5b6/FLAG690a5a347 [2019-12-07 17:07:58,240 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:07:58,240 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/sv-benchmarks/c/ldv-memsafety/memleaks_test17_1-1.i [2019-12-07 17:07:58,251 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/data/c6dd02b5d/59ad8d67391849f2aa6bc8846397e5b6/FLAG690a5a347 [2019-12-07 17:07:58,688 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/data/c6dd02b5d/59ad8d67391849f2aa6bc8846397e5b6 [2019-12-07 17:07:58,690 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:07:58,690 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-07 17:07:58,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:07:58,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:07:58,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:07:58,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:07:58" (1/1) ... [2019-12-07 17:07:58,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5dd555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:58, skipping insertion in model container [2019-12-07 17:07:58,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:07:58" (1/1) ... [2019-12-07 17:07:58,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:07:58,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:07:58,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:07:58,982 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-07 17:07:58,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:07:59,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:07:59,031 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:07:59,066 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:07:59,119 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:07:59,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:59 WrapperNode [2019-12-07 17:07:59,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:07:59,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:07:59,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:07:59,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:07:59,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:59" (1/1) ... [2019-12-07 17:07:59,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:59" (1/1) ... [2019-12-07 17:07:59,146 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:59" (1/1) ... [2019-12-07 17:07:59,146 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:59" (1/1) ... [2019-12-07 17:07:59,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:59" (1/1) ... [2019-12-07 17:07:59,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:59" (1/1) ... [2019-12-07 17:07:59,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:59" (1/1) ... [2019-12-07 17:07:59,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:07:59,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:07:59,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:07:59,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:07:59,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/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:07:59,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-12-07 17:07:59,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:07:59,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 17:07:59,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 17:07:59,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-12-07 17:07:59,226 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-12-07 17:07:59,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-12-07 17:07:59,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-12-07 17:07:59,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-12-07 17:07:59,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-12-07 17:07:59,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-12-07 17:07:59,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-12-07 17:07:59,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-12-07 17:07:59,227 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-12-07 17:07:59,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-12-07 17:07:59,227 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-12-07 17:07:59,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-12-07 17:07:59,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-12-07 17:07:59,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-12-07 17:07:59,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-12-07 17:07:59,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-12-07 17:07:59,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-12-07 17:07:59,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-12-07 17:07:59,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-12-07 17:07:59,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-12-07 17:07:59,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-12-07 17:07:59,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-12-07 17:07:59,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-12-07 17:07:59,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-12-07 17:07:59,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-12-07 17:07:59,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-12-07 17:07:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-12-07 17:07:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-12-07 17:07:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-12-07 17:07:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-12-07 17:07:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-12-07 17:07:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-12-07 17:07:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-12-07 17:07:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-12-07 17:07:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-12-07 17:07:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-12-07 17:07:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-12-07 17:07:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_17 [2019-12-07 17:07:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure free_17 [2019-12-07 17:07:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-12-07 17:07:59,230 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-12-07 17:07:59,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-12-07 17:07:59,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-07 17:07:59,230 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-12-07 17:07:59,230 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-12-07 17:07:59,230 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-12-07 17:07:59,230 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-12-07 17:07:59,230 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-12-07 17:07:59,230 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-12-07 17:07:59,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-12-07 17:07:59,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-12-07 17:07:59,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-12-07 17:07:59,230 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-12-07 17:07:59,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-12-07 17:07:59,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-12-07 17:07:59,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-12-07 17:07:59,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-12-07 17:07:59,231 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-12-07 17:07:59,231 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-12-07 17:07:59,231 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-12-07 17:07:59,231 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-12-07 17:07:59,231 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-12-07 17:07:59,231 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-12-07 17:07:59,231 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-12-07 17:07:59,231 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-12-07 17:07:59,231 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-12-07 17:07:59,232 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-12-07 17:07:59,232 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-12-07 17:07:59,232 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-12-07 17:07:59,232 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-12-07 17:07:59,232 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-12-07 17:07:59,232 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-12-07 17:07:59,232 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-12-07 17:07:59,232 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-12-07 17:07:59,232 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-12-07 17:07:59,232 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-12-07 17:07:59,233 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-12-07 17:07:59,233 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-12-07 17:07:59,233 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-12-07 17:07:59,233 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-12-07 17:07:59,233 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-12-07 17:07:59,233 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-12-07 17:07:59,233 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-12-07 17:07:59,233 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-12-07 17:07:59,233 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-12-07 17:07:59,233 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-12-07 17:07:59,233 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-12-07 17:07:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-12-07 17:07:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-12-07 17:07:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-12-07 17:07:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-12-07 17:07:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-12-07 17:07:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-12-07 17:07:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-12-07 17:07:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-12-07 17:07:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-12-07 17:07:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-12-07 17:07:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-12-07 17:07:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-12-07 17:07:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-12-07 17:07:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-12-07 17:07:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-12-07 17:07:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-12-07 17:07:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-12-07 17:07:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-12-07 17:07:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-12-07 17:07:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-12-07 17:07:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-12-07 17:07:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-12-07 17:07:59,235 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-12-07 17:07:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-12-07 17:07:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-12-07 17:07:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-12-07 17:07:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-12-07 17:07:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-12-07 17:07:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-12-07 17:07:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-12-07 17:07:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-12-07 17:07:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-12-07 17:07:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-12-07 17:07:59,236 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-12-07 17:07:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-12-07 17:07:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-12-07 17:07:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-12-07 17:07:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-12-07 17:07:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-12-07 17:07:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-12-07 17:07:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-12-07 17:07:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-12-07 17:07:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-12-07 17:07:59,237 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-12-07 17:07:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-12-07 17:07:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-12-07 17:07:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-12-07 17:07:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-12-07 17:07:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-12-07 17:07:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-12-07 17:07:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-12-07 17:07:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-12-07 17:07:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-12-07 17:07:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-12-07 17:07:59,238 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-12-07 17:07:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-12-07 17:07:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-12-07 17:07:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-12-07 17:07:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-12-07 17:07:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-12-07 17:07:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-12-07 17:07:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-12-07 17:07:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-12-07 17:07:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-12-07 17:07:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-07 17:07:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-12-07 17:07:59,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-12-07 17:07:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-12-07 17:07:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-12-07 17:07:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-12-07 17:07:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-07 17:07:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:07:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-12-07 17:07:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-07 17:07:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-12-07 17:07:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:07:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-12-07 17:07:59,240 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-12-07 17:07:59,241 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-12-07 17:07:59,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:07:59,241 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-12-07 17:07:59,241 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-12-07 17:07:59,241 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-12-07 17:07:59,241 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-12-07 17:07:59,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-12-07 17:07:59,241 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-12-07 17:07:59,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:07:59,241 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-12-07 17:07:59,241 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-12-07 17:07:59,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-12-07 17:07:59,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-12-07 17:07:59,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-12-07 17:07:59,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 17:07:59,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 17:07:59,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-12-07 17:07:59,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-12-07 17:07:59,242 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-12-07 17:07:59,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-12-07 17:07:59,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-12-07 17:07:59,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-12-07 17:07:59,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-12-07 17:07:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-12-07 17:07:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-12-07 17:07:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-12-07 17:07:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-12-07 17:07:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-12-07 17:07:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-12-07 17:07:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-12-07 17:07:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-12-07 17:07:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-12-07 17:07:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-12-07 17:07:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_17 [2019-12-07 17:07:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure free_17 [2019-12-07 17:07:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-12-07 17:07:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-12-07 17:07:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-12-07 17:07:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:07:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 17:07:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:07:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-12-07 17:07:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-12-07 17:07:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-12-07 17:07:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-12-07 17:07:59,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-12-07 17:07:59,594 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 17:07:59,841 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 17:08:00,173 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:08:00,173 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 17:08:00,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:08:00 BoogieIcfgContainer [2019-12-07 17:08:00,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:08:00,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:08:00,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:08:00,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:08:00,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:07:58" (1/3) ... [2019-12-07 17:08:00,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49128696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:08:00, skipping insertion in model container [2019-12-07 17:08:00,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:59" (2/3) ... [2019-12-07 17:08:00,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49128696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:08:00, skipping insertion in model container [2019-12-07 17:08:00,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:08:00" (3/3) ... [2019-12-07 17:08:00,179 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1-1.i [2019-12-07 17:08:00,185 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:08:00,190 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 87 error locations. [2019-12-07 17:08:00,197 INFO L249 AbstractCegarLoop]: Starting to check reachability of 87 error locations. [2019-12-07 17:08:00,210 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:08:00,210 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 17:08:00,211 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:08:00,211 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:08:00,211 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:08:00,211 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:08:00,211 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:08:00,211 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:08:00,228 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-12-07 17:08:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:08:00,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:00,236 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:00,236 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:08:00,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:00,240 INFO L82 PathProgramCache]: Analyzing trace with hash -200276895, now seen corresponding path program 1 times [2019-12-07 17:08:00,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:08:00,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923383465] [2019-12-07 17:08:00,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/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:08:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:00,377 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 17:08:00,383 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:08:00,447 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:08:00,448 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:08:00,455 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:08:00,455 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:08:00,455 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:08:00,520 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:08:00,520 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:08:01,148 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:08:01,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923383465] [2019-12-07 17:08:01,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:01,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-12-07 17:08:01,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800490269] [2019-12-07 17:08:01,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:08:01,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:08:01,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:08:01,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:08:01,170 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 14 states. [2019-12-07 17:08:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:02,198 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2019-12-07 17:08:02,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:08:02,200 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2019-12-07 17:08:02,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:02,207 INFO L225 Difference]: With dead ends: 91 [2019-12-07 17:08:02,208 INFO L226 Difference]: Without dead ends: 88 [2019-12-07 17:08:02,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:08:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-07 17:08:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 77. [2019-12-07 17:08:02,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-12-07 17:08:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2019-12-07 17:08:02,240 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 16 [2019-12-07 17:08:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:02,241 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2019-12-07 17:08:02,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:08:02,241 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2019-12-07 17:08:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:08:02,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:02,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:02,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 17:08:02,445 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:08:02,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:02,446 INFO L82 PathProgramCache]: Analyzing trace with hash -200276896, now seen corresponding path program 1 times [2019-12-07 17:08:02,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:08:02,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350590057] [2019-12-07 17:08:02,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/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:08:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:02,560 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:08:02,562 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:08:02,566 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:08:02,566 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:08:02,568 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:08:02,568 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:08:02,568 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:08:02,584 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:08:02,584 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:08:02,607 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:08:02,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350590057] [2019-12-07 17:08:02,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:02,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 17:08:02,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446780487] [2019-12-07 17:08:02,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:08:02,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:08:02,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:08:02,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:08:02,609 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 5 states. [2019-12-07 17:08:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:02,747 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2019-12-07 17:08:02,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:08:02,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 17:08:02,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:02,749 INFO L225 Difference]: With dead ends: 83 [2019-12-07 17:08:02,749 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 17:08:02,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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:08:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 17:08:02,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-12-07 17:08:02,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-12-07 17:08:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2019-12-07 17:08:02,756 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 16 [2019-12-07 17:08:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:02,757 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2019-12-07 17:08:02,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:08:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2019-12-07 17:08:02,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:08:02,757 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:02,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:02,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 17:08:02,959 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:08:02,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:02,959 INFO L82 PathProgramCache]: Analyzing trace with hash 687226786, now seen corresponding path program 1 times [2019-12-07 17:08:02,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:08:02,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973098937] [2019-12-07 17:08:02,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/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:08:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:03,076 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:08:03,077 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:08:03,097 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:08:03,098 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:08:03,122 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:08:03,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973098937] [2019-12-07 17:08:03,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:03,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 17:08:03,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759932914] [2019-12-07 17:08:03,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:08:03,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:08:03,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:08:03,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:08:03,123 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand 5 states. [2019-12-07 17:08:03,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:03,144 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2019-12-07 17:08:03,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:08:03,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 17:08:03,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:03,145 INFO L225 Difference]: With dead ends: 78 [2019-12-07 17:08:03,145 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 17:08:03,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 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:08:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 17:08:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-12-07 17:08:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 17:08:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-12-07 17:08:03,151 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 16 [2019-12-07 17:08:03,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:03,151 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-12-07 17:08:03,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:08:03,151 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-12-07 17:08:03,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:08:03,152 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:03,152 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:03,352 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 17:08:03,354 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:08:03,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:03,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1913632700, now seen corresponding path program 1 times [2019-12-07 17:08:03,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:08:03,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656427949] [2019-12-07 17:08:03,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/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:08:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:03,495 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:08:03,496 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:08:03,509 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:08:03,509 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:08:03,555 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:08:03,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656427949] [2019-12-07 17:08:03,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:03,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 17:08:03,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168670214] [2019-12-07 17:08:03,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:08:03,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:08:03,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:08:03,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:08:03,556 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 5 states. [2019-12-07 17:08:03,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:03,584 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-12-07 17:08:03,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:08:03,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 17:08:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:03,585 INFO L225 Difference]: With dead ends: 78 [2019-12-07 17:08:03,585 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 17:08:03,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:08:03,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 17:08:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-12-07 17:08:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 17:08:03,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2019-12-07 17:08:03,590 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 17 [2019-12-07 17:08:03,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:03,590 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2019-12-07 17:08:03,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:08:03,591 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2019-12-07 17:08:03,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 17:08:03,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:03,591 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:03,791 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 17:08:03,793 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:08:03,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:03,794 INFO L82 PathProgramCache]: Analyzing trace with hash -170822365, now seen corresponding path program 1 times [2019-12-07 17:08:03,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:08:03,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616073641] [2019-12-07 17:08:03,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/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:08:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:03,909 INFO L264 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:08:03,910 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:08:03,916 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:08:03,917 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:08:03,943 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:08:03,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616073641] [2019-12-07 17:08:03,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:03,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 17:08:03,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157145215] [2019-12-07 17:08:03,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:08:03,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:08:03,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:08:03,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:08:03,944 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 3 states. [2019-12-07 17:08:04,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:04,029 INFO L93 Difference]: Finished difference Result 114 states and 127 transitions. [2019-12-07 17:08:04,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:08:04,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 17:08:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:04,030 INFO L225 Difference]: With dead ends: 114 [2019-12-07 17:08:04,030 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 17:08:04,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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:08:04,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 17:08:04,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 74. [2019-12-07 17:08:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 17:08:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2019-12-07 17:08:04,035 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 17 [2019-12-07 17:08:04,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:04,036 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2019-12-07 17:08:04,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:08:04,036 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2019-12-07 17:08:04,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:08:04,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:04,036 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:04,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 17:08:04,238 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:08:04,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:04,239 INFO L82 PathProgramCache]: Analyzing trace with hash -73256383, now seen corresponding path program 1 times [2019-12-07 17:08:04,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:08:04,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076474754] [2019-12-07 17:08:04,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/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:08:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:04,402 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 17:08:04,403 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:08:04,414 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:08:04,415 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:08:04,420 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:08:04,420 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:08:04,420 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:08:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:08:04,499 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:08:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:08:05,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076474754] [2019-12-07 17:08:05,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:08:05,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2019-12-07 17:08:05,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008928106] [2019-12-07 17:08:05,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:08:05,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:08:05,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:08:05,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:08:05,496 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 18 states. [2019-12-07 17:08:06,997 WARN L192 SmtUtils]: Spent 356.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-12-07 17:08:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:07,533 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2019-12-07 17:08:07,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:08:07,534 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2019-12-07 17:08:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:07,535 INFO L225 Difference]: With dead ends: 91 [2019-12-07 17:08:07,535 INFO L226 Difference]: Without dead ends: 91 [2019-12-07 17:08:07,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2019-12-07 17:08:07,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-07 17:08:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2019-12-07 17:08:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-07 17:08:07,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-12-07 17:08:07,540 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 22 [2019-12-07 17:08:07,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:07,541 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-12-07 17:08:07,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:08:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-12-07 17:08:07,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:08:07,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:07,542 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 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:08:07,742 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 17:08:07,744 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:08:07,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:07,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1067902475, now seen corresponding path program 1 times [2019-12-07 17:08:07,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:08:07,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787595343] [2019-12-07 17:08:07,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/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:08:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:07,978 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:08:07,979 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:08:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:08:08,013 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:08:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:08:08,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787595343] [2019-12-07 17:08:08,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:08:08,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-12-07 17:08:08,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117390526] [2019-12-07 17:08:08,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:08:08,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:08:08,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:08:08,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:08:08,127 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 12 states. [2019-12-07 17:08:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:08,400 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2019-12-07 17:08:08,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:08:08,400 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-12-07 17:08:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:08,401 INFO L225 Difference]: With dead ends: 92 [2019-12-07 17:08:08,401 INFO L226 Difference]: Without dead ends: 92 [2019-12-07 17:08:08,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:08:08,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-07 17:08:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-12-07 17:08:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 17:08:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2019-12-07 17:08:08,405 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 35 [2019-12-07 17:08:08,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:08,406 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2019-12-07 17:08:08,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:08:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2019-12-07 17:08:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:08:08,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:08,406 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:08,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 17:08:08,608 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:08:08,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:08,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1190057473, now seen corresponding path program 2 times [2019-12-07 17:08:08,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:08:08,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57483924] [2019-12-07 17:08:08,611 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/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:08:08,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:08:08,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:08:08,831 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 17:08:08,832 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:08:08,841 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:08:08,841 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:08:08,845 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:08:08,846 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:08:08,846 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:08:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:08:09,072 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:08:10,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:08:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:08:11,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57483924] [2019-12-07 17:08:11,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:08:11,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2019-12-07 17:08:11,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599151191] [2019-12-07 17:08:11,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 17:08:11,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:08:11,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 17:08:11,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:08:11,294 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 28 states. [2019-12-07 17:08:12,674 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2019-12-07 17:08:13,099 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2019-12-07 17:08:13,819 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-12-07 17:08:14,654 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-12-07 17:08:15,026 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-12-07 17:08:15,735 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 17:08:16,369 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-12-07 17:08:17,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:17,410 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2019-12-07 17:08:17,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 17:08:17,412 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2019-12-07 17:08:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:17,413 INFO L225 Difference]: With dead ends: 112 [2019-12-07 17:08:17,413 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 17:08:17,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=487, Invalid=1493, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 17:08:17,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 17:08:17,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-12-07 17:08:17,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-07 17:08:17,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2019-12-07 17:08:17,418 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 34 [2019-12-07 17:08:17,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:17,419 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2019-12-07 17:08:17,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 17:08:17,419 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2019-12-07 17:08:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:08:17,420 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:17,420 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 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:08:17,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 17:08:17,622 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:08:17,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:17,623 INFO L82 PathProgramCache]: Analyzing trace with hash -321692208, now seen corresponding path program 2 times [2019-12-07 17:08:17,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:08:17,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860431490] [2019-12-07 17:08:17,624 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 17:08:17,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-12-07 17:08:17,776 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:08:17,778 INFO L264 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:08:17,780 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:08:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 17:08:17,797 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:08:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 17:08:17,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860431490] [2019-12-07 17:08:17,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:17,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-12-07 17:08:17,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424805412] [2019-12-07 17:08:17,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:08:17,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:08:17,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:08:17,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:08:17,847 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand 7 states. [2019-12-07 17:08:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:17,912 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2019-12-07 17:08:17,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:08:17,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 17:08:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:17,914 INFO L225 Difference]: With dead ends: 141 [2019-12-07 17:08:17,914 INFO L226 Difference]: Without dead ends: 138 [2019-12-07 17:08:17,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:08:17,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-07 17:08:17,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 111. [2019-12-07 17:08:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 17:08:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2019-12-07 17:08:17,919 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 50 [2019-12-07 17:08:17,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:17,920 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2019-12-07 17:08:17,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:08:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2019-12-07 17:08:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:08:17,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:17,921 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:18,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 17:08:18,123 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:08:18,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:18,124 INFO L82 PathProgramCache]: Analyzing trace with hash 115614506, now seen corresponding path program 1 times [2019-12-07 17:08:18,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:08:18,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390290795] [2019-12-07 17:08:18,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 17:08:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:18,312 INFO L264 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 17:08:18,314 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:08:18,409 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:08:18,409 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:08:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 17:08:18,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390290795] [2019-12-07 17:08:18,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:08:18,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-12-07 17:08:18,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533361443] [2019-12-07 17:08:18,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 17:08:18,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:08:18,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 17:08:18,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:08:18,779 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 22 states. [2019-12-07 17:08:19,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:19,189 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2019-12-07 17:08:19,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:08:19,190 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2019-12-07 17:08:19,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:19,191 INFO L225 Difference]: With dead ends: 111 [2019-12-07 17:08:19,191 INFO L226 Difference]: Without dead ends: 111 [2019-12-07 17:08:19,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:08:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-12-07 17:08:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-12-07 17:08:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 17:08:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2019-12-07 17:08:19,195 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 50 [2019-12-07 17:08:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:19,196 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2019-12-07 17:08:19,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 17:08:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2019-12-07 17:08:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:08:19,197 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:19,198 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:19,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 17:08:19,398 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:08:19,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1051535094, now seen corresponding path program 2 times [2019-12-07 17:08:19,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:08:19,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528632348] [2019-12-07 17:08:19,399 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 17:08:19,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:08:19,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:08:19,534 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 17:08:19,535 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:08:19,539 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:08:19,539 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:08:19,540 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:08:19,540 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:08:19,540 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:08:19,602 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:08:19,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 17:08:19,602 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:08:19,615 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 17:08:19,615 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:08:19,615 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-12-07 17:08:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-12-07 17:08:19,638 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:08:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-12-07 17:08:22,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528632348] [2019-12-07 17:08:22,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:08:22,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-12-07 17:08:22,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141552706] [2019-12-07 17:08:22,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 17:08:22,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:08:22,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 17:08:22,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=229, Unknown=1, NotChecked=0, Total=272 [2019-12-07 17:08:22,041 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 17 states. [2019-12-07 17:08:43,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:43,585 INFO L93 Difference]: Finished difference Result 208 states and 237 transitions. [2019-12-07 17:08:43,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:08:43,586 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-12-07 17:08:43,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:43,587 INFO L225 Difference]: With dead ends: 208 [2019-12-07 17:08:43,587 INFO L226 Difference]: Without dead ends: 208 [2019-12-07 17:08:43,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=105, Invalid=494, Unknown=1, NotChecked=0, Total=600 [2019-12-07 17:08:43,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-12-07 17:08:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 109. [2019-12-07 17:08:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-12-07 17:08:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2019-12-07 17:08:43,593 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 56 [2019-12-07 17:08:43,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:43,593 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2019-12-07 17:08:43,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 17:08:43,593 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2019-12-07 17:08:43,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:08:43,594 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:43,594 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:43,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 17:08:43,795 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:08:43,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:43,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1051535093, now seen corresponding path program 1 times [2019-12-07 17:08:43,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:08:43,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445149369] [2019-12-07 17:08:43,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 17:08:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:43,984 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-07 17:08:43,985 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:08:43,997 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:08:43,997 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:08:44,003 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:08:44,006 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:08:44,006 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:08:44,011 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:08:44,011 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:08:44,011 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-12-07 17:08:46,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:08:46,150 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-12-07 17:08:46,150 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:08:46,163 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:08:46,170 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:08:46,170 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 17:08:46,170 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:08:46,180 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:08:46,180 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:08:46,181 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2019-12-07 17:08:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-12-07 17:08:46,214 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:08:46,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:08:46,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:08:46,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:08:46,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:08:53,488 WARN L192 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-12-07 17:08:53,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:09:03,989 WARN L192 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-12-07 17:09:04,905 INFO L430 ElimStorePlain]: Different costs {1=[|v_#valid_259|], 2=[|v_#length_220|]} [2019-12-07 17:09:04,912 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 17:09:04,912 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:09:04,920 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:09:04,921 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:09:04,922 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:09:04,929 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:09:04,929 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:09:04,929 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:23, output treesize:5 [2019-12-07 17:09:05,511 INFO L430 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-12-07 17:09:05,518 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 17:09:05,518 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:09:05,537 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:09:05,539 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:09:05,540 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:09:05,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:09:05,556 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:09:05,556 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:33, output treesize:16 [2019-12-07 17:09:05,703 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-12-07 17:09:05,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445149369] [2019-12-07 17:09:05,703 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:09:05,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-12-07 17:09:05,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028603959] [2019-12-07 17:09:05,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 17:09:05,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:09:05,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 17:09:05,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=405, Unknown=5, NotChecked=0, Total=462 [2019-12-07 17:09:05,704 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 22 states. [2019-12-07 17:09:32,653 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= (_ bv0 32) |c_ldv_malloc_#res.offset|) (= (bvadd (select |c_#valid| |c_ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1)) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (forall ((v_alloc_17_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse1 (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvule .cse0 (select |c_#length| v_alloc_17_~array.base_BEFORE_CALL_4)) (not (bvule (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2) .cse0)) (exists ((v_ldv_malloc_~size_55 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_48| (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_48| v_ldv_malloc_~size_55) v_alloc_17_~array.base_BEFORE_CALL_4))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_48|) (_ bv0 1)))))))) (forall ((v_alloc_17_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_4 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_49| (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32))) (let ((.cse2 (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse3 (bvadd .cse2 v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_49|))) (not (bvule (bvadd .cse2 v_alloc_17_~array.offset_BEFORE_CALL_2) .cse3)) (bvule .cse3 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_49| ldv_malloc_~size) v_alloc_17_~array.base_BEFORE_CALL_4)) (exists ((v_ldv_malloc_~size_55 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_48| (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_48| v_ldv_malloc_~size_55) v_alloc_17_~array.base_BEFORE_CALL_4))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_48|) (_ bv0 1)))))))) (exists ((v_prenex_4 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4)))) is different from false [2019-12-07 17:09:36,705 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv0 32) |c_ldv_malloc_#res.offset|) (= (bvadd (select |c_#valid| |c_ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1)) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (forall ((v_alloc_17_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse1 (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvule .cse0 (select |c_#length| v_alloc_17_~array.base_BEFORE_CALL_4)) (not (bvule (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2) .cse0)) (exists ((v_ldv_malloc_~size_55 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_48| (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_48| v_ldv_malloc_~size_55) v_alloc_17_~array.base_BEFORE_CALL_4))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_48|) (_ bv0 1)))))))) (exists ((v_prenex_4 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4)))) is different from false [2019-12-07 17:09:43,945 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-12-07 17:10:01,498 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= |c_#valid| |c_old(#valid)|) (forall ((v_alloc_17_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse1 (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvule .cse0 (select |c_#length| v_alloc_17_~array.base_BEFORE_CALL_4)) (not (bvule (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2) .cse0)) (exists ((v_ldv_malloc_~size_55 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_48| (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_48| v_ldv_malloc_~size_55) v_alloc_17_~array.base_BEFORE_CALL_4))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_48|) (_ bv0 1)))))))) (= |c_old(#length)| |c_#length|) (exists ((v_prenex_4 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4)))) is different from false [2019-12-07 17:10:38,996 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-12-07 17:10:45,315 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv1 1) (select |c_#valid| c_alloc_17_~array.base)) (= (_ bv40 32) (select |c_#length| c_alloc_17_~array.base)) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (_ bv40 32) (select |c_#length| |c_alloc_17_#in~array.base|)) (= |c_#valid| |c_old(#valid)|) (forall ((v_alloc_17_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse1 (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvule .cse0 (select |c_#length| v_alloc_17_~array.base_BEFORE_CALL_4)) (not (bvule (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2) .cse0)) (exists ((v_ldv_malloc_~size_55 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_48| (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_48| v_ldv_malloc_~size_55) v_alloc_17_~array.base_BEFORE_CALL_4))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_48|) (_ bv0 1)))))))) (= |c_old(#length)| |c_#length|) (= c_alloc_17_~array.offset (_ bv0 32)) (= (_ bv0 32) c_alloc_17_~i~0) (= (_ bv1 1) (select |c_#valid| |c_alloc_17_#in~array.base|)) (exists ((v_prenex_4 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4))) (= |c_alloc_17_#in~array.offset| (_ bv0 32))) is different from false [2019-12-07 17:11:38,984 WARN L192 SmtUtils]: Spent 46.55 s on a formula simplification. DAG size of input: 72 DAG size of output: 44 [2019-12-07 17:11:43,639 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (_ bv40 32) (select |c_#length| |c_alloc_17_#in~array.base|)) (= |c_#valid| |c_old(#valid)|) (forall ((v_alloc_17_~i~0_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_17_~array.base_BEFORE_CALL_4 (_ BitVec 32))) (let ((.cse1 (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)))) (or (bvule .cse0 (select |c_#length| v_alloc_17_~array.base_BEFORE_CALL_4)) (not (bvule (bvadd .cse1 v_alloc_17_~array.offset_BEFORE_CALL_2) .cse0)) (exists ((v_ldv_malloc_~size_55 (_ BitVec 32)) (|v_ldv_malloc_#t~malloc12.base_48| (_ BitVec 32))) (and (not (bvule (bvadd (bvmul v_alloc_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) v_alloc_17_~array.offset_BEFORE_CALL_2 (_ bv4 32)) (select (store |c_old(#length)| |v_ldv_malloc_#t~malloc12.base_48| v_ldv_malloc_~size_55) v_alloc_17_~array.base_BEFORE_CALL_4))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_48|) (_ bv0 1)))))))) (= |c_old(#length)| |c_#length|) (= (_ bv1 1) (select |c_#valid| |c_alloc_17_#in~array.base|)) (exists ((v_prenex_4 (_ BitVec 32))) (= (_ bv0 1) (select |c_old(#valid)| v_prenex_4))) (= |c_alloc_17_#in~array.offset| (_ bv0 32))) is different from false [2019-12-07 17:11:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:43,655 INFO L93 Difference]: Finished difference Result 243 states and 280 transitions. [2019-12-07 17:11:43,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 17:11:43,656 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-12-07 17:11:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:43,657 INFO L225 Difference]: With dead ends: 243 [2019-12-07 17:11:43,657 INFO L226 Difference]: Without dead ends: 243 [2019-12-07 17:11:43,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 88 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 85.3s TimeCoverageRelationStatistics Valid=121, Invalid=698, Unknown=13, NotChecked=290, Total=1122 [2019-12-07 17:11:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-12-07 17:11:43,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 119. [2019-12-07 17:11:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 17:11:43,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 136 transitions. [2019-12-07 17:11:43,662 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 136 transitions. Word has length 56 [2019-12-07 17:11:43,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:43,662 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 136 transitions. [2019-12-07 17:11:43,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 17:11:43,662 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 136 transitions. [2019-12-07 17:11:43,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:11:43,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:43,663 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:43,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 17:11:43,865 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:11:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:43,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1207954601, now seen corresponding path program 1 times [2019-12-07 17:11:43,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:11:43,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342557654] [2019-12-07 17:11:43,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 17:11:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:44,029 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:11:44,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:11:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-12-07 17:11:44,042 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:11:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-12-07 17:11:44,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342557654] [2019-12-07 17:11:44,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:11:44,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 17:11:44,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821999140] [2019-12-07 17:11:44,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:11:44,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:11:44,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:11:44,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:11:44,066 INFO L87 Difference]: Start difference. First operand 119 states and 136 transitions. Second operand 5 states. [2019-12-07 17:11:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:44,106 INFO L93 Difference]: Finished difference Result 142 states and 165 transitions. [2019-12-07 17:11:44,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:11:44,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-07 17:11:44,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:44,107 INFO L225 Difference]: With dead ends: 142 [2019-12-07 17:11:44,108 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 17:11:44,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:11:44,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 17:11:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2019-12-07 17:11:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-12-07 17:11:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2019-12-07 17:11:44,111 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 58 [2019-12-07 17:11:44,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:44,111 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2019-12-07 17:11:44,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:11:44,111 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2019-12-07 17:11:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:11:44,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:44,112 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:44,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 17:11:44,314 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:11:44,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:44,314 INFO L82 PathProgramCache]: Analyzing trace with hash 534855734, now seen corresponding path program 1 times [2019-12-07 17:11:44,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:11:44,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114309373] [2019-12-07 17:11:44,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 17:11:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:44,444 INFO L264 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:11:44,445 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:11:44,454 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-12-07 17:11:44,455 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:11:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-12-07 17:11:44,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114309373] [2019-12-07 17:11:44,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:11:44,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:11:44,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104495715] [2019-12-07 17:11:44,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:11:44,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:11:44,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:11:44,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:11:44,476 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand 6 states. [2019-12-07 17:11:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:44,548 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2019-12-07 17:11:44,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:11:44,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-07 17:11:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:44,550 INFO L225 Difference]: With dead ends: 132 [2019-12-07 17:11:44,550 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 17:11:44,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:11:44,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 17:11:44,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2019-12-07 17:11:44,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-12-07 17:11:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2019-12-07 17:11:44,554 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 58 [2019-12-07 17:11:44,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:44,554 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2019-12-07 17:11:44,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:11:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2019-12-07 17:11:44,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:11:44,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:44,555 INFO L410 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:44,755 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 17:11:44,757 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:11:44,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:44,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1546730881, now seen corresponding path program 3 times [2019-12-07 17:11:44,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:11:44,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141241458] [2019-12-07 17:11:44,758 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 17:11:45,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-12-07 17:11:45,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:11:45,155 INFO L264 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 17:11:45,156 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:11:45,166 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:11:45,166 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:45,170 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:45,170 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:45,170 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:11:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 41 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:11:45,534 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:11:47,173 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-12-07 17:11:47,810 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-12-07 17:11:51,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:52,627 WARN L192 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-12-07 17:11:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:11:53,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141241458] [2019-12-07 17:11:53,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:11:53,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2019-12-07 17:11:53,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215000297] [2019-12-07 17:11:53,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-07 17:11:53,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:11:53,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-07 17:11:53,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1402, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 17:11:53,405 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 42 states. [2019-12-07 17:11:58,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:58,487 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2019-12-07 17:11:58,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:11:58,489 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 58 [2019-12-07 17:11:58,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:58,489 INFO L225 Difference]: With dead ends: 113 [2019-12-07 17:11:58,489 INFO L226 Difference]: Without dead ends: 113 [2019-12-07 17:11:58,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=589, Invalid=2491, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 17:11:58,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-12-07 17:11:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-12-07 17:11:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-12-07 17:11:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2019-12-07 17:11:58,494 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 58 [2019-12-07 17:11:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:58,494 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2019-12-07 17:11:58,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-07 17:11:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2019-12-07 17:11:58,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:11:58,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:58,495 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:58,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 17:11:58,696 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:11:58,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:58,697 INFO L82 PathProgramCache]: Analyzing trace with hash 926469409, now seen corresponding path program 1 times [2019-12-07 17:11:58,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:11:58,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169488326] [2019-12-07 17:11:58,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 17:11:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:58,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 17:11:58,897 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:11:58,901 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:11:58,901 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:58,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:58,903 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:58,903 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 17:11:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-12-07 17:11:58,939 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:11:58,987 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_6| (Array (_ BitVec 32) (_ BitVec 1)))) (or (forall ((v_prenex_12 (_ BitVec 32))) (or (= (bvadd (select |c_#valid| v_prenex_12) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv1 1) (select |v_old(#valid)_BEFORE_CALL_6| v_prenex_12))))) (exists ((v_entry_point_~array~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv1 1) (select |v_old(#valid)_BEFORE_CALL_6| v_entry_point_~array~0.base_BEFORE_CALL_5)) (not (= (_ bv1 1) (select |c_old(#valid)| v_entry_point_~array~0.base_BEFORE_CALL_5))))))) is different from false [2019-12-07 17:11:58,993 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_prenex_12 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_6| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (bvadd (select |c_#valid| v_prenex_12) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv1 1) (select |v_old(#valid)_BEFORE_CALL_6| v_prenex_12))) (exists ((v_entry_point_~array~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv1 1) (select |v_old(#valid)_BEFORE_CALL_6| v_entry_point_~array~0.base_BEFORE_CALL_5)) (not (= (_ bv1 1) (select |c_old(#valid)| v_entry_point_~array~0.base_BEFORE_CALL_5))))))) is different from false [2019-12-07 17:11:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2019-12-07 17:11:59,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169488326] [2019-12-07 17:11:59,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:11:59,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 10 [2019-12-07 17:11:59,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835747145] [2019-12-07 17:11:59,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:11:59,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:11:59,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:11:59,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=58, Unknown=2, NotChecked=30, Total=110 [2019-12-07 17:11:59,033 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand 11 states. [2019-12-07 17:11:59,170 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_12 (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_6| (Array (_ BitVec 32) (_ BitVec 1)))) (or (= (bvadd (select |c_#valid| v_prenex_12) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv1 1) (select |v_old(#valid)_BEFORE_CALL_6| v_prenex_12))) (exists ((v_entry_point_~array~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv1 1) (select |v_old(#valid)_BEFORE_CALL_6| v_entry_point_~array~0.base_BEFORE_CALL_5)) (not (= (_ bv1 1) (select |c_old(#valid)| v_entry_point_~array~0.base_BEFORE_CALL_5))))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2019-12-07 17:11:59,174 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_6| (Array (_ BitVec 32) (_ BitVec 1)))) (or (forall ((v_prenex_12 (_ BitVec 32))) (or (= (bvadd (select |c_#valid| v_prenex_12) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv1 1) (select |v_old(#valid)_BEFORE_CALL_6| v_prenex_12))))) (exists ((v_entry_point_~array~0.base_BEFORE_CALL_5 (_ BitVec 32))) (and (= (_ bv1 1) (select |v_old(#valid)_BEFORE_CALL_6| v_entry_point_~array~0.base_BEFORE_CALL_5)) (not (= (_ bv1 1) (select |c_old(#valid)| v_entry_point_~array~0.base_BEFORE_CALL_5))))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2019-12-07 17:11:59,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:59,437 INFO L93 Difference]: Finished difference Result 175 states and 198 transitions. [2019-12-07 17:11:59,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:11:59,438 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-07 17:11:59,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:59,439 INFO L225 Difference]: With dead ends: 175 [2019-12-07 17:11:59,439 INFO L226 Difference]: Without dead ends: 175 [2019-12-07 17:11:59,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=168, Unknown=4, NotChecked=116, Total=342 [2019-12-07 17:11:59,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-07 17:11:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 148. [2019-12-07 17:11:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 17:11:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2019-12-07 17:11:59,443 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 65 [2019-12-07 17:11:59,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:59,443 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2019-12-07 17:11:59,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:11:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2019-12-07 17:11:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:11:59,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:59,444 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:59,645 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 17:11:59,645 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:11:59,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:59,646 INFO L82 PathProgramCache]: Analyzing trace with hash 926469410, now seen corresponding path program 1 times [2019-12-07 17:11:59,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:11:59,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701697029] [2019-12-07 17:11:59,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 17:11:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:59,864 INFO L264 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 17:11:59,865 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:11:59,875 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:11:59,875 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:59,880 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:59,880 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:59,880 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 17:11:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-12-07 17:11:59,976 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:12:00,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:00,348 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_entry_point_~array~0.offset_BEFORE_CALL_4 (_ BitVec 32)) (v_entry_point_~array~0.base_BEFORE_CALL_8 (_ BitVec 32)) (|v_old(#length)_BEFORE_CALL_2| (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_4 (_ bv4 32)))) (or (bvule .cse0 (select |c_#length| v_entry_point_~array~0.base_BEFORE_CALL_8)) (exists ((v_prenex_13 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (bvadd v_prenex_13 (_ bv4 32)))) (and (bvule v_prenex_13 .cse1) (not (bvule .cse1 (select |c_old(#length)| v_prenex_14))) (bvule .cse1 (select |v_old(#length)_BEFORE_CALL_2| v_prenex_14))))) (not (bvule v_entry_point_~array~0.offset_BEFORE_CALL_4 .cse0)) (not (bvule .cse0 (select |v_old(#length)_BEFORE_CALL_2| v_entry_point_~array~0.base_BEFORE_CALL_8)))))) is different from false [2019-12-07 17:12:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 3 not checked. [2019-12-07 17:12:00,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701697029] [2019-12-07 17:12:00,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:12:00,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2019-12-07 17:12:00,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417129813] [2019-12-07 17:12:00,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 17:12:00,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:12:00,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 17:12:00,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=266, Unknown=1, NotChecked=32, Total=342 [2019-12-07 17:12:00,876 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand 19 states. [2019-12-07 17:12:01,333 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_entry_point_~array~0.offset_BEFORE_CALL_4 (_ BitVec 32)) (v_entry_point_~array~0.base_BEFORE_CALL_8 (_ BitVec 32)) (|v_old(#length)_BEFORE_CALL_2| (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_4 (_ bv4 32)))) (or (bvule .cse0 (select |c_#length| v_entry_point_~array~0.base_BEFORE_CALL_8)) (exists ((v_prenex_13 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (bvadd v_prenex_13 (_ bv4 32)))) (and (bvule v_prenex_13 .cse1) (not (bvule .cse1 (select |c_old(#length)| v_prenex_14))) (bvule .cse1 (select |v_old(#length)_BEFORE_CALL_2| v_prenex_14))))) (not (bvule v_entry_point_~array~0.offset_BEFORE_CALL_4 .cse0)) (not (bvule .cse0 (select |v_old(#length)_BEFORE_CALL_2| v_entry_point_~array~0.base_BEFORE_CALL_8)))))) (= |c_old(#length)| |c_#length|)) is different from false [2019-12-07 17:12:01,345 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_entry_point_~array~0.offset_BEFORE_CALL_4 (_ BitVec 32)) (v_entry_point_~array~0.base_BEFORE_CALL_8 (_ BitVec 32)) (|v_old(#length)_BEFORE_CALL_2| (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd v_entry_point_~array~0.offset_BEFORE_CALL_4 (_ bv4 32)))) (or (bvule .cse0 (select |c_#length| v_entry_point_~array~0.base_BEFORE_CALL_8)) (exists ((v_prenex_13 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse1 (bvadd v_prenex_13 (_ bv4 32)))) (and (bvule v_prenex_13 .cse1) (not (bvule .cse1 (select |c_old(#length)| v_prenex_14))) (bvule .cse1 (select |v_old(#length)_BEFORE_CALL_2| v_prenex_14))))) (not (bvule v_entry_point_~array~0.offset_BEFORE_CALL_4 .cse0)) (not (bvule .cse0 (select |v_old(#length)_BEFORE_CALL_2| v_entry_point_~array~0.base_BEFORE_CALL_8)))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= |c_old(#length)| |c_#length|)) is different from false [2019-12-07 17:12:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:03,080 INFO L93 Difference]: Finished difference Result 200 states and 228 transitions. [2019-12-07 17:12:03,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:12:03,081 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2019-12-07 17:12:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:03,082 INFO L225 Difference]: With dead ends: 200 [2019-12-07 17:12:03,082 INFO L226 Difference]: Without dead ends: 200 [2019-12-07 17:12:03,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 110 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=108, Invalid=603, Unknown=3, NotChecked=156, Total=870 [2019-12-07 17:12:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-12-07 17:12:03,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 176. [2019-12-07 17:12:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 17:12:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 219 transitions. [2019-12-07 17:12:03,087 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 219 transitions. Word has length 65 [2019-12-07 17:12:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:03,087 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 219 transitions. [2019-12-07 17:12:03,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 17:12:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 219 transitions. [2019-12-07 17:12:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:12:03,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:03,088 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:03,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 17:12:03,289 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:12:03,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:03,290 INFO L82 PathProgramCache]: Analyzing trace with hash 2041542736, now seen corresponding path program 1 times [2019-12-07 17:12:03,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:12:03,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453951063] [2019-12-07 17:12:03,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 17:12:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:03,477 INFO L264 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:12:03,478 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:12:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-12-07 17:12:03,506 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:12:03,604 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-12-07 17:12:03,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453951063] [2019-12-07 17:12:03,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:12:03,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-12-07 17:12:03,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388098894] [2019-12-07 17:12:03,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:12:03,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:12:03,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:12:03,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:12:03,605 INFO L87 Difference]: Start difference. First operand 176 states and 219 transitions. Second operand 9 states. [2019-12-07 17:12:03,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:03,748 INFO L93 Difference]: Finished difference Result 223 states and 273 transitions. [2019-12-07 17:12:03,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:12:03,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-07 17:12:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:03,750 INFO L225 Difference]: With dead ends: 223 [2019-12-07 17:12:03,750 INFO L226 Difference]: Without dead ends: 217 [2019-12-07 17:12:03,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:12:03,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-12-07 17:12:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 176. [2019-12-07 17:12:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 17:12:03,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 217 transitions. [2019-12-07 17:12:03,755 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 217 transitions. Word has length 66 [2019-12-07 17:12:03,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:03,756 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 217 transitions. [2019-12-07 17:12:03,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:12:03,756 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 217 transitions. [2019-12-07 17:12:03,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:12:03,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:03,756 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:03,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 17:12:03,958 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:12:03,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:03,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1344219005, now seen corresponding path program 1 times [2019-12-07 17:12:03,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:12:03,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697726263] [2019-12-07 17:12:03,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 17:12:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:04,154 INFO L264 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-07 17:12:04,155 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:12:04,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 17:12:04,161 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:04,167 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:04,167 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:04,168 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 17:12:04,210 INFO L343 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-12-07 17:12:04,210 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2019-12-07 17:12:04,211 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:04,221 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:04,222 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:04,222 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-12-07 17:12:04,319 INFO L343 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-12-07 17:12:04,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2019-12-07 17:12:04,320 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:04,337 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:04,337 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:04,337 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:39 [2019-12-07 17:12:04,494 INFO L343 Elim1Store]: treesize reduction 171, result has 17.8 percent of original size [2019-12-07 17:12:04,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 57 [2019-12-07 17:12:04,494 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:04,518 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:04,518 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:04,518 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:57, output treesize:53 [2019-12-07 17:12:04,801 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2019-12-07 17:12:04,801 INFO L343 Elim1Store]: treesize reduction 66, result has 69.3 percent of original size [2019-12-07 17:12:04,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 50 treesize of output 172 [2019-12-07 17:12:04,802 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:04,895 INFO L614 ElimStorePlain]: treesize reduction 114, result has 30.9 percent of original size [2019-12-07 17:12:04,896 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:04,896 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:51 [2019-12-07 17:12:05,278 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-12-07 17:12:05,278 INFO L343 Elim1Store]: treesize reduction 112, result has 62.7 percent of original size [2019-12-07 17:12:05,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 59 treesize of output 214 [2019-12-07 17:12:05,279 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:05,390 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2019-12-07 17:12:05,391 INFO L614 ElimStorePlain]: treesize reduction 144, result has 29.4 percent of original size [2019-12-07 17:12:05,391 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:05,391 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:64, output treesize:60 [2019-12-07 17:12:05,889 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 67 [2019-12-07 17:12:05,889 INFO L343 Elim1Store]: treesize reduction 170, result has 57.2 percent of original size [2019-12-07 17:12:05,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 68 treesize of output 256 [2019-12-07 17:12:05,890 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:06,058 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 36 [2019-12-07 17:12:06,058 INFO L614 ElimStorePlain]: treesize reduction 174, result has 28.4 percent of original size [2019-12-07 17:12:06,058 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:06,058 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:73, output treesize:69 [2019-12-07 17:13:20,122 WARN L192 SmtUtils]: Spent 1.23 m on a formula simplification. DAG size of input: 161 DAG size of output: 96 [2019-12-07 17:13:20,123 INFO L343 Elim1Store]: treesize reduction 209, result has 61.0 percent of original size [2019-12-07 17:13:20,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 80 treesize of output 359 [2019-12-07 17:13:20,124 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:20,290 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2019-12-07 17:13:20,290 INFO L614 ElimStorePlain]: treesize reduction 174, result has 31.8 percent of original size [2019-12-07 17:13:20,291 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:13:20,291 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2019-12-07 17:13:21,098 WARN L192 SmtUtils]: Spent 587.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 87 [2019-12-07 17:13:21,099 INFO L343 Elim1Store]: treesize reduction 322, result has 48.6 percent of original size [2019-12-07 17:13:21,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 86 treesize of output 340 [2019-12-07 17:13:21,100 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:21,315 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 44 [2019-12-07 17:13:21,316 INFO L614 ElimStorePlain]: treesize reduction 234, result has 27.1 percent of original size [2019-12-07 17:13:21,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:13:21,316 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:91, output treesize:87 [2019-12-07 17:13:21,924 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 240 DAG size of output: 48 [2019-12-07 17:13:21,924 INFO L343 Elim1Store]: treesize reduction 644, result has 11.0 percent of original size [2019-12-07 17:13:21,925 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 93 treesize of output 116 [2019-12-07 17:13:21,925 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:21,978 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:21,978 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:13:21,978 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:93, output treesize:89 [2019-12-07 17:13:22,828 INFO L343 Elim1Store]: treesize reduction 522, result has 0.2 percent of original size [2019-12-07 17:13:22,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 96 treesize of output 34 [2019-12-07 17:13:22,828 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:22,830 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:22,830 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:13:22,830 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:96, output treesize:3 [2019-12-07 17:13:22,954 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 17:13:22,955 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:17:27,490 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 84 [2019-12-07 17:17:27,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 191 [2019-12-07 17:17:27,494 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:27,595 INFO L614 ElimStorePlain]: treesize reduction 97, result has 45.2 percent of original size [2019-12-07 17:17:27,595 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:27,613 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:27,613 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:17:27,613 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:86, output treesize:80 [2019-12-07 17:17:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 126 proven. 19 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 17:17:27,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697726263] [2019-12-07 17:17:27,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:17:27,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2019-12-07 17:17:27,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993397366] [2019-12-07 17:17:27,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-07 17:17:27,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:17:27,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-07 17:17:27,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=567, Invalid=1747, Unknown=38, NotChecked=0, Total=2352 [2019-12-07 17:17:27,836 INFO L87 Difference]: Start difference. First operand 176 states and 217 transitions. Second operand 49 states. [2019-12-07 17:17:36,722 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-12-07 17:17:37,957 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-12-07 17:17:38,516 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-07 17:17:41,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:41,501 INFO L93 Difference]: Finished difference Result 209 states and 254 transitions. [2019-12-07 17:17:41,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 17:17:41,502 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 66 [2019-12-07 17:17:41,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:41,503 INFO L225 Difference]: With dead ends: 209 [2019-12-07 17:17:41,503 INFO L226 Difference]: Without dead ends: 209 [2019-12-07 17:17:41,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 251.1s TimeCoverageRelationStatistics Valid=1105, Invalid=4407, Unknown=38, NotChecked=0, Total=5550 [2019-12-07 17:17:41,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-12-07 17:17:41,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 198. [2019-12-07 17:17:41,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-07 17:17:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 250 transitions. [2019-12-07 17:17:41,509 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 250 transitions. Word has length 66 [2019-12-07 17:17:41,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:41,510 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 250 transitions. [2019-12-07 17:17:41,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-07 17:17:41,510 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2019-12-07 17:17:41,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:17:41,510 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:41,510 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:41,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 17:17:41,711 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, alloc_17Err0REQUIRES_VIOLATION, alloc_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err1REQUIRES_VIOLATION, alloc_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err7REQUIRES_VIOLATION, alloc_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_17Err2REQUIRES_VIOLATION, alloc_17Err3REQUIRES_VIOLATION, alloc_17Err8REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-12-07 17:17:41,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:41,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1278884257, now seen corresponding path program 1 times [2019-12-07 17:17:41,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:17:41,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323044595] [2019-12-07 17:17:41,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 17:17:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:41,878 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 17:17:41,879 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:17:41,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-12-07 17:17:41,891 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:41,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:41,899 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:41,899 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-12-07 17:17:41,954 INFO L343 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-12-07 17:17:41,954 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2019-12-07 17:17:41,954 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:41,967 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:41,968 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:41,968 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-12-07 17:17:42,076 INFO L343 Elim1Store]: treesize reduction 96, result has 20.7 percent of original size [2019-12-07 17:17:42,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 42 [2019-12-07 17:17:42,076 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:42,097 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:42,098 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:42,098 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2019-12-07 17:17:42,292 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-12-07 17:17:42,292 INFO L343 Elim1Store]: treesize reduction 32, result has 77.5 percent of original size [2019-12-07 17:17:42,292 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 130 [2019-12-07 17:17:42,293 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:44,403 WARN L192 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2019-12-07 17:17:44,403 INFO L614 ElimStorePlain]: treesize reduction 84, result has 34.9 percent of original size [2019-12-07 17:17:44,404 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:44,404 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2019-12-07 17:18:21,282 WARN L192 SmtUtils]: Spent 36.78 s on a formula simplification. DAG size of input: 71 DAG size of output: 54 [2019-12-07 17:18:21,283 INFO L343 Elim1Store]: treesize reduction 71, result has 69.9 percent of original size [2019-12-07 17:18:21,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 188 [2019-12-07 17:18:21,284 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:25,451 WARN L192 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2019-12-07 17:18:25,452 INFO L614 ElimStorePlain]: treesize reduction 154, result has 27.0 percent of original size [2019-12-07 17:18:25,452 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:25,452 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:61, output treesize:57 [2019-12-07 17:18:25,860 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 57 [2019-12-07 17:18:25,860 INFO L343 Elim1Store]: treesize reduction 112, result has 62.7 percent of original size [2019-12-07 17:18:25,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 59 treesize of output 214 [2019-12-07 17:18:25,861 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:25,983 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-12-07 17:18:25,983 INFO L614 ElimStorePlain]: treesize reduction 144, result has 30.4 percent of original size [2019-12-07 17:18:25,983 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:25,983 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:63 [2019-12-07 17:19:25,501 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-12-07 17:19:25,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323044595] [2019-12-07 17:19:25,502 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2019-12-07 17:19:25,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [121919060] [2019-12-07 17:19:25,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 17:19:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:26,094 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-07 17:19:26,095 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:19:26,096 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken [2019-12-07 17:19:26,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65479528] [2019-12-07 17:19:26,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_189feea9-2950-4e97-bdda-b1ec8eef74b9/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:19:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:19:26,233 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 17:19:26,235 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:19:26,236 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@742122c6 [2019-12-07 17:19:26,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:19:26,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 17:19:26,236 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 17:19:26,236 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:19:26,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3,22 cvc4 --incremental --print-success --lang smt --rewrite-divk,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:19:26,867 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 17:19:26,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:19:26 BoogieIcfgContainer [2019-12-07 17:19:26,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:19:26,868 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:19:26,868 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:19:26,868 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:19:26,869 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:08:00" (3/4) ... [2019-12-07 17:19:26,871 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 17:19:26,871 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:19:26,872 INFO L168 Benchmark]: Toolchain (without parser) took 688181.88 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.2 MB). Free memory was 948.4 MB in the beginning and 1.0 GB in the end (delta: -70.0 MB). Peak memory consumption was 151.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:19:26,872 INFO L168 Benchmark]: CDTParser took 0.18 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:19:26,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -112.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:19:26,873 INFO L168 Benchmark]: Boogie Preprocessor took 65.59 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:19:26,873 INFO L168 Benchmark]: RCFGBuilder took 988.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 935.3 MB in the end (delta: 118.8 MB). Peak memory consumption was 118.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:19:26,873 INFO L168 Benchmark]: TraceAbstraction took 686692.83 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 103.3 MB). Free memory was 935.3 MB in the beginning and 1.0 GB in the end (delta: -83.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:19:26,874 INFO L168 Benchmark]: Witness Printer took 3.33 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:19:26,875 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 428.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 948.4 MB in the beginning and 1.1 GB in the end (delta: -112.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.59 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 988.29 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 935.3 MB in the end (delta: 118.8 MB). Peak memory consumption was 118.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 686692.83 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 103.3 MB). Free memory was 935.3 MB in the beginning and 1.0 GB in the end (delta: -83.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.33 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 780]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L795] CALL entry_point() [L784] int i; [L785] int len = 10; [L786] CALL, EXPR ldv_malloc(sizeof(struct A17*)*len) [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L786] RET, EXPR ldv_malloc(sizeof(struct A17*)*len) [L786] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L787] COND FALSE !(!array) [L788] i=0 [L788] COND TRUE i=0) [L775] return - -3; [L791] RET alloc_17(array, len) [L792] CALL free_17(array, len) [L778] int i; [L779] i=0 [L779] COND TRUE i