./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 976e1955e162f3b4e872a15f7e9a64e265f0afc5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 19:24:24,320 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 19:24:24,322 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 19:24:24,335 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 19:24:24,335 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 19:24:24,336 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 19:24:24,338 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 19:24:24,340 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 19:24:24,342 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 19:24:24,343 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 19:24:24,344 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 19:24:24,344 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 19:24:24,346 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 19:24:24,347 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 19:24:24,348 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 19:24:24,349 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 19:24:24,350 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 19:24:24,352 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 19:24:24,356 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 19:24:24,360 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 19:24:24,363 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 19:24:24,368 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 19:24:24,373 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 19:24:24,373 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 19:24:24,374 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 19:24:24,375 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 19:24:24,376 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 19:24:24,377 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 19:24:24,381 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 19:24:24,383 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 19:24:24,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 19:24:24,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 19:24:24,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 19:24:24,385 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 19:24:24,386 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 19:24:24,386 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 19:24:24,388 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 19:24:24,412 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 19:24:24,412 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 19:24:24,416 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 19:24:24,417 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 19:24:24,417 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 19:24:24,417 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 19:24:24,417 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 19:24:24,417 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 19:24:24,417 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 19:24:24,418 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 19:24:24,418 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 19:24:24,418 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 19:24:24,418 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 19:24:24,418 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 19:24:24,418 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 19:24:24,419 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 19:24:24,419 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 19:24:24,419 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 19:24:24,419 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 19:24:24,419 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 19:24:24,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 19:24:24,420 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 19:24:24,421 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 19:24:24,421 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 19:24:24,421 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 19:24:24,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 976e1955e162f3b4e872a15f7e9a64e265f0afc5 [2019-01-14 19:24:24,456 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 19:24:24,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 19:24:24,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 19:24:24,478 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 19:24:24,479 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 19:24:24,479 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i [2019-01-14 19:24:24,545 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841539ab9/0c65ddf2fc0948788092c8d45465972f/FLAG88ad018c2 [2019-01-14 19:24:25,057 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 19:24:25,058 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-memsafety/memleaks_test13_true-valid-memsafety.i [2019-01-14 19:24:25,074 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841539ab9/0c65ddf2fc0948788092c8d45465972f/FLAG88ad018c2 [2019-01-14 19:24:25,337 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841539ab9/0c65ddf2fc0948788092c8d45465972f [2019-01-14 19:24:25,341 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 19:24:25,342 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 19:24:25,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 19:24:25,344 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 19:24:25,349 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 19:24:25,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:24:25" (1/1) ... [2019-01-14 19:24:25,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8cb670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:24:25, skipping insertion in model container [2019-01-14 19:24:25,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 07:24:25" (1/1) ... [2019-01-14 19:24:25,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 19:24:25,424 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 19:24:25,939 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:24:25,957 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 19:24:26,164 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 19:24:26,289 INFO L195 MainTranslator]: Completed translation [2019-01-14 19:24:26,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:24:26 WrapperNode [2019-01-14 19:24:26,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 19:24:26,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 19:24:26,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 19:24:26,291 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 19:24:26,309 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:24:26" (1/1) ... [2019-01-14 19:24:26,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:24:26" (1/1) ... [2019-01-14 19:24:26,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:24:26" (1/1) ... [2019-01-14 19:24:26,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:24:26" (1/1) ... [2019-01-14 19:24:26,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:24:26" (1/1) ... [2019-01-14 19:24:26,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:24:26" (1/1) ... [2019-01-14 19:24:26,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:24:26" (1/1) ... [2019-01-14 19:24:26,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 19:24:26,450 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 19:24:26,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 19:24:26,450 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 19:24:26,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:24:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 19:24:26,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 19:24:26,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 19:24:26,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-01-14 19:24:26,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-14 19:24:26,514 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-14 19:24:26,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-01-14 19:24:26,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-01-14 19:24:26,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-01-14 19:24:26,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-01-14 19:24:26,515 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-01-14 19:24:26,516 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-01-14 19:24:26,516 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-01-14 19:24:26,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-01-14 19:24:26,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-01-14 19:24:26,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-01-14 19:24:26,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-01-14 19:24:26,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-01-14 19:24:26,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-01-14 19:24:26,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-01-14 19:24:26,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-01-14 19:24:26,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-01-14 19:24:26,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-01-14 19:24:26,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-01-14 19:24:26,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-01-14 19:24:26,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-01-14 19:24:26,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-01-14 19:24:26,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-01-14 19:24:26,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-01-14 19:24:26,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-01-14 19:24:26,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-01-14 19:24:26,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-01-14 19:24:26,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-01-14 19:24:26,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-01-14 19:24:26,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-01-14 19:24:26,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-01-14 19:24:26,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-01-14 19:24:26,524 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-01-14 19:24:26,524 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-01-14 19:24:26,524 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2019-01-14 19:24:26,524 INFO L138 BoogieDeclarations]: Found implementation of procedure free_13 [2019-01-14 19:24:26,524 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-01-14 19:24:26,525 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 19:24:26,525 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-01-14 19:24:26,525 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-01-14 19:24:26,525 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-01-14 19:24:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-14 19:24:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-14 19:24:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 19:24:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 19:24:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 19:24:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 19:24:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 19:24:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 19:24:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 19:24:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 19:24:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 19:24:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 19:24:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 19:24:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 19:24:26,527 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 19:24:26,528 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 19:24:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 19:24:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 19:24:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 19:24:26,531 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 19:24:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 19:24:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 19:24:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 19:24:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 19:24:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 19:24:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 19:24:26,532 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 19:24:26,533 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 19:24:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 19:24:26,534 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 19:24:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 19:24:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 19:24:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 19:24:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 19:24:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 19:24:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 19:24:26,535 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 19:24:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 19:24:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 19:24:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 19:24:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 19:24:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 19:24:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 19:24:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 19:24:26,536 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 19:24:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 19:24:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 19:24:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 19:24:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 19:24:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 19:24:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 19:24:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 19:24:26,537 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 19:24:26,538 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 19:24:26,539 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 19:24:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 19:24:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 19:24:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 19:24:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 19:24:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 19:24:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 19:24:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 19:24:26,540 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 19:24:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 19:24:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 19:24:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 19:24:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 19:24:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 19:24:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 19:24:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 19:24:26,541 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 19:24:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 19:24:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 19:24:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 19:24:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 19:24:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 19:24:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 19:24:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 19:24:26,542 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 19:24:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 19:24:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 19:24:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 19:24:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 19:24:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 19:24:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 19:24:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 19:24:26,543 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 19:24:26,544 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 19:24:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 19:24:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 19:24:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 19:24:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 19:24:26,545 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 19:24:26,546 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 19:24:26,546 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 19:24:26,546 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 19:24:26,546 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 19:24:26,546 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 19:24:26,546 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 19:24:26,546 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 19:24:26,546 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 19:24:26,547 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 19:24:26,547 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-01-14 19:24:26,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-01-14 19:24:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-01-14 19:24:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-01-14 19:24:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-01-14 19:24:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-01-14 19:24:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-01-14 19:24:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-01-14 19:24:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 19:24:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-01-14 19:24:26,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-01-14 19:24:26,549 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-01-14 19:24:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 19:24:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-01-14 19:24:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-01-14 19:24:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-01-14 19:24:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 19:24:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-01-14 19:24:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-01-14 19:24:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-01-14 19:24:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-01-14 19:24:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-01-14 19:24:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-01-14 19:24:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 19:24:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-01-14 19:24:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-01-14 19:24:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-01-14 19:24:26,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-01-14 19:24:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-01-14 19:24:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 19:24:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 19:24:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-01-14 19:24:26,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-01-14 19:24:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-01-14 19:24:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-01-14 19:24:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-01-14 19:24:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-01-14 19:24:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-01-14 19:24:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-01-14 19:24:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-01-14 19:24:26,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-01-14 19:24:26,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-01-14 19:24:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-01-14 19:24:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-01-14 19:24:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-01-14 19:24:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-01-14 19:24:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-01-14 19:24:26,555 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-01-14 19:24:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2019-01-14 19:24:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure free_13 [2019-01-14 19:24:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-01-14 19:24:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 19:24:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 19:24:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 19:24:26,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 19:24:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 19:24:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-01-14 19:24:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-01-14 19:24:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-01-14 19:24:26,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-01-14 19:24:27,411 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 19:24:27,959 WARN L745 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-01-14 19:24:28,750 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 19:24:28,751 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 19:24:28,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:24:28 BoogieIcfgContainer [2019-01-14 19:24:28,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 19:24:28,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 19:24:28,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 19:24:28,758 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 19:24:28,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 07:24:25" (1/3) ... [2019-01-14 19:24:28,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b0a8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:24:28, skipping insertion in model container [2019-01-14 19:24:28,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 07:24:26" (2/3) ... [2019-01-14 19:24:28,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b0a8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 07:24:28, skipping insertion in model container [2019-01-14 19:24:28,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:24:28" (3/3) ... [2019-01-14 19:24:28,763 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test13_true-valid-memsafety.i [2019-01-14 19:24:28,774 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 19:24:28,788 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 80 error locations. [2019-01-14 19:24:28,809 INFO L257 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2019-01-14 19:24:28,840 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 19:24:28,841 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 19:24:28,841 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 19:24:28,842 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 19:24:28,846 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 19:24:28,846 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 19:24:28,846 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 19:24:28,846 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 19:24:28,847 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 19:24:28,879 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-14 19:24:28,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 19:24:28,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:28,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:28,899 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:28,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:28,910 INFO L82 PathProgramCache]: Analyzing trace with hash 508462536, now seen corresponding path program 1 times [2019-01-14 19:24:28,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:28,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:28,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:28,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:28,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:29,453 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 19:24:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:29,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:29,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 19:24:29,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 19:24:29,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 19:24:29,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:24:29,751 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 8 states. [2019-01-14 19:24:30,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:30,937 INFO L93 Difference]: Finished difference Result 157 states and 165 transitions. [2019-01-14 19:24:30,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 19:24:30,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-01-14 19:24:30,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:30,959 INFO L225 Difference]: With dead ends: 157 [2019-01-14 19:24:30,959 INFO L226 Difference]: Without dead ends: 150 [2019-01-14 19:24:30,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-14 19:24:30,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-14 19:24:31,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 109. [2019-01-14 19:24:31,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 19:24:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-01-14 19:24:31,027 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 17 [2019-01-14 19:24:31,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:31,027 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-01-14 19:24:31,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 19:24:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-01-14 19:24:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 19:24:31,029 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:31,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:31,030 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:31,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:31,030 INFO L82 PathProgramCache]: Analyzing trace with hash 508462537, now seen corresponding path program 1 times [2019-01-14 19:24:31,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:31,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:31,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:31,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:31,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:31,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:31,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 19:24:31,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 19:24:31,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 19:24:31,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:24:31,272 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 8 states. [2019-01-14 19:24:32,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:32,112 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-01-14 19:24:32,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 19:24:32,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-01-14 19:24:32,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:32,117 INFO L225 Difference]: With dead ends: 112 [2019-01-14 19:24:32,117 INFO L226 Difference]: Without dead ends: 112 [2019-01-14 19:24:32,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-14 19:24:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-14 19:24:32,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2019-01-14 19:24:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 19:24:32,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-01-14 19:24:32,132 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 17 [2019-01-14 19:24:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:32,132 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-01-14 19:24:32,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 19:24:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-01-14 19:24:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 19:24:32,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:32,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:32,134 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:32,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:32,134 INFO L82 PathProgramCache]: Analyzing trace with hash -741869603, now seen corresponding path program 1 times [2019-01-14 19:24:32,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:32,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:32,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:32,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:32,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:32,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:32,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 19:24:32,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 19:24:32,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 19:24:32,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:24:32,569 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 11 states. [2019-01-14 19:24:33,237 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 19:24:34,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:34,081 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2019-01-14 19:24:34,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 19:24:34,082 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-14 19:24:34,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:34,086 INFO L225 Difference]: With dead ends: 149 [2019-01-14 19:24:34,086 INFO L226 Difference]: Without dead ends: 149 [2019-01-14 19:24:34,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2019-01-14 19:24:34,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-14 19:24:34,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 106. [2019-01-14 19:24:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-14 19:24:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-01-14 19:24:34,098 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 20 [2019-01-14 19:24:34,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:34,098 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-01-14 19:24:34,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 19:24:34,098 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-01-14 19:24:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 19:24:34,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:34,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:34,100 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:34,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:34,100 INFO L82 PathProgramCache]: Analyzing trace with hash -741869604, now seen corresponding path program 1 times [2019-01-14 19:24:34,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:34,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:34,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:34,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:34,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:34,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:34,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 19:24:34,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 19:24:34,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 19:24:34,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:24:34,232 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 8 states. [2019-01-14 19:24:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:34,638 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2019-01-14 19:24:34,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 19:24:34,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-01-14 19:24:34,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:34,643 INFO L225 Difference]: With dead ends: 149 [2019-01-14 19:24:34,643 INFO L226 Difference]: Without dead ends: 149 [2019-01-14 19:24:34,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-01-14 19:24:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-14 19:24:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 105. [2019-01-14 19:24:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-14 19:24:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-01-14 19:24:34,654 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 20 [2019-01-14 19:24:34,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:34,654 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-01-14 19:24:34,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 19:24:34,655 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-01-14 19:24:34,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 19:24:34,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:34,656 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:34,656 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:34,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:34,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1523121193, now seen corresponding path program 1 times [2019-01-14 19:24:34,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:34,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:34,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:34,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:34,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:34,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:34,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-14 19:24:34,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 19:24:34,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 19:24:34,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-14 19:24:34,790 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 9 states. [2019-01-14 19:24:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:35,157 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-01-14 19:24:35,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 19:24:35,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-01-14 19:24:35,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:35,161 INFO L225 Difference]: With dead ends: 121 [2019-01-14 19:24:35,161 INFO L226 Difference]: Without dead ends: 121 [2019-01-14 19:24:35,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:24:35,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-14 19:24:35,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-01-14 19:24:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 19:24:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2019-01-14 19:24:35,170 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 21 [2019-01-14 19:24:35,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:35,170 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2019-01-14 19:24:35,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 19:24:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2019-01-14 19:24:35,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 19:24:35,171 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:35,171 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:35,172 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:35,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:35,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1523121192, now seen corresponding path program 1 times [2019-01-14 19:24:35,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:35,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:35,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:35,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:35,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:35,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:35,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 19:24:35,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 19:24:35,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 19:24:35,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-14 19:24:35,355 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 10 states. [2019-01-14 19:24:35,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:35,794 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-01-14 19:24:35,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 19:24:35,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-01-14 19:24:35,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:35,796 INFO L225 Difference]: With dead ends: 119 [2019-01-14 19:24:35,796 INFO L226 Difference]: Without dead ends: 119 [2019-01-14 19:24:35,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-01-14 19:24:35,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-14 19:24:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-01-14 19:24:35,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 19:24:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2019-01-14 19:24:35,805 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 21 [2019-01-14 19:24:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:35,805 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2019-01-14 19:24:35,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 19:24:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2019-01-14 19:24:35,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 19:24:35,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:35,807 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:35,807 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:35,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:35,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1394038474, now seen corresponding path program 1 times [2019-01-14 19:24:35,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:35,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:35,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:35,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:35,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:35,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:35,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:35,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:24:35,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:24:35,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:24:35,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:24:35,912 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 5 states. [2019-01-14 19:24:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:35,943 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-01-14 19:24:35,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:24:35,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 19:24:35,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:35,948 INFO L225 Difference]: With dead ends: 102 [2019-01-14 19:24:35,948 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 19:24:35,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:24:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 19:24:35,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-01-14 19:24:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 19:24:35,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-01-14 19:24:35,964 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 21 [2019-01-14 19:24:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:35,964 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-01-14 19:24:35,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:24:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-01-14 19:24:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 19:24:35,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:35,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:35,968 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:35,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:35,968 INFO L82 PathProgramCache]: Analyzing trace with hash -424133688, now seen corresponding path program 1 times [2019-01-14 19:24:35,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:35,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:35,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:35,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:35,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:36,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:36,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:24:36,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:24:36,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:24:36,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:24:36,050 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 5 states. [2019-01-14 19:24:36,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:36,064 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2019-01-14 19:24:36,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:24:36,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-01-14 19:24:36,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:36,070 INFO L225 Difference]: With dead ends: 100 [2019-01-14 19:24:36,071 INFO L226 Difference]: Without dead ends: 100 [2019-01-14 19:24:36,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:24:36,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-14 19:24:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-14 19:24:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 19:24:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-01-14 19:24:36,086 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 21 [2019-01-14 19:24:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:36,086 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-01-14 19:24:36,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:24:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-01-14 19:24:36,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 19:24:36,087 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:36,087 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:36,093 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:36,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:36,095 INFO L82 PathProgramCache]: Analyzing trace with hash -295050969, now seen corresponding path program 1 times [2019-01-14 19:24:36,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:36,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:36,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:36,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:36,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:36,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:36,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:24:36,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:24:36,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:24:36,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:24:36,320 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 6 states. [2019-01-14 19:24:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:36,613 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-01-14 19:24:36,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 19:24:36,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-01-14 19:24:36,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:36,616 INFO L225 Difference]: With dead ends: 137 [2019-01-14 19:24:36,616 INFO L226 Difference]: Without dead ends: 135 [2019-01-14 19:24:36,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-01-14 19:24:36,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-14 19:24:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2019-01-14 19:24:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-14 19:24:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2019-01-14 19:24:36,627 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 21 [2019-01-14 19:24:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:36,627 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-01-14 19:24:36,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:24:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2019-01-14 19:24:36,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 19:24:36,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:36,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:36,632 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:36,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:36,633 INFO L82 PathProgramCache]: Analyzing trace with hash -295050968, now seen corresponding path program 1 times [2019-01-14 19:24:36,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:36,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:36,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:36,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:36,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:36,904 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 19:24:37,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:37,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:37,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 19:24:37,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 19:24:37,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 19:24:37,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 19:24:37,430 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 7 states. [2019-01-14 19:24:38,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:38,733 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2019-01-14 19:24:38,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 19:24:38,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-14 19:24:38,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:38,735 INFO L225 Difference]: With dead ends: 134 [2019-01-14 19:24:38,736 INFO L226 Difference]: Without dead ends: 134 [2019-01-14 19:24:38,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-01-14 19:24:38,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-14 19:24:38,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 115. [2019-01-14 19:24:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-14 19:24:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2019-01-14 19:24:38,747 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 21 [2019-01-14 19:24:38,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:38,747 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2019-01-14 19:24:38,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 19:24:38,747 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2019-01-14 19:24:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 19:24:38,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:38,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:38,751 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:38,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:38,751 INFO L82 PathProgramCache]: Analyzing trace with hash 864383194, now seen corresponding path program 1 times [2019-01-14 19:24:38,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:38,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:38,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:38,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:38,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:38,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:38,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:38,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 19:24:38,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:24:38,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:24:38,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:24:38,975 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand 5 states. [2019-01-14 19:24:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:39,164 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2019-01-14 19:24:39,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 19:24:39,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-14 19:24:39,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:39,167 INFO L225 Difference]: With dead ends: 114 [2019-01-14 19:24:39,167 INFO L226 Difference]: Without dead ends: 114 [2019-01-14 19:24:39,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:24:39,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-14 19:24:39,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-14 19:24:39,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-14 19:24:39,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-01-14 19:24:39,173 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 23 [2019-01-14 19:24:39,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:39,174 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-01-14 19:24:39,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:24:39,174 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-01-14 19:24:39,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 19:24:39,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:39,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:39,176 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:39,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:39,177 INFO L82 PathProgramCache]: Analyzing trace with hash 864383195, now seen corresponding path program 1 times [2019-01-14 19:24:39,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:39,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:39,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:39,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:39,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:39,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:39,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 19:24:39,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 19:24:39,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 19:24:39,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-14 19:24:39,435 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 10 states. [2019-01-14 19:24:39,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:39,927 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2019-01-14 19:24:39,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 19:24:39,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-01-14 19:24:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:39,931 INFO L225 Difference]: With dead ends: 129 [2019-01-14 19:24:39,931 INFO L226 Difference]: Without dead ends: 129 [2019-01-14 19:24:39,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-01-14 19:24:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-14 19:24:39,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2019-01-14 19:24:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-14 19:24:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2019-01-14 19:24:39,937 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 23 [2019-01-14 19:24:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:39,938 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2019-01-14 19:24:39,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 19:24:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2019-01-14 19:24:39,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 19:24:39,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:39,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:39,942 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:39,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:39,942 INFO L82 PathProgramCache]: Analyzing trace with hash -227598599, now seen corresponding path program 1 times [2019-01-14 19:24:39,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:39,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:39,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:39,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:39,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:40,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:40,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 19:24:40,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 19:24:40,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 19:24:40,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 19:24:40,006 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand 5 states. [2019-01-14 19:24:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:40,179 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2019-01-14 19:24:40,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 19:24:40,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-01-14 19:24:40,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:40,183 INFO L225 Difference]: With dead ends: 125 [2019-01-14 19:24:40,183 INFO L226 Difference]: Without dead ends: 125 [2019-01-14 19:24:40,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:24:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-14 19:24:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2019-01-14 19:24:40,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-14 19:24:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2019-01-14 19:24:40,189 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 26 [2019-01-14 19:24:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:40,189 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2019-01-14 19:24:40,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 19:24:40,189 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2019-01-14 19:24:40,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 19:24:40,192 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:40,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:40,194 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:40,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:40,194 INFO L82 PathProgramCache]: Analyzing trace with hash -227598598, now seen corresponding path program 1 times [2019-01-14 19:24:40,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:40,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:40,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:40,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:40,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:40,352 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 19:24:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:40,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:40,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 19:24:40,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 19:24:40,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 19:24:40,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 19:24:40,479 INFO L87 Difference]: Start difference. First operand 119 states and 131 transitions. Second operand 7 states. [2019-01-14 19:24:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:40,755 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2019-01-14 19:24:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 19:24:40,756 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-01-14 19:24:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:40,757 INFO L225 Difference]: With dead ends: 123 [2019-01-14 19:24:40,758 INFO L226 Difference]: Without dead ends: 123 [2019-01-14 19:24:40,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:24:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-14 19:24:40,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2019-01-14 19:24:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 19:24:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2019-01-14 19:24:40,763 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 26 [2019-01-14 19:24:40,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:40,764 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2019-01-14 19:24:40,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 19:24:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2019-01-14 19:24:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 19:24:40,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:40,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:40,768 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:40,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:40,769 INFO L82 PathProgramCache]: Analyzing trace with hash 196769551, now seen corresponding path program 1 times [2019-01-14 19:24:40,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:40,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:40,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:40,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:40,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:40,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:40,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:24:40,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:24:40,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:24:40,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:24:40,859 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 6 states. [2019-01-14 19:24:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:41,109 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2019-01-14 19:24:41,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 19:24:41,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-14 19:24:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:41,112 INFO L225 Difference]: With dead ends: 143 [2019-01-14 19:24:41,112 INFO L226 Difference]: Without dead ends: 143 [2019-01-14 19:24:41,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-14 19:24:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-14 19:24:41,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129. [2019-01-14 19:24:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-14 19:24:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2019-01-14 19:24:41,120 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 28 [2019-01-14 19:24:41,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:41,122 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2019-01-14 19:24:41,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:24:41,122 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2019-01-14 19:24:41,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 19:24:41,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:41,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:41,125 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:41,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash 196769552, now seen corresponding path program 1 times [2019-01-14 19:24:41,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:41,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:41,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:41,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:41,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:41,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:41,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:41,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:24:41,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:24:41,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:24:41,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:24:41,690 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 6 states. [2019-01-14 19:24:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:42,151 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2019-01-14 19:24:42,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 19:24:42,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-01-14 19:24:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:42,153 INFO L225 Difference]: With dead ends: 129 [2019-01-14 19:24:42,153 INFO L226 Difference]: Without dead ends: 110 [2019-01-14 19:24:42,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-14 19:24:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-14 19:24:42,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-14 19:24:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 19:24:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-01-14 19:24:42,161 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 28 [2019-01-14 19:24:42,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:42,162 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-01-14 19:24:42,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:24:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-01-14 19:24:42,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 19:24:42,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:42,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:42,163 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:42,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:42,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1428666086, now seen corresponding path program 1 times [2019-01-14 19:24:42,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:42,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:42,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:42,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:42,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:42,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:42,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 19:24:42,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 19:24:42,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 19:24:42,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 19:24:42,384 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 12 states. [2019-01-14 19:24:42,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:42,983 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2019-01-14 19:24:42,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 19:24:42,985 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-01-14 19:24:42,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:42,987 INFO L225 Difference]: With dead ends: 121 [2019-01-14 19:24:42,987 INFO L226 Difference]: Without dead ends: 121 [2019-01-14 19:24:42,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-01-14 19:24:42,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-14 19:24:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2019-01-14 19:24:42,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 19:24:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-01-14 19:24:42,994 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 35 [2019-01-14 19:24:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:42,995 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-01-14 19:24:42,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 19:24:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-01-14 19:24:42,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 19:24:42,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:42,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:42,996 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:42,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:42,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1428666087, now seen corresponding path program 1 times [2019-01-14 19:24:42,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:42,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:43,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:43,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:43,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:43,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:43,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 19:24:43,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 19:24:43,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 19:24:43,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-14 19:24:43,376 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 13 states. [2019-01-14 19:24:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:44,024 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2019-01-14 19:24:44,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-14 19:24:44,026 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2019-01-14 19:24:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:44,027 INFO L225 Difference]: With dead ends: 116 [2019-01-14 19:24:44,028 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 19:24:44,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-01-14 19:24:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 19:24:44,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 108. [2019-01-14 19:24:44,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 19:24:44,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2019-01-14 19:24:44,035 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 35 [2019-01-14 19:24:44,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:44,039 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2019-01-14 19:24:44,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 19:24:44,039 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2019-01-14 19:24:44,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-14 19:24:44,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:44,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:44,042 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:44,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:44,043 INFO L82 PathProgramCache]: Analyzing trace with hash -134477669, now seen corresponding path program 1 times [2019-01-14 19:24:44,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:44,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:44,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:44,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:44,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:44,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:44,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-01-14 19:24:44,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 19:24:44,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 19:24:44,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2019-01-14 19:24:44,515 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 16 states. [2019-01-14 19:24:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:45,393 INFO L93 Difference]: Finished difference Result 114 states and 118 transitions. [2019-01-14 19:24:45,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 19:24:45,394 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2019-01-14 19:24:45,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:45,396 INFO L225 Difference]: With dead ends: 114 [2019-01-14 19:24:45,396 INFO L226 Difference]: Without dead ends: 114 [2019-01-14 19:24:45,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2019-01-14 19:24:45,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-14 19:24:45,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2019-01-14 19:24:45,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 19:24:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2019-01-14 19:24:45,401 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 40 [2019-01-14 19:24:45,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:45,401 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2019-01-14 19:24:45,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 19:24:45,402 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2019-01-14 19:24:45,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-14 19:24:45,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:45,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:45,405 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:45,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:45,405 INFO L82 PathProgramCache]: Analyzing trace with hash -508330895, now seen corresponding path program 1 times [2019-01-14 19:24:45,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:45,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:45,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:45,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:45,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:45,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:45,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:45,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-01-14 19:24:45,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 19:24:45,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 19:24:45,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-01-14 19:24:45,718 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 17 states. [2019-01-14 19:24:46,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:46,677 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-14 19:24:46,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-14 19:24:46,678 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2019-01-14 19:24:46,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:46,680 INFO L225 Difference]: With dead ends: 106 [2019-01-14 19:24:46,680 INFO L226 Difference]: Without dead ends: 106 [2019-01-14 19:24:46,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 19:24:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-14 19:24:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2019-01-14 19:24:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 19:24:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-01-14 19:24:46,685 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 42 [2019-01-14 19:24:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:46,687 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-01-14 19:24:46,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 19:24:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-01-14 19:24:46,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 19:24:46,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:46,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:46,689 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:46,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:46,689 INFO L82 PathProgramCache]: Analyzing trace with hash 331397522, now seen corresponding path program 1 times [2019-01-14 19:24:46,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:46,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:46,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:46,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:46,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:47,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:47,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-01-14 19:24:47,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 19:24:47,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 19:24:47,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2019-01-14 19:24:47,478 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 24 states. [2019-01-14 19:24:49,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:49,163 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-01-14 19:24:49,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-14 19:24:49,165 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2019-01-14 19:24:49,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:49,167 INFO L225 Difference]: With dead ends: 103 [2019-01-14 19:24:49,169 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 19:24:49,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=235, Invalid=1835, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 19:24:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 19:24:49,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-01-14 19:24:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 19:24:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-01-14 19:24:49,177 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 44 [2019-01-14 19:24:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:49,177 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-01-14 19:24:49,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 19:24:49,177 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-01-14 19:24:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-14 19:24:49,178 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:49,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:49,179 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:49,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:49,179 INFO L82 PathProgramCache]: Analyzing trace with hash 331397523, now seen corresponding path program 1 times [2019-01-14 19:24:49,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:49,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:49,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:49,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:49,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:50,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:50,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:50,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-01-14 19:24:50,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-14 19:24:50,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-14 19:24:50,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2019-01-14 19:24:50,594 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 27 states. [2019-01-14 19:24:51,733 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-01-14 19:24:52,040 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-01-14 19:24:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:54,223 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-01-14 19:24:54,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-14 19:24:54,227 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 44 [2019-01-14 19:24:54,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:54,228 INFO L225 Difference]: With dead ends: 102 [2019-01-14 19:24:54,228 INFO L226 Difference]: Without dead ends: 102 [2019-01-14 19:24:54,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=308, Invalid=2448, Unknown=0, NotChecked=0, Total=2756 [2019-01-14 19:24:54,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-14 19:24:54,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-01-14 19:24:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 19:24:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-01-14 19:24:54,233 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 44 [2019-01-14 19:24:54,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:54,233 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-01-14 19:24:54,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-14 19:24:54,233 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-01-14 19:24:54,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 19:24:54,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:54,236 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:54,236 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:54,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:54,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1683388672, now seen corresponding path program 1 times [2019-01-14 19:24:54,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:54,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:54,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:54,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:54,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:55,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:55,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-01-14 19:24:55,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 19:24:55,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 19:24:55,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-01-14 19:24:55,050 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 22 states. [2019-01-14 19:24:56,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:24:56,789 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2019-01-14 19:24:56,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-14 19:24:56,790 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-01-14 19:24:56,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:24:56,792 INFO L225 Difference]: With dead ends: 101 [2019-01-14 19:24:56,792 INFO L226 Difference]: Without dead ends: 101 [2019-01-14 19:24:56,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=175, Invalid=1547, Unknown=0, NotChecked=0, Total=1722 [2019-01-14 19:24:56,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-14 19:24:56,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-01-14 19:24:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 19:24:56,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2019-01-14 19:24:56,801 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 45 [2019-01-14 19:24:56,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:24:56,801 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2019-01-14 19:24:56,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 19:24:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2019-01-14 19:24:56,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-14 19:24:56,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:24:56,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:24:56,806 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:24:56,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:24:56,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1683388673, now seen corresponding path program 1 times [2019-01-14 19:24:56,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:24:56,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:24:56,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:56,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:24:56,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:24:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:24:57,125 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-14 19:24:57,460 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-01-14 19:24:57,838 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-01-14 19:24:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:24:58,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:24:58,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-01-14 19:24:58,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-14 19:24:58,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-14 19:24:58,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=503, Unknown=0, NotChecked=0, Total=552 [2019-01-14 19:24:58,530 INFO L87 Difference]: Start difference. First operand 100 states and 103 transitions. Second operand 24 states. [2019-01-14 19:25:00,627 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2019-01-14 19:25:00,798 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-01-14 19:25:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:25:02,115 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2019-01-14 19:25:02,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-14 19:25:02,117 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-01-14 19:25:02,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:25:02,118 INFO L225 Difference]: With dead ends: 100 [2019-01-14 19:25:02,118 INFO L226 Difference]: Without dead ends: 100 [2019-01-14 19:25:02,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=226, Invalid=1844, Unknown=0, NotChecked=0, Total=2070 [2019-01-14 19:25:02,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-14 19:25:02,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-14 19:25:02,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 19:25:02,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2019-01-14 19:25:02,123 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 45 [2019-01-14 19:25:02,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:25:02,124 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2019-01-14 19:25:02,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-14 19:25:02,124 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2019-01-14 19:25:02,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-14 19:25:02,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:25:02,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:25:02,125 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:25:02,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:25:02,126 INFO L82 PathProgramCache]: Analyzing trace with hash -963570734, now seen corresponding path program 1 times [2019-01-14 19:25:02,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:25:02,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:25:02,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:02,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:25:02,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:25:02,823 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-14 19:25:03,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:25:03,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:25:03,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-01-14 19:25:03,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-14 19:25:03,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-14 19:25:03,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2019-01-14 19:25:03,314 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 17 states. [2019-01-14 19:25:04,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:25:04,673 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2019-01-14 19:25:04,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-14 19:25:04,674 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 51 [2019-01-14 19:25:04,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:25:04,675 INFO L225 Difference]: With dead ends: 100 [2019-01-14 19:25:04,675 INFO L226 Difference]: Without dead ends: 100 [2019-01-14 19:25:04,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-01-14 19:25:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-14 19:25:04,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-14 19:25:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 19:25:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-01-14 19:25:04,683 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 51 [2019-01-14 19:25:04,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:25:04,683 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-01-14 19:25:04,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-14 19:25:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-01-14 19:25:04,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-14 19:25:04,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:25:04,685 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:25:04,686 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:25:04,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:25:04,686 INFO L82 PathProgramCache]: Analyzing trace with hash 194078712, now seen corresponding path program 1 times [2019-01-14 19:25:04,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:25:04,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:25:04,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:04,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:25:04,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:25:05,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:25:05,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:25:05,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-14 19:25:05,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 19:25:05,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 19:25:05,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-14 19:25:05,603 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 12 states. [2019-01-14 19:25:05,980 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 19:25:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:25:06,612 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-14 19:25:06,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 19:25:06,614 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-01-14 19:25:06,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:25:06,615 INFO L225 Difference]: With dead ends: 100 [2019-01-14 19:25:06,615 INFO L226 Difference]: Without dead ends: 100 [2019-01-14 19:25:06,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-01-14 19:25:06,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-14 19:25:06,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-14 19:25:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 19:25:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-14 19:25:06,619 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 52 [2019-01-14 19:25:06,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:25:06,619 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-14 19:25:06,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 19:25:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-14 19:25:06,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 19:25:06,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:25:06,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:25:06,621 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:25:06,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:25:06,621 INFO L82 PathProgramCache]: Analyzing trace with hash 773322071, now seen corresponding path program 1 times [2019-01-14 19:25:06,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:25:06,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:25:06,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:06,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:25:06,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:25:07,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:25:07,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:25:07,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-01-14 19:25:07,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-14 19:25:07,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-14 19:25:07,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2019-01-14 19:25:07,535 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 30 states. [2019-01-14 19:25:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:25:09,839 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-14 19:25:09,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-14 19:25:09,841 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 55 [2019-01-14 19:25:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:25:09,842 INFO L225 Difference]: With dead ends: 103 [2019-01-14 19:25:09,842 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 19:25:09,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=237, Invalid=2415, Unknown=0, NotChecked=0, Total=2652 [2019-01-14 19:25:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 19:25:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-01-14 19:25:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 19:25:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2019-01-14 19:25:09,846 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 55 [2019-01-14 19:25:09,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:25:09,846 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2019-01-14 19:25:09,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-14 19:25:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2019-01-14 19:25:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 19:25:09,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:25:09,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:25:09,851 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:25:09,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:25:09,851 INFO L82 PathProgramCache]: Analyzing trace with hash 773322072, now seen corresponding path program 1 times [2019-01-14 19:25:09,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:25:09,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:25:09,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:09,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:25:09,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:25:10,149 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 13 [2019-01-14 19:25:11,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:25:11,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:25:11,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-01-14 19:25:11,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-14 19:25:11,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-14 19:25:11,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=795, Unknown=0, NotChecked=0, Total=870 [2019-01-14 19:25:11,560 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 30 states. [2019-01-14 19:25:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:25:13,533 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-14 19:25:13,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 19:25:13,535 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 55 [2019-01-14 19:25:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:25:13,536 INFO L225 Difference]: With dead ends: 103 [2019-01-14 19:25:13,536 INFO L226 Difference]: Without dead ends: 103 [2019-01-14 19:25:13,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=245, Invalid=2305, Unknown=0, NotChecked=0, Total=2550 [2019-01-14 19:25:13,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-14 19:25:13,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-01-14 19:25:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-14 19:25:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-14 19:25:13,540 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 55 [2019-01-14 19:25:13,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:25:13,541 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-14 19:25:13,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-14 19:25:13,541 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-14 19:25:13,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-14 19:25:13,541 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:25:13,544 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-14 19:25:13,544 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:25:13,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:25:13,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1015146914, now seen corresponding path program 1 times [2019-01-14 19:25:13,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:25:13,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:25:13,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:13,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:25:13,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:25:13,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:25:13,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:25:13,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 19:25:13,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 19:25:13,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 19:25:13,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 19:25:13,715 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 6 states. [2019-01-14 19:25:13,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:25:13,844 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-14 19:25:13,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 19:25:13,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-01-14 19:25:13,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:25:13,847 INFO L225 Difference]: With dead ends: 100 [2019-01-14 19:25:13,847 INFO L226 Difference]: Without dead ends: 100 [2019-01-14 19:25:13,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-14 19:25:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-14 19:25:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-14 19:25:13,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-14 19:25:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-14 19:25:13,850 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 60 [2019-01-14 19:25:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:25:13,851 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-14 19:25:13,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 19:25:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-14 19:25:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-14 19:25:13,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:25:13,852 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-14 19:25:13,852 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:25:13,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:25:13,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1015146913, now seen corresponding path program 1 times [2019-01-14 19:25:13,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:25:13,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:25:13,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:13,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:25:13,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:25:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:25:14,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:25:14,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:25:14,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:25:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:25:14,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:25:15,187 INFO L478 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 27 [2019-01-14 19:25:15,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2019-01-14 19:25:15,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:15,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:15,231 INFO L478 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 23 treesize of output 19 [2019-01-14 19:25:15,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-01-14 19:25:15,234 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:15,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:15,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:15,238 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:7 [2019-01-14 19:25:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:25:15,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:25:15,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 19 [2019-01-14 19:25:15,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 19:25:15,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 19:25:15,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2019-01-14 19:25:15,309 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 20 states. [2019-01-14 19:25:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:25:17,331 INFO L93 Difference]: Finished difference Result 118 states and 120 transitions. [2019-01-14 19:25:17,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 19:25:17,333 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2019-01-14 19:25:17,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:25:17,334 INFO L225 Difference]: With dead ends: 118 [2019-01-14 19:25:17,334 INFO L226 Difference]: Without dead ends: 118 [2019-01-14 19:25:17,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2019-01-14 19:25:17,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-14 19:25:17,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2019-01-14 19:25:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 19:25:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-01-14 19:25:17,353 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 60 [2019-01-14 19:25:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:25:17,354 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-01-14 19:25:17,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 19:25:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-01-14 19:25:17,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 19:25:17,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:25:17,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-14 19:25:17,361 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:25:17,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:25:17,361 INFO L82 PathProgramCache]: Analyzing trace with hash -722917068, now seen corresponding path program 1 times [2019-01-14 19:25:17,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:25:17,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:25:17,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:17,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:25:17,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:25:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:25:17,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:25:17,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-14 19:25:17,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 19:25:17,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 19:25:17,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-14 19:25:17,864 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 7 states. [2019-01-14 19:25:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:25:18,141 INFO L93 Difference]: Finished difference Result 109 states and 111 transitions. [2019-01-14 19:25:18,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 19:25:18,143 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-01-14 19:25:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:25:18,145 INFO L225 Difference]: With dead ends: 109 [2019-01-14 19:25:18,145 INFO L226 Difference]: Without dead ends: 109 [2019-01-14 19:25:18,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-01-14 19:25:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-14 19:25:18,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-14 19:25:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 19:25:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2019-01-14 19:25:18,149 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 62 [2019-01-14 19:25:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:25:18,149 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2019-01-14 19:25:18,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 19:25:18,150 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2019-01-14 19:25:18,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 19:25:18,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:25:18,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-14 19:25:18,151 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:25:18,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:25:18,151 INFO L82 PathProgramCache]: Analyzing trace with hash -722917067, now seen corresponding path program 1 times [2019-01-14 19:25:18,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:25:18,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:25:18,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:18,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:25:18,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:25:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 19:25:18,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:25:18,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-14 19:25:18,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-14 19:25:18,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-14 19:25:18,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-01-14 19:25:18,587 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 14 states. [2019-01-14 19:25:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:25:19,181 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-01-14 19:25:19,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 19:25:19,188 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2019-01-14 19:25:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:25:19,189 INFO L225 Difference]: With dead ends: 108 [2019-01-14 19:25:19,189 INFO L226 Difference]: Without dead ends: 108 [2019-01-14 19:25:19,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2019-01-14 19:25:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-14 19:25:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-14 19:25:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-14 19:25:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-01-14 19:25:19,193 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 62 [2019-01-14 19:25:19,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:25:19,193 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-01-14 19:25:19,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-14 19:25:19,193 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-01-14 19:25:19,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-14 19:25:19,194 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:25:19,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-14 19:25:19,195 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:25:19,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:25:19,195 INFO L82 PathProgramCache]: Analyzing trace with hash -935592584, now seen corresponding path program 1 times [2019-01-14 19:25:19,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:25:19,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:25:19,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:19,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:25:19,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:25:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 19:25:19,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 19:25:19,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-01-14 19:25:19,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-14 19:25:19,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-14 19:25:19,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-01-14 19:25:19,589 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 15 states. [2019-01-14 19:25:20,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:25:20,121 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2019-01-14 19:25:20,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-14 19:25:20,122 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2019-01-14 19:25:20,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:25:20,124 INFO L225 Difference]: With dead ends: 107 [2019-01-14 19:25:20,124 INFO L226 Difference]: Without dead ends: 107 [2019-01-14 19:25:20,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2019-01-14 19:25:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-14 19:25:20,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-14 19:25:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-14 19:25:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2019-01-14 19:25:20,129 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 63 [2019-01-14 19:25:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:25:20,132 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2019-01-14 19:25:20,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-14 19:25:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2019-01-14 19:25:20,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-14 19:25:20,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:25:20,133 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 19:25:20,134 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:25:20,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:25:20,134 INFO L82 PathProgramCache]: Analyzing trace with hash 272516438, now seen corresponding path program 1 times [2019-01-14 19:25:20,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:25:20,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:25:20,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:20,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:25:20,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:25:20,388 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 19:25:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:25:21,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:25:21,975 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:25:21,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:25:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:25:22,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:25:22,073 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2019-01-14 19:25:22,092 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 19:25:22,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:22,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:22,136 INFO L267 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-01-14 19:25:22,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:24 [2019-01-14 19:25:22,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 19:25:22,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:22,246 INFO L478 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 7 treesize of output 5 [2019-01-14 19:25:22,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-14 19:25:22,249 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:22,250 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:22,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:22,258 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:18 [2019-01-14 19:25:23,394 WARN L181 SmtUtils]: Spent 906.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 19:25:23,894 WARN L181 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 19:25:24,640 WARN L181 SmtUtils]: Spent 686.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-14 19:25:24,660 INFO L478 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-01-14 19:25:24,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:24,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:24,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:15 [2019-01-14 19:25:24,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 19:25:24,992 INFO L478 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 8 treesize of output 7 [2019-01-14 19:25:24,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:24,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:25,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:25,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-01-14 19:25:25,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-01-14 19:25:25,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:25:25,109 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2019-01-14 19:25:25,110 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:25,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:25,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:25,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-01-14 19:25:25,332 INFO L303 Elim1Store]: Index analysis took 104 ms [2019-01-14 19:25:25,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2019-01-14 19:25:25,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-01-14 19:25:25,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:25,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:25:25,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2019-01-14 19:25:25,416 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-14 19:25:25,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 19:25:25,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 19:25:25,477 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:68 [2019-01-14 19:25:25,887 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-01-14 19:25:27,357 WARN L181 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-01-14 19:25:27,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:25:27,413 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 19:25:27,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:27,436 INFO L478 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 23 treesize of output 19 [2019-01-14 19:25:27,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-14 19:25:27,448 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:27,450 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:27,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:27,465 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:59, output treesize:39 [2019-01-14 19:25:27,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 31 [2019-01-14 19:25:27,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 30 [2019-01-14 19:25:27,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 19:25:27,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-01-14 19:25:27,932 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:27,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 8 [2019-01-14 19:25:27,935 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:27,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:25:27,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:25:27,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 39 [2019-01-14 19:25:27,991 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2019-01-14 19:25:28,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-14 19:25:28,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-14 19:25:28,080 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:55, output treesize:89 [2019-01-14 19:25:28,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2019-01-14 19:25:28,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:28,782 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 19:25:28,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:28,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:28,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:5 [2019-01-14 19:25:28,862 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:25:28,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:25:28,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31] total 61 [2019-01-14 19:25:28,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-14 19:25:28,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-14 19:25:28,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=3471, Unknown=0, NotChecked=0, Total=3660 [2019-01-14 19:25:28,883 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 61 states. [2019-01-14 19:25:31,055 WARN L181 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-01-14 19:25:32,493 WARN L181 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-01-14 19:25:33,598 WARN L181 SmtUtils]: Spent 980.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2019-01-14 19:25:34,959 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-01-14 19:25:35,200 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2019-01-14 19:25:35,902 WARN L181 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 19:25:36,629 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2019-01-14 19:25:37,894 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-14 19:25:38,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:25:38,921 INFO L93 Difference]: Finished difference Result 69 states and 68 transitions. [2019-01-14 19:25:38,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-14 19:25:38,923 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 64 [2019-01-14 19:25:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:25:38,924 INFO L225 Difference]: With dead ends: 69 [2019-01-14 19:25:38,924 INFO L226 Difference]: Without dead ends: 69 [2019-01-14 19:25:38,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=682, Invalid=8248, Unknown=0, NotChecked=0, Total=8930 [2019-01-14 19:25:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-14 19:25:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-14 19:25:38,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 19:25:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 68 transitions. [2019-01-14 19:25:38,929 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 68 transitions. Word has length 64 [2019-01-14 19:25:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:25:38,929 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 68 transitions. [2019-01-14 19:25:38,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-14 19:25:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 68 transitions. [2019-01-14 19:25:38,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-14 19:25:38,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 19:25:38,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-14 19:25:38,933 INFO L423 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_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err1REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-01-14 19:25:38,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 19:25:38,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1390684022, now seen corresponding path program 1 times [2019-01-14 19:25:38,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 19:25:38,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 19:25:38,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:38,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:25:38,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 19:25:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:25:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:25:39,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 19:25:39,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 19:25:39,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 19:25:39,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 19:25:39,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 19:25:39,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 19:25:39,508 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2019-01-14 19:25:39,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:39,514 INFO L267 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-01-14 19:25:39,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2019-01-14 19:25:39,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 19:25:39,680 INFO L478 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 8 treesize of output 7 [2019-01-14 19:25:39,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:39,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:39,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:25:39,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2019-01-14 19:25:39,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2019-01-14 19:25:39,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:39,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 19:25:39,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:10 [2019-01-14 19:25:39,949 INFO L478 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 20 treesize of output 16 [2019-01-14 19:25:39,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-01-14 19:25:39,969 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:25:39,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:25:40,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 19:25:40,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2019-01-14 19:25:41,259 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2019-01-14 19:25:41,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 19:25:41,271 INFO L267 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-01-14 19:25:41,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:9 [2019-01-14 19:25:43,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 19:25:43,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 19:25:43,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19] total 33 [2019-01-14 19:25:43,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-14 19:25:43,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-14 19:25:43,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=993, Unknown=12, NotChecked=0, Total=1122 [2019-01-14 19:25:43,916 INFO L87 Difference]: Start difference. First operand 69 states and 68 transitions. Second operand 34 states. [2019-01-14 19:25:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 19:25:50,085 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2019-01-14 19:25:50,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-14 19:25:50,087 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 68 [2019-01-14 19:25:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 19:25:50,088 INFO L225 Difference]: With dead ends: 68 [2019-01-14 19:25:50,088 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 19:25:50,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=278, Invalid=2160, Unknown=12, NotChecked=0, Total=2450 [2019-01-14 19:25:50,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 19:25:50,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 19:25:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 19:25:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 19:25:50,090 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 68 [2019-01-14 19:25:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 19:25:50,090 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 19:25:50,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-14 19:25:50,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 19:25:50,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 19:25:50,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 07:25:50 BoogieIcfgContainer [2019-01-14 19:25:50,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 19:25:50,105 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 19:25:50,106 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 19:25:50,106 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 19:25:50,107 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 07:24:28" (3/4) ... [2019-01-14 19:25:50,113 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 19:25:50,126 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-01-14 19:25:50,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-01-14 19:25:50,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-01-14 19:25:50,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-01-14 19:25:50,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-01-14 19:25:50,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-14 19:25:50,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-01-14 19:25:50,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 19:25:50,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-01-14 19:25:50,127 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-01-14 19:25:50,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-01-14 19:25:50,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-01-14 19:25:50,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-01-14 19:25:50,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-01-14 19:25:50,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-01-14 19:25:50,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_13 [2019-01-14 19:25:50,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-01-14 19:25:50,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-01-14 19:25:50,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-01-14 19:25:50,128 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-01-14 19:25:50,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-01-14 19:25:50,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-01-14 19:25:50,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-01-14 19:25:50,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-01-14 19:25:50,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-01-14 19:25:50,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-01-14 19:25:50,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_13 [2019-01-14 19:25:50,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-01-14 19:25:50,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-01-14 19:25:50,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-01-14 19:25:50,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-01-14 19:25:50,129 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-01-14 19:25:50,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-14 19:25:50,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-01-14 19:25:50,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-01-14 19:25:50,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-01-14 19:25:50,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-01-14 19:25:50,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 19:25:50,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-01-14 19:25:50,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-01-14 19:25:50,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-01-14 19:25:50,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-01-14 19:25:50,130 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-01-14 19:25:50,131 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-01-14 19:25:50,141 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 51 nodes and edges [2019-01-14 19:25:50,142 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-14 19:25:50,142 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 19:25:50,143 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 19:25:50,143 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 19:25:50,220 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 19:25:50,221 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 19:25:50,222 INFO L168 Benchmark]: Toolchain (without parser) took 84880.20 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 569.9 MB). Free memory was 951.3 MB in the beginning and 1.4 GB in the end (delta: -450.1 MB). Peak memory consumption was 119.8 MB. Max. memory is 11.5 GB. [2019-01-14 19:25:50,222 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:25:50,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 946.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2019-01-14 19:25:50,226 INFO L168 Benchmark]: Boogie Preprocessor took 158.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 19:25:50,226 INFO L168 Benchmark]: RCFGBuilder took 2303.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.4 MB in the end (delta: 107.8 MB). Peak memory consumption was 107.8 MB. Max. memory is 11.5 GB. [2019-01-14 19:25:50,227 INFO L168 Benchmark]: TraceAbstraction took 81349.14 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 429.4 MB). Free memory was 999.4 MB in the beginning and 1.4 GB in the end (delta: -417.1 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2019-01-14 19:25:50,227 INFO L168 Benchmark]: Witness Printer took 115.59 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-01-14 19:25:50,233 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 946.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 158.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2303.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 999.4 MB in the end (delta: 107.8 MB). Peak memory consumption was 107.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 81349.14 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 429.4 MB). Free memory was 999.4 MB in the beginning and 1.4 GB in the end (delta: -417.1 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Witness Printer took 115.59 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1294]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1294]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1121]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1121]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1411]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1411]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1179]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1179]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1179]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1179]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1179]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1179]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1156]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1157]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1157]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1156]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1156]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1156]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1256]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1258]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1258]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1256]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1115]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1115]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1116]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1116]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1340]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1344]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1339]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1339]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1344]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1340]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1340]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1344]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1163]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1164]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1163]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1163]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1164]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1163]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1163]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1164]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1463]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1099]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1100]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1100]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1099]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1131]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1109]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1107]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1109]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1110]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1107]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1108]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1110]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1108]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1198]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1198]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1265]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1267]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1267]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1265]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1126]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1126]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1453]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1451]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1453]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1453]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1193]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1193]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1146]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1146]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 80 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 45 procedures, 347 locations, 80 error locations. SAFE Result, 81.2s OverallTime, 35 OverallIterations, 2 TraceHistogramMax, 48.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2184 SDtfs, 2873 SDslu, 10654 SDs, 0 SdLazy, 18805 SolverSat, 1110 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 26.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1071 GetRequests, 260 SyntacticMatches, 32 SemanticMatches, 779 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5401 ImplicationChecksByTransitivity, 46.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 35 MinimizatonAttempts, 270 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 30.8s InterpolantComputationTime, 1528 NumberOfCodeBlocks, 1528 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1490 ConstructedInterpolants, 29 QuantifiedInterpolants, 766120 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1210 ConjunctsInSsa, 197 ConjunctsInUnsatCore, 38 InterpolantComputations, 32 PerfectInterpolantSequences, 17/33 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...