./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/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 ac205ef89a28814c553e9a519c996fc887772dd9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:55:29,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:55:29,254 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:55:29,271 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:55:29,272 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:55:29,274 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:55:29,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:55:29,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:55:29,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:55:29,295 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:55:29,296 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:55:29,298 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:55:29,299 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:55:29,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:55:29,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:55:29,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:55:29,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:55:29,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:55:29,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:55:29,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:55:29,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:55:29,323 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:55:29,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:55:29,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:55:29,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:55:29,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:55:29,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:55:29,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:55:29,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:55:29,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:55:29,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:55:29,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:55:29,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:55:29,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:55:29,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:55:29,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:55:29,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:55:29,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:55:29,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:55:29,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:55:29,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:55:29,343 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 21:55:29,371 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:55:29,381 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:55:29,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:55:29,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:55:29,383 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:55:29,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:55:29,384 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:55:29,384 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:55:29,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:55:29,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:55:29,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:55:29,385 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 21:55:29,385 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 21:55:29,386 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 21:55:29,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:55:29,386 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:55:29,386 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:55:29,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:55:29,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:55:29,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:55:29,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:55:29,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:55:29,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:55:29,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:55:29,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:55:29,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:55:29,389 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_96af8252-3294-4774-909a-fc377889e320/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 -> ac205ef89a28814c553e9a519c996fc887772dd9 [2019-11-15 21:55:29,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:55:29,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:55:29,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:55:29,433 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:55:29,433 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:55:29,434 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2019-11-15 21:55:29,496 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/data/48217240c/8a4ffe82b8324ba9b8ae20d36a3db2c8/FLAGd46fa85ed [2019-11-15 21:55:30,031 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:55:30,032 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/sv-benchmarks/c/ldv-memsafety/memleaks_test11_1.i [2019-11-15 21:55:30,059 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/data/48217240c/8a4ffe82b8324ba9b8ae20d36a3db2c8/FLAGd46fa85ed [2019-11-15 21:55:30,279 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/data/48217240c/8a4ffe82b8324ba9b8ae20d36a3db2c8 [2019-11-15 21:55:30,281 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:55:30,283 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 21:55:30,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:55:30,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:55:30,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:55:30,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:55:30" (1/1) ... [2019-11-15 21:55:30,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b9f325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:55:30, skipping insertion in model container [2019-11-15 21:55:30,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:55:30" (1/1) ... [2019-11-15 21:55:30,298 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:55:30,360 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:55:30,935 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:55:30,957 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:55:31,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:55:31,124 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:55:31,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:55:31 WrapperNode [2019-11-15 21:55:31,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:55:31,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:55:31,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:55:31,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:55:31,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:55:31" (1/1) ... [2019-11-15 21:55:31,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:55:31" (1/1) ... [2019-11-15 21:55:31,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:55:31" (1/1) ... [2019-11-15 21:55:31,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:55:31" (1/1) ... [2019-11-15 21:55:31,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:55:31" (1/1) ... [2019-11-15 21:55:31,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:55:31" (1/1) ... [2019-11-15 21:55:31,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:55:31" (1/1) ... [2019-11-15 21:55:31,252 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:55:31,253 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:55:31,253 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:55:31,253 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:55:31,254 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:55:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/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-11-15 21:55:31,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 21:55:31,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:55:31,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-15 21:55:31,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 21:55:31,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 21:55:31,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 21:55:31,340 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 21:55:31,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 21:55:31,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-15 21:55:31,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-15 21:55:31,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-15 21:55:31,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-15 21:55:31,342 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-15 21:55:31,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-15 21:55:31,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-15 21:55:31,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-15 21:55:31,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-15 21:55:31,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-15 21:55:31,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-15 21:55:31,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-15 21:55:31,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-15 21:55:31,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-15 21:55:31,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-15 21:55:31,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-15 21:55:31,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-15 21:55:31,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-15 21:55:31,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-15 21:55:31,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-15 21:55:31,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-15 21:55:31,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-15 21:55:31,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-15 21:55:31,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-15 21:55:31,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-15 21:55:31,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-15 21:55:31,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-15 21:55:31,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-15 21:55:31,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-15 21:55:31,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-15 21:55:31,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-15 21:55:31,348 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-15 21:55:31,348 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-15 21:55:31,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_get_clientdata [2019-11-15 21:55:31,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_i2c_set_clientdata [2019-11-15 21:55:31,349 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_2_11 [2019-11-15 21:55:31,349 INFO L138 BoogieDeclarations]: Found implementation of procedure free_11 [2019-11-15 21:55:31,349 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-15 21:55:31,349 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 21:55:31,350 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-15 21:55:31,350 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-15 21:55:31,350 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-15 21:55:31,350 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 21:55:31,351 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 21:55:31,351 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 21:55:31,351 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 21:55:31,351 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 21:55:31,351 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 21:55:31,352 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 21:55:31,352 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 21:55:31,352 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 21:55:31,352 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 21:55:31,352 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 21:55:31,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 21:55:31,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 21:55:31,353 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 21:55:31,353 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 21:55:31,354 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 21:55:31,354 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 21:55:31,354 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 21:55:31,354 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 21:55:31,354 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 21:55:31,355 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 21:55:31,355 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 21:55:31,355 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 21:55:31,355 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 21:55:31,355 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 21:55:31,356 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 21:55:31,356 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 21:55:31,356 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 21:55:31,356 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 21:55:31,357 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 21:55:31,357 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 21:55:31,357 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 21:55:31,357 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 21:55:31,357 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 21:55:31,358 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 21:55:31,358 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 21:55:31,358 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 21:55:31,358 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 21:55:31,358 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 21:55:31,359 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 21:55:31,359 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 21:55:31,359 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 21:55:31,359 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 21:55:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 21:55:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 21:55:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 21:55:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 21:55:31,360 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 21:55:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 21:55:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 21:55:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 21:55:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 21:55:31,361 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 21:55:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 21:55:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 21:55:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 21:55:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 21:55:31,362 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 21:55:31,363 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 21:55:31,363 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 21:55:31,363 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 21:55:31,363 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 21:55:31,363 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 21:55:31,364 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 21:55:31,364 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 21:55:31,364 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 21:55:31,364 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 21:55:31,364 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 21:55:31,365 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 21:55:31,365 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 21:55:31,365 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 21:55:31,365 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 21:55:31,365 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 21:55:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 21:55:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 21:55:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 21:55:31,366 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 21:55:31,367 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 21:55:31,367 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 21:55:31,367 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 21:55:31,367 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 21:55:31,367 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 21:55:31,368 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 21:55:31,368 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 21:55:31,368 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 21:55:31,368 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 21:55:31,368 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 21:55:31,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 21:55:31,369 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 21:55:31,369 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 21:55:31,369 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 21:55:31,370 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 21:55:31,370 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 21:55:31,370 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 21:55:31,370 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 21:55:31,370 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 21:55:31,371 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 21:55:31,371 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 21:55:31,371 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 21:55:31,371 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 21:55:31,371 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 21:55:31,372 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 21:55:31,372 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 21:55:31,372 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 21:55:31,372 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 21:55:31,372 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 21:55:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 21:55:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-15 21:55:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 21:55:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-15 21:55:31,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-15 21:55:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-15 21:55:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-15 21:55:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-15 21:55:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-15 21:55:31,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 21:55:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-15 21:55:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-15 21:55:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-15 21:55:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:55:31,375 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-15 21:55:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-15 21:55:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-15 21:55:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:55:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-15 21:55:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-15 21:55:31,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-15 21:55:31,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-15 21:55:31,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-15 21:55:31,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-15 21:55:31,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:55:31,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-15 21:55:31,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-15 21:55:31,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-15 21:55:31,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-15 21:55:31,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-15 21:55:31,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:55:31,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:55:31,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-15 21:55:31,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-15 21:55:31,379 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-15 21:55:31,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-15 21:55:31,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-15 21:55:31,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-15 21:55:31,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-15 21:55:31,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-15 21:55:31,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-15 21:55:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-15 21:55:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-15 21:55:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-15 21:55:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-15 21:55:31,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-15 21:55:31,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-15 21:55:31,382 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-15 21:55:31,382 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-15 21:55:31,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_get_clientdata [2019-11-15 21:55:31,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_i2c_set_clientdata [2019-11-15 21:55:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_2_11 [2019-11-15 21:55:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure free_11 [2019-11-15 21:55:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-15 21:55:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 21:55:31,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 21:55:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:55:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 21:55:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:55:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-15 21:55:31,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-15 21:55:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-11-15 21:55:31,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-11-15 21:55:32,140 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:55:32,386 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:55:32,767 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:55:32,767 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-15 21:55:32,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:55:32 BoogieIcfgContainer [2019-11-15 21:55:32,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:55:32,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:55:32,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:55:32,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:55:32,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:55:30" (1/3) ... [2019-11-15 21:55:32,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630f42b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:55:32, skipping insertion in model container [2019-11-15 21:55:32,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:55:31" (2/3) ... [2019-11-15 21:55:32,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630f42b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:55:32, skipping insertion in model container [2019-11-15 21:55:32,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:55:32" (3/3) ... [2019-11-15 21:55:32,779 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test11_1.i [2019-11-15 21:55:32,792 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:55:32,822 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 96 error locations. [2019-11-15 21:55:32,835 INFO L249 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2019-11-15 21:55:32,861 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:55:32,862 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 21:55:32,862 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:55:32,862 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:55:32,862 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:55:32,862 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:55:32,862 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:55:32,862 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:55:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states. [2019-11-15 21:55:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 21:55:32,909 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:55:32,910 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:55:32,914 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:55:32,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:32,919 INFO L82 PathProgramCache]: Analyzing trace with hash 175287793, now seen corresponding path program 1 times [2019-11-15 21:55:32,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:32,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903255816] [2019-11-15 21:55:32,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:32,927 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:32,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:55:33,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903255816] [2019-11-15 21:55:33,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:55:33,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:55:33,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343960062] [2019-11-15 21:55:33,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:55:33,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:33,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:55:33,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:55:33,384 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 8 states. [2019-11-15 21:55:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:55:34,525 INFO L93 Difference]: Finished difference Result 205 states and 239 transitions. [2019-11-15 21:55:34,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:55:34,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-15 21:55:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:55:34,542 INFO L225 Difference]: With dead ends: 205 [2019-11-15 21:55:34,542 INFO L226 Difference]: Without dead ends: 198 [2019-11-15 21:55:34,544 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:55:34,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-15 21:55:34,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 110. [2019-11-15 21:55:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 21:55:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-15 21:55:34,610 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 16 [2019-11-15 21:55:34,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:55:34,611 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-15 21:55:34,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:55:34,611 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-15 21:55:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 21:55:34,614 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:55:34,615 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:55:34,616 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:55:34,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:34,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1518730592, now seen corresponding path program 1 times [2019-11-15 21:55:34,617 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:34,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728239564] [2019-11-15 21:55:34,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:34,618 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:34,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:55:34,794 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728239564] [2019-11-15 21:55:34,794 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:55:34,794 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:55:34,795 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147950442] [2019-11-15 21:55:34,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:55:34,796 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:34,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:55:34,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:55:34,797 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 7 states. [2019-11-15 21:55:35,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:55:35,663 INFO L93 Difference]: Finished difference Result 198 states and 230 transitions. [2019-11-15 21:55:35,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:55:35,663 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-15 21:55:35,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:55:35,666 INFO L225 Difference]: With dead ends: 198 [2019-11-15 21:55:35,666 INFO L226 Difference]: Without dead ends: 198 [2019-11-15 21:55:35,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:55:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-15 21:55:35,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 114. [2019-11-15 21:55:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 21:55:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2019-11-15 21:55:35,688 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 21 [2019-11-15 21:55:35,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:55:35,688 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2019-11-15 21:55:35,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:55:35,688 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2019-11-15 21:55:35,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 21:55:35,689 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:55:35,690 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:55:35,690 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:55:35,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:35,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1518730625, now seen corresponding path program 1 times [2019-11-15 21:55:35,691 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:35,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605499197] [2019-11-15 21:55:35,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:35,692 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:35,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:55:35,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605499197] [2019-11-15 21:55:35,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922651293] [2019-11-15 21:55:35,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:36,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 21:55:36,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:36,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:55:36,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:55:36,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:36,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:55:36,180 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 21:55:36,266 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:36,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 21:55:36,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:55:36,287 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 21:55:36,288 INFO L496 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-11-15 21:55:36,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-15 21:55:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:55:36,299 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:55:36,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-15 21:55:36,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506056747] [2019-11-15 21:55:36,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:55:36,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:36,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:55:36,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:55:36,301 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand 10 states. [2019-11-15 21:55:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:55:37,639 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2019-11-15 21:55:37,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:55:37,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-15 21:55:37,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:55:37,643 INFO L225 Difference]: With dead ends: 227 [2019-11-15 21:55:37,644 INFO L226 Difference]: Without dead ends: 227 [2019-11-15 21:55:37,644 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:55:37,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-15 21:55:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 129. [2019-11-15 21:55:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-15 21:55:37,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 146 transitions. [2019-11-15 21:55:37,677 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 146 transitions. Word has length 21 [2019-11-15 21:55:37,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:55:37,678 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 146 transitions. [2019-11-15 21:55:37,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:55:37,678 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 146 transitions. [2019-11-15 21:55:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 21:55:37,680 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:55:37,680 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:55:37,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:37,893 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:55:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:37,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1518730626, now seen corresponding path program 1 times [2019-11-15 21:55:37,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:37,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869211652] [2019-11-15 21:55:37,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:37,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:37,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:55:38,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869211652] [2019-11-15 21:55:38,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125352145] [2019-11-15 21:55:38,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:38,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 21:55:38,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:38,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:55:38,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:55:38,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:38,448 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:55:38,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-15 21:55:38,602 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:38,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 21:55:38,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:55:38,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:55:38,630 INFO L567 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-11-15 21:55:38,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:55:38,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:55:38,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:18 [2019-11-15 21:55:38,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:55:38,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:55:38,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:55:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:55:38,718 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:55:38,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-15 21:55:38,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091249112] [2019-11-15 21:55:38,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 21:55:38,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:38,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 21:55:38,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:55:38,720 INFO L87 Difference]: Start difference. First operand 129 states and 146 transitions. Second operand 17 states. [2019-11-15 21:55:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:55:41,452 INFO L93 Difference]: Finished difference Result 329 states and 384 transitions. [2019-11-15 21:55:41,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 21:55:41,452 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2019-11-15 21:55:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:55:41,456 INFO L225 Difference]: With dead ends: 329 [2019-11-15 21:55:41,456 INFO L226 Difference]: Without dead ends: 329 [2019-11-15 21:55:41,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2019-11-15 21:55:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-15 21:55:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 162. [2019-11-15 21:55:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-15 21:55:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 204 transitions. [2019-11-15 21:55:41,489 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 204 transitions. Word has length 21 [2019-11-15 21:55:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:55:41,489 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 204 transitions. [2019-11-15 21:55:41,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 21:55:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 204 transitions. [2019-11-15 21:55:41,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 21:55:41,491 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:55:41,491 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:55:41,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:41,695 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:55:41,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:41,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1225327618, now seen corresponding path program 1 times [2019-11-15 21:55:41,696 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:41,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452295520] [2019-11-15 21:55:41,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:41,697 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:41,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:41,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:55:41,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452295520] [2019-11-15 21:55:41,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102755405] [2019-11-15 21:55:41,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:41,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 21:55:41,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:42,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:55:42,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:55:42,008 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2019-11-15 21:55:42,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943478539] [2019-11-15 21:55:42,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:55:42,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:42,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:55:42,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:55:42,010 INFO L87 Difference]: Start difference. First operand 162 states and 204 transitions. Second operand 5 states. [2019-11-15 21:55:42,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:55:42,033 INFO L93 Difference]: Finished difference Result 149 states and 180 transitions. [2019-11-15 21:55:42,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:55:42,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-15 21:55:42,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:55:42,035 INFO L225 Difference]: With dead ends: 149 [2019-11-15 21:55:42,035 INFO L226 Difference]: Without dead ends: 145 [2019-11-15 21:55:42,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:55:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-15 21:55:42,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-11-15 21:55:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-15 21:55:42,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 176 transitions. [2019-11-15 21:55:42,055 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 176 transitions. Word has length 21 [2019-11-15 21:55:42,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:55:42,056 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 176 transitions. [2019-11-15 21:55:42,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:55:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 176 transitions. [2019-11-15 21:55:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 21:55:42,057 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:55:42,057 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:55:42,261 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:42,262 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:55:42,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:42,263 INFO L82 PathProgramCache]: Analyzing trace with hash 723512239, now seen corresponding path program 1 times [2019-11-15 21:55:42,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:42,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987125071] [2019-11-15 21:55:42,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:42,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:42,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:55:42,384 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987125071] [2019-11-15 21:55:42,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107282043] [2019-11-15 21:55:42,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:42,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:55:42,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:55:42,568 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:55:42,568 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-15 21:55:42,568 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048040203] [2019-11-15 21:55:42,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:55:42,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:42,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:55:42,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:55:42,570 INFO L87 Difference]: Start difference. First operand 145 states and 176 transitions. Second operand 7 states. [2019-11-15 21:55:43,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:55:43,079 INFO L93 Difference]: Finished difference Result 153 states and 180 transitions. [2019-11-15 21:55:43,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:55:43,080 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-15 21:55:43,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:55:43,082 INFO L225 Difference]: With dead ends: 153 [2019-11-15 21:55:43,082 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 21:55:43,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:55:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 21:55:43,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 144. [2019-11-15 21:55:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 21:55:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 174 transitions. [2019-11-15 21:55:43,095 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 174 transitions. Word has length 22 [2019-11-15 21:55:43,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:55:43,095 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 174 transitions. [2019-11-15 21:55:43,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:55:43,096 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 174 transitions. [2019-11-15 21:55:43,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:55:43,099 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:55:43,099 INFO L380 BasicCegarLoop]: trace histogram [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-11-15 21:55:43,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:43,313 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:55:43,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:43,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2108587257, now seen corresponding path program 1 times [2019-11-15 21:55:43,314 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:43,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858468160] [2019-11-15 21:55:43,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:43,314 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:43,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:43,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:55:43,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858468160] [2019-11-15 21:55:43,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326036886] [2019-11-15 21:55:43,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:43,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 21:55:43,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:55:43,834 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:55:43,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-11-15 21:55:43,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736638270] [2019-11-15 21:55:43,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 21:55:43,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:43,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 21:55:43,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:55:43,838 INFO L87 Difference]: Start difference. First operand 144 states and 174 transitions. Second operand 13 states. [2019-11-15 21:55:44,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:55:44,627 INFO L93 Difference]: Finished difference Result 178 states and 212 transitions. [2019-11-15 21:55:44,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:55:44,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-11-15 21:55:44,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:55:44,630 INFO L225 Difference]: With dead ends: 178 [2019-11-15 21:55:44,630 INFO L226 Difference]: Without dead ends: 172 [2019-11-15 21:55:44,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:55:44,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-15 21:55:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 139. [2019-11-15 21:55:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-15 21:55:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 168 transitions. [2019-11-15 21:55:44,650 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 168 transitions. Word has length 26 [2019-11-15 21:55:44,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:55:44,650 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 168 transitions. [2019-11-15 21:55:44,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 21:55:44,651 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 168 transitions. [2019-11-15 21:55:44,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 21:55:44,652 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:55:44,652 INFO L380 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] [2019-11-15 21:55:44,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:44,853 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:55:44,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:44,854 INFO L82 PathProgramCache]: Analyzing trace with hash -863309303, now seen corresponding path program 1 times [2019-11-15 21:55:44,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:44,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360408371] [2019-11-15 21:55:44,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:44,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:44,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:44,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:44,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:55:44,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360408371] [2019-11-15 21:55:44,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:55:44,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:55:44,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657079125] [2019-11-15 21:55:44,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:55:44,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:44,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:55:44,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:55:44,967 INFO L87 Difference]: Start difference. First operand 139 states and 168 transitions. Second operand 7 states. [2019-11-15 21:55:45,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:55:45,370 INFO L93 Difference]: Finished difference Result 169 states and 195 transitions. [2019-11-15 21:55:45,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:55:45,371 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-11-15 21:55:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:55:45,372 INFO L225 Difference]: With dead ends: 169 [2019-11-15 21:55:45,372 INFO L226 Difference]: Without dead ends: 169 [2019-11-15 21:55:45,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:55:45,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-15 21:55:45,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 139. [2019-11-15 21:55:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-15 21:55:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 167 transitions. [2019-11-15 21:55:45,379 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 167 transitions. Word has length 29 [2019-11-15 21:55:45,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:55:45,379 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 167 transitions. [2019-11-15 21:55:45,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:55:45,380 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 167 transitions. [2019-11-15 21:55:45,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 21:55:45,381 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:55:45,381 INFO L380 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] [2019-11-15 21:55:45,382 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:55:45,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:45,383 INFO L82 PathProgramCache]: Analyzing trace with hash -863309253, now seen corresponding path program 1 times [2019-11-15 21:55:45,383 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:45,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359742497] [2019-11-15 21:55:45,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:45,384 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:45,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 21:55:45,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359742497] [2019-11-15 21:55:45,548 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522095859] [2019-11-15 21:55:45,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:45,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 21:55:45,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:45,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:55:45,758 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:55:45,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:45,760 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:55:45,761 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 21:55:45,814 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:45,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 21:55:45,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:55:45,832 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 21:55:45,832 INFO L496 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-11-15 21:55:45,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-15 21:55:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:55:45,845 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:55:45,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-11-15 21:55:45,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071799987] [2019-11-15 21:55:45,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:55:45,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:45,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:55:45,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:55:45,847 INFO L87 Difference]: Start difference. First operand 139 states and 167 transitions. Second operand 10 states. [2019-11-15 21:55:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:55:47,164 INFO L93 Difference]: Finished difference Result 204 states and 247 transitions. [2019-11-15 21:55:47,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:55:47,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-11-15 21:55:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:55:47,166 INFO L225 Difference]: With dead ends: 204 [2019-11-15 21:55:47,167 INFO L226 Difference]: Without dead ends: 204 [2019-11-15 21:55:47,167 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:55:47,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-15 21:55:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 152. [2019-11-15 21:55:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-15 21:55:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 187 transitions. [2019-11-15 21:55:47,176 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 187 transitions. Word has length 29 [2019-11-15 21:55:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:55:47,176 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 187 transitions. [2019-11-15 21:55:47,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:55:47,177 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 187 transitions. [2019-11-15 21:55:47,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 21:55:47,178 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:55:47,178 INFO L380 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] [2019-11-15 21:55:47,383 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:47,384 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:55:47,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:47,385 INFO L82 PathProgramCache]: Analyzing trace with hash -863309252, now seen corresponding path program 1 times [2019-11-15 21:55:47,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:47,385 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226999288] [2019-11-15 21:55:47,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:47,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:47,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 21:55:47,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226999288] [2019-11-15 21:55:47,632 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067774463] [2019-11-15 21:55:47,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:47,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-15 21:55:47,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:47,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:55:47,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:55:47,817 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:47,818 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:55:47,818 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 21:55:47,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:47,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 21:55:47,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:55:47,979 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-15 21:55:47,979 INFO L496 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-11-15 21:55:47,980 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-11-15 21:55:48,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:55:48,011 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:55:48,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-11-15 21:55:48,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498200622] [2019-11-15 21:55:48,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 21:55:48,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:48,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 21:55:48,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:55:48,012 INFO L87 Difference]: Start difference. First operand 152 states and 187 transitions. Second operand 16 states. [2019-11-15 21:55:49,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:55:49,377 INFO L93 Difference]: Finished difference Result 229 states and 273 transitions. [2019-11-15 21:55:49,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:55:49,378 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-11-15 21:55:49,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:55:49,380 INFO L225 Difference]: With dead ends: 229 [2019-11-15 21:55:49,380 INFO L226 Difference]: Without dead ends: 229 [2019-11-15 21:55:49,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2019-11-15 21:55:49,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-11-15 21:55:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 170. [2019-11-15 21:55:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-15 21:55:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2019-11-15 21:55:49,398 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 29 [2019-11-15 21:55:49,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:55:49,399 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2019-11-15 21:55:49,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 21:55:49,399 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2019-11-15 21:55:49,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 21:55:49,408 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:55:49,408 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:55:49,621 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:49,622 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:55:49,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:49,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1368867878, now seen corresponding path program 1 times [2019-11-15 21:55:49,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:49,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503986153] [2019-11-15 21:55:49,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:49,623 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:49,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:49,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:55:49,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503986153] [2019-11-15 21:55:49,719 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507148444] [2019-11-15 21:55:49,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:49,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 21:55:49,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:55:49,953 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:55:49,953 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2019-11-15 21:55:49,953 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780768768] [2019-11-15 21:55:49,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:55:49,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:49,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:55:49,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:55:49,954 INFO L87 Difference]: Start difference. First operand 170 states and 214 transitions. Second operand 5 states. [2019-11-15 21:55:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:55:50,004 INFO L93 Difference]: Finished difference Result 145 states and 170 transitions. [2019-11-15 21:55:50,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:55:50,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-15 21:55:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:55:50,006 INFO L225 Difference]: With dead ends: 145 [2019-11-15 21:55:50,006 INFO L226 Difference]: Without dead ends: 141 [2019-11-15 21:55:50,006 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:55:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-15 21:55:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2019-11-15 21:55:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-15 21:55:50,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 164 transitions. [2019-11-15 21:55:50,012 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 164 transitions. Word has length 29 [2019-11-15 21:55:50,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:55:50,018 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 164 transitions. [2019-11-15 21:55:50,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:55:50,018 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 164 transitions. [2019-11-15 21:55:50,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:55:50,019 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:55:50,019 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:55:50,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:50,224 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:55:50,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:50,224 INFO L82 PathProgramCache]: Analyzing trace with hash -105280481, now seen corresponding path program 1 times [2019-11-15 21:55:50,224 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:50,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056854243] [2019-11-15 21:55:50,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:50,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:50,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:50,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:55:50,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056854243] [2019-11-15 21:55:50,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672846084] [2019-11-15 21:55:50,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:50,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:55:50,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:55:50,502 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:55:50,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-11-15 21:55:50,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096971279] [2019-11-15 21:55:50,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:55:50,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:50,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:55:50,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:55:50,504 INFO L87 Difference]: Start difference. First operand 139 states and 164 transitions. Second operand 7 states. [2019-11-15 21:55:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:55:50,915 INFO L93 Difference]: Finished difference Result 147 states and 167 transitions. [2019-11-15 21:55:50,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:55:50,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-15 21:55:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:55:50,917 INFO L225 Difference]: With dead ends: 147 [2019-11-15 21:55:50,917 INFO L226 Difference]: Without dead ends: 147 [2019-11-15 21:55:50,917 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:55:50,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-15 21:55:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 138. [2019-11-15 21:55:50,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-11-15 21:55:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 161 transitions. [2019-11-15 21:55:50,924 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 161 transitions. Word has length 30 [2019-11-15 21:55:50,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:55:50,924 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 161 transitions. [2019-11-15 21:55:50,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:55:50,925 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 161 transitions. [2019-11-15 21:55:50,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:55:50,926 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:55:50,926 INFO L380 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] [2019-11-15 21:55:51,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:51,131 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:55:51,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:51,131 INFO L82 PathProgramCache]: Analyzing trace with hash -581304269, now seen corresponding path program 1 times [2019-11-15 21:55:51,131 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:51,132 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998855691] [2019-11-15 21:55:51,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:51,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:51,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:55:51,299 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998855691] [2019-11-15 21:55:51,299 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:55:51,299 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:55:51,299 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107564620] [2019-11-15 21:55:51,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:55:51,300 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:51,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:55:51,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:55:51,301 INFO L87 Difference]: Start difference. First operand 138 states and 161 transitions. Second operand 9 states. [2019-11-15 21:55:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:55:51,953 INFO L93 Difference]: Finished difference Result 161 states and 189 transitions. [2019-11-15 21:55:51,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:55:51,954 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-11-15 21:55:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:55:51,955 INFO L225 Difference]: With dead ends: 161 [2019-11-15 21:55:51,955 INFO L226 Difference]: Without dead ends: 161 [2019-11-15 21:55:51,956 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:55:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-15 21:55:51,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 137. [2019-11-15 21:55:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 21:55:51,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 160 transitions. [2019-11-15 21:55:51,966 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 160 transitions. Word has length 32 [2019-11-15 21:55:51,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:55:51,966 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 160 transitions. [2019-11-15 21:55:51,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:55:51,966 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 160 transitions. [2019-11-15 21:55:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:55:51,968 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:55:51,968 INFO L380 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] [2019-11-15 21:55:51,973 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:55:51,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:51,973 INFO L82 PathProgramCache]: Analyzing trace with hash -581304268, now seen corresponding path program 1 times [2019-11-15 21:55:51,974 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:51,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389487104] [2019-11-15 21:55:51,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:51,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:51,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:52,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 21:55:52,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389487104] [2019-11-15 21:55:52,217 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944072369] [2019-11-15 21:55:52,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:52,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 21:55:52,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:52,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:55:52,455 INFO L375 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 14 treesize of output 16 [2019-11-15 21:55:52,456 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:55:52,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:52,476 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:52,476 INFO L375 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-11-15 21:55:52,477 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:55:52,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:52,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:55:52,485 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2019-11-15 21:55:52,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 21:55:52,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:55:52,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2019-11-15 21:55:52,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689083948] [2019-11-15 21:55:52,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:55:52,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:52,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:55:52,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:55:52,543 INFO L87 Difference]: Start difference. First operand 137 states and 160 transitions. Second operand 8 states. [2019-11-15 21:55:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:55:53,088 INFO L93 Difference]: Finished difference Result 162 states and 180 transitions. [2019-11-15 21:55:53,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:55:53,089 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2019-11-15 21:55:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:55:53,090 INFO L225 Difference]: With dead ends: 162 [2019-11-15 21:55:53,090 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 21:55:53,091 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:55:53,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 21:55:53,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 136. [2019-11-15 21:55:53,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-15 21:55:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 159 transitions. [2019-11-15 21:55:53,097 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 159 transitions. Word has length 32 [2019-11-15 21:55:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:55:53,098 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 159 transitions. [2019-11-15 21:55:53,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:55:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 159 transitions. [2019-11-15 21:55:53,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 21:55:53,099 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:55:53,099 INFO L380 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] [2019-11-15 21:55:53,299 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:53,300 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:55:53,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:55:53,300 INFO L82 PathProgramCache]: Analyzing trace with hash -287644268, now seen corresponding path program 1 times [2019-11-15 21:55:53,301 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:55:53,301 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982576920] [2019-11-15 21:55:53,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:53,301 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:55:53,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:55:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 21:55:53,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982576920] [2019-11-15 21:55:53,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66893308] [2019-11-15 21:55:53,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:55:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:55:53,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-15 21:55:53,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:55:53,908 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:55:53,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:55:53,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:53,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:55:53,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 21:55:53,926 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:53,926 INFO L375 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-11-15 21:55:53,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:55:53,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:53,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:55:53,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-15 21:55:53,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:55:53,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:55:53,954 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:53,954 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:55:53,954 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-15 21:55:55,970 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.offset_BEFORE_CALL_4 Int) (v_entry_point_~c11~0.base_BEFORE_CALL_8 Int)) (not (= v_entry_point_~c11~0.base_BEFORE_CALL_8 (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_8) v_entry_point_~c11~0.offset_BEFORE_CALL_4)))) is different from true [2019-11-15 21:55:55,998 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:55,998 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-15 21:55:55,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:55:56,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:55:56,019 INFO L567 ElimStorePlain]: treesize reduction 20, result has 59.2 percent of original size [2019-11-15 21:55:56,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:55:56,020 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:18 [2019-11-15 21:55:56,118 INFO L375 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 25 treesize of output 13 [2019-11-15 21:55:56,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:55:56,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:55:56,124 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:55:56,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-11-15 21:55:56,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-11-15 21:55:56,127 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:55:56,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 20 [2019-11-15 21:55:56,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632992733] [2019-11-15 21:55:56,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-15 21:55:56,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:55:56,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-15 21:55:56,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=337, Unknown=1, NotChecked=36, Total=420 [2019-11-15 21:55:56,129 INFO L87 Difference]: Start difference. First operand 136 states and 159 transitions. Second operand 21 states. [2019-11-15 21:56:00,308 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-15 21:56:04,343 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-11-15 21:56:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:56:07,375 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2019-11-15 21:56:07,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 21:56:07,375 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2019-11-15 21:56:07,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:56:07,377 INFO L225 Difference]: With dead ends: 159 [2019-11-15 21:56:07,377 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 21:56:07,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=4, NotChecked=60, Total=1056 [2019-11-15 21:56:07,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 21:56:07,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 140. [2019-11-15 21:56:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-15 21:56:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 162 transitions. [2019-11-15 21:56:07,384 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 162 transitions. Word has length 34 [2019-11-15 21:56:07,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:56:07,384 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 162 transitions. [2019-11-15 21:56:07,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-15 21:56:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 162 transitions. [2019-11-15 21:56:07,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 21:56:07,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:56:07,385 INFO L380 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] [2019-11-15 21:56:07,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:56:07,586 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:56:07,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:07,586 INFO L82 PathProgramCache]: Analyzing trace with hash -287644267, now seen corresponding path program 1 times [2019-11-15 21:56:07,586 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:07,586 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915884222] [2019-11-15 21:56:07,586 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:07,587 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:07,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 21:56:07,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915884222] [2019-11-15 21:56:07,943 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949381835] [2019-11-15 21:56:07,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:56:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:08,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-15 21:56:08,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:08,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:56:08,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:08,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:08,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:56:08,162 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 21:56:08,206 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:08,206 INFO L375 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-11-15 21:56:08,207 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:08,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:08,210 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:56:08,210 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-15 21:56:08,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:56:08,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:08,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:08,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:56:08,289 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:08,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:08,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:56:08,302 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-11-15 21:56:10,366 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.base_BEFORE_CALL_11 Int) (v_entry_point_~c11~0.offset_BEFORE_CALL_6 Int)) (not (= v_entry_point_~c11~0.base_BEFORE_CALL_11 (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_11) v_entry_point_~c11~0.offset_BEFORE_CALL_6)))) is different from true [2019-11-15 21:56:10,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 55 [2019-11-15 21:56:10,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:10,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:10,456 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:10,456 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 80 [2019-11-15 21:56:10,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:56:10,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:10,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 21:56:10,504 INFO L567 ElimStorePlain]: treesize reduction 124, result has 33.3 percent of original size [2019-11-15 21:56:10,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:56:10,504 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:31 [2019-11-15 21:56:10,606 INFO L375 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 31 treesize of output 19 [2019-11-15 21:56:10,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:10,614 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:10,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 26 treesize of output 14 [2019-11-15 21:56:10,618 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:10,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:10,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:56:10,624 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:11 [2019-11-15 21:56:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2019-11-15 21:56:10,690 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:56:10,690 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 26 [2019-11-15 21:56:10,690 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235587695] [2019-11-15 21:56:10,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 21:56:10,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:56:10,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 21:56:10,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=592, Unknown=1, NotChecked=48, Total=702 [2019-11-15 21:56:10,691 INFO L87 Difference]: Start difference. First operand 140 states and 162 transitions. Second operand 27 states. [2019-11-15 21:56:14,971 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-15 21:56:19,019 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-11-15 21:56:22,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:56:22,625 INFO L93 Difference]: Finished difference Result 158 states and 179 transitions. [2019-11-15 21:56:22,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 21:56:22,626 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2019-11-15 21:56:22,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:56:22,627 INFO L225 Difference]: With dead ends: 158 [2019-11-15 21:56:22,627 INFO L226 Difference]: Without dead ends: 158 [2019-11-15 21:56:22,628 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=174, Invalid=1308, Unknown=4, NotChecked=74, Total=1560 [2019-11-15 21:56:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-15 21:56:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 139. [2019-11-15 21:56:22,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-15 21:56:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2019-11-15 21:56:22,634 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 34 [2019-11-15 21:56:22,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:56:22,634 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2019-11-15 21:56:22,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 21:56:22,635 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2019-11-15 21:56:22,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 21:56:22,635 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:56:22,636 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-15 21:56:22,836 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:56:22,836 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:56:22,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:22,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1489841322, now seen corresponding path program 1 times [2019-11-15 21:56:22,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:22,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097042868] [2019-11-15 21:56:22,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:22,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:22,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:56:23,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097042868] [2019-11-15 21:56:23,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714488253] [2019-11-15 21:56:23,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:56:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:23,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-15 21:56:23,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:23,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:23,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:56:24,026 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:56:24,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-15 21:56:24,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100114928] [2019-11-15 21:56:24,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 21:56:24,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:56:24,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 21:56:24,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2019-11-15 21:56:24,028 INFO L87 Difference]: Start difference. First operand 139 states and 161 transitions. Second operand 23 states. [2019-11-15 21:56:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:56:25,723 INFO L93 Difference]: Finished difference Result 159 states and 179 transitions. [2019-11-15 21:56:25,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:56:25,724 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2019-11-15 21:56:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:56:25,725 INFO L225 Difference]: With dead ends: 159 [2019-11-15 21:56:25,726 INFO L226 Difference]: Without dead ends: 150 [2019-11-15 21:56:25,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2019-11-15 21:56:25,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-15 21:56:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 133. [2019-11-15 21:56:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-15 21:56:25,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2019-11-15 21:56:25,732 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 37 [2019-11-15 21:56:25,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:56:25,732 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2019-11-15 21:56:25,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 21:56:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2019-11-15 21:56:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:56:25,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:56:25,735 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-11-15 21:56:25,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:56:25,936 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:56:25,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:25,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1312409768, now seen corresponding path program 1 times [2019-11-15 21:56:25,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:25,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514577892] [2019-11-15 21:56:25,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:25,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:25,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:26,056 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:56:26,056 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514577892] [2019-11-15 21:56:26,057 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240981100] [2019-11-15 21:56:26,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:56:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:26,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 21:56:26,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:26,276 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:56:26,276 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:56:26,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2019-11-15 21:56:26,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226446113] [2019-11-15 21:56:26,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:56:26,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:56:26,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:56:26,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:56:26,278 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 5 states. [2019-11-15 21:56:26,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:56:26,312 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2019-11-15 21:56:26,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:56:26,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-15 21:56:26,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:56:26,314 INFO L225 Difference]: With dead ends: 131 [2019-11-15 21:56:26,314 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 21:56:26,315 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:56:26,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 21:56:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-15 21:56:26,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-15 21:56:26,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2019-11-15 21:56:26,319 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 43 [2019-11-15 21:56:26,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:56:26,320 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2019-11-15 21:56:26,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:56:26,320 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2019-11-15 21:56:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:56:26,321 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:56:26,321 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:56:26,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:56:26,522 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:56:26,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:26,522 INFO L82 PathProgramCache]: Analyzing trace with hash -903585543, now seen corresponding path program 1 times [2019-11-15 21:56:26,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:26,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414650338] [2019-11-15 21:56:26,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:26,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:26,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:27,128 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-15 21:56:27,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414650338] [2019-11-15 21:56:27,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010963926] [2019-11-15 21:56:27,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:56:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:27,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-15 21:56:27,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:27,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:56:27,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:27,331 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:27,331 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:56:27,331 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 21:56:27,353 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:27,354 INFO L375 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-11-15 21:56:27,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:27,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:27,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:56:27,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-15 21:56:27,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:56:27,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:27,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:27,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:56:27,379 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:27,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:27,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:56:27,390 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-11-15 21:56:29,402 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.base_BEFORE_CALL_16 Int) (v_entry_point_~c11~0.offset_BEFORE_CALL_10 Int)) (not (= v_entry_point_~c11~0.base_BEFORE_CALL_16 (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_16) v_entry_point_~c11~0.offset_BEFORE_CALL_10)))) is different from true [2019-11-15 21:56:29,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:56:29,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:29,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:29,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:56:29,419 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:14 [2019-11-15 21:56:33,451 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 14 [2019-11-15 21:56:33,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:56:33,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-11-15 21:56:33,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:33,553 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:33,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:56:33,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-11-15 21:56:33,567 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:33,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:33,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:56:33,589 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:62, output treesize:26 [2019-11-15 21:56:33,700 INFO L375 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 25 treesize of output 17 [2019-11-15 21:56:33,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:33,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:33,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:56:33,707 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2019-11-15 21:56:33,832 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:33,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 28 [2019-11-15 21:56:33,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:33,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:56:33,834 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:56:33,843 INFO L567 ElimStorePlain]: treesize reduction 12, result has 45.5 percent of original size [2019-11-15 21:56:33,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:56:33,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:5 [2019-11-15 21:56:33,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:33,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 21:56:33,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:33,956 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 21:56:33,956 INFO L496 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-11-15 21:56:33,957 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2019-11-15 21:56:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2019-11-15 21:56:33,980 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:56:33,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 29 [2019-11-15 21:56:33,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942070246] [2019-11-15 21:56:33,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 21:56:33,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:56:33,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 21:56:33,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=740, Unknown=2, NotChecked=54, Total=870 [2019-11-15 21:56:33,982 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand 30 states. [2019-11-15 21:56:46,543 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-15 21:56:52,653 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2019-11-15 21:56:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:56:56,742 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2019-11-15 21:56:56,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 21:56:56,742 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 43 [2019-11-15 21:56:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:56:56,743 INFO L225 Difference]: With dead ends: 159 [2019-11-15 21:56:56,744 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 21:56:56,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=281, Invalid=2167, Unknown=6, NotChecked=96, Total=2550 [2019-11-15 21:56:56,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 21:56:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 126. [2019-11-15 21:56:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 21:56:56,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2019-11-15 21:56:56,749 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 43 [2019-11-15 21:56:56,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:56:56,750 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2019-11-15 21:56:56,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 21:56:56,750 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2019-11-15 21:56:56,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-15 21:56:56,750 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:56:56,751 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:56:56,955 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:56:56,956 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:56:56,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:56:56,957 INFO L82 PathProgramCache]: Analyzing trace with hash -903585542, now seen corresponding path program 1 times [2019-11-15 21:56:56,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:56:56,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207363335] [2019-11-15 21:56:56,957 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:56,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:56:56,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:56:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-15 21:56:57,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207363335] [2019-11-15 21:56:57,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690756304] [2019-11-15 21:56:57,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:56:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:56:57,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 79 conjunts are in the unsatisfiable core [2019-11-15 21:56:57,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:56:57,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:56:57,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:57,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:57,970 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:56:57,970 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 21:56:57,982 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:57,983 INFO L375 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-11-15 21:56:57,983 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:57,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:57,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:56:57,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-11-15 21:56:57,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:56:57,994 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:58,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:58,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 21:56:58,014 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:56:58,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:56:58,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:56:58,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-11-15 21:57:00,038 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_entry_point_~c11~0.offset_BEFORE_CALL_12 Int) (v_entry_point_~c11~0.base_BEFORE_CALL_19 Int)) (not (= v_entry_point_~c11~0.base_BEFORE_CALL_19 (select (select |c_#memory_$Pointer$.base| v_entry_point_~c11~0.base_BEFORE_CALL_19) v_entry_point_~c11~0.offset_BEFORE_CALL_12)))) is different from true [2019-11-15 21:57:04,076 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 12 [2019-11-15 21:57:04,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:57:04,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:04,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:04,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:57:04,102 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:04,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:04,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 21:57:04,113 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:27, output treesize:22 [2019-11-15 21:57:07,534 WARN L191 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 21 [2019-11-15 21:57:07,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:57:07,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-11-15 21:57:07,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:07,584 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:07,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:57:07,589 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-11-15 21:57:07,589 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:07,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:07,603 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:57:07,603 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:67, output treesize:58 [2019-11-15 21:57:07,907 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:07,907 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 59 [2019-11-15 21:57:07,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:57:07,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:57:07,910 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 21:57:07,930 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.8 percent of original size [2019-11-15 21:57:07,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-11-15 21:57:07,933 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:07,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:07,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:57:07,941 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:88, output treesize:14 [2019-11-15 21:57:07,995 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:07,996 INFO L375 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-11-15 21:57:07,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:08,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:08,006 INFO L375 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-11-15 21:57:08,007 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:08,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:08,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:57:08,014 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-11-15 21:57:08,021 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-11-15 21:57:08,021 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:57:08,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 33 [2019-11-15 21:57:08,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484478193] [2019-11-15 21:57:08,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 21:57:08,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:08,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 21:57:08,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=973, Unknown=3, NotChecked=62, Total=1122 [2019-11-15 21:57:08,023 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 34 states. [2019-11-15 21:57:30,480 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-15 21:57:36,538 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2019-11-15 21:57:42,648 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-11-15 21:57:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:50,635 INFO L93 Difference]: Finished difference Result 132 states and 146 transitions. [2019-11-15 21:57:50,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 21:57:50,635 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2019-11-15 21:57:50,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:50,636 INFO L225 Difference]: With dead ends: 132 [2019-11-15 21:57:50,636 INFO L226 Difference]: Without dead ends: 132 [2019-11-15 21:57:50,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 37.4s TimeCoverageRelationStatistics Valid=263, Invalid=2382, Unknown=11, NotChecked=100, Total=2756 [2019-11-15 21:57:50,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-15 21:57:50,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2019-11-15 21:57:50,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-15 21:57:50,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2019-11-15 21:57:50,642 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 43 [2019-11-15 21:57:50,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:50,642 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2019-11-15 21:57:50,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 21:57:50,642 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2019-11-15 21:57:50,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 21:57:50,643 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:50,643 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:57:50,848 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:57:50,849 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:57:50,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:50,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1954667464, now seen corresponding path program 1 times [2019-11-15 21:57:50,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:50,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156496428] [2019-11-15 21:57:50,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:50,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:50,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:50,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:50,938 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:57:50,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156496428] [2019-11-15 21:57:50,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:50,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:57:50,939 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013792114] [2019-11-15 21:57:50,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 21:57:50,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:50,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:57:50,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:57:50,940 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand 7 states. [2019-11-15 21:57:51,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:51,299 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2019-11-15 21:57:51,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:57:51,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-11-15 21:57:51,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:51,300 INFO L225 Difference]: With dead ends: 130 [2019-11-15 21:57:51,300 INFO L226 Difference]: Without dead ends: 130 [2019-11-15 21:57:51,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:57:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-15 21:57:51,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2019-11-15 21:57:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-15 21:57:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2019-11-15 21:57:51,303 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 47 [2019-11-15 21:57:51,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:51,304 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2019-11-15 21:57:51,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 21:57:51,304 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2019-11-15 21:57:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 21:57:51,304 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:51,304 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:57:51,305 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:57:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:51,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1758153959, now seen corresponding path program 1 times [2019-11-15 21:57:51,305 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:51,305 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196030780] [2019-11-15 21:57:51,305 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:51,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:51,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:51,726 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-15 21:57:51,726 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196030780] [2019-11-15 21:57:51,727 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985965488] [2019-11-15 21:57:51,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:57:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:51,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 64 conjunts are in the unsatisfiable core [2019-11-15 21:57:51,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:57:51,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:57:51,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:51,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:51,974 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:57:51,974 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:51,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:51,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:57:51,985 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-11-15 21:57:52,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:57:52,054 INFO L375 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-11-15 21:57:52,055 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:52,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:52,092 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:52,093 INFO L375 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-11-15 21:57:52,093 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:52,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:52,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:57:52,104 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-11-15 21:57:52,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:57:52,122 INFO L375 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-11-15 21:57:52,123 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:52,135 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:52,145 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:52,145 INFO L375 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-11-15 21:57:52,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:52,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:52,153 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:57:52,154 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-11-15 21:57:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 21:57:52,166 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:57:52,166 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 19 [2019-11-15 21:57:52,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713296941] [2019-11-15 21:57:52,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 21:57:52,167 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:52,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 21:57:52,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:57:52,167 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand 20 states. [2019-11-15 21:57:53,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:53,366 INFO L93 Difference]: Finished difference Result 148 states and 155 transitions. [2019-11-15 21:57:53,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 21:57:53,368 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2019-11-15 21:57:53,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:53,368 INFO L225 Difference]: With dead ends: 148 [2019-11-15 21:57:53,368 INFO L226 Difference]: Without dead ends: 148 [2019-11-15 21:57:53,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=129, Invalid=801, Unknown=0, NotChecked=0, Total=930 [2019-11-15 21:57:53,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-15 21:57:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 131. [2019-11-15 21:57:53,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-15 21:57:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 145 transitions. [2019-11-15 21:57:53,372 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 145 transitions. Word has length 47 [2019-11-15 21:57:53,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:53,373 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 145 transitions. [2019-11-15 21:57:53,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 21:57:53,373 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 145 transitions. [2019-11-15 21:57:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-15 21:57:53,374 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:53,374 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:57:53,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:57:53,578 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:57:53,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:53,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1758153958, now seen corresponding path program 1 times [2019-11-15 21:57:53,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:53,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34625962] [2019-11-15 21:57:53,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:53,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:53,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:53,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 21:57:53,710 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34625962] [2019-11-15 21:57:53,710 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:53,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:57:53,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860812721] [2019-11-15 21:57:53,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:57:53,711 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:53,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:57:53,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:57:53,712 INFO L87 Difference]: Start difference. First operand 131 states and 145 transitions. Second operand 10 states. [2019-11-15 21:57:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:54,270 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2019-11-15 21:57:54,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:57:54,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-11-15 21:57:54,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:54,271 INFO L225 Difference]: With dead ends: 138 [2019-11-15 21:57:54,272 INFO L226 Difference]: Without dead ends: 138 [2019-11-15 21:57:54,272 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:57:54,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-15 21:57:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 131. [2019-11-15 21:57:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-15 21:57:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2019-11-15 21:57:54,277 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 47 [2019-11-15 21:57:54,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:54,277 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2019-11-15 21:57:54,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:57:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2019-11-15 21:57:54,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 21:57:54,278 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:54,279 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:57:54,279 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:57:54,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:54,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2129162513, now seen corresponding path program 1 times [2019-11-15 21:57:54,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:54,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929245832] [2019-11-15 21:57:54,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:54,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:54,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:54,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:54,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 21:57:54,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929245832] [2019-11-15 21:57:54,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570998456] [2019-11-15 21:57:54,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:57:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:54,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-15 21:57:54,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:57:54,980 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:57:54,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:54,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:54,994 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:57:54,995 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:55,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:55,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:57:55,005 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2019-11-15 21:57:55,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:57:55,102 INFO L375 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-11-15 21:57:55,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:55,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:55,128 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:55,128 INFO L375 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-11-15 21:57:55,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:55,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:55,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:57:55,138 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-11-15 21:57:55,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:57:55,155 INFO L375 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-11-15 21:57:55,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:55,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:55,172 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:55,172 INFO L375 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-11-15 21:57:55,172 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:55,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:55,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:57:55,179 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-11-15 21:57:55,202 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 21:57:55,203 INFO L375 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-11-15 21:57:55,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:55,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:55,226 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:55,227 INFO L375 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-11-15 21:57:55,227 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 21:57:55,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:57:55,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:57:55,242 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2019-11-15 21:57:55,252 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-15 21:57:55,252 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:57:55,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 19 [2019-11-15 21:57:55,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111867213] [2019-11-15 21:57:55,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 21:57:55,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:55,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 21:57:55,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-11-15 21:57:55,254 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand 20 states. [2019-11-15 21:57:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:56,476 INFO L93 Difference]: Finished difference Result 146 states and 153 transitions. [2019-11-15 21:57:56,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 21:57:56,477 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2019-11-15 21:57:56,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:56,478 INFO L225 Difference]: With dead ends: 146 [2019-11-15 21:57:56,478 INFO L226 Difference]: Without dead ends: 146 [2019-11-15 21:57:56,478 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 21:57:56,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-15 21:57:56,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2019-11-15 21:57:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-15 21:57:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 143 transitions. [2019-11-15 21:57:56,481 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 143 transitions. Word has length 48 [2019-11-15 21:57:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:56,482 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 143 transitions. [2019-11-15 21:57:56,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 21:57:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 143 transitions. [2019-11-15 21:57:56,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 21:57:56,482 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:56,482 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:57:56,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:57:56,683 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:57:56,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:56,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2129162514, now seen corresponding path program 1 times [2019-11-15 21:57:56,684 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:56,684 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822547734] [2019-11-15 21:57:56,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:56,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:56,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:56,913 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 21:57:56,913 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822547734] [2019-11-15 21:57:56,913 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:56,914 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 21:57:56,914 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749231836] [2019-11-15 21:57:56,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 21:57:56,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:56,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:57:56,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:57:56,915 INFO L87 Difference]: Start difference. First operand 130 states and 143 transitions. Second operand 11 states. [2019-11-15 21:57:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:57,529 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2019-11-15 21:57:57,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:57:57,530 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2019-11-15 21:57:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:57,531 INFO L225 Difference]: With dead ends: 136 [2019-11-15 21:57:57,531 INFO L226 Difference]: Without dead ends: 136 [2019-11-15 21:57:57,531 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:57:57,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-15 21:57:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2019-11-15 21:57:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-15 21:57:57,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2019-11-15 21:57:57,535 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 48 [2019-11-15 21:57:57,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:57,535 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2019-11-15 21:57:57,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 21:57:57,536 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2019-11-15 21:57:57,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 21:57:57,536 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:57,537 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:57:57,537 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:57:57,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:57,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1637901710, now seen corresponding path program 1 times [2019-11-15 21:57:57,537 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:57,538 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348612113] [2019-11-15 21:57:57,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:57,538 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:57,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:57:57,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348612113] [2019-11-15 21:57:57,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:57,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:57:57,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820910018] [2019-11-15 21:57:57,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:57:57,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:57,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:57:57,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:57:57,689 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 8 states. [2019-11-15 21:57:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:58,144 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2019-11-15 21:57:58,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:57:58,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-15 21:57:58,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:58,146 INFO L225 Difference]: With dead ends: 126 [2019-11-15 21:57:58,146 INFO L226 Difference]: Without dead ends: 126 [2019-11-15 21:57:58,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:57:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-15 21:57:58,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-11-15 21:57:58,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 21:57:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2019-11-15 21:57:58,150 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 53 [2019-11-15 21:57:58,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:58,150 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2019-11-15 21:57:58,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:57:58,151 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2019-11-15 21:57:58,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 21:57:58,152 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:58,152 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:57:58,152 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:57:58,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:58,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2146531409, now seen corresponding path program 1 times [2019-11-15 21:57:58,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:58,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982561670] [2019-11-15 21:57:58,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:58,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:58,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:57:58,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982561670] [2019-11-15 21:57:58,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:58,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:57:58,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696767905] [2019-11-15 21:57:58,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:57:58,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:58,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:57:58,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:57:58,267 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 8 states. [2019-11-15 21:57:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:58,606 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-11-15 21:57:58,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 21:57:58,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-15 21:57:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:58,608 INFO L225 Difference]: With dead ends: 125 [2019-11-15 21:57:58,608 INFO L226 Difference]: Without dead ends: 125 [2019-11-15 21:57:58,608 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-11-15 21:57:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-15 21:57:58,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-11-15 21:57:58,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-15 21:57:58,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2019-11-15 21:57:58,612 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 53 [2019-11-15 21:57:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:58,612 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2019-11-15 21:57:58,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:57:58,613 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2019-11-15 21:57:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-15 21:57:58,614 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:58,614 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:57:58,614 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:57:58,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:58,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2117963855, now seen corresponding path program 1 times [2019-11-15 21:57:58,615 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:58,615 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387746319] [2019-11-15 21:57:58,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:58,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:58,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:57:58,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387746319] [2019-11-15 21:57:58,747 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:58,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:57:58,748 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566559110] [2019-11-15 21:57:58,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:57:58,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:58,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:57:58,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:57:58,749 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 8 states. [2019-11-15 21:57:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:59,170 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2019-11-15 21:57:59,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:57:59,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-11-15 21:57:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:59,171 INFO L225 Difference]: With dead ends: 124 [2019-11-15 21:57:59,171 INFO L226 Difference]: Without dead ends: 124 [2019-11-15 21:57:59,172 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:57:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-15 21:57:59,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-11-15 21:57:59,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 21:57:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2019-11-15 21:57:59,175 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 54 [2019-11-15 21:57:59,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:59,176 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2019-11-15 21:57:59,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:57:59,176 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2019-11-15 21:57:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-15 21:57:59,176 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:59,176 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:57:59,177 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:57:59,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:59,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1232369679, now seen corresponding path program 1 times [2019-11-15 21:57:59,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:59,177 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088584134] [2019-11-15 21:57:59,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:59,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:59,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:57:59,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088584134] [2019-11-15 21:57:59,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:57:59,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:57:59,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251763417] [2019-11-15 21:57:59,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 21:57:59,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:57:59,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:57:59,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:57:59,310 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 8 states. [2019-11-15 21:57:59,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:57:59,769 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2019-11-15 21:57:59,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:57:59,769 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-11-15 21:57:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:57:59,770 INFO L225 Difference]: With dead ends: 123 [2019-11-15 21:57:59,771 INFO L226 Difference]: Without dead ends: 123 [2019-11-15 21:57:59,771 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:57:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-15 21:57:59,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-11-15 21:57:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 21:57:59,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2019-11-15 21:57:59,775 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 55 [2019-11-15 21:57:59,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:57:59,775 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2019-11-15 21:57:59,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 21:57:59,776 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2019-11-15 21:57:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 21:57:59,776 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:57:59,776 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:57:59,777 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:57:59,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:57:59,777 INFO L82 PathProgramCache]: Analyzing trace with hash 21364415, now seen corresponding path program 1 times [2019-11-15 21:57:59,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:57:59,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492147793] [2019-11-15 21:57:59,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:59,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:57:59,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:57:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:57:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 21:58:00,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492147793] [2019-11-15 21:58:00,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:00,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-15 21:58:00,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055620883] [2019-11-15 21:58:00,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 21:58:00,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:00,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 21:58:00,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-11-15 21:58:00,059 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 17 states. [2019-11-15 21:58:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:01,084 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2019-11-15 21:58:01,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 21:58:01,085 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 62 [2019-11-15 21:58:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:01,086 INFO L225 Difference]: With dead ends: 152 [2019-11-15 21:58:01,086 INFO L226 Difference]: Without dead ends: 152 [2019-11-15 21:58:01,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-11-15 21:58:01,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-15 21:58:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 139. [2019-11-15 21:58:01,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-15 21:58:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 149 transitions. [2019-11-15 21:58:01,091 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 149 transitions. Word has length 62 [2019-11-15 21:58:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:01,091 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 149 transitions. [2019-11-15 21:58:01,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 21:58:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 149 transitions. [2019-11-15 21:58:01,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-15 21:58:01,092 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:01,093 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:01,093 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:58:01,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:01,093 INFO L82 PathProgramCache]: Analyzing trace with hash 21364416, now seen corresponding path program 1 times [2019-11-15 21:58:01,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:01,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626389288] [2019-11-15 21:58:01,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:01,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:01,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:01,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:58:01,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626389288] [2019-11-15 21:58:01,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181247356] [2019-11-15 21:58:01,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:01,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:01,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 54 conjunts are in the unsatisfiable core [2019-11-15 21:58:01,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:58:02,051 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:58:02,051 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 25 [2019-11-15 21:58:02,051 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563496496] [2019-11-15 21:58:02,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 21:58:02,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:02,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 21:58:02,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-11-15 21:58:02,053 INFO L87 Difference]: Start difference. First operand 139 states and 149 transitions. Second operand 26 states. [2019-11-15 21:58:03,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:03,503 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2019-11-15 21:58:03,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 21:58:03,504 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2019-11-15 21:58:03,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:03,504 INFO L225 Difference]: With dead ends: 137 [2019-11-15 21:58:03,505 INFO L226 Difference]: Without dead ends: 137 [2019-11-15 21:58:03,506 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=231, Invalid=1931, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 21:58:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-15 21:58:03,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 130. [2019-11-15 21:58:03,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-15 21:58:03,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2019-11-15 21:58:03,510 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 62 [2019-11-15 21:58:03,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:03,510 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2019-11-15 21:58:03,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 21:58:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2019-11-15 21:58:03,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 21:58:03,511 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:03,512 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:03,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:03,716 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:58:03,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:03,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1135609397, now seen corresponding path program 1 times [2019-11-15 21:58:03,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:03,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811608008] [2019-11-15 21:58:03,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:03,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:03,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:04,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:04,310 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 21:58:04,311 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811608008] [2019-11-15 21:58:04,311 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:58:04,311 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-11-15 21:58:04,312 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752334574] [2019-11-15 21:58:04,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 21:58:04,312 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:04,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 21:58:04,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2019-11-15 21:58:04,313 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand 25 states. [2019-11-15 21:58:05,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:05,986 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2019-11-15 21:58:05,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 21:58:05,987 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2019-11-15 21:58:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:05,987 INFO L225 Difference]: With dead ends: 135 [2019-11-15 21:58:05,987 INFO L226 Difference]: Without dead ends: 135 [2019-11-15 21:58:05,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=252, Invalid=1910, Unknown=0, NotChecked=0, Total=2162 [2019-11-15 21:58:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-15 21:58:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 107. [2019-11-15 21:58:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-15 21:58:05,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 110 transitions. [2019-11-15 21:58:05,993 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 110 transitions. Word has length 65 [2019-11-15 21:58:05,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:05,993 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 110 transitions. [2019-11-15 21:58:05,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 21:58:05,994 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 110 transitions. [2019-11-15 21:58:05,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-15 21:58:05,994 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:05,995 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:05,995 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:58:05,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:05,996 INFO L82 PathProgramCache]: Analyzing trace with hash 667877261, now seen corresponding path program 1 times [2019-11-15 21:58:05,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:05,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542434887] [2019-11-15 21:58:05,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:05,996 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:05,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:06,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:58:06,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542434887] [2019-11-15 21:58:06,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703444241] [2019-11-15 21:58:06,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:07,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 70 conjunts are in the unsatisfiable core [2019-11-15 21:58:07,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:07,268 INFO L375 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 13 treesize of output 9 [2019-11-15 21:58:07,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:07,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:07,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:07,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 21:58:07,880 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:07,881 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 28 treesize of output 26 [2019-11-15 21:58:07,881 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:07,886 INFO L567 ElimStorePlain]: treesize reduction 17, result has 15.0 percent of original size [2019-11-15 21:58:07,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:07,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:28, output treesize:3 [2019-11-15 21:58:07,895 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-15 21:58:07,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:58:07,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [25] total 39 [2019-11-15 21:58:07,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770983949] [2019-11-15 21:58:07,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 21:58:07,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:07,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 21:58:07,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1453, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 21:58:07,897 INFO L87 Difference]: Start difference. First operand 107 states and 110 transitions. Second operand 20 states. [2019-11-15 21:58:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:08,732 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2019-11-15 21:58:08,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 21:58:08,733 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 71 [2019-11-15 21:58:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:08,734 INFO L225 Difference]: With dead ends: 152 [2019-11-15 21:58:08,734 INFO L226 Difference]: Without dead ends: 152 [2019-11-15 21:58:08,735 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=171, Invalid=2279, Unknown=0, NotChecked=0, Total=2450 [2019-11-15 21:58:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-15 21:58:08,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 132. [2019-11-15 21:58:08,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-15 21:58:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2019-11-15 21:58:08,750 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 71 [2019-11-15 21:58:08,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:08,753 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2019-11-15 21:58:08,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 21:58:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2019-11-15 21:58:08,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 21:58:08,754 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:08,755 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:08,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:08,959 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:58:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:08,960 INFO L82 PathProgramCache]: Analyzing trace with hash -770640990, now seen corresponding path program 1 times [2019-11-15 21:58:08,960 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:08,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190371584] [2019-11-15 21:58:08,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:08,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:08,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:58:09,819 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190371584] [2019-11-15 21:58:09,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596289589] [2019-11-15 21:58:09,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:10,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 79 conjunts are in the unsatisfiable core [2019-11-15 21:58:10,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:10,135 INFO L375 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 13 treesize of output 9 [2019-11-15 21:58:10,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:10,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:10,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:10,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 21:58:10,662 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:10,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 18 [2019-11-15 21:58:10,663 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:10,669 INFO L567 ElimStorePlain]: treesize reduction 9, result has 25.0 percent of original size [2019-11-15 21:58:10,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:10,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-15 21:58:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:58:10,683 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:58:10,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 40 [2019-11-15 21:58:10,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357250126] [2019-11-15 21:58:10,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-15 21:58:10,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:10,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-15 21:58:10,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1458, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 21:58:10,686 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand 40 states. [2019-11-15 21:58:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:13,538 INFO L93 Difference]: Finished difference Result 150 states and 151 transitions. [2019-11-15 21:58:13,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-15 21:58:13,539 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 72 [2019-11-15 21:58:13,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:13,539 INFO L225 Difference]: With dead ends: 150 [2019-11-15 21:58:13,539 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 21:58:13,541 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=442, Invalid=4960, Unknown=0, NotChecked=0, Total=5402 [2019-11-15 21:58:13,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 21:58:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 129. [2019-11-15 21:58:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-15 21:58:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-11-15 21:58:13,545 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 72 [2019-11-15 21:58:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:13,546 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-11-15 21:58:13,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-15 21:58:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-11-15 21:58:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-15 21:58:13,547 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:13,547 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:13,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:13,752 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:58:13,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:13,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1880184415, now seen corresponding path program 1 times [2019-11-15 21:58:13,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:13,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945963885] [2019-11-15 21:58:13,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:13,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:13,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:13,928 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:58:13,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945963885] [2019-11-15 21:58:13,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875489000] [2019-11-15 21:58:13,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/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-11-15 21:58:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:14,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:58:14,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:58:14,221 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:58:14,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 9 [2019-11-15 21:58:14,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999359095] [2019-11-15 21:58:14,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:58:14,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:14,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:58:14,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:58:14,223 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 10 states. [2019-11-15 21:58:14,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:14,634 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2019-11-15 21:58:14,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:58:14,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-11-15 21:58:14,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:14,635 INFO L225 Difference]: With dead ends: 130 [2019-11-15 21:58:14,635 INFO L226 Difference]: Without dead ends: 130 [2019-11-15 21:58:14,636 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:58:14,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-15 21:58:14,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2019-11-15 21:58:14,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-15 21:58:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2019-11-15 21:58:14,639 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 73 [2019-11-15 21:58:14,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:14,639 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2019-11-15 21:58:14,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:58:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2019-11-15 21:58:14,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 21:58:14,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:14,640 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:14,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:14,841 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:58:14,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:14,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1734935337, now seen corresponding path program 1 times [2019-11-15 21:58:14,841 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:14,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406749723] [2019-11-15 21:58:14,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:14,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:14,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:15,810 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 21:58:15,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406749723] [2019-11-15 21:58:15,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569011271] [2019-11-15 21:58:15,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:16,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 79 conjunts are in the unsatisfiable core [2019-11-15 21:58:16,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:16,220 INFO L375 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 13 treesize of output 9 [2019-11-15 21:58:16,221 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:16,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:16,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:16,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-15 21:58:17,011 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:17,011 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 18 [2019-11-15 21:58:17,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:17,019 INFO L567 ElimStorePlain]: treesize reduction 9, result has 25.0 percent of original size [2019-11-15 21:58:17,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:17,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-15 21:58:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:58:17,035 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:58:17,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 41 [2019-11-15 21:58:17,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862454740] [2019-11-15 21:58:17,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-15 21:58:17,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:17,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-15 21:58:17,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1612, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 21:58:17,038 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 42 states. [2019-11-15 21:58:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:19,927 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2019-11-15 21:58:19,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-15 21:58:19,927 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 74 [2019-11-15 21:58:19,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:19,928 INFO L225 Difference]: With dead ends: 129 [2019-11-15 21:58:19,928 INFO L226 Difference]: Without dead ends: 129 [2019-11-15 21:58:19,931 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=439, Invalid=5111, Unknown=0, NotChecked=0, Total=5550 [2019-11-15 21:58:19,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-15 21:58:19,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2019-11-15 21:58:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-15 21:58:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2019-11-15 21:58:19,935 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 74 [2019-11-15 21:58:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:19,935 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2019-11-15 21:58:19,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-15 21:58:19,935 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2019-11-15 21:58:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 21:58:19,936 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:19,936 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:20,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:20,137 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:58:20,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:20,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1843824831, now seen corresponding path program 1 times [2019-11-15 21:58:20,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:20,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354158978] [2019-11-15 21:58:20,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:20,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:20,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:20,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:20,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:20,312 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:58:20,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354158978] [2019-11-15 21:58:20,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605765724] [2019-11-15 21:58:20,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:20,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:58:20,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:20,597 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:58:20,598 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:58:20,598 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 9 [2019-11-15 21:58:20,598 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113432725] [2019-11-15 21:58:20,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:58:20,601 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:20,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:58:20,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:58:20,602 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand 10 states. [2019-11-15 21:58:21,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:21,036 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2019-11-15 21:58:21,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:58:21,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-11-15 21:58:21,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:21,038 INFO L225 Difference]: With dead ends: 128 [2019-11-15 21:58:21,038 INFO L226 Difference]: Without dead ends: 128 [2019-11-15 21:58:21,038 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:58:21,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-15 21:58:21,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2019-11-15 21:58:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-15 21:58:21,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-11-15 21:58:21,043 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 74 [2019-11-15 21:58:21,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:21,043 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2019-11-15 21:58:21,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:58:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2019-11-15 21:58:21,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 21:58:21,046 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:21,047 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:21,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:21,256 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:58:21,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:21,256 INFO L82 PathProgramCache]: Analyzing trace with hash 2051579800, now seen corresponding path program 1 times [2019-11-15 21:58:21,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:21,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817051640] [2019-11-15 21:58:21,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:21,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:21,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:22,409 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 21:58:22,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817051640] [2019-11-15 21:58:22,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881060464] [2019-11-15 21:58:22,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:22,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 64 conjunts are in the unsatisfiable core [2019-11-15 21:58:22,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:22,893 INFO L375 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 13 treesize of output 9 [2019-11-15 21:58:22,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:22,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:22,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:22,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-11-15 21:58:23,534 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:23,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 32 treesize of output 30 [2019-11-15 21:58:23,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:58:23,535 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 21:58:23,548 INFO L567 ElimStorePlain]: treesize reduction 19, result has 20.8 percent of original size [2019-11-15 21:58:23,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:23,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:5 [2019-11-15 21:58:23,560 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 21:58:23,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:58:23,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [31] total 45 [2019-11-15 21:58:23,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913808471] [2019-11-15 21:58:23,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 21:58:23,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:23,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 21:58:23,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1953, Unknown=0, NotChecked=0, Total=2070 [2019-11-15 21:58:23,562 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 23 states. [2019-11-15 21:58:31,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:31,010 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2019-11-15 21:58:31,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 21:58:31,010 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 75 [2019-11-15 21:58:31,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:31,011 INFO L225 Difference]: With dead ends: 141 [2019-11-15 21:58:31,011 INFO L226 Difference]: Without dead ends: 141 [2019-11-15 21:58:31,012 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=174, Invalid=2906, Unknown=0, NotChecked=0, Total=3080 [2019-11-15 21:58:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-15 21:58:31,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 125. [2019-11-15 21:58:31,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-15 21:58:31,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2019-11-15 21:58:31,015 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 75 [2019-11-15 21:58:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:31,015 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2019-11-15 21:58:31,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 21:58:31,016 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2019-11-15 21:58:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 21:58:31,016 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:31,016 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:31,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:31,218 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:58:31,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:31,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1323994463, now seen corresponding path program 1 times [2019-11-15 21:58:31,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:31,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237704247] [2019-11-15 21:58:31,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:31,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:31,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,389 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 21:58:31,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237704247] [2019-11-15 21:58:31,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207259636] [2019-11-15 21:58:31,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:58:31,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 21:58:31,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:58:31,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 21:58:31,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:58:31,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:58:31,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:58:31,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 21:58:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:58:31,692 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:58:31,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 9 [2019-11-15 21:58:31,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140519725] [2019-11-15 21:58:31,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 21:58:31,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:58:31,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:58:31,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:58:31,694 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 10 states. [2019-11-15 21:58:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:58:32,135 INFO L93 Difference]: Finished difference Result 130 states and 132 transitions. [2019-11-15 21:58:32,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:58:32,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 75 [2019-11-15 21:58:32,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:58:32,136 INFO L225 Difference]: With dead ends: 130 [2019-11-15 21:58:32,136 INFO L226 Difference]: Without dead ends: 130 [2019-11-15 21:58:32,137 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:58:32,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-15 21:58:32,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2019-11-15 21:58:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-15 21:58:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2019-11-15 21:58:32,140 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 75 [2019-11-15 21:58:32,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:58:32,141 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2019-11-15 21:58:32,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 21:58:32,141 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2019-11-15 21:58:32,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-15 21:58:32,142 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:58:32,142 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:58:32,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:58:32,348 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, alloc_2_11Err0REQUIRES_VIOLATION, alloc_2_11Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err5REQUIRES_VIOLATION, alloc_2_11Err2REQUIRES_VIOLATION, alloc_2_11Err1REQUIRES_VIOLATION, alloc_2_11Err3REQUIRES_VIOLATION, alloc_2_11Err7ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err8ASSERT_VIOLATIONMEMORY_FREE, alloc_2_11Err4REQUIRES_VIOLATION, free_11Err2ASSERT_VIOLATIONMEMORY_FREE, free_11Err0ASSERT_VIOLATIONMEMORY_FREE, free_11Err1ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr7ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr9ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr8ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr6ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr5ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr11ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr10ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr12ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr3REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-15 21:58:32,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:58:32,348 INFO L82 PathProgramCache]: Analyzing trace with hash -825535239, now seen corresponding path program 1 times [2019-11-15 21:58:32,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:58:32,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410559344] [2019-11-15 21:58:32,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:32,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:58:32,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:58:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:58:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:58:32,450 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:58:32,450 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 21:58:32,514 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 22 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-11-15 21:58:32,515 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 21 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-11-15 21:58:32,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:58:32 BoogieIcfgContainer [2019-11-15 21:58:32,550 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:58:32,551 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:58:32,551 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:58:32,551 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:58:32,554 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:55:32" (3/4) ... [2019-11-15 21:58:32,556 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 21:58:32,562 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 22 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-11-15 21:58:32,562 WARN L1295 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 21 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2019-11-15 21:58:32,629 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_96af8252-3294-4774-909a-fc377889e320/bin/uautomizer/witness.graphml [2019-11-15 21:58:32,629 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:58:32,631 INFO L168 Benchmark]: Toolchain (without parser) took 182348.07 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 432.5 MB). Free memory was 939.3 MB in the beginning and 1.4 GB in the end (delta: -435.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:58:32,631 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:58:32,631 INFO L168 Benchmark]: CACSL2BoogieTranslator took 850.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:58:32,632 INFO L168 Benchmark]: Boogie Preprocessor took 117.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:58:32,632 INFO L168 Benchmark]: RCFGBuilder took 1516.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 981.2 MB in the end (delta: 120.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:58:32,633 INFO L168 Benchmark]: TraceAbstraction took 179780.05 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 286.8 MB). Free memory was 981.2 MB in the beginning and 1.4 GB in the end (delta: -397.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:58:32,633 INFO L168 Benchmark]: Witness Printer took 78.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:58:32,636 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 850.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1516.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 981.2 MB in the end (delta: 120.0 MB). Peak memory consumption was 120.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 179780.05 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 286.8 MB). Free memory was 981.2 MB in the beginning and 1.4 GB in the end (delta: -397.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 78.40 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 22 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 21 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 22 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 21 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 800]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L570] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={-5:0}] [L825] CALL entry_point() VAL [ldv_global_msg_list={-5:0}] [L804] CALL, EXPR ldv_malloc(sizeof(struct ldv_i2c_client)) VAL [\old(size)=20, ldv_global_msg_list={-5:0}] [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [\old(size)=20, \result={-2:0}, ldv_global_msg_list={-5:0}, malloc(size)={-2:0}, size=20] [L804] RET, EXPR ldv_malloc(sizeof(struct ldv_i2c_client)) VAL [ldv_global_msg_list={-5:0}, ldv_malloc(sizeof(struct ldv_i2c_client))={-2:0}] [L804] struct ldv_i2c_client *c11 = (struct ldv_i2c_client *)ldv_malloc(sizeof(struct ldv_i2c_client)); [L805] COND FALSE !(!c11) VAL [c11={-2:0}, ldv_global_msg_list={-5:0}] [L807] CALL, EXPR ldv_malloc(sizeof(struct ldv_m88ts2022_config)) VAL [\old(size)=4, ldv_global_msg_list={-5:0}] [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [\old(size)=4, \result={1:0}, ldv_global_msg_list={-5:0}, malloc(size)={1:0}, size=4] [L807] RET, EXPR ldv_malloc(sizeof(struct ldv_m88ts2022_config)) VAL [c11={-2:0}, ldv_global_msg_list={-5:0}, ldv_malloc(sizeof(struct ldv_m88ts2022_config))={1:0}] [L806-L807] struct ldv_m88ts2022_config *cfg = (struct ldv_m88ts2022_config *) ldv_malloc(sizeof(struct ldv_m88ts2022_config)); [L808] COND FALSE !(!cfg) VAL [c11={-2:0}, cfg={1:0}, ldv_global_msg_list={-5:0}] [L809] c11->dev.platform_data = cfg VAL [c11={-2:0}, cfg={1:0}, ldv_global_msg_list={-5:0}] [L811] CALL, EXPR ldv_malloc(sizeof(struct ldv_dvb_frontend)) VAL [\old(size)=4, ldv_global_msg_list={-5:0}] [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [\old(size)=4, \result={2:0}, ldv_global_msg_list={-5:0}, malloc(size)={2:0}, size=4] [L811] RET, EXPR ldv_malloc(sizeof(struct ldv_dvb_frontend)) VAL [c11={-2:0}, cfg={1:0}, ldv_global_msg_list={-5:0}, ldv_malloc(sizeof(struct ldv_dvb_frontend))={2:0}] [L810-L811] struct ldv_dvb_frontend *fe = (struct ldv_dvb_frontend *) ldv_malloc(sizeof(struct ldv_dvb_frontend)); [L812] COND FALSE !(!fe) VAL [c11={-2:0}, cfg={1:0}, fe={2:0}, ldv_global_msg_list={-5:0}] [L813] cfg->fe = fe VAL [c11={-2:0}, cfg={1:0}, fe={2:0}, ldv_global_msg_list={-5:0}] [L814] CALL alloc_2_11(c11) VAL [client={-2:0}, ldv_global_msg_list={-5:0}] [L785] EXPR client->dev.platform_data VAL [client={-2:0}, client={-2:0}, client->dev.platform_data={1:0}, ldv_global_msg_list={-5:0}] [L785] struct ldv_m88ts2022_config *cfg = client->dev.platform_data; [L786] EXPR cfg->fe VAL [cfg={1:0}, cfg->fe={2:0}, client={-2:0}, client={-2:0}, ldv_global_msg_list={-5:0}] [L786] struct ldv_dvb_frontend *fe = cfg->fe; [L787] CALL, EXPR ldv_malloc(sizeof(struct Data11)) VAL [\old(size)=12, ldv_global_msg_list={-5:0}] [L527] COND TRUE __VERIFIER_nondet_int() [L528] return malloc(size); VAL [\old(size)=12, \result={-3:0}, ldv_global_msg_list={-5:0}, malloc(size)={-3:0}, size=12] [L787] RET, EXPR ldv_malloc(sizeof(struct Data11)) VAL [cfg={1:0}, client={-2:0}, client={-2:0}, fe={2:0}, ldv_global_msg_list={-5:0}, ldv_malloc(sizeof(struct Data11))={-3:0}] [L787] struct Data11 *priv = (struct Data11*)ldv_malloc(sizeof(struct Data11)); [L788] COND FALSE !(!priv) VAL [cfg={1:0}, client={-2:0}, client={-2:0}, fe={2:0}, ldv_global_msg_list={-5:0}, priv={-3:0}] [L789] fe->tuner_priv = priv VAL [cfg={1:0}, client={-2:0}, client={-2:0}, fe={2:0}, ldv_global_msg_list={-5:0}, priv={-3:0}] [L790] CALL ldv_i2c_set_clientdata(client, priv) VAL [data={-3:0}, dev={-2:0}, ldv_global_msg_list={-5:0}] [L779] CALL ldv_dev_set_drvdata(&dev->dev, data) VAL [data={-3:0}, dev={-2:0}, ldv_global_msg_list={-5:0}] [L624] dev->driver_data = data VAL [data={-3:0}, data={-3:0}, dev={-2:0}, dev={-2:0}, ldv_global_msg_list={-5:0}] [L779] RET ldv_dev_set_drvdata(&dev->dev, data) VAL [data={-3:0}, data={-3:0}, dev={-2:0}, dev={-2:0}, ldv_global_msg_list={-5:0}] [L790] RET ldv_i2c_set_clientdata(client, priv) VAL [cfg={1:0}, client={-2:0}, client={-2:0}, fe={2:0}, ldv_global_msg_list={-5:0}, priv={-3:0}] [L791] free(priv) VAL [cfg={1:0}, client={-2:0}, client={-2:0}, fe={2:0}, ldv_global_msg_list={-5:0}, priv={-3:0}] [L791] free(priv) VAL [cfg={1:0}, client={-2:0}, client={-2:0}, fe={2:0}, ldv_global_msg_list={-5:0}, priv={-3:0}] [L791] free(priv) [L792] return 0; VAL [\result=0, cfg={1:0}, client={-2:0}, client={-2:0}, fe={2:0}, ldv_global_msg_list={-5:0}, priv={-3:0}] [L814] RET alloc_2_11(c11) VAL [alloc_2_11(c11)=0, c11={-2:0}, cfg={1:0}, fe={2:0}, ldv_global_msg_list={-5:0}] [L815] CALL free_11(c11) VAL [client={-2:0}, ldv_global_msg_list={-5:0}] [L798] CALL, EXPR ldv_i2c_get_clientdata(client) VAL [dev={-2:0}, ldv_global_msg_list={-5:0}] [L775] CALL, EXPR ldv_dev_get_drvdata(&dev->dev) VAL [dev={-2:0}, ldv_global_msg_list={-5:0}] [L620] EXPR dev->driver_data VAL [dev={-2:0}, dev={-2:0}, dev->driver_data={-3:0}, ldv_global_msg_list={-5:0}] [L620] return dev->driver_data; [L775] RET, EXPR ldv_dev_get_drvdata(&dev->dev) VAL [dev={-2:0}, dev={-2:0}, ldv_dev_get_drvdata(&dev->dev)={-3:0}, ldv_global_msg_list={-5:0}] [L775] return ldv_dev_get_drvdata(&dev->dev); [L798] RET, EXPR ldv_i2c_get_clientdata(client) VAL [client={-2:0}, client={-2:0}, ldv_global_msg_list={-5:0}, ldv_i2c_get_clientdata(client)={-3:0}] [L798] void *priv = (struct Data11*)ldv_i2c_get_clientdata(client); [L799] COND TRUE \read(*priv) VAL [client={-2:0}, client={-2:0}, ldv_global_msg_list={-5:0}, priv={-3:0}] [L800] free(priv) VAL [client={-2:0}, client={-2:0}, ldv_global_msg_list={-5:0}, priv={-3:0}] [L800] free(priv) VAL [client={-2:0}, client={-2:0}, ldv_global_msg_list={-5:0}, priv={-3:0}] [L800] free(priv) VAL [client={-2:0}, client={-2:0}, ldv_global_msg_list={-5:0}, priv={-3:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 50 procedures, 405 locations, 96 error locations. Result: UNSAFE, OverallTime: 179.6s, OverallIterations: 40, TraceHistogramMax: 4, AutomataDifference: 127.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3455 SDtfs, 5153 SDslu, 13634 SDs, 0 SdLazy, 29015 SolverSat, 2101 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 51.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2312 GetRequests, 1399 SyntacticMatches, 26 SemanticMatches, 887 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 5699 ImplicationChecksByTransitivity, 106.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 950 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 39.2s InterpolantComputationTime, 2988 NumberOfCodeBlocks, 2988 NumberOfCodeBlocksAsserted, 66 NumberOfCheckSat, 2847 ConstructedInterpolants, 104 QuantifiedInterpolants, 785338 SizeOfPredicates, 224 NumberOfNonLiveVariables, 6544 ConjunctsInSsa, 925 ConjunctsInUnsatCore, 65 InterpolantComputations, 19 PerfectInterpolantSequences, 865/1100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...